Model Checking and Modular Verification

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 16, Issue 3, 1994, Pages 843-871

  Grumberg, Orna ^a   Long, David E ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

computer aided verification; CTL; formal verification; model checking; Moore machines; temporal logics

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; DECISION TABLES; FORMAL LOGIC; LOGIC PROGRAMMING; PROGRAM DEBUGGING; PROGRAMMING THEORY; SEQUENTIAL MACHINES;

COMPUTER AIDED VERIFICATION; FORMAL VERIFICATION; MODEL CHECKING; MODULAR VERIFICATION; MOORE MACHINES; TEMPORAL LOGICS;

ALGORITHMS;

EID: 0028427381     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/177492.177725     Document Type: Article

References (31)

1. BEN-ARI, M., MANNA, Z., AND PNUELI, A. 1983. The temporal logic of branching time. Acta Informatica 20, 207-226.
2. 20 states and beyond. In Proceedings of the 5th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
3. CLARKE, E. M., AND EMERSON, E. A. 1981. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs: Workshop (Yorktown Heights, NY, May). Lecture Notes in Computer Science, vol. 131. Springer-Verlag, New York.
4. CLARKE, E. M., DRAGHICESCU, I. A., AND KURSHAN, R. P. 1990. A unified approach for showing language containment and equivalence between various types of ?-automata. In Proceedings of the 15th Colloquium on Trees in Algebra and Programming. Lecture Notes in Computer Science, vol. 407. Springer-Verlag, New York.
5. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2, 244-263.
6. CLARKE, E. M., LONG, D. E., AND MCMILLAN, K. L. 1989a. Compositional model checking. In Proceedings of the 4th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
7. CLARKE, E. M., LONG, D. E., AND MCMILLAN, K. L 1989b. A language for compositional specification and verification of finite state hardware controllers. In Proceedings of the 9th International Symposium on Computer Hardware Description Languages and their Applications. North-Holland, Amsterdam.
8. CLEAVELAND, R. 1990. Tableau-based model checking in the propositional mu-calculus. Acta Informatica 27, 8, 725-747.
9. CLEAVELAND, R., AND STEFFEN, B. 1990. When is “partial” adequate. A logic-based proof technique using partial specifications. In Proceedings of the 5th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
10. CLEAVELAND, R., PARROW, J., AND STEFFEN, B. 1989. The concurrency workbench. In Proceedings of the 1989 International Workshop on Automatic Verification Methods for Finite State Systems (Grenoble France). Lecture Notes in Computer Science, vol 407. Springer-Verlag, New York.
11. COUDERT, O., BERTHET, C., AND MADRE, J. C 1990. Verifying temporal properties of sequential machines without building their state diagrams. In Proceedings of the 1990 Workshop on Computer-Aided Verification. ACM, New York.
12. DILL, D. L. 1989. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. ACM Distinguished Dissertations. MIT Press, Cambridge, Mass.
13. EMERSON, E. A., AND HALPERN, J. Y. 1986. “Sometimes” and “Not Never” revisited: On branching time versus linear time. J. ACM 33 1, 151-178.
14. EMERSON, E. A., AND LEI, C.-L. 1986. Efficient model checking in fragments of the propositional mu-calculus. In Proceedings of the 1st Annual Symposium on Logic in Computer Science IEEE Computer Society Press, Los Alamitos, Calif.
15. GRAF, S., AND STEFFEN, B. 1990. Compositional minimization of finite state processes. In Proceedings of the 1990 Workshop on Computer-Aided Verification. ACM, New York.
16. HOPCROFT, J. E., AND ULLMAN, J. D. 1979 Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
17. JOSKO, B. 1989. Verifying the correctness of AADL-modules using model checking. In Proceedings of the REX Workshop on Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness. Lecture Notes in Computer Science, vol. 430. Springer-Verlag, New York.
18. KURSHAN, R. P. 1989. Analysis of discrete event coordination. In Proceedings of the REX Workshop on Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness. Lecture Notes in Computer Science, vol 430. Springer-Verlag, New York.
19. KuRSHAN, R. P. AND MCMILLAN, K. L. 1989 A structural induction theorem for processes. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing. ACM Press, New York.
20. LARSEN, K. G. 1993. The expressive power of implicit specifications In Proceedings of the 18th International Colloquium on Automata, Languages, and Programming. Eur. Assoc, for Theoretical Computer Science. To be published.
21. LICHTENSTEIN, O., AND PNUELI, A. 1985. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages. ACM, New York.
22. MILNER, R. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer-Verlag, New York.
23. MILNER, R. 1971. An algebraic definition of simulation between programs. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence (Sept.).
24. PNUELI, A. 1984. In transition for global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems. NATO ASI Series. Series F, Computer and System Sciences, vol. 13. Springer-Verlag, New York.
25. PNUELI, A., AND SHERMAN, R. 1981 Semantic tableau for temporal logic. Tech. Rep. CS81-21, The Weizmann Institute, Israel.
26. SHTADLER, Z., AND GRUMBERG, O. 1989. Network grammars, communication behaviors and automatic verification. In Proceedings of the 1989 International Workshop on Automatic Verification Methods for Finite State Systems (Grenoble, France). Lecture Notes in Computer Science, vol. 407. Springer-Verlag, New York
27. SHUREK, G., AND GRUMBERG, O. 1990. The modular framework of computer-aided verification: Motivation, solutions and evaluation criteria. In Proceedings of the 1990 Workshop on Computer-Aided Verification. ACM, New York.
28. STIRLING, C., AND WALKER, D. J. 1989. Local model checking in the modal mu-calculus. In Proceedings of the 1989 International Joint Conference on Theory and Practice of Software Development. Lecture Notes in Computer Science, vol. 351-352. Springer-Verlag, New York.
29. WALKER, D. 1988. Bisimulations and divergence. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
30. WINSKEL, G. 1989. Model checking in the modal v-calculus. In Proceedings of the 16th International Colloquium on Automata, Languages, and Programming. Eur. Assoc, for Theoretical Computer Science.
31. WOLPER, P. 1983. Temporal logic can be more expressive. Inf. Contr. 56, 1/2 (Jan./Feb.), 72-99.