Symbolic exploration of transition hierarchies

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

Volumn 1384, Issue , 1998, Pages 330-344

  Alur, Rajeev ^a   Henzinger, Thomas A ^b   Rajamani, Sriram K ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

ABSTRACTION PROCESS; CORRESPONDING STATE; DESIGN ABSTRACTIONS; FORMAL DESIGN; MANUAL PROCESS; MODEL CHECKER; VERIFICATION TOOLS;

MODEL CHECKING;

EID: 84947923147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054181     Document Type: Conference Paper

References (17)

1. L. Aceto and M. Hennessy. Towards action refinement in process algebras. In Proc. of LICS 89: Logic in Computer Science, pages 138-145. IEEE Computer Society Press, 1989.
2. R. Alur, R.K. Brayton, T.A. Henzinger, S. Qadeer, and S.K. Rajamani. Partial-order reduction in symbolic state-spa~:e exploration. In Proc. of CAV 97: Computer-Aided Verification, LNCS 1254, pages 340-351. Springer-Verlag, 1997.
3. R. Alur and T.A. Henzinger. Reactive modules. In Proc. of LICS 96: Logic in Computer Science, pages 207-218. IEEE Computer Society Press, 1996.
4. A. Benveniste, P. le Guernic, and C. Jaequemot. Synchronous programming with events and relations: The SIGNAL language and its semantics. Science of Computer Programming, 16:103-149, 1991.
5. R.K. Brayton, A. Sangiovanni-Vincentelli, G.D. Hachtel, F. Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, S. Qadeer, R.K. Ranjan, T.R. Shiple, G. Swamy, T. Villa, A. Pardo, and S. Sarwary. VIS: a system for verification and synthesis. In Proc. of CA V 96: Computer-Aided Verification, LNCS 1102, pages 428-432. Springer-Verlag, 1996.
6. E.M. Clarke and R.P. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61-67, 1996.
7. E.M. Clarke, K.L. McMillan, S. Campos, and V. Hartonas-Garmhausen. Symbolic model checking. In Proe. of CA V 96: Computer-Aided Verification, LNCS 1102, pages 419-422. Springer-Verlag, 1996.
8. K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
9. R.J. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: a semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, 1993.
10. D.L. Dill. The Murø verification system. In Proc. of CAV 96: Computer-Aided Verification, LNCS 1102, pages 390-393. Springer-Verlag, 1996.
11. N. Halbwachs. Synchronous Programming of Reactive Systems. rKluwer Academic Publishes, 1993.
12. G.J. Holzmann and D.A. Peled. An improvement in formal verification. In Proc. of FORTE 94: Formal Description Techniques, pages 197-211. Chapman & Hall, 1994.
13. G.J. Holzmann and D.A. Peled. The state of SPIN. In Proc. of CAV 96: Computer-Aided Verification, LNCS 1102, pages 385-389. Springer-Verlag, 1996.
14. R.H. Hardin, Z. Har'E1, and R.P. Kurshan. COSPAN. In Proc. of CAV 96: Computer-Aided Verification, LNCS 1102, pages 423-427. Springer-Verlag, 1996.
15. L. Lamport. What good is temporal logic? In Proc. of Information Processing 83: IFIP World Computer Congress, pages 657-668. Elsevier Science Publishers, 1983.
16. N.A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
17. H.J. Touati, H. Savoj, B. Lin, R.K. Brayton, and A. Sangiovanni-Vincentelli. Implicit state enumeration of finite-state machines using BDDs. In Proc. of ICCAD 90: Computer-Aided Design, pages 130-133. IEEE Computer Society Press, 1990.