Constraint-based abstraction of a model checker for infinite state systems
- Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.
Author details: | Gourinath Banda, John P. Gallagher |
---|---|
URN: | urn:nbn:de:kobv:517-opus-41516 |
Publication type: | Conference Proceeding |
Language: | English |
Publication year: | 2010 |
Publishing institution: | Universität Potsdam |
Contributing corporation: | Gesellschaft für Logische Programmierung e.V. |
Release date: | 2010/03/04 |
Source: | Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 109 - 124 |
Organizational units: | Extern / Extern |
DDC classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
Collection(s): | Universität Potsdam / Tagungsbände/Proceedings (nicht fortlaufend) / Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Theory of Logic Programming |
License (German): | Keine öffentliche Lizenz: Unter Urheberrechtsschutz |
External remark: | Work partly supported by the Danish Natural Science Research Council project SAFT: Static Analysis Using Finite Tree Automata. |