The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Model checking for programming languages using VeriSoft
Abstract
Verification by state-space exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing model-checking techniques are restricted to the verification of properties of models, i.e., abstractions, of concurrent systems.In this paper, we discuss how model checking can be extended to deal directly with "actual" descriptions of concurrent systems, e.g., implementations of communication protocols written in programming languages such as C or C++. We then introduce a new search technique that is suitable for exploring the state spaces of such systems. This algorithm has been implemented in VeriSoft, a tool for systematically exploring the state spaces of systems composed of several concurrent processes executing arbitrary C code. As an example of application, we describe how VeriSoft successfully discovered an error in a 2500-line C program controlling robots operating in an unpredictable environment.
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 Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,453
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
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
Clarke, E., McMillan, K., Campos, S., & Hartonas-Garmhausen, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_93 · Cited by 2,839
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
Symbolic Boolean manipulation with ordered binary-decision diagrams
Bryant, R. E. (1992) · ACM Computing Surveys · doi:10.1145/136035.136043 · Cited by 2,015
Design and validation of computer protocols
Holzmann, G. J. (1991) · Cited by 1,926
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
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
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
Self-citationDART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065036 · Cited by 1,570
Self-citationVisser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics
Lu, S., Park, S., Seo, E., & Zhou, Y. (2008) · Proceedings of the 13th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1346281.1346323 · Cited by 895
EXE: automatically generating inputs of death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180445 · Cited by 788
Search-based software engineering: Trends, techniques and applications
Harman, M., Mansouri, S. A., & Zhang, Y. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379787 · Cited by 777
Korat: automated testing based on Java predicates
Boyapati, C., Khurshid, S., & Marinov, D. (2002) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/566171.566191 · Cited by 593
The software model checker Blast: Applications to software engineering
Beyer, D., Henzinger, T. A., Jhala, R., & Majumdar, R. (2007) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-007-0044-z · Cited by 585
Generalized Symbolic Execution for Model Checking and Testing
Khurshid, S., PĂsĂreanu, C. S., & Visser, W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36577-x_40 · Cited by 568
S2E: a platform for in-vivo multi-path analysis of software systems
Chipounov, V., Kuznetsov, V., & Candea, G. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950396 · Cited by 514
Test input generation with java PathFinder
Visser, W., Pǎsǎreanu, C. S., & Khurshid, S. (2004) · Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis · doi:10.1145/1007512.1007526 · Cited by 501
Iterative context bounding for systematic testing of multithreaded programs
Musuvathi, M., & Qadeer, S. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250785 · Cited by 483
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Software engineering for security: a roadmap
Devanbu, P. T., & Stubblebine, S. (2000) · Proceedings of the Conference on The Future of Software Engineering · doi:10.1145/336512.336559 · Cited by 418
Compositional dynamic test generation
Godefroid, P. (2007) · ACM SIGPLAN Notices · doi:10.1145/1190215.1190226 · Cited by 408
Self-citationPerracotta: mining temporal API rules from imperfect traces
Yang, J., Evans, D., Bhardwaj, D., Bhat, T., & Das, M. (2006) · Proceedings of the 28th international conference on Software engineering · doi:10.1145/1134285.1134325 · Cited by 406
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
CMC: a pragmatic approach to model checking real code
Musuvathi, M., Park, D. Y. W., Chou, A., Engler, D. R., & Dill, D. L. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844136 · Cited by 361
Using formal specifications to support testing
Hierons, R. M., Bogdanov, K., Bowen, J. P., Cleaveland, R., Derrick, J., Dick, J., Gheorghe, M., Harman, M., Kapoor, K., Krause, P., et al. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459354 · Cited by 356
EXE: Automatically Generating Inputs of Death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2008) · ACM Transactions on Information and System Security · doi:10.1145/1455518.1455522 · Cited by 342
Visser, W., Havelund, K., Brat, G., & Park, S. (2000) · Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering · doi:10.1109/ase.2000.873645 · Cited by 341
Compositional dynamic test generation
Godefroid, P. (2007) · Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1190216.1190226 · Cited by 314
Self-citationUsing model checking to find serious file system errors
Yang, J., Twohey, P., Engler, D., & Musuvathi, M. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1189256.1189259 · Cited by 310
Detecting BGP configuration faults with static analysis
Feamster, N., & Balakrishnan, H. (2005) · doi:10.5555/1251203.1251207 · Cited by 307
Korat: automated testing based on Java predicates
Boyapati, C., Khurshid, S., & Marinov, D. (2002) · Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis · doi:10.1145/566172.566191 · Cited by 302
Execution Generated Test Cases: How to Make Systems Code Crash Itself
Cadar, C., & Engler, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11537328_2 · Cited by 254
Delta execution for efficient state-space exploration of object-oriented programs
d'Amorim, M., Lauterburg, S., & Marinov, D. (2007) · Proceedings of the 2007 international symposium on Software testing and analysis · doi:10.1145/1273463.1273472 · Cited by 26
“For example, Verisoft [18] is a well-known model ch e ker that effectively employs re-execution.”
MethodInfluential
Metadata
- Authors
- Godefroid, P.
- Venue
- Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 174-186
- OpenAlex
- W2065675749
- Cited by
- 825
- References
- 19
- FWCI
- 11.66
- 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.