Nevin Heintze, et al.  Home/Search
Context Related
| cmu.edu/afs/cs/user...fptabstract.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uchicago.edu/~s...rogramanalysis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Nevin Heintze Joxan Jaffar School of Computer Science IBM T.J. Watson Research Center Carnegie Mellon University PO Box 218 Pittsburgh, PA 15213 Yorktown Heights, NY 10598 Summary The notion of cartesian closure on a set of unifiers has been used to define approximations of the least models of logic programs. Such approximations, often called types, are not known to be recursive. In this paper, we use cartesian closure to define a similar, but more accurate, approximation. The main result... (Update)
Cited by: More
Regular Trees as an Abstract Domain for Program Specialisation - Gallagher, Peralta (2000) (Correct)
Inference of Well-typings for Logic Programs with.. - Bruynooghe.. (2005) (Correct)
Polymorphically Typed Logic Programs - Yardeni, Fruehwirth, Shapiro (1991) (Correct)
Similar documents (at the sentence level):
15.5%: A Finite Presentation Theorem for Approximating Logic Programs - Heintze, Jaffar (1990) (Correct)
Active bibliography (related documents): More All
0.1: Set Constraints: a Pearl in Research on Constraints - Pacholski, Podelski (1997) (Correct)
0.0: Practical Aspects of Set Based Analysis - Heintze (1992) (Correct)
0.0: Set-Based Program Analysis (Extended Abstract) - Heintze, Jaffar (1991) (Correct)
Similar documents based on text: More All
0.2: A Framework for Combining Analysis and Verification - Heintze, Jaffar, Voicu (2000) (Correct)
0.1: A General Framework for Program Reasoning - Heintze, Jaffar, Voicu (Correct)
0.1: Term Schematazations and Their Applications - CADE 13 Workshop - Uribe (1996) (Correct)
Related documents from co-citation: More All
46: Towards a theory of types in Prolog (context) - Mishra - 1984
41: Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981
40: Set Based Program Analysis - Heintze - 1992
BibTeX entry: (Update)
N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197--209, January 1990. http://citeseer.ist.psu.edu/article/heintze90finite.html More
@inproceedings{ heintze90finite,
author = "Nevin Heintze and Joxan Jaffar",
title = "{A Finite Presentation Theorem for Approximating Logic Programs (Extended Abstract)}",
booktitle = "{Seventeenth Annual {ACM} Symposium onn Principles of Programming Languages}",
publisher = "ACM Press, New York",
address = "San Francisco, California, January 17--19",
pages = "197--209",
year = "1990",
url = "citeseer.ist.psu.edu/article/heintze90finite.html" }
Citations (may not include all citations):241 Decidability of Second-order Theories and Automata on Infini.. (context) - Rabin - 1969
207 Flow Analysis and Optimization of LISP-like Structures (context) - Jones, Muchnick - 1979 ACM DBLP
108 A Practical Framework for the Abstract Interpretation of Log.. (context) - Bruynooghe - 1987 ACM DBLP
94 A Finite Presentation Theorem for Approximating Logic Progra.. - Heintze, Jaffar - 1989 ACM DBLP
91 Toward a Theory of Types in PROLOG (context) - Mishra - 1984
66 Declaration-free Type Checking (context) - Mishra, Reddy - 1985 ACM DBLP
63 Automatic Computation of Data Set Definitions (context) - Reynolds - 1969 DBLP
49 A Type System for Logic Programs (context) - Yardeni, Shapiro - 1987 ACM DBLP
36 An Instance of Abstract Interpretation integrating Type and .. (context) - Bruynooghe, Janssens - 1988
27 A Decision Procedure for a Class of Herbrand Set Constraints (context) - Heintze, Jaffar - 1989
1 Regular Prefix Relations (context) - Angluin, Hoover - 1984 DBLP
1 Complexity of Flow Analysis, Inductive Assertion Synthesis, .. (context) - Jones, Muchnick - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uchicago.edu/~sagiv/courses/program-analysis.html): More
Data Flow Frequency Analysis - Ramalingam (1996) (Correct)
Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting - Deutsch (1994) (Correct)
A Type-Directed Optimizing Compiler for ML - Guanshan Tong (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC