CoChat
Sign Up
Cited by 582Logic, programming, and type systemsFormal Methods in VerificationLogic, Reasoning, and Knowledge

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract interpretation and application to logic programs

Open access
Cousot, Patrick, Cousot, Radhia·1992·The Journal of Logic Programming
DOI 10.1016/0743-1066(92)90030-7
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1016/0743-1066(92)90030-7

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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?

  • Algorithm 4.6.1 can be seen as performing an abstract interpretation on an infinite domain of infinite height (the ascending chain condition of Cousot and Cousot [1992] is not satisfied) and without a priori limitation of precision.

    “Algorithm 4.6.1 can also be seen as performing an abstract interpretation on an infinite domain of infinite height (i.e., the ascending chain condition of Cousot and Cousot [1992] is not satisfied) and without a priori limitation of the precision (i.e., if possible, we do not perform any abstraction at all and obtain simply the concrete results).”

    From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Cousot and Cousot [1992]

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 51

  1. Barbuti, 1992, Modeling Prolog Control, Conference Record of the 19th ACM Symposium on Principles of Programming Languages
  2. Barbuti, 1990, Recognizing Non-Floundering Logic Programs and Goals, Int. J. Foundat. Comput. Sci., 1, 151, 10.1142/S0129054190000126 · DOI
  3. Clarke, 1992, Model Checking and Abstraction, Conference Record of the 19th ACM Symposium on Principles of Programming Languages
  4. Cortesi, 1991, Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Coumpoundness Analysis, Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'91
  5. Cousot, 1976, Static Determination of Dynamic Properties of Programs, Proceedings of the 2nd International Symposium on Programming
  6. Cousot, 1977, Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, Conference Record of the 4th ACM Symposium on Principles of Programming Languages
  7. Cousot, 1977, Automatic Synthesis of Optimal Invariant Assertions: Mathematical Foundations, ACM Symposium on Artificial Intelligence and Programming Languages
  8. Cousot, 1977, Static Determination of Dynamic Properties of Generalized Type Unions, ACM Symposium on Language Design for Reliable Software, 10.1145/800022.808314 · DOI
  9. Cousot, 1979, A Constructive Characterization of the Lattices of All Retractions, Pre-Closure, Quasi-Closure and Closure Operators on a Complete Lattice, Port. Math., 38, 185
  10. Cousot, 1979, Systematic Design of Program Analysis Frameworks, Conference Record of the 6th ACM Symposium on Principles of Programming Languages
  11. Cousot, 1985, Principe des Méthodes de Preuve de Propriétés d'Invariance et de Fatalité des Programmes Parallèles, Parallélisme, Communication et Synchronisation, 129
  12. Cousot, 1987, Sometime = Always + Recursion  Always: On the Equivalence of theIntermittent and Invariant Assertions Methods for Proving Inevitability Pro perties of Programs, Acta Inform., 24, 1, 10.1007/BF00290704 · DOI
  13. Cousot, 1989, A Language-Independent Proof of the Soundness and Completeness of Generalized Hoare Logic, Inform. Comput., 80, 165, 10.1016/0890-5401(89)90018-7 · DOI
  14. Cousot, 1992, Inductive Definitions, Semantics and Abstract Interpretation, Conference Record of the 19th ACM Symposium on Principles of Programming Languages
  15. Cousot, 1978, Automatic Discovery of Linear Restraints Among Variables of a Program, Conference Record of the 5th ACM Symposium on Principles of Programming Languages
  16. Debray, S.K., Flow analysis of a Simple Clas of Dynamic Logic Programs, in: Proceedings of the 1987 International Symposium on Logic Programming, IEEE Press, New York, pp. 307–316.
  17. Debray, 1988, Efficient Dataflow Analysis of Logic Programs, Conference Record of the 15th ACM Symposium on Principles of Programming Languages
  18. Debray, 1989, Static Inference of Modes and Data Dependencies in Logic Programs, ACM Trans. Programming Lang. Syst., 11, 418, 10.1145/65979.65983 · DOI
  19. Debray, 1990, Task Granularity Analysis in Logic Programs, SIGPLAN'90 Conference on Programming Language Design and Implementation
  20. Debray, 1988, Automatic Mode Inference of Logic Programs, J. Logic Programming, 5, 207, 10.1016/0743-1066(88)90010-6 · DOI
  21. Debray, 1989, Functional Computations in Logic Programs, ACM Trans. Programming Lang. Syst., 11, 451, 10.1145/65979.65984 · DOI
  22. Debray, 1990, Towards Banishing the Cut from Prolog, IEEE Trans. Software Engrg., 16, 335, 10.1109/32.48941 · DOI
  23. Falaschi, 1984, Declarative Modelling of the Operational Behavior of Logic Languages, Theoret. Comput. Sci., 69, 289, 10.1016/0304-3975(89)90070-4 · DOI
  24. Fitting, 1985, A Kripke-Kleene Semantics for Logic Programs, J. Logic Programming, 2, 269, 10.1016/S0743-1066(85)80005-4 · DOI
  25. Gallagher, 1988, Specialization of Prolog and FCP Programs by Abstract Interpretation, New Generation Comput., 6, 159, 10.1007/BF03037136 · DOI
  26. Granger, 1989, Static Analysis of Arithmetical Congruences, Int. J. Comput. Math., 30, 165, 10.1080/00207168908803778 · DOI
  27. Gupta, 1990, A Fresh Look at Optimizing Array Bound Checking, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation
  28. Hudak, 1991, Collecting Interpretations of Expressions, ACM Trans. Programming Lang. Syst., 13, 269, 10.1145/103135.103139 · DOI
  29. Irigoin, 1988, Supernode Partitioning
  30. Jones, 1986, Data Flow Analysis of Applicative Programs Using Minimal Function Graphs: Abridged Version, Conference Record of the 13th ACM Symposium on Principles of Programming Languages
  31. Kanamori, 1985, Type Inference in Prolog and Its Application, Proceedings of the 9th International Joint Conference on Artificial Intelligence
  32. Kaplan, 1980, A General Scheme for the Automatic Inference of Variable Types, J. ACM, 27, 128, 10.1145/322169.322181 · DOI
  33. Karr, 1976, Affine Relationships Among Variables of a Program, Acta Inform., 6, 133, 10.1007/BF00268497 · DOI
  34. Keller, 1976, Formal Verification of Parallel Programs, Commun. ACM, 19, 371, 10.1145/360248.360251 · DOI
  35. Kildall, 1973, A Unified Approach to Global Program Optimization, Conference Record of the ACM Symposium on Principles of Programming Languages
  36. Mellish, 1985, Some Global Optimizations for a Prolog Program, J. Logic Programming, 1, 43, 10.1016/0743-1066(85)90004-4 · DOI
  37. Mishra, 1985, Declaration-Free Type Checking, Proceedings 12th ACM Symposium on Principles of Programming Languages
  38. Monsuez, 1991, An Attempt to Find Polymorphic Types by Abstract Interpretation, BIGRE, Actes JTASPEFL'91, Bordeaux, 74, 18
  39. Mycroft, 1984, A Polymorphic Type System for Prolog, Artif. Intell., 23, 289, 10.1016/0004-3702(84)90017-1 · DOI
  40. Naur, 1963, The Design of the GIER ALGOL Compiler, BIT, 3, 124, 10.1007/BF01935579 · DOI
  41. Naur, 1963, The Design of the GIER ALGOL Compiler, BIT, 3, 145, 10.1007/BF01939983 · DOI
  42. Naur, 1965, Checking of Operand Types in ALGOL Compilers, BIT, 5, 151, 10.1007/BF01940219 · DOI
  43. Nielson, 1985, Tensor Products Generalize the Relational Data Flow Analysis Method, Proceedings of the Fourth Hungarian Computer Science Conference
  44. Nielson, 1992, Bounded Fixed Point Iteration [extended abstract], Conference Record of the 19th ACM Symposium on Principles of Programming Languages
  45. Sato, 1984, Enumeration of Success Patterns in Logic Programs, Theoret. Comput. Sci., 34, 227, 10.1016/0304-3975(84)90119-1 · DOI
  46. Sintzoff, 1972, Calculating Properties of Programs by Valuations on Specific Models, Proceedings of an ACM Conference on Proving Assertions about Programs, 10.1145/800235.807086 · DOI
  47. Tarski, 1955, A Lattice Theoretical Fixpoint Theorem and Its Applications, Pacific J. Math., 5, 285, 10.2140/pjm.1955.5.285 · DOI
  48. van Emden, 1976, The Semantics of Predicate Logic as a Programming Language, J. ACM, 23, 733, 10.1145/321978.321991 · DOI
  49. van Gelder, 1990, Deriving Constraints Among Argument Sizes in Logic Programs, Proceedings of the 9th ACM Symposium on Principles of Database Systems
  50. Vataja, 1984, Finding Temporary Terms in Prolog Programs, Proceedings of the International Conference of FGCS
  51. Wegbreit, 1975, Property Extraction in Well-Founded Property Sets, IEEE Trans. Software Engrg., SE-1, 270, 10.1109/TSE.1975.6312852 · DOI

Cited by

Sorted by citations

Metadata

Authors
Cousot, P., & Cousot, R.
Affiliations
  • École Normale Supérieure - PSL (FR)
  • École Polytechnique (FR)
Corresponding author
Cousot, Patrick
ORCID
Cousot, Patrick
Venue
The Journal of Logic Programming
Publisher
Elsevier BV
Published
1992-07
Volume
13
Issue
2-3
Pages
103-179
ISSN
0743-1066 (ISSN-L)
DOI
10.1016/0743-1066(92)90030-7
OpenAlex
W2081810835
Cited by
582
References
1
Citations by year
2026: 4 · 2025: 6 · 2024: 5 · 2023: 9 · 2022: 10 · 2021: 7 · 2020: 8 · 2019: 8 · 2018: 7 · 2017: 9 · 2016: 9 · 2015: 13 · 2014: 22 · 2013: 18 · 2012: 18
Type
conference abstract
Language
en
Open access
Licence
Locations
The Journal of Logic Programming (publishedVersion)
Funders
Centre National de la Recherche Scientifique
Topics
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
Keywords
abstract interpretation, logic programs, data flow analysis, Galois connections, fixpoint computation, SLD-resolution, groundness analysis, abstract domains, program analysis

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