Automatically Closing Open Reactive Programs

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 33, Issue 5, 1998, Pages 345-357

  Colby, Christopher ^a   Godefroid, Patrice ^b   Jagadeesan, Lalita Jategaonkar ^b  

^a LOYOLA UNIVERSITY CHICAGO   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346877056     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/277652.277754     Document Type: Article

References (34)

1. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986.
2. D. Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. In Proceedings of the ACM '88 Conference on Programming Lanugage Design and Implementation, pages 47-56, Atlanta, GE, USA, June 1988. ACM Press.
3. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, pages 238-252, New York, NY, 1977. ACM.
4. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
5. K. D. Cooper and K. Kennedy. Interprocedural side-effect analysis in linear time. In David S. Wise, editor, Proceedings of the SIGPLAN '88 Conference on Programming Lanugage Design and Implementation (SIGPLAN '88), pages 57-66, Atlanta, GE, USA, June 1988. ACM Press.
6. C. Colby. Analyzing the communication topology of concurrent programs. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 202-213, New York, NY, USA, June 1995. ACM Press.
7. C. Colby. Semantics-based Program Analysis via Symbolic Composition of Transfer Relations. PhD thesis, Carnegie Mellon University, August 1996.
8. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 1(15):36-72, 1993.
9. R. Cridlig. Semantic analysis of shared-memory concurrent languages using abstract model-checking. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 214-225, New York, NY, USA, June 1995. ACM Press.
10. D.R. Chase, M. Wegman, and F.K. Zadeck. Analysis of pointers and structures. In Proceedings of Conference on Programming Language Design and Implementation, pages 296-310, June 1990.
11. A. Deutsch. Interprocedural May-Alias analysis for pointers: Beyond k-limiting. SIGPLAN Notices, 29(6):230-241, June 1994. Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation.
12. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319-349, July 1987.
13. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer Science. Springer-Verlag, January 1996.
14. P. Godefroid. Model Checking for Programming Languages using VeriSoft. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pages 174-186, Paris, January 1997.
15. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
16. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
17. S. Horwitz and T. Reps. The use of program dependence graphs in software engineering. In Proceedings of the 14th International Conference on Software Engineering, pages 392-411, May 1992.
18. S. Horwitz, T. Reps, and D. Binkley. Intel-procedural slicing using dependence graphs. In David S. Wise, editor, Proceedings of the ACM '88 Conference on Programming Language Design and Implementation, pages 35-46, Atlanta, GE, USA, June 1988. ACM Press.
19. D. J. Kuck, R. H. Kuhn, B. Leasure, D. A. Padua, and M. Wolfe. Dependence graphs and compiler optimizations. In Proceedings of the 8th ACM Symposium on Principles of Programming Languages, pages 207-218, January 1981.
20. L. T. Kou. On live-dead analysis for global data flow problems. Journal of the ACM, 23(3):473-483, July 1977.
21. W. Landi. Interprocedural aliasing in the presence of pointers. PhD thesis, Rutgers University, 1991.
22. D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of ACM Symposium on Testing, Analysis, and verification (TAV4), pages 21-35, Vancouver, October 1991.
23. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
24. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
25. T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks. Acta Informatica, 28:121-163, 1990.
26. S. P. Masticola and B. G. Ryder. Non-concurrency analysis. In Proceedings of Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel programming, pages 129-138, San Diego, May 1993.
27. K.E. Martersteck and A.B. Spencer. Introduction to the 5ESS(TM) switching system. AT&T Technical Journal, 64(6 part 2):1305-1314, July-August 1985.
28. J.P. Quielle and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. 5th Int'l Symp. on Programming, volume 137 of Lecture Notes in Computer Science, pages 337-351, Springer-Verlag, 1981.
29. E. Ruf. Context-insensitive alias analysis reconsidered. In Proceedings of Conference on Programming Language Design and Implementation, New York, NY, USA, June 1995. ACM Press.
30. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive up-dating. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 16-31, St. Petersburg, Florida, January 1996. ACM Press.
31. R. N. Taylor. A general-purpose algorithm for analyzing concurrent programs. Communications of the ACM, pages 362-376, May 1983.
32. F. Tip. Generic techniques for source-level debugging and dynamic program slicing. In Proceedings of TAP-SOFT'95, volume 915 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
33. A. Venet. Abstract interpretation of the π-calculus. In Mads Dam, editor, Analysis and Verification of Multiple-Agent Languages (Proceedings of the Fifth LOMAPS Workshop), volume 1192 of Lecture Notes in Computer Science, pages 51-75. Springer-Verlag, 1997.
34. M. Weiser. Program slicing. In Proceedings of the 5th International Conference on Software Engineering, March 1981.