Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 4, 1999, Pages 747-789

  Bultan, Tevfik ^a,b   Gerber, Richard ^a,c   Pugh, William ^a,c  

^a UNIVERSITY OF MARYLAND   (United States)

^b University of California   (United States)

^c University of Maryland ^*  (United States)

Author keywords

D.2.4 Software Engineering : Software Program Verification Formal Methods; F.3.1 Logics and Meanings of Programs : Specifying and Verifying and Reasoning about Programs Invariants; Mechanical verification; Model Checking; Preand post conditions

Indexed keywords

EID: 0012085727     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/325478.325480     Document Type: Article

References (63)

1. ALUR, R., COURCOUBETIS, C., HALBWACHS, N., HÈNZINGER, T. A., P. H. HO, X. N., OLIVERO, A., SIFAKIS, J., AND YOVINE, S. 1995. The algorithmic analysis of hybrid systems. Theoretical Computer Science 138, 1, 3-34.
2. ALUR, R., COURCOUBETIS, C., HENZINGER, T. A., AND HO, P. H. 1993. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems,
3. R. L. Grossman, A. Nerode, A. P. Ravn, and H. Richel, Eds. Lecture Notes in Computer Science, vol. 736. Springer-Verlag, 209-229.
4. ALUR, R., HENZINGER, T. A., AND HO, P. 1996. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering 22, 3 (March), 181-201.
5. ANDREWS, G. R. 1991. Concurrent Programming: Principles and Practice. The Benjamin/Cummings Publishing Company, Redwood City, California.
6. ARNOLD, A. 1994. Finite Transition Systems: Semantics of Communicating Systems. Prentice Hall, Englewood Cliffs, New Jersey.
7. BASIN, D. A. AND KLARLUND, N. 1995. Hardware verification using monadic second-order logic. In Proceedings of the 7th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 939. Springer-Verlag.
8. BIEHL, M., KLARLUND, N., AND RAUHE, T. 1996. Mona: Decidable arithmetic in practice. In Proceedings of Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium. Lecture Notes in Computer Science, vol. 1135. Springer.
9. BJØRNER, N., BROWNE, I. A., AND MANNA, Z. 1997. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science 173, 1 (February), 49-87.
10. BOIGELOT, B. AND GODEFROID, P. 1996. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proceedings of the 8th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1102. Springer-Verlag, 1-12.
11. BOIGELOT, B. AND WOLPER, P. 1994. Symbolic verification with periodic sets. In Proceedings of the 6th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 818. Springer-Verlag, 55-67.
12. BOUAJJANI, A. AND MALER, O. 1996. Reachability analysis of pushdown automata. In Proceedings of INFINITY International workshop on Infinite State Systems, Technical Report MIP-9614. University of Passau, 99-114.
13. BRADFIELD, J. C. 1992. Verifying Temporal Properties of Systems. Birkhauser, Boston.
14. BRYANT, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35, 8, 677-691.
15. BULTAN, T., FISCHER, J., AND GERBER, R. 1996. Compositional verification by model checking for counter-examples. In Proceedings of the 1996 ACM SIGSOFT International Symposium on Software Testing and Analysis. 224-238.
16. BULTAN, T., GERBER, R., AND LEAGUE, C. 1998. Verifying systems with integer constraints and boolean predicates: A composite approach. In Proceedings of the 1998 ACM SIGSOFT International Symposium on Software Testing and Analysis. 113-123.
17. BURCH, J. R., CLARKE, E. M., LONG, D. E., MCMILLAN, K. L., AND DILL, D. L. 1994. Symbolic model checking for sequential circuit verification. IEEE Transactions on Camputer-Aided Design of Integrated Circuits and Systems 13, 4 (April), 401-424.
18. 20 states and beyond. Information and Computation 98, 2 (June), 142-170.
19. CABODI, G., CAMURATI, P., AND QUER, S. 1994a. Efficient state space pruning in symbolic backward traversal. In Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
20. CABODI, G., CAMURATI, P., AND QUER, S. 1994b. Symbolic exploration of large circuits with enhanced forward/backward traversals. In Proceedings: EURO-DAC'94 with EURO-VHDL'94. 22-27.
21. CLARKE, E. M. AND EMERSON, E. A. 1981. Design and synthesis of synchronization skeletons using branching time temporal logic. In Logic of Programs: Workshop, D. Kozen, Ed. Lecture Notes in Computer Science, vol. 131. Springer-Verlag.
22. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8, 2 (April), 244-263.
23. CLARKE, E. M., GRUMBERG, O., AND LONG, D. E. 1994. Model checking and abstraction. ACM Transactions on Programming Languages and Systems 16, 5 (September), 1512-1542.
24. CLARKE, E. M., LONG, D. E., , AND MCMILLAN, K. L. 1989. Compositional model checking. In Proceedings of the 4th Annual IEEE Symposium on Logic in Computer Science. 464-475.
25. COOPER, D. C. 1971. Programs for mechanical program verification. In Machine Intelligence 6. American Elsevier, New York, 43-59.
26. COUDERT, O., BERTHET, C., AND MADRE, J. C. 1989. Verification of synchronous sequential machines based on symbolic execution. In Automatic Verification Methods for Finite State Systems, J. Sifakis, Ed. Lecture Notes in Computer Science, vol. 407. Springer-Verlag, 365-373.
27. COUDERT, O., MADRE, J. C., AND BERTHET, C. 1990. Verifying temporal properties of sequential machines without building their state diagrams. In Proceedings of the 2nd International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 531. Springer, 23-32.
28. COUSOT, P. AND COUSOT, R., 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th Annual ACM Symposium on Principles of Programming Languages. 238-252.
29. COUSOT, P. AND HALBWACHS, N. 1978. Automatic discovery of linear restraints among variables of a program. In Proceedings of the 5th Annual ACM Symposium on Principles of Programming. 84-97.
30. CRIDLIG, R. 1996. Semantic analysis of concurrent ML by abstract model-checking. In Proceedings of INFINITY International workshop on Infinite State Systems, Technical Report MIP-9614. University of Passau, 71-86.
31. DAMS, D., GERTH, R., AND GRUMBERG, O. 1997. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems 19, 2 (March), 253-291.
32. DILLON, L. K. 1990. Using symbolic execution for verification of ada tasking programs. ACM Transactions on Programming Languages and Systems 12, 4 (October), 643-669.
33. DINGEL, J. AND FILKORN, T. 1995. Model checking for infinite state systems using data abstraction. In Proceedings of the 7th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 939. Springer-Verlag, 54-69.
34. ESPARZA, J. 1997. Decidability of model checking for infinite-state concurrent systems. Acta Informatica 34, 85-107.
35. FISCHER, M. J. AND RABIN, M. O. 1974. Super-exponential complexity of presburger arithmetic. In SIAM-AMS Proceedings. Vol. 7. 27-41.
36. GODEFROID, P. 1994. Partial-order methods for the verification of concurrent systems: An approach to the state-explosion problem. Ph.D. thesis, Universite De Liege.
37. GODEFROID, P. AND LONG, D. 1996. Symbolic protocol verification with queue BDDs. In Proceedings of the 11th Symposium on Logic in Computer Science. 198-206.
38. GRUMBERG, O. AND LONG, D. E. 1994. Model checking and modular verification. ACM Transactions on Programming Languages and Systems 16, 3 (May), 843-871.
39. HALBWACHS, N. 1993. Delay analysis in synchronous programs. In Proceedings of computer aided verification, C. Courcoubetis, Ed. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, 333-346.
40. HALBWACHS, N., RAYMOND, P., AND PROY, Y. 1994. Verification of linear hybrid systems by means of convex approximations. In Proceedings of International Symposium on Static Analysis, B. LeCharlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag.
41. HANTLER, S. L. AND KING, J. C. 1976. An introduction to proving the correctness of programs. ACM Computing Surveys 8, 3 (September), 331-353.
42. HENRIKSEN, J. G., JENSEN, J., JØRGENSEN, M., KLARLUND, N., PAIGE, R., RAUHE, T., AND SANDHOLM, A. 1995. Mona: Monadic second-order logic in practice. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems, First International Workshop. Lecture Notes in Computer Science, vol. 1019. Springer-Verlag.
43. HENZINGER, T. A. AND HO, P. 1995. A note on abstract-interpretation strategies for hybrid automata. In Hybrid Systems II, P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, Eds. Lecture Notes in Computer Science, vol. 999. Springer-Verlag, 252-264.
44. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, Massachusetts.
45. KELB, P., DAMS, D., AND GERTH, R. 1995. Practical symbolic model checking of the full μ-calculus using compositional abstractions. Tech. Rep. 95-31, Department of Computer Science, Eindhoven University of Technology.
46. KELLY, W., MASLOV, V., PUGH, W., ROSSER, E., SHPEISMAN, T., AND WONNACOTT, D. 1995. The omega library interface guide. Tech. Rep. CS-TR-3445, Department of Computer Science, University of Maryland, College Park. March.
47. KELLY, W., PUGH, W., ROSSER, E., AND SHPEISMAN, T. 1994. Transitive closure of infinite graphs and its applications. Tech. Rep. CS-TR-3457, UMIACS-TR-95-48, Department of Computer Science, University of Maryland, College Park. April.
48. KLARLUND, N. 1997. Mona & fido: The logic-automaton connection in practice. In Proceedings of Computer Science Logic.
49. MANNA, Z., ANUCHITANUKUL, A., BJØRNER, N., BROWNE, A., CHANG, E., COLÓN, M., ALFARO, L., DEVARAJAN, H., SIPMA, H., AND URIBE, T. 1994. Step: The Stanford temporal prover. Tech. Rep. STAN-CS-TR-94-1518, Computer Science Department, Stanford University. July.
50. MCMILLAN, K. L. 1993. Symbolic model checking. Kluwer Academic Publishers, Massachusetts.
51. 22pn upper bound on the complexity of presburger arithmetic. Journal of Computer and System Sciences 16, 323-332.
52. OWRE, S., RAJAN, S., RUSHBY, J. M., SHANKAR, N., AND SRIVAS, M. 1996. PVS: Combining specification, proof checking, and model checking. In Proceedings of the 8th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1102. Springer-Verlag.
53. PARDO, A. AND HACHTEL, G. D. 1997. Automatic abstraction techniques for prepositional μ-calculus model checking. In Proceedings of the 9th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 1254. Springer, 12-23.
54. PUGH, W. 1992. The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM 8, 102-104.
55. PUGH, W. AND WONNACOTT, D. 1994. Static analysis of upper and lower bounds on dependences and parallelism. ACM Transactions on Programming Languages and Systems 14, 3 (July), 1248-1278.
56. QUEILLE, J. AND SIFAKIS, J. 1982. Specification and verification of concurrent systems in CESAR. In Proceedings of the Fifth International Symposium in Programming.
57. SHANKAR, A. U. 1993. An introduction to assertional reasoning for concurrent systems. ACM Computing Surveys 25, 3 (September), 225-262.
58. SHIPLE, T. R., KUKULA, J. H., AND RANJAN, R. K. 1998. A comparison of presburger engines for EFSM reachability. In Proceedings of the 10th International Conference on Computer-Aided Verification.
59. TARSKI, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285-309.
60. VARDI, M. Y. AND WOLPER, P. 1986. An automata-theoretic approach to automatic program verification. In Proceedings of First IEEE Symposium on Logic in Computer Science. 322-331.
61. WING, J. M. AND VAZIRI-FARAHANI, M. 1995. Model checking software systems: A case study. In Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering. 128-139.
62. WOLPER, P. AND BOIGELOT, B. 1995. An automata-theoretic approach to presburger arithmetic constraints. In Proceedings of the Static Analysis Symposium.
63. WONNACOTT, D. G. 1995. Constraint-based array dependence analysis. Ph.D. thesis, University of Maryland, College Park.