The DOI matches its Crossref record.
Deriving descriptions of possible values of program variables by means of abstract interpretation
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Very few abstract interpretations of logic programs use infinite domains of infinite height, and to the authors' knowledge all of them have some a priori limitation of precision, at least in practice.
“Very few abstract interpretations of logic programs use infinite domains of infinite height (some notable exceptions are Bruynooghe [1991], Janssens and Bruynooghe [1992], and Heintze [1992]), and to our knowledge all of them have some a priori limitation of the precision, at least in practice.”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Janssens and Bruynooghe [1992]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 24
- Bansal, 1988, An Abstract Interpretation Scheme for Logic Programs Based on Type Expression, Proceedings of the International Conference on Fifth Generation Computer Systems, 422
- Bruynooghe, 1991, A Practical Framework for the Abstract Interpretation of Logic Programs, J. Logic Programming, 10, 91, 10.1016/0743-1066(91)80001-T · DOI · Paper page
- Bruynooghe, 1988, An Instance of Abstract Interpretation Integrating Type and Mode Inferencing, Proceedings of the 5th International Conference and Symposium on Logic Programming, 669
- Bruynooghe, 1987, Abstract Interpretation: Towards the Global Optimization of Prolog Programs, Proceedings of the 4th Symposium on Logic Programming, 192
- Debray, 1986, Automatic Mode Inference for Prolog Programs, Proceedings of the 3rd Symposium on Logic Programming, 78
- Hanus, 1989, Polymorphic Higher-Order Programming in Prolog, Proceedings of the 6th International Conference on Logic Programming, 382
- Jacobs, 1989, Accurate and Efficient Approximation of Variable Aliasing in Logic Programs, North American Conference on Logic Programming, 154
- Kanamori, 1985, Type Inference in Prolog and Its Application, Proceedings of the 9th International Joint Conference on Artificial Intelligence, 704
- Kanamori, 1987, Analyzing Success Patterns of Logic Programs by Abstract Hybrid Interpretation, ICOT Technical Report TR 279
- Kluzniak, 1987, Type Synthesis for Ground Prolog, Proceedings of the 4th International Conference on Logic Programming, 788
- Manilla, 1987, Flow Analysis of Prolog Programs, Proceedings of the 4th Symposium on Logic Programming, 205
- Manna, 1970, On the Termination of Markov Algorithms, Proceedings of the 3rd Hawaii International Conference on Systems Science, 789
- Mariën, 1989, The Impact of Abstract Interpretation on Code Generation: An Experiment in Efficiency, Proceedings of the 6th International Conference on Logic Programming, 33
- Mishra, 1984, Towards a Theory of Types in Prolog, Proceedings of the 1st Symposium on Logic Programming, 289
- Mulkers, 1990, Analysis of Shared Data Structures for Compile-Time Garbage Collection in Logic Programs, Proceedings of the 7th International Conference on Logic Programming, 747
- Muthukumar, 1989, Determination of Variable Dependence Information at Compile Time through Abstract Interpretation, North American Conference on Logic Programming, 166
- Mycroft, 1984, A Polymorphic Type System for Prolog, Artif. Intell., 23, 295, 10.1016/0004-3702(84)90017-1 · DOI
- Somogyi, 1987, A System of Precise Modes for Logic Programs, Proceedings of the 4th International Conference on Logic Programming, 769
- Sondergaard, 1986, An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction, Proceedings of the European Symposium on Programming, 327
- Warren, 1988, On the Practicality of Global Flow Analysis of Logic Programs, Proceedings of the 5th International Conference and Symposium on Logic Programming, 684
- Winsborough, 1989, Path-Dependent Reachability Analysis for Multiple Specialization, North American Conference on Logic Programming, 133
- Winsborough, 1988, And-Parallelism in the Presence of Shared Free Variables, Proceedings of the 5th International Conference and Symposium on Logic Programming, 749
- Xu, 1988, A Type Inference System for Prolog, Proceedings of the 5th International Conference and Symposium on Logic Programming, 604
- Zobel, 1987, Derivation of Polymorphic Types for Prolog Programs, Proceedings of the 4th International Conference on Logic Programming, 817
Cited by
Sorted by citations
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
Metadata
- Authors
- Janssens, G., & Bruynooghe, M.
- Affiliations
- KU Leuven (BE)
- Corresponding author
- Janssens, G.
- ORCID
- Bruynooghe, M.
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1992-07
- Volume
- 13
- Issue
- 2-3
- Pages
- 205-258
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W2069076448
- Cited by
- 149
- References
- 0
- Citations by year
- 2024: 1 · 2017: 1 · 2015: 1 · 2013: 3
- FWCI
- 17.84
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- The Journal of Logic Programming (publishedVersion)
- Lirias (acceptedVersion, other-oa)
- Lirias (submittedVersion, other-oa)
- Funders
- Fonds De La Recherche Scientifique - FNRS
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Keywords
- abstract interpretation, Prolog compiler, program specialization, unification, extended modes, type information, free variables, variable sharing, program optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
