The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Behavioral consistency of C and verilog programs using bounded model checking
Open accessAbstract
"We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program are unwound and translated into a formula that is satisfiable if and only if the circuit and the code disagree. The formula is then checked using a SAT solver. We are able to translate C programs that make use of side effects, pointers, dynamic memory allocation, and loops with conditions that cannot be evaluated statically. We describe experimental results on various reactive circuits and programs, including a small processor given in Verilog and its Instruction Set Architecture given in ANSI-C."
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
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,375
Clarke, E. M., Grümberg, O., & Long, D. (1996) · Cited by 6,813
Self-citationChaff: engineering an efficient SAT solver
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001) · Proceedings of the 38th conference on Design automation - DAC '01 · doi:10.1145/378239.379017 · Cited by 2,940
Symbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clarke, E., & Zhu, Y. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49059-0_14 · Cited by 2,150
Self-citationSymbolic model checking using SAT procedures instead of BDDs
Biere, A., Cimatti, A., Clarke, E. M., Fujita, M., & Zhu, Y. (1999) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/309847.309942 · Cited by 752
Self-citationThe Verilog hardware description language
(1991) · Choice Reviews Online · doi:10.5860/choice.29-2154 · Cited by 501
Benefits of Bounded Model Checking at an Industrial Setting
Copty, F., Fix, L., Fraer, R., Giunchiglia, E., Kamhi, G., Tacchella, A., & Vardi, M. Y. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44585-4_43 · Cited by 189
Tuning SAT Checkers for Bounded Model Checking
Shtrichman, O. (2000) · Lecture notes in computer science · doi:10.1007/10722167_36 · Cited by 167
Verifying Safety Properties of a PowerPC− Microprocessor Using Symbolic Model Checking without BDDs
Biere, A., Clarke, E. M., Raimi, R., & Zhu, Y. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48683-6_8 · Cited by 130
Self-citationFinding Bugs in an Alpha Microprocessor Using Satisfiability Solvers
Bjesse, P., Leonard, T., & Mokkedem, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44585-4_44 · Cited by 114
The Code Validation Tool (CVT)
Pnueli, A., Shtrichman, O., & Siegel, M. (1998) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s100090050027 · Cited by 88
Formal verification of commercial integrated circuits
Pixley, C. (2001) · IEEE Design & Test of Computers · doi:10.1109/mdt.2001.936243 · Cited by 16
Cited by
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
Cadar, C., Dunbar, D., & Engler, D. (2008) · doi:10.5555/1855741.1855756 · Cited by 2,620
A Tool for Checking ANSI-C Programs
Clarke, E., Kroening, D., & Lerda, F. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24730-2_15 · Cited by 1,408
Self-citationCombinatorial sketching for finite programs
Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., & Saraswat, V. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168907 · Cited by 635
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
A Survey of Automated Techniques for Formal Software Verification
D'Silva, V., Kroening, D., & Weissenbacher, G. (2008) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2008.923410 · Cited by 378
Self-citation
Metadata
- Authors
- Clarke, E., Kroening, D., & Yorav, K.
- Venue
- Proceedings of the 40th annual Design Automation Conference
- Publisher
- ACM
- Published
- 2003-06-02
- Pages
- 368-371
- ISSN
- 0738-100X (ISSN-L)
- OpenAlex
- W2171999426
- Cited by
- 281
- References
- 12
- FWCI
- 11.60
- Type
- conference paper
- Language
- en
- Open access
- green
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.