Abstraction-Based Model Checking Using Modal Transition Systems
Top Cited Papers
- 22 August 2001
- book chapter
- Published by Springer Nature
- p. 426-440
- https://doi.org/10.1007/3-540-44685-0_29
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Boolean and Cartesian Abstraction for Model Checking C ProgramsPublished by Springer Nature ,2001
- Generalized Model Checking: Reasoning about Partial State SpacesPublished by Springer Nature ,2000
- Temporal abstract interpretationPublished by Association for Computing Machinery (ACM) ,2000
- Bebop: A Symbolic Model Checker for Boolean ProgramsPublished by Springer Nature ,2000
- Model Checking Partial State Spaces with 3-Valued Temporal LogicsPublished by Springer Nature ,1999
- Experience with Predicate AbstractionPublished by Springer Nature ,1999
- Computing abstractions of infinite state systems compositionally and automaticallyPublished by Springer Nature ,1998
- Abstract interpretation of reactive systemsACM Transactions on Programming Languages and Systems, 1997
- Optimality in abstractions of model checkingPublished by Springer Nature ,1995
- Model checking and abstractionACM Transactions on Programming Languages and Systems, 1994