Model Checking as Constraint Solving
- 1 January 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurationsTheoretical Computer Science, 1999
- Model Checking in CLPPublished by Springer Nature ,1999
- Verifying systems with infinite but regular state spacesPublished by Springer Nature ,1998
- Set-based analysis of reactive infinite-state systemsPublished by Springer Nature ,1998
- Model checking the full modal mu-calculus for infinite sequential processesPublished by Springer Nature ,1997
- Reachability analysis of pushdown automata: Application to model-checkingPublished by Springer Nature ,1997
- Symbolic model checking of infinite state systems using presburger arithmeticPublished by Springer Nature ,1997
- Combining constraint solving and symbolic model checking for a class of systems with non-linear constraintsPublished by Springer Nature ,1997
- An automata-theoretic approach to branching-time model checking (Extended abstract)Published by Springer Nature ,1994
- Symbolic verification with periodic setsPublished by Springer Nature ,1994