Program analysis using mixed term and set constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1302 LNCS, Issue , 1997, Pages 114-126

  Fähndrich, Manuel ^a   Aiken, Alexander ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY;

ANALYSIS APPROACH; CONSTRAINT-BASED; DESIGN AND IMPLEMENTATIONS; EQUALITY CONSTRAINTS; EXTREME METHOD; PROGRAM ANALYSIS; SET CONSTRAINTS; UNCAUGHT EXCEPTIONS;

STATIC ANALYSIS;

EID: 85017248930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032737     Document Type: Conference Paper

References (36)

1. A. Aiken, D. Kozen, M. Vardi, and E. Wimmers. The complexity of set constraints. In E. Börger, Y. Gurevich, and K. Meinke, editors, Computer Science Logic '93, volume 832 of Lect. Notes in Comput. Sci., pages 1-17. Eur. Assoc. Comput. Sci. Logic, Springer, September 1993.
2. L. O. Andereen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. DKU report 94/19.
3. A. Aiken and E. Wimmers. Solving Systems of Set Constraints. In Symposium on Logic in Computer Science, pages 329-340, June 1992.
4. A. Aiken and E. Wimmers. Type Inclusion Constraints and Type Inference. In Proceedings of the 199S Conference on Functional Programming Languages and Computer Architecture, pages 31-41, Copenhagen, Denmark, June 1993.
5. A. Aiken, E. Wimmers, and T.K. Lakshman. Soft typing with conditional types. In Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 163-173, January 1994.
6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by contraction or approximation of fixed points. In Fourth Annual A CM Symposium on Principles of Programming Languages, pages 238-252, January 1977.
7. Manuel Fähndrich and Alex Aiken. Making set-constraint based program analyses scale. In First Workshop on Set Constraints at CP’96, Cambridge, MA, August 1996. Available as Technical Report CSD-TR-96-91T, University of California at Berkeley.
8. Cormac Flanagan and Matthias Felleisen. Componential set-based analysis. In PLDI’97 [PLD97]
9. Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi, Stephanie Weirich, and Matthias Felleisen. Catching Bugs in the Web of Program Invariants. In Proceedings of the 1996 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 23-32, May 1996.
10. Fuh and P. Mishra. Type inference with subtypes. In Proceedings of the 198S. European Symposium on Programming, pages 94-114, 1988.
11. Juan Carlos Guzmán and Ascánder Suarez. An extended type system for exceptions. In Proceedmos of the ACM SIGPLAN Workshop on ML and its Applications, pages 127-135, June 1994.
12. N. Heintze. Set Based Program Analysis PhD thesis, Carnegie Mellon University, 1992.
13. Nevin Heintze. Set Based Analysis of ML Programs. In Proceedings of the 1994 ACM Conference on LISP and Functional Programming, pages 306-17, June 1994.
14. Henglein. Efficient Type Inference for Higher-Order Binding-Time Analysis. In 5th ACM Conference Proceedings on Functional Programming Languages and Computer Architecture, pages 448-72, 1991.
15. F. Henglein. Global tagging optimization by type inference. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, pages 205-215, July 1992.
16. Nevin Heintze and David McAllester. Linear-time subtransitive control flow analysis
17. Proceedings of the International Conference on Functional Programming (ICFP '97), June 1997.
18. Pierre Jouvelot and David K. Giflbrd. Algebraic reconstruction of types and effects. In Proceedings of the 18th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 303-310, January 1991.
19. M. Lucassen and David K. Gifford. Polymorphic effect systems. In Proceedings of the 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 47-57, 1988.
20. John M. Lucassen. Types and Effects -Towards the Integration of Functional and Imperative Programming. Ph.D. thesis, MIT Laboratory for Computer Science, August 1987.
21. David McAllester and Nevin Heintze. On the complexity of set-based analysis. In ICFP’97 [ICF97], pages 150-63.
22. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
23. J. Mitchell. Coercion and type inference (summary). In Eleventh Annual ACM Symposium on Principles of Programming Languages, pages 175-185, January 1984.
24. Martin Miiller, Joachim Niehren, and Andreas Podelski. Inclusion constraints over non-empty sets of trees. In Proceedings of the Seventh International Joint Conference on the Theory and Practice of Software Development (TAPSOFT’97), April 1997.
25. Christian Mossin. Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, Department of Computer Science, University of Copenhagen, 1996.
26. D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymophic types. In Eleventh Annual ACM Symposium on Principles of Programming Languages, pages 165-174, January 1984.
27. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
28. Simon Marlow and Philip Wadler. A practical subtyping system for Erlang. In ICFP’97 [ICF97J].
29. Proceedings of the 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation, June 1997.
30. François Pottier. Simplifying subtyping constraints. In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming (ICFP '96), pages 122-133, January 1996.
31. Marc Shapiro and Susan Horwitz. Fast and accurate flow-insensitive points-to analysis. In Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 1-14, January 1997.
32. O. Shivers. Control flow analysis in Scheme. In Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 164-174, June 1988.
33. Bjarne Steensgaard. Points-to analysis in almost linear time. In Proceedings of the ZSrd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 32-41, January 1996.
34. Valery Trifonov and Scott Smith. Subtyping Constrained Types. In Proceedings of the 3rd International Static Analysis Symposium, pages 349-365, September 1996.
35. M. Tofte and J.-P. Talpin. Implementation of the typed call-by-value λ-calculus using a stack of regions. In Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 188-201, 1994.
36. Kwangkeun Yi. Compile-time detection of uncaught exceptions for Standard ML programs. In Proceedings of the 1st International Static Analysis Symposium, volume 864 of Lecture Notes in Computer Science. Springer, 1994.