Partial order reduction: Model-checking using representatives
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Combining partial order reductions with on-the-fly model-checkingFormal Methods in System Design, 1996
- Rational and Recognizable Complex Trace LanguagesInformation and Computation, 1995
- Proving partial order propertiesTheoretical Computer Science, 1994
- 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
- Defining conditional independence using collapsesTheoretical Computer Science, 1992
- Event fairness and non-interleaving concurrencyFormal Aspects of Computing, 1989
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986