Selectors make set-based analysis too hard

Higher-Order and Symbolic Computation

Volumn 18, Issue 3-4, 2005, Pages 245-269

  Meunier, Philippe ^a   Findler, Robert Bruce ^b   Steckler, Paul ^a   Wand, Mitchell ^a  

^a Northeastern University   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Program analysis; Scheme; Set based analysis; Static debugging

Indexed keywords

PROGRAM ANALYSIS; SCHEMES; SET-BASED ANALYSIS; STATIC DEBUGGING;

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; PROBLEM SOLVING; PROGRAM DEBUGGING; PROGRAMMING THEORY;

SET THEORY;

EID: 28244480233     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-005-4876-5     Document Type: Conference Paper

References (23)

1. Aiken, A. Introduction to set constraint-based program analysis. Science of Computer Programming, 35 (1999) 79-111.
2. Aiken, A., Wimmers, E.L., and Lakshman, T.K. Soft typing with conditional types. In Proceeding of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '94), 1994, pp. 163-173.
3. Cormen, T.H., Leiserson, C.E., and Rivest, R.L. Introduction to Algorithms. MIT Press/McGraw-Hill, Cambridge, MA/New York, 1990.
4. Cousot, P. and Cousot, R. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1977, pp. 238-252.
5. Dybvig, R.K. Chez Scheme User's Guide. Cadence Research Systems, 1998.
6. Dybvig, R.K. and Hieb, R. A new approach to procedures with variable arity. Lisp and Symbolic Computation, 3 (1990) 229-244.
7. Dzeng, H. and Haynes, C.T. Type Reconstruction for variable-arity procedures. In Proceedings of the ACM Conference on Lisp and Functional Programming, 1994, pp. 239-249.
8. Findler, R.B., Clements, J., Flanagan, C., Flatt, M., Krishnamurthi, S., Steckler, P., and Felleisen, M. DrScheme: A progamming environment for scheme. Journal of Functional Programming, 12(2) (2002) 159-182.
9. Flanagan, C. MrSpidey: Static Debugger Manual. Rice University, 1995.
10. Flanagan, C. Effective static debugging via componential set-based analysis. PhD thesis, Rice University, 1997.
11. Flanagan, C. and Felleisen, M. Componential set-based analysis. ACM Trans. on Progmmming Languages and Systems, 21(2) (1999) 369-415.
12. Flatt, M. MzScheme: Language. Reference. Manual. Rice University. 2000, Version 103.
13. Heintze, N. Set based program analysis. PhD thesis, Carnegie-Mellon Univ., Pittsburgh, Pa, 1992.
14. Heintze, N. Set-based analysis of ML programs. In Proceedings of the 1994 ACM Conference on LISP and Functional Programming, 1994, pp. 306-317.
15. Heintze, N. and McAllester, D. Linear-time subtransitive control flow analysis. In Proceedings of the 1997 ACM Conference, on Programming Language Design and Implementation (PLDI '97), 1997a, pp. 261-272.
16. Heintze, N. and McAllester, D. On the cubic bottleneck in subtyping and flow analysis. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS '97), 1997b, pp. 342-351.
17. 5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1) (1998) 7-105.
18. McAllester, D. and Heintze, N. On the complexity of set-based analysis. In 1997 International Conference on Functional Programming, 1997.
19. Palsberg, J. Closure analysis in constraint form. Proceedings of the ACM Transactions on Programming Languages and Systems, 17(1) (1995) 47-62.
20. Palsberg, J. and Schwartzbach, M.I. Object-Oriented Type Systems, Wiley Professional Computing. Chichester, Wiley, 1994.
21. Sestoft, P. Replacing Function Parameters by Global Variables. Master's thesis, DIKU, University of Copenhagen, 1988.
22. Shivers, O. The semantics of Scheme control-flow analysis. In Proceedings of the 1991 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991, pp. 190-198.
23. Wand, M. and Williamson, G.B. A modular, extensible proof method for small-step flow analyses. In Programming Languages and Systems, 11th European Symposium on Programming, ESOP 2002, held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2002, Proceedings, D. Le Métayer (Ed.), vol. 2305 of Lecture Notes in Computer Science, 2002, pp. 213-227.