Abstract interpretation of logic programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis

Full text

Pdf (1.02 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

New Haven, Connecticut, United States

Pages: 52 - 61

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Agostino Cortesi	Dept. of Mathematics, University of Padova, Via Belzoni 7, I-35131 Padova, Italy
Gilbert Filé	Dept. of Mathematics, University of Padova, Via Belzoni 7, I-35131 Padova, Italy

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/115865.115872 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.

	Apt 87	Apt K.: Introduction to Logic Programming. Research Report CWI R8741, Amsterdam, 1987.
	Bruy 88	Maurice Bruynooghe, A practical framework for the abstract interpretation of logic programs, Journal of Logic Programming, v.10 n.2, p.91-124, Feb. 1991 [doi>10.1016/0743-1066(91)80001-T]
	CCou 77	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]
	CDDe 85	Chang J.H., Despain A.M., DeGroot D.: AND-parallelism of logic programs based on static data dependency analysis. In Digest of papers of COMPCON, 1985.
	ChDe 85	Chang J.H., Despain A.M." Semi intelligent backtracking of Prolog based on static data dependency analysis. Proe 2nd SLP, Boston, 1985.
	Codo 90	Christian Codognet , Philippe Codognet , Marc-Michel Corsini, Abstract interpretation for concurrent logic languages, Proceedings of the 1990 North American conference on Logic programming, p.215-232, January 1990, Austin, Texas, United States
	CFil 91	Cortesi A., Fil~ G.: Abstract Interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis. Research Report n.4/91. Dip. di Matemattea Universita' di Padova. 1991.
	CFWi 91	Cortesi A., Fil~ G., Winsborough W.: Prop revisited: propositional formulas as abstract domain for groundness analysis. To appear in Proc. LICS'91. Amsterdam. 1991.
	CFWi 91b	Cortesi A., Fil~ G., Winsborough W." Equivalence of abstract domains for groundness analysis. Research Report n.8/91. Dip. di Matematica Universita' di Padova. 1991.
	CoFi 88	Corsini M.M., Fil~ G.: A complete framework for the abstracl interpretation of logic programs: theory and application. Research Report n.3/88. Dipartimento di Matematica Universita' di Padova. 1988.
	CoFM 90	Codish M., Falaschi M., Mariott K.: Suspension Analysis for Concurrent Logic Programs. Research Report- University of Pisa, 1990.
	Debr 89	Saumya K. Debray, Static inference of modes and data dependencies in logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.3, p.418-450, July 1989 [doi>10.1145/65979.65983]
	DeWa 88	Saumya K. Debray , David S. Warren, Automatic mode inference for logic programs, Journal of Logic Programming, v.5 n.3, p.207-229, Sept. 1988 [doi>10.1016/0743-1066(88)90010-6]
	HerR 89	Hermenegildo M., Rossi F." On the correctness of independent AND-parallelism in logzc programs. In Proc. MCC, Austin, Texas, 1989.
	JaLa 89	jacobs D, Langen A.: Accurate and efficient approximation of variable aliasing in logic programs. In Proc. NACLP'89, Cleveland, 1989.
	JoMy 86	Neil D. Jones , Alan Mycroft, Data flow analysis of applicative programs using minimal function graphs, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.296-306, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512672]
	JoSøn 87	Jones N., S~ndergaard H.: A semantic based framework for the abstract interpretation of Pro.. log. In "Abstract Interpretation of Declaratiw~ Languages" ed. S.Abramsky and C.Hankin. Ellis Horwood. 1987
	KaKa 90	Kanamori T., Kawamura T." Abstract in.. terpretation based on OLDT resolution. ICOT T.R. 1990.
	Llo 87	J. W. Lloyd, Foundations of logic programming, Springer-Verlag New York, Inc., New York, NY, 1984
	MaSøn 89	Marriott K., S~ndergaard H.: Notes for a tutorial on Abstract Interpretation of logic pro-. grams. NACLP'89. Cleveland 1989.
	MaSøn 90	Kim Marriott , Harald Søndergaard, Analysis of constraint logic programs, Proceedings of the 1990 North American conference on Logic programming, p.531-547, January 1990, Austin, Texas, United States
	Mell 81	Mellish C.S.: The automatic generation of mode declarations for Prolog programs. In Proc. Workshop on Logic Prog. for Intel. Systems. Los Angeles. 1981.
	MuHe 91	Muthukumar K., Hermenegildo M.: Combined determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In Proe. ICLP '91. Paris. 1991.
	PetPr 89	Pettorossi A., Proietti M.: Decidability results and characterization of strategies for the development of logic programs. In Proc. ICLP'89, Lisboa (Portugal), 1989.
	Sønd 89	Sendergaard H.: Semantics based analysis and transformation of logic programs. P hD Thesis, University of Copenhagen, Denmark, 1989.
	Tayl 89	Taylor A.: Removal of dereferencing and trailing in Prolog compilation. In Proc. ICLP'89, Lisboa (Portugal), 1989.
	Wins 90	Will Winsborough, Multiple specialization using minimal-function graph semantics, Journal of Logic Programming, v.13 n.2-3, p.259-290, July 1992 [doi>10.1016/0743-1066(92)90033-Y]

CITED BY 3

	C. R. Ramakrishnan , I. V. Ramakrishnan , R. C. Sekar, A symbolic constraint solving framework for analysis of logic programs, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.12-23, June 21-23, 1995, La Jolla, California, United States
	Roberto Barbuti , Roberto Giacobazzi , Giorgio Levi, A general framework for semantics-based bottom-up abstract interpretation of logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.1, p.133-181, Jan. 1993
	Baudouin Le Charlier , Sabina Rossi , Pascal Van Hentenryck, Sequence-based abstract interpretation of Prolog, Theory and Practice of Logic Programming, v.2 n.1, p.25-84, January 2002