skip to content
 

Constraints and Verification

8th May 2006 to 12th May 2006

Organisers: Professor Andreas Podelski (MPI, Saarbrucken) and Professor Moshe Vardi (Rice)

Workshop Theme

In recent years there has been an increasing interest in the application of constraint-programming and constraint-solving technology to the verification of hardware and software systems. Constraint solvers for Boolean (SAT) and arithmetic domains (Presburger, polyhedra, linear constraints) are widely used as subprocedures of various model checkers Constraint solving is also used for computing static analysis of programs with numerical data variables and concurrent systems. Constraints are also used extensively in automated test generation. The aim of this workshop is to bring together researchers working in constraints and verification and to investigate the theoretical foundations, new applications, and future developments in this area.

Sponsored by

IBM logo

IBM logo

University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons