A symbolic constraint solving framework for analysis of logic programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A symbolic constraint solving framework for analysis of logic programs

Full text

Pdf (1.10 MB)

Source

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

La Jolla, California, United States

Pages: 12 - 23

Year of Publication: 1995

ISBN:0-89791-720-0

Authors

C. R. Ramakrishnan	Dept. of Computer Science, SUNY at Stony Brook, Stony Brook, NY
I. V. Ramakrishnan
R. C. Sekar	Bellcore, 445, South Street, Morristown, NJ

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 3, 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/215465.215467 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	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]
	2	Randal E. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys (CSUR), v.24 n.3, p.293-318, Sept. 1992 [doi>10.1145/136035.136043]
	3	Michael Codish , Bart Demoen, Analysing logic programs using “prop”-ositional logic programs and a magic wand, Proceedings of the 1993 international symposium on Logic programming, p.114-129, December 1993, Vancouver, British Columbia, Canada
	4	P. Codognet and G. File. Computations, abstractions and constraints. In International Conference on Computer Languages, pages 155-164. IEEE Press, 1992.
	5	Marc-Michel Corsini , Kaninda Musumbu , Antoine Rauzy , Baudouin Le Charlier, Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains, Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming, p.75-91, August 25-27, 1993
	6	Agostino Cortesi , Gilbert Filé, Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.52-61, June 17-19, 1991, New Haven, Connecticut, United States
	7	A. Cortesi, G. Fil~, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In IEEE Symbosium on Logic in Computer Science, pages 322-327. IEEE Press, 1991.
	8	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]
	9	Patrick Cousot , Rahida Cousot, Abstract interpretation and application to logic programs, Journal of Logic Programming, v.13 n.2-3, p.103-179, July 1992 [doi>10.1016/0743-1066(92)90030-7]
	10	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
	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	R. Giacobazzi, S. Debray, and G. Levy. A generalized semantics for constraint logic programs. In Internatzonal Conference on Fifth Generation Computing Systems, 1992.
	13	N. Heintze. Practical aspects of set based analysis. In Joint international Conference/Symposium on Logic Programming, pages 765-779. MIT Press, 1992.
	14	D. Jacobs and A. Langen. Accurate and efficient approximation of variable aliasing in logic programs. In North American Conference on Logic Programming, pages 154-165. MIT Press, 1989.
	15	J. Jaffar and M. Maher. Constraint logic programming: A survey. Journal of Logic Programming, pages 503- 582, 10th Anniversary Special Issue 1994.
	16	B. Le Charlier and P. Van Hentenryck. Reexecution in abstract interpretation of Prolog. In Joint International Con ference//Symposium on Logic Programming, pages 750-764. MIT Press, 1992.
	17	Baudouin Le Charlier , Pascal Van Hentenryck, Experimental evaluation of a generic abstract interpretation algorithm for PROLOG, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.1, p.35-101, Jan. 1994 [doi>10.1145/174625.174627]
	18	K. Marriot and H. Sondergaard. Notes for a tutorial on abstract interpretation of logic programs (unpublished). In North American Conference on Logic Programming, 1989.
	19	Kim Marriott , Harald Søndergaard, Bottom-up dataflow analysis of normal logic programs, Journal of Logic Programming, v.13 n.2-3, p.181-204, July 1992 [doi>10.1016/0743-1066(92)90031-W]
	20	K. Muthukumar , M. Hermenegildo, Compile-time derivation of variable dependency using abstract interpretation, Journal of Logic Programming, v.13 n.2-3, p.315-347, July 1992 [doi>10.1016/0743-1066(92)90035-2]
	21	R. Ramakrishnan. Magic Templates: A spellbinding approach to logic programming. In Joint International Con}erence/Symposiurn on Logic Programming, pages 140-159. MIT Press, 1988.
	22	T. Sato and H. Tamaki. Enumeration of success patterns in logic programs. Theoretical Computer Science, 34:227-240, 1984.
	23	B. Wegbreit. Property extraction in well founded property sets. IEEE Transactions on Software Engineering, SE-1(3):270-285, September 1975.

CITED BY 3

	R. Sekar , I. V. Ramakrishnan , P. Mishra, On the power and limitations of strictness analysis, Journal of the ACM (JACM), v.44 n.3, p.505-525, May 1997
	Steven Dawson , C. R. Ramakrishnan , David S. Warren, Practical program analysis using general purpose logic programming systems—a case study, ACM SIGPLAN Notices, v.31 n.5, p.117-126, May 1996
	R. Sekar , I. V. Ramakrishnan, Fast strictness analysis based on demand propagation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.6, p.896-937, Nov. 1995