Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
malta13 [2013/06/20 00:04] cesar.sanchez |
malta13 [2013/06/24 21:36] cesar.sanchez |
||
|---|---|---|---|
| Line 20: | Line 20: | ||
| | 12.00-12.30 | {{:malta13-rodriguez-carbonell.pdf|To Encode or to Propagate? The Best Choice for Each Constraint in SAT}} | Enric Rodriguez-Carbonell | | | 12.00-12.30 | {{:malta13-rodriguez-carbonell.pdf|To Encode or to Propagate? The Best Choice for Each Constraint in SAT}} | Enric Rodriguez-Carbonell | | ||
| | 12.30-14.00 | **Lunch** || | | 12.30-14.00 | **Lunch** || | ||
| - | | 14.00-14.30 | Model-checking for efficient malware detection | Tayssir Touilli | | + | | 14.00-14.30 | Model-checking for Efficient Malware Detection | Tayssir Touilli | |
| | 14.30-15.00 | {{:malta13-perez.pdf|Decidable Classes of Mean-Payoff Games with Imperfect Information}} | Guillermo Perez | | | 14.30-15.00 | {{:malta13-perez.pdf|Decidable Classes of Mean-Payoff Games with Imperfect Information}} | Guillermo Perez | | ||
| | 15.00-15.30 | **Coffee break** || | | 15.00-15.30 | **Coffee break** || | ||
| - | | 15.30-16.00 | {{:malta13-pace.pdf|Contract Analysis}} | Gordon Pace | | + | | 15.30-16.00 | {{:malta13-pace.pdf|Reasoning About Contracts}} | Gordon Pace | |
| | 16.00-16.30 | {{:malta13-jensen.pdf|Fictional Separation Logic}} | Jonas Jensen | | | 16.00-16.30 | {{:malta13-jensen.pdf|Fictional Separation Logic}} | Jonas Jensen | | ||
| | 16.30-17.30 | MC Meeting || | | 16.30-17.30 | MC Meeting || | ||
| Line 34: | Line 34: | ||
| | 10.00-10.30 | **Coffee break** || | | 10.00-10.30 | **Coffee break** || | ||
| | 10.30-11.00 | {{:malta13-beyene.pdf|Solving Existentially Quantfied Horn Clauses}} | Tewodros Beyene | | | 10.30-11.00 | {{:malta13-beyene.pdf|Solving Existentially Quantfied Horn Clauses}} | Tewodros Beyene | | ||
| - | | 11.00-11.30 | {{:malta13-selajev.pdf|Scaling dynamic logic for intermediate states}} | Boriss Selajev | | + | | 11.00-11.30 | {{:malta13-selajev.pdf|Scaling Dynamic Logic for Intermediate States}} | Boriss Selajev | |
| | 11.30-12.00 | {{:malta13-lengal.pdf|Fully Automated Shape Analysis Based on Forest Automata}} | Ondrej Lengal | | | 11.30-12.00 | {{:malta13-lengal.pdf|Fully Automated Shape Analysis Based on Forest Automata}} | Ondrej Lengal | | ||
| | 12.00-12.30 | {{:malta13-sanchez.pdf|Invariant Generation for Parametrized Systems using Self-Reflection}} | Alejandro Sanchez | | | 12.00-12.30 | {{:malta13-sanchez.pdf|Invariant Generation for Parametrized Systems using Self-Reflection}} | Alejandro Sanchez | | ||
| | 12.30-14.00 | **Lunch** || | | 12.30-14.00 | **Lunch** || | ||
| - | | 14.00-15.00 | {{:malta13-gallagher.pdf|Verification by Abstraction and Specialisation of Constraint Logic Programs}} **(Invited speaker)** | John Gallagher | | + | | 14.00-15.00 | {{:malta13-siirtola.pdf|Verification by Abstraction and Specialisation of Constraint Logic Programs}} **(Invited speaker)** | John Gallagher | |
| | 15.00-15.30 | **Coffee break** || | | 15.00-15.30 | **Coffee break** || | ||
| | 15:30-16:00 | {{:malta13-siirtola.pdf|Object-Oriented Programs as Parameterised Systems}} | Siirtola Antti | | | 15:30-16:00 | {{:malta13-siirtola.pdf|Object-Oriented Programs as Parameterised Systems}} | Siirtola Antti | | ||
| | 16.00-16.30 | {{:malta13-konecny.pdf|Underapproximation of Procedure Summaries for Integer Programs}} | Filip Konecni | | | 16.00-16.30 | {{:malta13-konecny.pdf|Underapproximation of Procedure Summaries for Integer Programs}} | Filip Konecni | | ||
| | 16.30-17.00 | {{:malta13-jackson.pdf|Auditing User-provided Axioms in Software Verification Conditions}} | Paul Jackson | | | 16.30-17.00 | {{:malta13-jackson.pdf|Auditing User-provided Axioms in Software Verification Conditions}} | Paul Jackson | | ||
| - | | 17:00-17:30 | {{:malta13-monniaux.pdf|Death by a thousand cuts}} | David Monniaux | | + | | 17:00-17:30 | {{:malta13-monniaux.pdf|Death by a Thousand Cuts (worst-case execution time by bounded model checking)}} | David Monniaux | |
| | 17:30-18:00 | Discussion Session: Cross-fertilization between Logic Programming with CLP and Horn Clause Verification || | | 17:30-18:00 | Discussion Session: Cross-fertilization between Logic Programming with CLP and Horn Clause Verification || | ||