Workshop in Cambridge, UK, 8 - 12 May 2006
Organisers: Prof. Andreas Podelski (MPI Informatik, Saarbruecken) and Prof. Moshe Vardi (Rice)
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.
The Conference will take place at the Newton Institute and accommodation for participants will be provided in single study bedrooms with en suite bathroom at New Hall. The conference package, costing £485, includes accommodation and breakfast from Sunday 7 May 2006 to lunch on Friday 12 May 2006, and refreshments during the days that lectures take place. Participants who wish to attend but do not require the Conference Package will be charged a registration fee of £85. Self-supporting participants are very welcome to apply.
Are available here. Invited participants to the semester long programme whose dates coincide with those of the workshop need not apply or pay any registration fee.
The closing date for the receipt of applications is 24 February 2006
Information for Conference Participants | Local Information
The Workshop is part of the Logic and Algorithms Programme at the Isaac Newton Institute for Mathematical Sciences, 16 January - 7 July 2006