On-the-fly verification with stubborn sets
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 397-408
- https://doi.org/10.1007/3-540-56922-7_33
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The weakest compositional semantic equivalence preserving nexttime-less linear temporal logicPublished by Springer Nature ,2006
- A partial approach to model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A stubborn attack on state explosionFormal Methods in System Design, 1992
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- Using partial orders for the efficient verification of deadlock freedom and safety propertiesPublished by Springer Nature ,1992
- Coverage Preserving Reduction Strategies for Reachability AnalysisPublished by Elsevier ,1992
- Using partial orders to improve automatic verification methodsPublished by American Mathematical Society (AMS) ,1991
- Stubborn sets for reduced state space generationPublished by Springer Nature ,1991
- Eliminating redundant interleavings during concurrent program verificationPublished by Springer Nature ,1989