The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Kodkod: A Relational Model Finder
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Temporal Logic of Nested Calls and Returns
Alur, R., Etessami, K., & Madhusudan, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_35 · Cited by 3,339
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
Apt, K. R. (1992) · Cited by 1,678
Translating Pseudo-Boolean Constraints into SAT
Eén, N., & Sörensson, N. (2006) · Journal on Satisfiability, Boolean Modeling and Computation · doi:10.3233/sat190014 · Cited by 587
BerkMin: A fast and robust SAT-solver
Goldberg, E. I., & Novikov, Y. (2003) · Design, Automation, and Test in Europe · doi:10.1109/date.2002.998262 · Cited by 363
Concepts, Techniques, and Models of Computer Programming
Roy, P. V., & Haridi, S. (2004) · Cited by 350
(1992) · Expert Systems · doi:10.1111/j.1468-0394.1992.tb00386.x · Cited by 234
Symbolic Reachability Analysis Based on SAT-Solvers
Abdulla, P. A., Bjesse, P., & Eén, N. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46419-0_28 · Cited by 187
Zchaff2004: An Efficient SAT Solver
Mahajan, Y. S., Fu, Z., & Malik, S. (2005) · Lecture notes in computer science · doi:10.1007/11527695_27 · Cited by 147
Cited by
Answer Set Solving in Practice
Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. H. (2012) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00457ed1v01y201211aim019 · Cited by 288
Coverage guided, property based testing
Lampropoulos, L., Hicks, M., & Pierce, B. C. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3360607 · Cited by 49
Metadata
- Authors
- Torlak, E., & Jackson, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-07-04
- Pages
- 632-647
- OpenAlex
- W1519503479
- Cited by
- 499
- References
- 15
- FWCI
- 21.75
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Kodkod: A Relational Model Finder. https://app.cochat.ai/papers/10.1007/978-3-540-71209-1_49
- The paper
- Torlak, E., & Jackson, D. (2007). Kodkod: A Relational Model Finder. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-71209-1_49
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.