skip to content
 

Seminars (LAAW05)

Videos and presentation materials from other INI events are also available.

Search seminar archive

Event When Speaker Title Presentation Material
LAAW05 8th May 2006
10:00 to 11:00
Z Manna From verification conditions to constraints
LAAW05 8th May 2006
11:30 to 12:00
Solving verification constraint problems with constraint programming
LAAW05 8th May 2006
14:00 to 15:00
Program verification by parametric abstraction and semi-definite programming
LAAW05 8th May 2006
15:30 to 16:00
Parameterized interfaces for open system verification of product lines
LAAW05 8th May 2006
16:00 to 16:30
Polyhedral analysis of systems software
LAAW05 8th May 2006
16:30 to 17:00
Proving termination of programs
LAAW05 9th May 2006
09:00 to 10:00
Bounded and unbounded model checking with SAT
LAAW05 9th May 2006
10:00 to 10:30
D Kroening Model checking C++ programs that use the STL
LAAW05 9th May 2006
10:30 to 11:00
K Namjoshi Incremental model checking
LAAW05 9th May 2006
11:30 to 12:00
J Marques-Silva Towards more efficient SAT-based model checking
LAAW05 9th May 2006
12:00 to 12:30
Uniform + supercompilation = verification
LAAW05 9th May 2006
14:00 to 15:00
Artifical Biochemistry
LAAW05 9th May 2006
15:30 to 16:00
Generalizing BDD trees using minimal and/or graphs
LAAW05 9th May 2006
16:00 to 16:30
Return of the JTMS: Preferences orchestrate conflict learning and solution synthesis
LAAW05 9th May 2006
16:30 to 17:00
Enhancing software model checking with static program analysis
LAAW05 9th May 2006
17:00 to 17:30
M Leconte State of the art in constraint programming solvers
LAAW05 10th May 2006
09:00 to 10:00
Logic verification challenges in system level design at Intel
LAAW05 10th May 2006
10:00 to 10:30
Constraints in hardware verification: some industrial perspectives
LAAW05 10th May 2006
10:30 to 11:00
D Lugiez Symbolic constraint solving for cryptographic protocols
LAAW05 10th May 2006
11:30 to 12:00
Automatic refinement and vacuity detection for symbolic trajectory evaluation
LAAW05 11th May 2006
09:00 to 10:00
Linear constraints in probabilistic model checking
LAAW05 11th May 2006
10:00 to 10:30
Time average games
LAAW05 11th May 2006
10:30 to 11:00
O Maler Controller synthesis with adversaries
LAAW05 11th May 2006
11:30 to 12:00
P Abdullah Language inclusion for timed automata
LAAW05 11th May 2006
14:00 to 15:00
Consequence generation, interpolants and invariant discovery
LAAW05 11th May 2006
15:30 to 16:30
Y Naveh Constraint satisfaction for random stimuli generation
LAAW05 11th May 2006
16:30 to 17:00
Verifying properties of well-founded linked lists
LAAW05 11th May 2006
17:00 to 17:30
Reasoning about dynamic networks of counter systems
LAAW05 12th May 2006
09:00 to 10:00
On the use of automata for representing arithmetic constraints
LAAW05 12th May 2006
10:00 to 10:30
Modelling with FO(ID); Solving with SAT
LAAW05 12th May 2006
10:30 to 11:00
S Cotton Satisfiability modulo theory chains with DPLL(T)
LAAW05 12th May 2006
11:30 to 12:00
A progressive approach to solving satisfiability modulo theories (SMT)
LAAW05 12th May 2006
14:00 to 15:00
E Giunchiglia State of the art in QBF reasoning, with emphasis on applications in FV
LAAW05 12th May 2006
15:30 to 16:30
Compact propositional encodings of first-order theories
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons