Formal language, grammar and set-constraint-based program analysis by abstract interpretation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Formal language, grammar and set-constraint-based program analysis by abstract interpretation

Full text

Pdf (1.22 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the seventh international conference on Functional programming languages and computer architecture table of contents

La Jolla, California, United States

Pages: 170 - 181

Year of Publication: 1995

ISBN:0-89791-719-7

Authors

Patrick Cousot	LIX, CNRS & ÉÉcole Polytechnique, 91140 Palaiseau cedex, France
Radhia Cousot

Sponsors

IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 51, Citation Count: 25

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/224164.224199 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	Alexander Aiken , Brian R. Murphy, Implementing regular tree expressions, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.427-447, June 1991, Cambridge, Massachusetts, United States
	2	Alex Aiken , Brian Murphy, Static type inference in a dynamically typed language, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.279-290, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99621]
	3	A. Aiken & E. L. Wimmers. Solving systems of set constraints (extended abstract). In Proc. ?th IEEE LICS'92, 329-340, 1992.
	4	F. Bourdoncle. Abstract interpretation by dynamic partitioning. J. Func. Prog., 2(4), 1992.
	5	Patrick Cousot , Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.238-252, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512973]
	6	Patrick Cousot , Radhia Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.269-282, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567778]
	7	P. Cousot & R. Cousot. Abstract interpretation frameworks. J. Logic and Comp., 2(4):511-547, 1992.
	8	Patrick Cousot , Radhia Cousot, Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation, Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming, p.269-295, August 26-28, 1992
	9	P. Cousot & R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages). In Proc. 199~i IEEE ICCL, 95-112, 1994.
	10	Patrick Cousot , Radhia Cousot, Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-Theoretic Form, Proceedings of the 7th International Conference on Computer Aided Verification, p.293-308, July 03-05, 1995
	11	Patrick Cousot , Nicolas Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.84-96, January 23-25, 1978, Tucson, Arizona [doi>10.1145/512760.512770]
	12	Alain Deutsch, An Operational Model of Strictness Properties and Its Abstractions (Extended Abstract), Proceedings of the 1991 Glasgow Workshop on Functional Programming, p.82-99, August 12-14, 1991
	13	A. Deutsch. A storeless model of aliasing and its abstraction using finite representations of right-regular equivalence relations. In Proc. 1992 IEEE ICCL, 2- 13, 1992.
	14	Alain Deutsch, Interprocedural may-alias analysis for pointers: beyond k-limiting, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.230-241, June 20-24, 1994, Orlando, Florida, United States
	15	Philippe Granger, Static analysis of linear congruence equalities among variables of a program, Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1, p.169-192, April 1991, Brighton, United Kingdom
	16	N. Heintze. Practical aspects of set based analysis. In Proc. Joint Int. Con/. and Syrup. on Logic Programming, 765-779. MIT Press, 1992.
	17	Nevin Charles Heintze, Set based program analysis, Carnegie Mellon University, Pittsburgh, PA, 1992
	18	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
	19	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
	20	Nevin Heintze , Joxan Jaffar, A finite presentation theorem for approximating logic programs, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.197-209, December 1989, San Francisco, California, United States [doi>10.1145/96709.96729]
	21	N. Heintze & J. Jaffar. An engine for logic program analysis. In Proc. 7th IEEE LICS'9~, 318-328, 1992.
	22	N. D. Jones. Flow analysis of lazy higher-order functional programs. In S. Abramsky & C. Hankin, eds., Abstract Interpretation of Declarative Languages, 103- 122. Ellis Horwood, 1987.
	23	Neil D. Jones , Steven S. Muchnick, Flow analysis and optimization of LISP-like structures, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.244-256, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567776]
	24	Neil D. Jones , Steven S. Muchnick, A flexible approach to interprocedural data flow analysis and programs with recursive data structures, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.66-74, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582161]
	25	M. Karr. Affine relationships among variables of a program. Acta In/., 6:133-151, 1976.
	26	B. Le Charlier & P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. In Proc. 1992 IEEE ICCL, 137-146, 1992.
	27	Prateek Mishra , Uday S. Reddy, Declaration-free type checking, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.7-21, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318603]
	28	Jens Palsberg, Flobal Program Analysis in Constraint Form, Proceedings of the 19th International Colloquium on Trees in Algebra and Programming, p.276-290, April 11-13, 1994
	29	J. Reynolds. Automatic computation of data set definitions. In In/ormation Processing'68, 456-461. North Holland, 1969.
	30	Morten Heine Sørensen, Grammar-Based Data-Flow Analysis to Stop Deforestation, Proceedings of the 19th International Colloquium on Trees in Algebra and Programming, p.335-351, April 11-13, 1994

CITED BY 25

	Christopher Colby , Peter Lee, Trace-based program analysis, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.195-207, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Kirsten L. Solberg Gasser , Flemming Nielson , Hanne Riis Nielson, Systematic realisation of control flow analyses for CML, ACM SIGPLAN Notices, v.32 n.8, p.38-51, Aug. 1997
	Alain Deutsch, Semantic models and abstract interpretation techniques for inductive data structures and pointers, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.226-229, June 21-23, 1995, La Jolla, California, United States
	John P. Gallagher , Julio C. Peralta, Using regular approximations for generalisation during partial evalution, ACM SIGPLAN Notices, v.34 n.11, p.44-51, Nov. 1999
	Hanne Riis Nielson , Flemming Nielson, Shape analysis for mobile ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.142-154, January 19-21, 2000, Boston, MA, USA
	Patrick Cousot, Program analysis: the abstract interpretation perspective, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996
	Frédéric Besson , Thomas de Grenier de Latour , Thomas Jensen, Secure calling contexts for stack inspection, Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.76-87, October 06-08, 2002, Pittsburgh, PA, USA
	Byeong-Mo Chang, Managing the granularity of constraint-based analyses by rule transformation, Information Processing Letters, v.83 n.2, p.79-88, 31 July 2002
	Robert Cartwright , Matthias Felleisen, Program verification through soft typing, ACM Computing Surveys (CSUR), v.28 n.2, p.349-351, June 1996
	Cormac Flanagan , Matthias Felleisen, Componential set-based analysis, ACM SIGPLAN Notices, v.32 n.5, p.235-248, May 1997
	Flemming Nielson , Hanne Riis Nielson, Infinitary control flow analysis: a collecting semantics for closure analysis, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.332-345, January 15-17, 1997, Paris, France
	Thomas Jensen, Types in program analysis, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Lunjin Lu, Path Dependent Analysis of Logic Programs, Higher-Order and Symbolic Computation, v.16 n.4, p.341-377, December 2003
	Roberto Bagnara , Roberta Gori , Patricia M. Hill , Enea Zaffanella, Finite-tree analysis for constraint logic-based languages, Information and Computation, v.193 n.2, p.84-116, 15 September 2004
	Cormac Flanagan , Matthias Felleisen, Componential set-based analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.2, p.370-416, March 1999
	Patrick Cousot, Types as abstract interpretations, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.316-331, January 15-17, 1997, Paris, France
	Yanhong A. Liu , Scott D. Stoller, Eliminating dead code on recursive data, Science of Computer Programming, v.47 n.2-3, p.221-242, May 2003
	John P. Gallagher , Julio C. Peralta, Regular Tree Languages as an Abstract Domain in Program Specialisation, Higher-Order and Symbolic Computation, v.14 n.2-3, p.143-172, September 2001
	Byeong-Mo Chang , Jangwu Jo, Granularity of constraint-based analysis for Java, Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.94-102, September 05-07, 2001, Florence, Italy
	Marc Éluard , Thomas Jensen, Secure object flow analysis for java card, Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference, p.11-11, November 21-22, 2002, San Jose, CA
	Frédéric Besson , Thomas De Grenier DeLatour , Thomas Jensen, Interfaces for stack inspection, Journal of Functional Programming, v.15 n.2, p.179-217, March 2005
	C. Flanagan , Mattias Felleisen, The semantics of future and an application, Journal of Functional Programming, v.9 n.1, p.1-31, January 1999
	Daniel Damian , Olivier Danvy, Syntactic accidents in program analysis: on the impact of the CPS transformation, Journal of Functional Programming, v.13 n.5, p.867-904, September 2003
	Pawel S. Pietrzak , Jesús Correas Fernández , Germán Puebla , Manuel V. Hermenegildo, A practical type analysis for verification of modular prolog programs, Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 07-08, 2008, San Francisco, California, USA
	Lunjin Lu, Improving precision of type analysis using non-discriminative union, Theory and Practice of Logic Programming, v.8 n.1, p.33-79, January 2008