This volume 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,...

This volume gives the proceedings of the ninth Symposium on Theoretical Aspects of Computer Science (STACS). This annual symposium is held alternately in France and Germany and is organized jointly by the Special Interest Group for Fundamental Computer Science of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (AFCET) and the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI). The volume includes three invited lectures and sections on parallel algorithms, logic and semantics, computational geometry, automata...

Social Policy and Practice in Canada: A History traces the history of social policy in Canada from the period of First Nations' control to the present day, exploring the various ways in which residents of the area known today as Canada have organized themselves to deal with (or to ignore) the needs of the ill, the poor, the elderly, and the young.

This book is the first synthesis on social policy in Canada to provide a critical perspective on the evolution of social policy in the country. While earlier work has treated each new social program as a major advance, and...

Model checking is a powerful approach for the formal verification of software. When applicable, it automatically provides complete proofs of correctness, or explains, via counter-examples, why a system is not correct.
This book provides a basic introduction to this new technique. The first part describes in simple terms the theoretical basis of model checking: transition systems as a formal model of systems, temporal logic as a formal language for behavioral properties, and model-checking algorithms. The second part explains how to write rich and structured temporal logic specifications in...