Modular set-based analysis from contracts

ACM SIGPLAN Notices

Volumn 41, Issue 1, 2006, Pages 218-231

  Meunier, Philippe ^a   Findler, Robert Bruce ^b   Felleisen, Matthias ^a  

^a Northeastern University   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Modular Analysis; Runtime Contracts; Set based Analysis; Static Debugging

Indexed keywords

MODULAR ANALYSIS; RUNTIME CONTRACTS; SET-BASED ANALYSIS; STATIC DEBUGGING;

COMPUTER SYSTEMS; CONTRACTS; ERROR ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; PROGRAM DEBUGGING;

COMPUTER PROGRAMMING;

EID: 33745184702     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1111320.1111057     Document Type: Article

References (32)

1. Abadi, M., L. Cardelli, B. Pierce and G. Plotkin. Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems, 13(2):237-268, 1991.
2. Aiken, A. S. and M. Fähndrich. Making set-constraint based program analyses scale. Technical Report CSD-96-917, University of California, Berkeley, September 1996.
3. Amadio, R. M. and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, September 1993.
4. Bourdoncle, F. Abstract debugging of higher-order imperative languages. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 46-55, 1993.
5. Cartwright, R. and M. Fagan. Soft typing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 278-292, 1991.
6. Cousot, P. and R. Cousot. Modular static program analysis, invited paper. In Horspool, R., editor, Proceedings of the Eleventh International Conference on Compiler Construction (CC 2002), pages 159-178, Grenoble, France, April 6-14 2002. LNCS 2304, Springer, Berlin.
7. Detlefs, D. L., K. R. M. Leino, G. Nelson and J. B. Saxe. Extended static checking. Technical Report 159, Compaq SRC Research Report, 1998.
8. Findler, R. B. and M. Felleisen. Contracts for higher-order functions. In ACM SIGPLAN International Conference on Functional Programming, 2002.
9. Flanagan, C. Hybrid type checking. In Proceedings of the symposium on Principles of Programming Languages, 2006. In this volume.
10. Flanagan, C. and M. Felleisen. Componential set-based analysis. ACM Trans. on Programming Languages and Systems, 21(2):369-415, Feb. 1999.
11. Flanagan, C., M. Flatt, S. Krishnamurthi, S. Weirich and M. Felleisen. Catching bugs in the web of program invariants. ACM SIGPLAN Notices, 31(5):23-32, 1996.
12. Flatt, M. Composable and compilable macros: You want it when? In ACM SIGPLAN International Conference on Functional Programming, 2002.
13. Flatt, M., R. B. Findler, S. Krishnamurthi and M. Felleisen. Programming languages as operating systems (or revenge of the son of the Lisp machine). In ACM SIGPLAN International Conference on Functional Programming, pages 138-147, September 1999.
14. Foster, J. S., M. Fähndrich and A. Aiken. A theory of type qualifiers. In PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, pages 192-203, New York, NY, USA, 1999. ACM Press.
15. Haack, C. and J. B. Wells. Type error slicing in implicitly typed higher-order languages. Sci. Comput. Programming, 50:189-224, 2004.
16. Heintze, N. Set-based analysis of ml programs. In LFP '94: Proceedings of the 1994 ACM conference on LISP and functional programming, pages 306-317, New York, NY, USA, 1994. ACM Press.
17. Henglein, F. Dynamic typing. In Proceedings of the 4th European Symposium on Programming, pages 233-253, London, UK, 1992. Springer-Verlag.
18. Hosoya, H., J. Vouillon and B. C. Pierce. Regular expression types for xml. In Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, pages 11-22. ACM Press, 2000.
19. Leroy, X., D. Doligez, J. Garrigue, D. Rémy and J. Vouillon. The Objective Caml system - documentation and user's manual, 2005.
20. MacQueen, D. B. Modules for Standard ML. In Proceedings of the 1984 ACM Conference on LISP and Functional Programming, pages 198-207, New York, 1984. ACM Press.
21. Meunier, P., R. B. Findler, P. A. Steckler and M. Wand. Selectors make set-based analysis too hard. Higher Order and Symbolic Computation, 2005. To appear.
22. Milner, R., M. Tofte, R. Harper and D. Macqueen. The Definition of Standard ML - Revised. MIT Press, Cambridge, MA, USA, 1997.
23. Palsberg, J. Closure analysis in constraint form. Proc. ACM Trans. on Programming Languages and Systems, 17(1):47-62, Jan. 1995.
24. Palsberg, J. and C. Pavlopoulou. From polyvariant flow information to intersection and union types. In Conference Record of POPL 98: The 25TH ACM SIGPLAN-SIGACT Symposium, on Principles of Programming Languages, San Diego, California, pages 197-208, New York, NY, 1998.
25. Palsberg, J. and M. I. Schwartzbach. Object-Oriented Type Systems. Wiley Professional Computing. Wiley, Chichester, 1994.
26. Probst, C. W. Modular control flow analysis for libraries. In SAS '02: Proceedings of the 9th International Symposium on Static Analysis, pages 165-179, London, UK, 2002. Springer-Verlag.
27. Shivers, O. The semantics of Scheme control-flow analysis. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, volume 26(9), pages 190-198, New Haven, CN, June 1991.
28. Tang, Y. M. and P. Jouvelot. Separate abstract interpretation for control-flow analysis. In Hagiya, M. and J. C. Mitchell, editors, Theoretical Aspects of Computer Software, pages 224-243. Springer, Berlin, Heidelberg, 1994.
29. Wand, M. Finding the source of type errors. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 38-43, 1986.
30. Wand, M. and G. B. Williamson. A modular, extensible proof method for small-step flow analyses. In Métayer, D. L., editor, Programming Languages and Systems, 11th European Symposium on Programming, ESOP 2002, Grenoble, France, April 8-12, 2002, Proceedings, volume 2305 of Lecture Notes in Computer Science, pages 213-227, Berlin, 2002. Springer-Verlag.
31. Wells, J. B., A. Dimock, R. Muller and F. Turbak. A calculus with polymorphic and polyvariant flow types. J. Funct. Programming, 12(3): 183-227, May 2002.
32. Wright, A. K. and S. Jagannathan. Polymorphic splitting: an effective polyvariant flow analysis. ACM Trans. Program. Lang. Syst., 20(1): 166-207, 1998.