Alain Finkel

Hubert Comon

Gerard Berry

This book constitutes the refereed proceedings of the 13th International Conference on Computer Aided Verification, CAV 2001, held in Paris, France in July 2001. The 33 revised full papers presented were carefully reviewed and selected from 106 regular paper submissions; also included are 13 reviewed tool presentations selected from 27 submissions. The book offers topical sections on model checking and theorem proving, automata techniques, verification core technology, BDD and decision trees, abstraction and refinement, combinations, infinite state systems, temporal logics and verification, microprocessor verification and cache coherence, SAT and applications, and timed automata.

13th International Conference, CAV 2001, Paris, France, July 18-22, 2001. Proceedings

Computer Aided Verification

Claude Marche

Ralf Treinen

Constraints provide a declarative way of representing infinite sets of data. They are well suited for combining different logical or programming paradigms as has been known for constraint logic programming since the 1980s and more recently for functional programming. The use of constraints in automated deduction is more recent and has proved to be very successful, moving the control from the meta-level to the constraints, which are now first-class objects. This monograph-like book presents six thoroughly reviewed and revised lectures given by leading researchers at the summer school organized by the ESPRIT CCL Working Group in Gif-sur-Yvette, France, in September 1999. The book offers coherently written chapters on constraints and constraint solving, constraint solving on terms, combining constraint solving, constraints and theorem proving, functional and constraint logic programming, and building industrial applications.

Hubert Comon

Books

Your next favorite book is out there