The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Automatic discovery of linear restraints among variables of a program
Abstract
The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
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-citationStatic determination of dynamic properties of programs
Cousot, P. M., & Cousot, R. (1976) · Cited by 473
Self-citationAffine relationships among variables of a program
Karr, M. (1976) · Acta Informatica · doi:10.1007/bf00268497 · Cited by 439
An Introduction to Linear Programming
O., D. G., Charnes, A., Cooper, W. W., & Henderson, A. (1953) · OR · doi:10.2307/3006832 · Cited by 241
Mattheiss, T. H. (1973) · Operations Research · doi:10.1287/opre.21.1.247 · Cited by 120
Property extraction in well-founded property sets
Wegbreit, B. (1975) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1975.6312852 · Cited by 91
The Number of Vertices of a Polyhedron
Saaty, T. L. (1955) · American Mathematical Monthly · doi:10.1080/00029890.1955.11988636 · Cited by 17
Cited by
The algorithmic analysis of hybrid systems
Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., & Yovine, S. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00202-t · Cited by 1,876
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-citationSpecification and verification of concurrent systems in CESAR
Queille, J. P., & Sifakis, J. (1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11494-7_22 · Cited by 1,321
Boogie: A Modular Reusable Verifier for Object-Oriented Programs
Barnett, M., Chang, B.-Y. E., DeLine, R., Jacobs, B., & Leino, K. R. M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11804192_17 · Cited by 799
AI2: Safety and Robustness Certification of Neural Networks with Abstract Interpretation
Gehr, T., Mirman, M., Drachsler-Cohen, D., Tsankov, P., Chaudhuri, S., & Vechev, M. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00058 · Cited by 799
Metadata
- Authors
- Cousot, P., & Halbwachs, N.
- Venue
- Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78
- Publisher
- ACM Press
- Published
- 1978
- Pages
- 84-96
- OpenAlex
- W2132661148
- Cited by
- 1,614
- References
- 8
- FWCI
- 3.87
- 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.