The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Linear Invariant Generation Using Non-linear Constraint Solving
Open accessOverview
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
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
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
A Decision Method for Elementary Algebra and Geometry
Tarski, A. (1998) · Texts and Monographs in Symbolic Computation · doi:10.1007/978-3-7091-9459-1_3 · Cited by 1,643
Automatic 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
Jaffar, J., & Lassez, J.-L. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41635 · Cited by 1,597
A Decision Method for Elementary Algebra and Geometry
Tarski, A., & McKinsey, J. C. C. (1951) · University of California Press eBooks · doi:10.1525/9780520348097 · Cited by 1,206
Algorithms+Data Structures = Programs
(2024) · Data Structures and Algorithms in Java · doi:10.1017/9781009260350.002 · Cited by 953
Temporal Verification of Reactive Systems: Safety
Manna, Z., & Pnueli, A. (1995) · Medical Entomology and Zoology · Cited by 947
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
Collins, G. E. (1975) · Lecture Notes in Computer Science · doi:10.1007/3-540-07407-4_17 · Cited by 655
Cited by
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
From program verification to program synthesis
Srivastava, S., Gulwani, S., & Foster, J. S. (2010) · Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1706299.1706337 · Cited by 267
Ranking LLM-Generated Loop Invariants for Program Verification
Chakraborty, S., Lahiri, S., Fakhoury, S., Lal, A., Musuvathi, M., Rastogi, A., Senthilnathan, A., Sharma, R., & Swamy, N. (2023) · Findings of the Association for Computational Linguistics: EMNLP 2023 · doi:10.18653/v1/2023.findings-emnlp.614 · Cited by 37
LLM Meets Bounded Model Checking: Neuro-symbolic Loop Invariant Inference
Wu, G., Cao, W., Yao, Y., Wei, H., Chen, T., & Ma, X. (2024) · Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering · doi:10.1145/3691620.3695014 · Cited by 24
Enhancing Automated Loop Invariant Generation for Complex Programs with Large Language Models
Liu, R., Chen, M., Wu, L.-I., Ke, J., & Li, G. (2024) · arXiv · doi:10.48550/arxiv.2412.10483 · Cited by 9
“Farkas’ lemma [9, 10, 11, 12, 13] is frequently used to extract linear relationships from loops, while other constraint templates, such as those based on Craig’s interpolant [52, 41, 42], are also employed.”
Metadata
- Authors
- Colón, M. A., Sankaranarayanan, S., & Sipma, H. B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 420-432
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1563374593
- Cited by
- 351
- References
- 14
- FWCI
- 6.63
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear Invariant Generation Using Non-linear Constraint Solving. https://app.cochat.ai/papers/10.1007/978-3-540-45069-6_39
- The paper
- Colón, M. A., Sankaranarayanan, S., & Sipma, H. B. (2003). Linear Invariant Generation Using Non-linear Constraint Solving. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-45069-6_39
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.