On the complexity analysis of static analyses

Journal of the ACM

Volumn 49, Issue 4, 2002, Pages 512-537

  McAllester, David ^a,b  

^a AutoReasoncom ^*  (United States)

^b AutoReasoncom   (United States)

Author keywords

Algorithms; Complexity analysis; Logic programming; Models of computation; Program analysis; Programming languages

Indexed keywords

COMPLEXITY ANALYSIS; DATALOG PROGRAMS; MODELS OF COMPUTATION; PSEUDO-CODE PRESENTATIONS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CONTROL SYSTEMS; DATA PROCESSING; GRAPH THEORY; MATHEMATICAL MODELS;

LOGIC PROGRAMMING;

EID: 0041999512     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/581771.581774     Document Type: Article

References (40)

1. ABADI, M., AND CARDELLI, L. 1996. A Theory Of Objects. Springer-Verlag, Berlin, Germany.
2. AHO, A. V., AND ULLMAN, J. 1986. Compilers: Principles Techniques and Tools. Addison Wesley, Reading, MA.
3. AIKEN, A., WIMMERS, E., AND LAKSHMAN, T. K. 1994. Soft typing with conditional types. In ACM Symposium on Principles of Programming Languages. ACM Press, New York, pp. 163-173.
4. APPEL, A. W. 1997. Modern Compiler Implementation in Java. Cambridge University Press, Cambridge, U.K.
5. BANCILHON, F., MAIER, D., SAGIV, Y., AND ULLMAN, J. D. 1986. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM SIGMODSIGACT Symposium on Principles of Database Systems. ACM Press, New York, pp. 1-15.
6. BONDORF, A., AND JORGENSEN, A. 1993. Efficient analysis for realistic off-line partial evaluation. J. Funct. Program. 3, 3, 315-346.
7. CHEN, W., AND WARREN, D. S. 1996. Tabled evaluation with delaying for general logic programs. Journal of the ACM 43, 1, 20-74.
8. COUSOT, P., AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixed points. In ACM Symposium on Principles of Programming Languages. ACM Press, New York, pp. 238-252.
9. DIJKSTRA, E. W. 1959. A note on two problems in connection with graphs. Numer. Math. 1, Oct., 269-271.
10. DOWNING, W., AND GALLIER, J. W. 1984. Linear time algorithms for testing the satisfiability of propositional horn formulae. J. Logic Program. 1, 3, 267-284.
11. EISNER, J., AND SATTA, G. 1999. Efficient parsing for bilexical context-free grammars and head automaton grammars. In Proceedings of the Annual Conference of the Association for Computational Linguistics (ACL-99). Morgan Kaufman, Menlo Park, Calif., pp. 457-464.
12. FÄHNDRICH, M., FOSTER, J., SU, Z., AND AIKEN, A. 1998. Partial online cycle elimination in inclusion constraint graphs. In Programming Language Design and Implementation (PLDI 98). ACM Press, New York, pp. 85-96.
13. HEINTZE, N. 1994. Set based analysis of ml programs. In ACM Conference on Lisp and Functional Programming. ACM Press, New York, pp. 306-317.
14. HEINTZE, N., AND JAFFAR, J. 1990a. A decision procedure for a class of set constraints. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 42-51.
15. HEINTZE, N., AND JAFFAR, J. 1990b. A finite presentation theorem for approximating logic programs. In ACM Symposium on Principles of Programming Languages. ACM Press, New York, pp. 197-209.
16. HEINTZE, N., AND MCALLESTER, D. 1997a. Linear time subtransitive control flow analysis. In Conference on Programming Language Design and Implementation (PLDI 97). ACM Press, New York, pp. 26-272.
17. HEINTZE, N., AND MCALLESTER, D. 1997b. On the cubic bottleneck in subtyping and flow analysis. In Proceedings, Twelvth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 342-361.
18. 3 barrier: Faster object type inference. Theor. Pract. Obj. Syst. 5, 1, 57-72. A Preliminary Version appeared in FOOL4.
19. KOZEN, D., PALSBERG, J., AND SCHWARTZBACH, M. I. 1994. Efficient inference of partial types. J. Comput. Syst. Sci. 49, 2 (Oct.), 306-324.
20. LARI, K., AND YOUNG, S. J. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Comput. Speech Lang. 4, 1, 35-56.
21. MARTELLI, A., AND MONTANARI, U. 1982. An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4, 2, 258-282.
22. MCALLESTER, D. 1996. Inferring recursive types. Available online at http://www.research.mit.edu/~dmac.
23. MELSKI, D., AND REPS, T. 1997. Intercovertability of set constraints and context free language reachability. In ACM SIGPLAN Symposium of Partial Evaluation and Semantic-Based Program Manipulation (PEPM'97). ACM Press, New York, pp. 74-89.
24. MILNER, R. 1978. A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17, 3, 348-375.
25. NAUGHTON, J., AND RAMAKRISHNAN, R. 1991. Bottom-up evaluation of logic programs. In Computational Logic, J.-L. Lassez and G. Plotkin, Eds. MIT Press, Cambridge, Mass.
26. PALSBERG, J. 1995. Efficient inference of object types. Inform. Comput. 123, 2, 198-209.
27. PALSBERG, J., AND O'KEEFE, P. 1995. A type system equivalent to flow analysis. ACM Trans. Program. Lang. Syst. 17, 4, 576-599.
28. PATERSON, M. S., AND WEGMAN, M. N. 1978. Linear unification. J. Comput. Syst. Sci. 16, 2 (April), 158-167.
29. PEREIRA, F., AND WARREN, D. 1983. Parsing as deduction. In 21st Annual Meeting of the Association for Computational Linguistics. Morgan Kaufman, Menlo Park, Calif., pp. 137-144.
30. REPS, T. 1994. Demand Interprocedural Program Analysis Using Logic Databases. Kluwer Academic Publishers, Norwell, Mass., pp. 163-196.
31. ROCIO, V., AND LOPES, J. G. 1998. Partial parsing, deduction and tabling. In Proceedings of Tabulation in Parsing and Deduction (TAPD'98) (Paris, France, April 1998), pp. 52-61.
32. ROHMER, J., LESCOEUR, R., AND KERISIT, J. M. 1986. The Alexander method - a technique for the processing of recursive axioms in deductive database queries. New Gen. Comput. 4, 3, 273-285.
33. SAGONAS, K., SWIFT, T., AND WARREN, D. S. 1994. Xsb as an efficient deductive database engine. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data (SIGMOD'94, Minneapolis, Minn.). ACM Press, New York, pp. 442-453.
34. SHIVERS, O. 1991. Data flow analysis and type recovery in scheme. In Topics in Advanced Language Implementation, P. Lee, Ed. MIT Press, Cambridge, Mass.
35. SHOSTAK, R. 1978. An algorithm for reasoning about equality. Comm. ACM 21, 2 (July), 583-585.
36. SHIEBER, S. M., SCHABES, Y., AND PEREIRA, F. 1995. Principles and implementation of deductive parsing. J. Logic Program. 24, 1-2 (July/Aug.), 3-36.
37. TAMAKI, H., AND SATO, T. 1986. Old resolution with tabulation. In Proceedings of the Third International Conference on Logic Programming. Lecture Notes in Computer Science, vol. 225. Springer-Verlag, London, England, pp. 84-96.
38. ULLMAN, J. 1989. Bottom-up beats top-down for datalog. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems (March 1998). ACM Press, New York, pp. 140-149.
39. ULLMAN, J., AND RAMAKRISHNAN, R. 1995. A survey of research in deductive database systems. J. Logic Program. 23, 2, 125-150.
40. VARDI, M. 1982. Complexity of relational query languages. In Proceedings of the 14th ACM SIGACT Symposium on Theory of Computating (San Francisco, Calif.). ACM Press, New York, pp. 137-146.