Combining partial order reductions with on-the-fly model-checking
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 377-390
- https://doi.org/10.1007/3-540-58179-0_69
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Reducibility in analysis of coordinationPublished by Springer Nature ,2006
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- On-the-fly verification of finite transition systemsFormal Methods in System Design, 1992
- Verification of distributed programs using representative interleaving sequencesDistributed Computing, 1992
- Defining conditional independence using collapsesTheoretical Computer Science, 1992
- Coverage Preserving Reduction Strategies for Reachability AnalysisPublished by Elsevier ,1992
- A stubborn attack on state explosionPublished by American Mathematical Society (AMS) ,1991
- Event fairness and non-interleaving concurrencyFormal Aspects of Computing, 1989
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985
- Reasoning about infinite computation pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983