Exploiting step semantics for efficient bounded model checking of asynchronous systems
Open Access
- 1 September 2012
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 77 (10-11) , 1095-1121
- https://doi.org/10.1016/j.scico.2011.07.005
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Planning as satisfiability: parallel plans and algorithms for plan searchArtificial Intelligence, 2006
- BMC via on-the-fly determinizationInternational Journal on Software Tools for Technology Transfer, 2005
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Bounded LTL model checking with stable modelsTheory and Practice of Logic Programming, 2003
- Temporal Induction by Incremental SAT SolvingElectronic Notes in Theoretical Computer Science, 2003
- Symbolic model checking with rich assertional languagesTheoretical Computer Science, 2001
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- Sequential and concurrent behaviour in Petri net theoryTheoretical Computer Science, 1987
- Minimum Feedback Arc Sets for a Directed GraphIEEE Transactions on Circuit Theory, 1963