The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Self-citationSystematic design of program analysis frameworks
Cousot, P., & Cousot, R. (1979) · Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79 · doi:10.1145/567752.567778 · Cited by 1,621
Self-citationAutomatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Self-citationThe Semantics of Predicate Logic as a Programming Language
Van Emden, M. H., & Kowalski, R. A. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
Abstract Interpretation Frameworks
COUSOT, P., & COUSOT, R. (1992) · Journal of Logic and Computation · doi:10.1093/logcom/2.4.511 · Cited by 710
Self-citationAbstract interpretation and application to logic programs
Cousot, P., & Cousot, R. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90030-7 · Cited by 582
Self-citationStatic determination of dynamic properties of programs
Cousot, P. M., & Cousot, R. (1976) · Cited by 473
Self-citationProgram Flow Analysis: Theory and Application
Muchnick, S. S., & Jones, N. D. (1981) · Medical Entomology and Zoology · Cited by 361
Abstract interpretation of declarative languages
(1988) · Information and Software Technology · doi:10.1016/0950-5849(88)90032-8 · Cited by 320
Semantic foundations of program analysis
Cousot, P. M. (1981) · Cited by 272
Self-citationConstructive versions of Tarski’s fixed point theorems
Cousot, P., & Cousot, R. (1979) · Pacific Journal of Mathematics · doi:10.2140/pjm.1979.82.43 · Cited by 254
Self-citationThe theory and practice of transforming call-by-need into call-by-value
Mycroft, A. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-09981-6_19 · Cited by 182
Inductive definitions, semantics and abstract interpretations
Cousot, P., & Cousot, R. (1992) · Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92 · doi:10.1145/143165.143184 · Cited by 177
Self-citationStatic determination of dynamic properties of recursive procedures
Cousot, P. M., & Cousot, R. (1977) · Cited by 175
Self-citationStatic analysis of arithmetical congruences
Granger, P. (1989) · International Journal of Computer Mathematics · doi:10.1080/00207168908803778 · Cited by 162
Static analysis of linear congruence equalities among variables of a program
Granger, P. (1991) · Lecture notes in computer science · doi:10.1007/3-540-53982-4_10 · Cited by 146
A technique for summarizing data access and its use in parallelism enhancing transformations
Balasundaram, V., & Kennedy, K. (1989) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/73141.74822 · Cited by 125
Deutsch, A. (2003) · International Conference on Computer Languages (ICCL) · doi:10.1109/iccl.1992.185463 · Cited by 118
Abstract interpretation by dynamic partitioning
Bourdoncle, F. (1992) · Journal of Functional Programming · doi:10.1017/s0956796800000496 · Cited by 97
Abstract interpretation: towards the global optimisation of PROLOG programs
Bruynooghe, M., Janssens, G., Callebaut, A., & Demoen, B. (1987) · Lirias · Cited by 91
Abstract Interpretation: Towards the Global Optimization of Prolog Programs.
Bruynooghe, M., Janssens, G., Callebaut, A., & Demoen, B. (1987) · SLP · Cited by 79
Cousot, P. M. (1978) · Cited by 71
Self-citationDétermination automatique de relations linéaires vérifiées par les variables d'un programme
Halbwachs, N. (1979) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 59
Deriving constraints among argument sizes in logic programs
Gelder, A. V. (1991) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530930 · Cited by 54
Bourdoncle, F. (1990) · Lecture notes in computer science · doi:10.1007/bfb0024192 · Cited by 33
On abstracting the procedural behaviour of logic programs
Janssens, G., & Bruynooghe, M. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55460-2_18 · Cited by 5
Cited by
An efficient cryptographic protocol verifier based on prolog rules
Blanchet, B. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930138 · Cited by 967
Miné, A. (2006) · Higher-Order and Symbolic Computation · doi:10.1007/s10990-006-8609-1 · Cited by 720
Julia: A Fast Dynamic Language for Technical Computing
Anderson, T. A., Liu, H., Kuper, L., Totoni, E., Vitek, J., & Shpeisman, T. (2012) · arXiv (Cornell University) · doi:10.4230/lipics.ecoop.2017.4 · Cited by 627
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781153 · Cited by 573
Self-citationBagnara, R., Hill, P. M., & Zaffanella, E. (2008) · Science of Computer Programming · doi:10.1016/j.scico.2007.08.001 · Cited by 477
Metadata
- Authors
- Cousot, P., & Cousot, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer-Verlag
- Published
- 2006-07-13
- Pages
- 269-295
- OpenAlex
- W1568478782
- Cited by
- 423
- References
- 27
- FWCI
- 19.21
- Type
- conference paper
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.