Efficient distributed SAT and SAT-based distributed bounded model checking

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

Volumn 2860, Issue , 2003, Pages 334-347

  Ganai, Malay K ^a   Gupta, Aarti ^a   Yang, Zijiang ^a   Ashar, Pranav ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN; PRODUCT DESIGN; TOPOLOGY;

BOUNDED MODEL CHECKING; COMMUNICATION COST; COMMUNICATION OVERHEADS; DISTRIBUTING COMPUTING; NETWORK OF WORKSTATIONS; SAT PROBLEMS; SAT SOLVERS; SINGLE SERVER;

MODEL CHECKING;

EID: 0142214498     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39724-3_30     Document Type: Article

References (27)

1. A. Silburt, A. Evans, G. Vrckovik, M. Diufrensne, and T. Brown, "Functional Verification of ASICs in Silicon Intensive Systems," presented at DesignCon98 On-Chip System Design Conference, 1998.
2. E. M. Clarke, O. Grumberg, and D. Peled, Model Checking: MIT Press, 1999.
3. K. L. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem: Kluwer Academic Publishers, 1993.
4. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transactions on Computers, vol. C-35(8), pp. 677-691, 1986.
5. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, "Symbolic model checking using SAT procedures instead of BDDs," in Proceedings of the Design Automation Conference, 1999, pp. 317-320.
6. P. Bjesse and K. Claessen, "SAT-based verification without state space traversal," in Proceedings of Conference on Formal Methods in Computer-Aided Design, 2000.
7. M. Ganai and A. Aziz, "Improved SAT-based Bounded Reachability Analysis," in Proceedings of VLSI Design Conference, 2002.
8. P. A. Abdulla, P. Bjesse, and N. Een, "Symbolic Reachability Analysis based on {SAT}-Solvers," in Proceedings of Workshop on Tools and Algorithms for the Analysis and Construction of Systems (TACAS), 2000.
9. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Prepositional Satisfiability," IEEE Transactions on Computers, vol. 48, pp. 506-521, 1999.
10. H. Zhang, "SATO: An efficient propositional prover," in Proceedings of International Conference on Automated Deduction, vol. 1249, LNAI, 1997, pp. 272-275.
11. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," in Proceedings of Design Automation Conference, 2001.
12. M. Ganai, L. Zhang, P. Ashar, and A. Gupta, "Combining Strengths of Circuit-based and CNF-based Algorithms for a High Performance SAT Solver," in Proceedings of the Design Automation Conference, 2002.
13. A. Kuehlmann, M. Ganai, and V. Paruthi, "Circuit-based Boolean Reasoning," in Proceedings of Design Automation Conference, 2001.
14. B. W. Wah, G.-J. Li, and C. F. Yu, "Multiprocessing of Combinational Search Problems," IEEE computer, pp. 93-108, 1985.
15. H. Zhang, M. P. Bonacina, and J. Hsiang, "PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems," Journal of Symbolic Computation, 1996.
16. Y. Zhao, "Accelerating Boolean Satisfiability through Application Specific Processing.," Ph.D. Thesis. Princeton, 2001.
17. C. Powley, C. Fergusion, and R. Korf, "Parallel Heuristic Search: Two Approaches," in Parallel Algorithms for Machine Intelligence and Vision, V. Kumar, P. S. Gopalakrishnan, and L. N. Kanal, Eds. New York: Springer-Verlag, 1990.
18. B. Jurkowiak, C. M. Li, and G. Utard, "Parallelizing Satz Using Dynamic Workload Balancing," presented at Workshop on Theory and Applications of Satisfiability Testing, 2001.
19. M. Boehm and E. Speckenmeyer, "A Fast Parallel SAT-solver - Efficient Workload Balancing," presented at Third International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, 1994.
20. U. Stern and D. L. Dill, "Parallelizing the Murphi Verifier," presented at Computer Aided Verification, 1997.
21. T. Heyman, D. Geist, O. Grumberg, and A. Schuster, "Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits," presented at Computer-Aided Verification, 2000.
22. A. Narayan, A. Isles, J. Jain, R. Brayton, and A. L. Sangiovanni-Vincentelli, "Reachability Analysis using Partitioned-ROBDDs," presented at International Conference on Computer-Aided Design, 1997.
23. A. Yadgar, "Parallel SAT Solving for Model Checking. www.cs.technion.ac.il/-yadgar/Research/research.pdf," 2002.
24. M. Davis, G. Longeman, and D. Loveland, "A Machine Program for Theorem Proving," Communications of the ACM, vol. 5, pp. 394-397, 1962.
25. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic Model Checking without BDDs," in Proceedings of Workshop on Tools and Algorithms for Analysis and Construction of Systems (TACAS), vol. 1579, LNCS, 1999.
26. M. Sheeran, S. Singh, and G. Stalmarck, "Checking Safety Properties using Induction and a SAT Solver," in Proceedings of Conference on Formal Methods in Computer-Aided Design, 2000.
27. A. Hasegawa, H. Matsuoka, and K. Nakanishi, "Clustering Software for Linux-Based HPC," NEC Research & Development, vol. vol 44, No. 1, pp. 60-63, 2003.