A Work-Efficient Distributed Algorithm for Reachability Analysis
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 54-66
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Experimental Analysis of Different Techniques for Bounded Model CheckingLecture Notes in Computer Science, 2003
- Improved reachability analysis of large finite state machines2002
- A Scalable Parallel Algorithm for Reachability Analysis of Very Large CircuitsFormal Methods in System Design, 2002
- Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions2001
- Symbolic Model Checking without BDDs1999
- NuSMV: A New Symbolic Model Verifier1999
- On-the-fly model checking of RCTL formulas1998
- RuleBase1996
- Efficient model checking by automated ordering of transition relation partitions1994
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992