Interconvertibility of set constraints and context-free language reachability

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 1997, Pages 74-84

  Melski, David ^a   Reps, Thomas ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; PATTERN MATCHING; SEMANTICS; ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE SELECTION AND EVALUATION; FINITE AUTOMATA; GRAPH THEORY;

FINITE-STATE AUTOMATA; FORMAL LANGUAGE THEORY; REACHABILITY; REACHABILITY PROBLEM; REGULAR EXPRESSIONS; SET CONSTRAINTS;

CONTEXT FREE LANGUAGES;

CONTEXT FREE LANGUAGE REACHABILITY; INTERCONVERTIBILITY; SET CONSTRAINT PROBLEM;

EID: 0030681439     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258993.259006     Document Type: Conference Paper

References (28)

1. D. Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 47-56, 1988.
2. K.D. Cooper and K. Kennedy. Interprocedural side-effect analysis in linear time. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 57-66, 1988.
3. K.D. Cooper and K. Kennedy. Fast interprocedural alias analysis. In ACM Symposium on Principles of Programming Languages, pages 49-59, 1989.
4. M. J. Fischer and A. R. Meyer. Boolean matrix multiplication and transitive closure. In Conference Record of the IEEE 12th Symposium on Switching and Automata Theory, 1971.
5. F. Gêcseg and M. Steinby. Tree Automata. Akadêmiai Kiadó, 1984.
6. M.S. Hecht. Flow Analysis of Computer Programs. North-Holland, 1977.
7. N. Heintze. Set-based program analysis. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October 1992.
8. N. Heintze. Set based analyis of ML programs. Technical Report CMU-CS-93-193, Carnegie Mellon University, 1993.
9. N. Heintze and J. Jaffar. A decision procedure for a class of set constraints. Technical Report CMU-CS-91-110, Carnegie Mellon University, 1991.
10. N. Heintze and D. McAllester. Linear-time subtransitive control flow analysis. In SIGPLAN Conference on Programming Languages Design and Implementation, 1997.
11. N. Heintze and D. McAllester. On the cubic bottleneck in subtyping and flow analysis. In LJCS '97: Proceedings of the IEEE Symposium on Logic in Computer Science, 1997.
12. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 35-46, 1988.
13. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(l):26-60, January 1990.
14. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In Proceedings of the Fourth ACM SIG-SOFT Symposium on the Foundations of Software Engineering, pages 104-115, October 1995. (Available on the www from URL http://www.cs.wisc.edu/wpis/papers/fse95.ps).
15. S. Horwitz, T. Reps, M. Sagiv, and G. Rosay. Speeding up slicing. In Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 11-20, December 1994. (Available on thewww from URL http://www.cs.wisc.edu/wpis/papers/fse94.ps).
16. N. D. Jones and W. T. Laaser. Complete problems for deterministic polynomial time. Theoretical Computer Science 3, pages 105-117, 1977.
17. N.D. Jones and S.S. Muchnick. Flow analysis and optimization of Lisp-like structures. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 4, pages 102-131. Prentice-Hall, 1981.
18. U.P. Khedker and D.M. Dhamdhere. A generalized theory of bit vector data flow analysis. ACM Transactions on Programming Languages and Systems, 16(5):1472-1511, September 1994.
19. L.T. Kou. On live-dead analysis for global data flow problems. J. ACM, 24(3):473-483, July 1977.
20. D. McAllester and N. Heintze. On the complexity of set-based analysis. In ICFP '97: Proceedings of the Second ACM SIGPLAN International Conference on Functional Programming, 1997.
21. T. Reps. Demand interprocedural program analysis using logic databases. In R. Ramakrishnan, editor, Applications of Logic Databases. Kluwer Academic Publishers, 1994.
22. T. Reps. Shape analysis as a generalized path problem. In PEPM '95: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, New York, NY, 1995. ACM.
23. T. Reps. On the sequential nature of interprocedural program-analysis problems. Acta Inf., 33:739-757, 1996.
24. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In A CM Symposium on Principles of Programming Languages, pages 49-61, 1995. (Available on the www from URL http://www.cs.wisc.edu/wpis/papers/popl95.ps).
25. T. Reps, M. Sagiv, and S. Horwitz. Interprocedural dataflow analysis via graph reachability. Technical Report TR 94-14, Datalogisk Institut, University of Copenhagen, 1994. (Available on the www from URL http://www.cs.wisc.edu/wpis/ papers/diku-tr94-14.ps).
26. J.C. Reynolds. Automatic computation of data set definitions. In Information Processing 68: Proceedings of the IFIP Congress, pages 456-461, New York, NY, 1968. North-Holland.
27. M. Sharir and A. Pnueli. Two approaches to interprocedural dataflow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-234. Prentice-Hall, 1981.
28. M. Yannakakis. Graph-theoretic methods in database theory. In Proceedings of the Symposium on Principles of Database Systems pages 230-242, 1990.