Efficient guided symbolic reachability using reachability expressions
- 8 January 2008
- journal article
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 10 (2) , 113-129
- https://doi.org/10.1007/s10009-007-0057-7
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability AnalysisPublished by Springer Nature ,2006
- The saturation algorithm for symbolic state-space explorationInternational Journal on Software Tools for Technology Transfer, 2005
- Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive PartitioningPublished by Springer Nature ,2005
- Rabbit: A Tool for BDD-Based Verification of Real-Time SystemsPublished by Springer Nature ,2003
- NuSMV 2: An OpenSource Tool for Symbolic Model CheckingPublished by Springer Nature ,2002
- Using Combinatorial Optimization Methods for Quantification SchedulingPublished by Springer Nature ,2001
- Symbolic guided search for CTL model checkingPublished by Association for Computing Machinery (ACM) ,2000
- Disjunctive partitioning and partial iterative squaringPublished by Association for Computing Machinery (ACM) ,1997
- Sequential circuit verification using symbolic model checkingPublished by Association for Computing Machinery (ACM) ,1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986