Achieving speedups in distributed symbolic reachability analysis through asynchronous computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3725 LNCS, Issue , 2005, Pages 129-145

  Grumberg, Orna ^a   Heyman, Tamir ^a   Ifergan, Nili ^a   Schuster, Assaf ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; MICROPROCESSOR CHIPS; PARALLEL ALGORITHMS; RESOURCE ALLOCATION;

ASYNCHRONOUS COMPUTATION; NON-BLOCKING PROTOCOLS; REACHABILITY ANALYSIS;

ALGORITHMS;

EID: 33646390657     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560548_12     Document Type: Conference Paper

References (30)

1. J. Barnat, L. Brim, and J. Stribrna. Distributed LTL model-checking in SPIN. In Proceedings of the 8th international SPIN workshop on Model checking of software, pages 200-216. Springer-Verlag, 2001.
2. I. Beer, S. Ben-David, and A. Landver. On-The-Fly Model Checking of RCTL Formulas. In CAV, pages 184-194, 1998.
3. A. Biere, C. Artho, and V. Schuppan. Liveness Checking as Safety Checking. In Proceedings of the 7th International ERCIM Workshop, FMICS'02. Electronic Notes in Theoretical Computer Science, 66(2). Elsevier, July 2002.
4. A. Biere, A. Cimatti, E.M. Clarke, O. Strichman, and Y. Zue. Bounded Model Checking. Advances in Computers. Volume 58, Academic Press, 2003.
5. V. A. Braberman, A. Olivero, and F. Schapachnik. Issues in distributed timed model checking: Building Zeus. STTT, 7(1):4-18, 2005.
6. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic Model Checking with Partitioned Transition Relations. In Proceedings of Internation Conference on Very Large Integration, pages 45-58, 1991.
7. G. Cabodi, P. Camurati, and S. Quer. Improved Reachability Analysis of Large FSM. In Proceedings of the IEEE International Conference on CAD, pages 354-360, 1996.
8. Pankaj Chauhan, Edmund M. Clarke, and Daniel Kroening. Using SAT based Image Computation for Reachability Analysis. Technical report, Carnegie Mellon University, School of Computer Science, 2003.
9. A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier. In CAV'99, pages 495-499.
10. E. M. Clarke, O. Grumberg, and D. Peled. Model checking. MIT Press, 1999.
11. E. W. Dijkstra, W. H. J. Feijen, and A. J. M. van Gasteren. Derivation of a Termination Detection Algorithm for Distributed Computations. Information Processing Letters, pages 217-219, 1983.
12. E. W. Dijkstra and C.S. Scholten. Termination Detection for Diffusing Computations. Information Processing Letters, pages 1-4, 1980.
13. R. Fraer, G. Kamhi, Z. Barukh, M.Y. Vardi, and L. Fix. Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification. In CAV'00, volume 1855 of LNCS.
14. O. Grumberg, A. Heyman, T. Heyman, and A. Schuster. Division System: A General Platform for Distributed Symbolic Model Checking Research, 2003.
15. O. Grumberg, T. Heyman, and A. Schuster. A Work-Efficient Distributed Algorithm for Reachability Analysis. In CAV, LNCS, 2003.
16. O. Grumberg, A. Schuster, and A. Yadgar. Memory Efficient All-Solutions SAT Solver and its Application for Reachability Analysis. In FMCAD'04.
17. A. Gupta, A. Gupta, Z. Yang, and P. Ashar. Dynamic Detection and Removal of Inactive Clauses in SAT with Application in Image Computation. In DAC, pages 536-541. ACM Press, 2001.
18. A. Gupta, Z. Yang, P. Ashar, L. Zhang, and S. Malik. Partition-Based Decision Heuristics for Image Computation using SAT and BDDs. In ICCAD, pages 286-292. IEEE Press, 2001.
19. Aarti Gupta, Zijiang Yang, Pranav Ashar, and Anubhav Gupta. SAT-Based Image Computation with Application in Reachability Analysis. In FMCAD, volume 1954 of LNCS, 2000.
20. T. Heyman, D. Geist, O. Grumberg, and A. Schuster. A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits. Formal Methods in System Design, pages 317 - 338, 2002.
21. H. Kang and I. Park. SAT-based Unbounded Symbolic Model Checking. In DAC, 2003.
22. F. Lerda and R. Sisto. Distributed-Memory Model Checking with SPIN. In Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking, pages 22-39. Springer-Verlag, 1999.
23. K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In CAV'00.
24. K. Milvang-Jensen and A. J. Hu. BDDNOW: A Parallel BDD Package. In FMCAD '98, LNCS, Palo Alto, California, USA, November 1998.
25. A. Narayan, A. Isles, J. Jain, R. Brayton, and A. L. Sangiovanni- Vincentelli. Reachability Analysis Using Partitioned-ROBDDs. In Proceedings of the IEEE International Conference on Computer Aided Design, pages 388-393, 1997.
26. A. A. Narayan, J. Jawahar, M. Fujita, and A. Sangiovanni-Vincenteli. Partitioned-ROBDDs. In CAV, pages 547-554, 1996.
27. D. M. Nicol and G. Ciardo. Automated Parallelization of Discrete State-Space Generation. J. Parallel Distrib. Comput., 47(2): 153-167, 1997.
28. M. R. Prasad, A. Biere, and A. Gupta. A Survey of Recent Advances in SAT-Based Verification. To appear in STTT, 2005.
29. U. Stern and D. L. Dill. Parallelizing the Munφ Verifier. In CAV, pages 256-278, 1997.
30. T. Stornetta and F. Brewer. Implementation of an Efficient Parallel BDD Package. In 33rd Design Automation Conference, 1996.