Can Saturation Be Parallelised?
Authors:
- 1 January 2007
- book chapter
- Published by Springer Nature
- p. 331-346
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation2005
- A Work-Efficient Distributed Algorithm for Reachability AnalysisLecture Notes in Computer Science, 2003
- Saturation: An Efficient Iteration Strategy for Symbolic State—Space Generation2001
- NUSMV: a new symbolic model checkerInternational Journal on Software Tools for Technology Transfer, 2000
- Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits2000
- BDDNOW: A Parallel BDD Package1998
- Implementation of an efficient parallel BDD package1996
- Symbolic Model Checking1993