Distributed symbolic model checking for μ-calculus

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

Volumn 2102, Issue , 2001, Pages 350-362

  Grumberg, Orna ^a   Heyman, Tamir ^a,b   Schuster, Assaf ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; CLUSTERING ALGORITHMS; COMPUTER AIDED ANALYSIS; DISTRIBUTED COMPUTER SYSTEMS; TEMPORAL LOGIC;

COMPUTING NODES; DISTRIBUTED CLUSTERS; LTL MODEL-CHECKING; REACHABILITY ANALYSIS; SAFETY PROPERTY; SYMBOLIC ALGORITHMS; SYMBOLIC MODEL CHECKING; TRANSITION RELATIONS;

MODEL CHECKING;

EID: 0013007059     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_32     Document Type: Conference Paper

References (18)

1. S. Ben-David, T. Heyman, O. Grumberg, and A. Schuster. Scalable Distributed On-the-Fly Symbolic Model Checking. In Third International Conference on Formal methods in Computer-Aided Design (FMCAD’00), Austin, Texas, November 2000.
2. R. E. Bryant. Graph-based Algorithms for Boolean FunctionManipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
3. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic Model Checking with Partitioned Transition Relations. In A. Halaas and P. B. Denyer, editors, Proceedings of the 1991 International Conference on Very Large Scale Integration, August 1991.
4. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic Model Checking: 1020 States and Beyond. Information and Computation, 98(2):142-170, 1992.
5. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. In Proceedings of the Tenth Annual ACM Symposium on Principles of Programming Languages, January 1983.
6. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT press, December 1999.
7. R. Cleaveland. Tableau-basedmodel checking in the propositional mu-calculus. Acta Informatica, 27:725-747, 1990.
8. O. Coudert, J. C. Madre, and C. Berthet. Verifying of Synchronous Sequential Machines Based on Symbolic Execution. In J. Sifakis, editor, Workshop on Automatic Verification Methods for Finite State Systems, pages 365-373. Springer-Verlag, Grenoble, France, 1989.
9. E. A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Propositional Mu-calculus. In Proceedings of the First Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, June 1986.
10. T. Heyman, D. Geist, O. Grumberg, and A. Schuster. Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits. In Proc. of the 12th International Conference on Computer Aided Verification. Springer-Verlag, June 2000.
11. D. Kozen. Results on the propositional μ-calculus. TCS, 27, 1983.
12. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97-107, January 1985.
13. D. Long, A. Browne, E. Clark, S. Jha, and W. Marrero. An Improved Algorithm for the Evaluation of Fixpoint Expressions. In Proc. of the Sixth International Conference on Computer Aided Verification, LNCS 818, pages 338-350. Springer-Verlag, 1994.
14. 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. IEEE Computer Society Press, June 1997.
15. J.P. Quielle and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proceedings of the Fifth International Symposium in Programming, 1981.
16. C. Stirling and D. J. Walker. Local Model Checking in the Model Mu-Calculus. In Proc. of the 1989 Int. Joint Conf. on Theory and Practice of Software Development, 1989.
17. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math, 1955.
18. G. Winskel. Model checking in the modal μ-calculus. In Proceedings of the Sixteenth International Colloquium on Automata, Languages, and Programming, 1989.