Type-based analysis of uncaught exceptions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Type-based analysis of uncaught exceptions

Full text

Pdf (1.92 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

San Antonio, Texas, United States

Pages: 276 - 290

Year of Publication: 1999

ISBN:1-58113-095-3

Authors

François Pessaux	INRIA Rocquencourt, projet Cristal, B.P. 105, 78153 Le Chesnay, France
Xavier Leroy	INRIA Rocquencourt, projet Cristal, B.P. 105, 78153 Le Chesnay, France

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 26, Citation Count: 15

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/292540.292565 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Henry G. Baker, Unify and conquer, Proceedings of the 1990 ACM conference on LISP and functional programming, p.218-226, June 27-29, 1990, Nice, France [doi>10.1145/91556.91652]
	2	Manuel Fahndrich , Alex Aiken, Making Set-Constraint Program Analyses Scale, University of California at Berkeley, Berkeley, CA, 1996
	3	Manuel Fähndrich , Alexander Aiken, Program Analysis Using Mixed Term and Set Constraints, Proceedings of the 4th International Symposium on Static Analysis, p.114-126, September 08-10, 1997
	4	Manuel Fahndrich , Jeffrey Foster , Jason Cu , Alexander Aiken, Tracking down Exceptions in Standard ML Programs, University of California at Berkeley, Berkeley, CA, 1998
	5	Manuel Fähndrich , Jeffrey S. Foster , Zhendong Su , Alexander Aiken, Partial online cycle elimination in inclusion constraint graphs, Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, p.85-96, June 17-19, 1998, Montreal, Quebec, Canada
	6	Cormac Flanagan , Matthias Felleisen, Componential set-based analysis, Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, p.235-248, June 16-18, 1997, Las Vegas, Nevada, United States
	7	Tim Freeman , Frank Pfenning, Refinement types for ML, Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, p.268-277, June 24-28, 1991, Toronto, Ontario, Canada
	8	J. C. Guzmdn and A. Sudrez. A type system for exceptions. In Proc. 199t workshop on ML and its applications, pages 127-135. Research report 2265, INRIA, 1994.
	9	Nevin Heintze, Set-based analysis of ML programs, Proceedings of the 1994 ACM conference on LISP and functional programming, p.306-317, June 27-29, 1994, Orlando, Florida, United States
	10	Fritz Henglein, Global tagging optimization by type inference, Proceedings of the 1992 ACM conference on LISP and functional programming, p.205-215, June 22-24, 1992, San Francisco, California, United States
	11	Fritz Henglein, Type inference with polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.253-289, April 1993 [doi>10.1145/169701.169692]
	12	Andrew K. Wright , Suresh Jagannathan, Polymorphic splitting: an effective polyvariant flow analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.1, p.166-207, Jan. 1998 [doi>10.1145/271510.271523]
	13	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, Type reconstruction in the presence of polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.290-311, April 1993 [doi>10.1145/169701.169687]
	14	X. Leroy and F. Pessaux. Type-based analysis of uncaught exceptions. Research report 3541, INRIA, Nov. 1998. Extended version of this paper.
	15	X. Leroy, J. Vouillon, D. Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/ocaml/, 1996.
	16	J. M. Lucassen , D. K. Gifford, Polymorphic effect systems, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.47-57, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73564]
	17	Alan Mycroft, Polymorphic Type Schemes and Recursive Definitions, Proceedings of the 6th Colloquium on International Symposium on Programming, p.217-228, April 17-19, 1984
	18	Atsushi Ohori, A polymorphic record calculus and its compilation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.6, p.844-895, Nov. 1995 [doi>10.1145/218570.218572]
	19	François Pottier, A framework for type inference with subtyping, Proceedings of the third ACM SIGPLAN international conference on Functional programming, p.228-238, September 26-29, 1998, Baltimore, Maryland, United States
	20	F. Pottier. Type inference in the presence of subtyping: from theory to practice. Research report 3483, INRIA, Sept. 1998.
	21	D. Rémy, Type checking records and variants in a natural extension of ML, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.77-88, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75284]
	22	D. R~my. Syntactic theories and the algebra of record terms. Research report 1869, INRIA, 1993.
	23	D. R@my. Type inference for records in a natural extension of ML. In C. A. Gunter and J. C. Mitchell, editors, Theoretical Aspects of Object-Oriented Programming. MIT Press, 1993.
	24	Didier Rémy , Jérôme Vouillon, Objective ML: a simple object-oriented extension of ML, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.40-53, January 15-17, 1997, Paris, France [doi>10.1145/263699.263707]
	25	Zhong Shao , Andrew W. Appel, Smartest recompilation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.439-450, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158702]
	26	Olin Grigsby Shivers, Control-flow analysis of higher-order languages of taming lambda, Carnegie Mellon University, Pittsburgh, PA, 1991
	27	Bjarne Steensgaard, Points-to analysis in almost linear time, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.32-41, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237727]
	28	Jean-Pierre Talpin , Pierre Jouvelot, The type and effect discipline, Information and Computation, v.111 n.2, p.245-296, June 1994 [doi>10.1006/inco.1994.1046]
	29	Mads Tofte , Lars Birkedal, A region inference algorithm, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.4, p.724-767, July 1998 [doi>10.1145/291891.291894]
	30	Mads Tofte , Jean-Pierre Talpin, Region-based memory management, Information and Computation, v.132 n.2, p.109-176, Feb. 1, 1997 [doi>10.1006/inco.1996.2613]
	31	M. Wand. Complete type inference for simple objects. In Logic in Computer Science 1987, pages 37-44. IEEE Computer Society Press, 1987.
	32	Andrew K. Wright, Simple imperative polymorphism, Lisp and Symbolic Computation, v.8 n.4, p.343-355, Dec. 1995 [doi>10.1007/BF01018828]
	33	Andrew K. Wright , Robert Cartwright, A practical soft type system for scheme, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.1, p.87-152, Jan. 1997 [doi>10.1145/239912.239917]
	34	Andrew K. Wright , Matthias Felleisen, A syntactic approach to type soundness, Information and Computation, v.115 n.1, p.38-94, Nov. 15, 1994 [doi>10.1006/inco.1994.1093]
	35	Kwangkeun Yi, An abstract interpretation for estimating uncaught exceptions in standard ML programs, Science of Computer Programming, v.31 n.1, p.147-173, May 1998 [doi>10.1016/S0167-6423(96)00044-5]
	36	Kwangkeun Yi , Sukyoung Ryu, Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs, Proceedings of the 4th International Symposium on Static Analysis, p.98-113, September 08-10, 1997

CITED BY 15

	Atsushi Igarashi , Naoki Kobayashi, A generic type system for the Pi-calculus, ACM SIGPLAN Notices, v.36 n.3, p.128-141, March 2001
	Michael Hanus , Frank Steiner, Type-based nondeterminism checking in functional logic programs, Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.202-213, September 20-23, 2000, Montreal, Quebec, Canada
	Martin P. Robillard , Gail C. Murphy, Static analysis to support the evolution of exception structure in object-oriented systems, ACM Transactions on Software Engineering and Methodology (TOSEM), v.12 n.2, p.191-221, April 2003
	Atsushi Igarashi , Naoki Kobayashi, A generic type system for the Pi-calculus, Theoretical Computer Science, v.311 n.1-3, p.121-163, 23 January 2004
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Jang-Wu Jo , Byeong-Mo Chang , Kwangkeun Yi , Kwang-Moo Choe, An uncaught exception analysis for Java, Journal of Systems and Software, v.72 n.1, p.59-69, June 2004
	Futoshi Iwama , Atsushi Igarashi , Naoki Kobayashi, Resource usage analysis for a functional language with exceptions, Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 09-10, 2006, Charleston, South Carolina
	Marko van Dooren , Eric Steegmans, Combining the robustness of checked exceptions with the flexibility of unchecked exceptions using anchored exception declarations, ACM SIGPLAN Notices, v.40 n.10, October 2005
	Kevin Glynn , Peter J. Stuckey , Martin Sulzmann , Harald Søndergaard, Exception analysis for non-strict languages, ACM SIGPLAN Notices, v.37 n.9, p.98-109, September 2002
	Shujuan Jiang , Baowen Xu , Liang Shi, An approach to analyzing recursive programs with exception handling constructs, ACM SIGPLAN Notices, v.41 n.4, April 2006
	Nick Benton , Peter Buchlovsky, Semantics of an effect analysis for exceptions, Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation, January 16-16, 2007, Nice, Nice, France
	Isil Dillig , Thomas Dillig , Alex Aiken, Static error detection using semantic inconsistency inference, ACM SIGPLAN Notices, v.42 n.6, June 2007
	Matthew Fluet , Riccardo Pucella, Phantom types and subtyping, Journal of Functional Programming, v.16 n.6, p.751-791, November 2006
	Manuel Serrano, Bee: an integrated development environment for the Scheme programming language, Journal of Functional Programming, v.10 n.4, p.353-395, July 2000
	Cristina David , Cristian Gherghina , Wei-Ngan Chin, Translation and optimization for a core calculus with exceptions, Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation, January 19-20, 2009, Savannah, GA, USA