Abstract
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.
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.
| Original language | English |
|---|---|
| Publication date | 2009 |
| Number of pages | 16 |
| Publication status | Published - 2009 |
| Event | 23rd Workshop on Constraint Logic Programming (WLP 2009) - Potsdam, Germany Duration: 15 Sept 2009 → 16 Sept 2009 |
Conference
| Conference | 23rd Workshop on Constraint Logic Programming (WLP 2009) |
|---|---|
| Country/Territory | Germany |
| City | Potsdam |
| Period | 15/09/2009 → 16/09/2009 |
Keywords
- Model checking
- Program analysis
- Abstract Interpretation