The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Bebop: A Symbolic Model Checker for Boolean Programs
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
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,082
McMillan, K. L. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3190-6 · Cited by 1,677
Precise interprocedural dataflow analysis via graph reachability
Reps, T., Horwitz, S., & Sagiv, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199462 · Cited by 1,170
Symbolic model checking: an approach to the state explosion problem
McMillan, K. L. (1992) · Defense Technical Information Center (DTIC) · Cited by 979
VIS: A system for verification and synthesis
Brayton, R. K., Hachtel, G. D., Sangiovanni-Vincentelli, A., Somenzi, F., Aziz, A., Cheng, S. T., Edwards, S., Khatri, S., Kukimoto, Y., Pardo, A., et al. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_95 · Cited by 608
Alur, R., & Henzinger, T. A. (1999) · Formal Methods in System Design · doi:10.1023/a:1008739929481 · Cited by 541
MOCHA: Modularity in model checking
Alur, R., Henzinger, T. A., Mang, F. Y. C., Qadeer, S., Rajamani, S. K., & Tasiran, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028774 · Cited by 382
Self-citationProgram Flow Analysis: Theory and Application
Muchnick, S. S., & Jones, N. D. (1981) · Medical Entomology and Zoology · Cited by 361
Cited by
Visser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
The S LAM project: debugging system software via static analysis
Ball, T., & Rajamani, S. K. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503274 · Cited by 923
Self-citationAutomatic predicate abstraction of C programs
Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442783 · Cited by 694
Self-citationThorough static analysis of device drivers
Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S. K., & Ustuner, A. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217943 · Cited by 371
Self-citationFrom symptom to cause: localizing errors in counterexample traces
Ball, T., Naik, M., & Rajamani, S. K. (2003) · Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/604131.604140 · Cited by 294
Self-citation
Metadata
- Authors
- Ball, T., & Rajamani, S. K.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 113-130
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1691700263
- Cited by
- 372
- References
- 14
- FWCI
- 15.38
- 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: Bebop: A Symbolic Model Checker for Boolean Programs. https://app.cochat.ai/papers/10.1007/10722468_7
- The paper
- Ball, T., & Rajamani, S. K. (2000). Bebop: A Symbolic Model Checker for Boolean Programs. Lecture Notes in Computer Science. https://doi.org/10.1007/10722468_7
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.