Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
- 1 January 2009
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Peephole Partial Order ReductionPublished by Springer Science and Business Media LLC ,2008
- Cartesian Partial-Order ReductionPublished by Springer Science and Business Media LLC ,2007
- Dynamic partial-order reduction for model checking softwareACM SIGPLAN Notices, 2005
- Symbolic Model Checking for Asynchronous Boolean ProgramsLecture Notes in Computer Science, 2005
- Symbolic Model Checking of SoftwareElectronic Notes in Theoretical Computer Science, 2003
- Symbolic Model Checking without BDDsLecture Notes in Computer Science, 1999
- Refining dependencies improves partial-order verification methods (extended abstract)Lecture Notes in Computer Science, 1993
- All from one, one for all: on model checking using representativesLecture Notes in Computer Science, 1993
- Defining conditional independence using collapsesTheoretical Computer Science, 1992
- Stubborn sets for reduced state space generationLecture Notes in Computer Science, 1991