CoChat
Sign Up
Cited by 243Logic, programming, and type systemsLogic, Reasoning, and KnowledgeFormal Methods in Verification

The DOI matches its Crossref record.

A practical framework for theabstract interpretation of logic programs

Open access
Bruynooghe, Maurice·1991·The Journal of Logic Programming
DOI 10.1016/0743-1066(91)80001-t
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1016/0743-1066(91)80001-t

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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 Bruynooghe [1991]

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 4

  1. Debray, 1988, J. Logic Programming, 5, 207, 10.1016/0743-1066(88)90010-6 · DOI
  2. Kanamori, 1987, Analyzing Success Patterns of Logic Programs by Abstract Hybrid Interpretation, ICOT Technical Report TR279
  3. Mellish, 1985, Some Global Optimizations for a Prolog Compiler, J. Logic Programming, 2, 43, 10.1016/0743-1066(85)90004-4 · DOI
  4. Naur, 1963, The Design of the Gier Algol Compiler, Part II, BIT, 3, 145, 10.1007/BF01939983 · DOI

Cited by

Sorted by citations

Metadata

Authors
Bruynooghe, M.
Affiliations
Fund for Scientific Research (BE)
Corresponding author
Bruynooghe, Maurice
ORCID
Bruynooghe, Maurice
Venue
The Journal of Logic Programming
Publisher
Elsevier BV
Published
1991-02
Volume
10
Issue
2
Pages
91-124
ISSN
0743-1066 (ISSN-L)
DOI
10.1016/0743-1066(91)80001-t
OpenAlex
W207722629
Cited by
243
References
0
Citations by year
2026: 2 · 2025: 1 · 2024: 2 · 2023: 1 · 2021: 2 · 2020: 3 · 2019: 4 · 2018: 2 · 2017: 1 · 2016: 3 · 2015: 3 · 2014: 2 · 2013: 3 · 2012: 2
FWCI
27.17
Type
journal article
Language
en
Open access
Licence
Locations
  • The Journal of Logic Programming (publishedVersion)
  • Lirias (acceptedVersion, other-oa)
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 › Computational Theory and Mathematics › Formal Methods in Verification
Keywords
abstract interpretation, logic programs, proof trees, type checking, type synthesis, parallel execution, correctness conditions

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