Automating modular verification

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

Volumn 1664 LNCS, Issue , 1999, Pages 82-97

  Alur, Rajeev ^a   De Alfaro, Luca ^b   Henzinger, Thomas A ^b,c   Mang, Freddy Y C ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

AUTOMATIC VERIFICATION; FINITE STATE SYSTEMS; MODULAR STRUCTURES; MODULAR VERIFICATION; STATE EXPLORATION; STATE EXPLOSION PROBLEMS; SYSTEM COMPONENTS; SYSTEM PROPERTY;

CONCRETES;

EID: 25144486118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_8     Document Type: Conference Paper

References (17)

1. R. Alur and T.A. Henzinger. Reactive modules. In Proc. 11th IEEE Symp. Logic in Comp. Sci., 1996.
2. R. Alur, T.A. Henzinger, F.Y.C. Mang, S. Qadeer, S.K. Rajamani, and S. Tasiran. Mocha: modularity in model checking. In Computer Aided Verification,LNCS 1427, pages 521-525. Springer-Verlag, 1998.
3. Martín Abadi and Leslie Lamport. Conjoining specifications. ACM Trans. Prog. Lang. Sys., 17(3):507-534, 1995.
4. C. Beeri. On the membership problem for functional and multivalued dependencies in relational databases. ACM Transactions on Database Systems, 5:241-259, 1980.
5. D. Barbara and H. Garcia-Molina. The demarcation protocol: a technique for maintaining linear arithmetic constraints in distributed database systems. In EDBT'92: 3rd International Conference on ExtendingDatabase Technology,LNCS 580, pages 373-388. Springer-Verlag, 1992.
6. R. Brayton, G. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. Ranjan, S. Sarwary, T. Shiple, G. Swamy, and T. Villa. VIS: A system for verification and synthesis. In Computer Aided Verification, LNCS 1102, pages 428-432. Springer-Verlag, 1996.
7. P. Cousot and R. Cousot. Refining model checking by abstract interpretation Automated Software Engineering Journal, 6(1):69-95, 1999.
8. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite state concurrent systems using temporal logic. In Proc. 10th ACM Symp. Princ. of Prog. Lang., 1983.
9. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Technical University of Eindhoven, 1996.
10. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Computer Aided Verification, LNCS. Springer-Verlag, 1997.
11. G.J. Holzman. Design and Validation of Computer Protocols. Prentice Hall, 1991.
12. T.A. Henzinger, S. Qadeer, S.K. Rajamani, and S. Tasiran. An assume-guarantee rule for checking simulation. In Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design (FMCAD 1998), LNCS 1522, pages 421-432. Springer-Verlag, 1998.
13. R.P. Kurshan. Computer-aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994.
14. K.L. McMillan. A compositional rule for hardware design refinement. In Computer Aided Verification, LNCS 1254, pages 24-35. Springer-Verlag, 1997.
15. P.J. Ramadge andW.M.Wonham. Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization, 25:206-230, 1987.
16. E.W. Stark. A proof technique for rely/guarantee properties. In Proc. of 5th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 206, pages 369-391. Springer-Verlag, 1985.
17. J.W. Thatcher and J.B. Wright. Generalized finite-automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2:57-81, 1968.