The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Bandera: extracting finite-state models from Java source code
Open accessAbstract
Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a finite-state model that approximates the executable behavior of the software system of interest. Current best-practice involves hand-construction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results), and difficult to optimize (which is necessary to combat the exponential complexity of verification algorithms).
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
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
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
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
Patterns in property specifications for finite-state verification
Dwyer, M. B., Avrunin, G. S., & Corbett, J. C. (1999) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1145/302405.302672 · Cited by 1,463
Self-citationPVS: A prototype verification system
Owre, S., Rushby, J. M., & Shankar, N. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55602-8_217 · Cited by 1,415
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
Model checking JAVA programs using JAVA PathFinder
Havelund, K., & Pressburger, T. (2000) · International Journal on Software Tools for Technology Transfer (STTT) · doi:10.1007/s100090050043 · Cited by 800
Interprocedural slicing using dependence graphs
Horwitz, S., Reps, T., & Binkley, D. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989419 · Cited by 372
Formal analysis of a space-craft controller using SPIN
Havelund, K., Lowry, M., & Penix, J. (2001) · IEEE Transactions on Software Engineering · doi:10.1109/32.940728 · Cited by 176
McMillan, K. L. (2000) · Verification of Digital and Hybrid Systems · doi:10.1007/978-3-642-59615-5_6 · Cited by 176
Slicing Software for Model Construction
Hatcliff, J., Dwyer, M. B., & Zheng, H. (2000) · LISP and Symbolic Computation · doi:10.1023/a:1026599015809 · Cited by 160
Self-citationA deadlock detection tool for concurrent Java programs
Demartini, C. G., Iosif, R., & Sisto, R. (1999) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(199906)29:7<577::aid-spe246>3.0.co;2-v · Cited by 137
Software Model Checking: Extracting Verification Models from Source Code
Holzmann, G. J., & Smith, M. (1999) · IFIP advances in information and communication technology · doi:10.1007/978-0-387-35578-8_28 · Cited by 73
Verification of Erlang programs using abstract interpretation and model checking
Huch, F. (1999) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/317636.317908 · Cited by 57
Staging static analyses using abstraction-based program specialization
John Hatcliff, A., Dwyer, M. B., & Laubach, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056612 · Cited by 23
Self-citation
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
Visser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
Extended static checking for Java
Flanagan, C., Leino, K. R. M., Lillibridge, M., Nelson, G., Saxe, J. B., & Stata, R. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512558 · Cited by 1,340
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
Bugs as deviant behavior: a general approach to inferring errors in systems code
Engler, D., Chen, D. Y., Hallem, S., Chou, A., & Chelf, B. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502041 · Cited by 737
Metadata
- Authors
- Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Păsăreanu, C. S., Robby, & Zheng, H.
- Venue
- Proceedings of the 22nd international conference on Software engineering - ICSE '00
- Publisher
- ACM Press
- Published
- 2000
- Pages
- 439-448
- ISSN
- 0270-5257 (ISSN-L)
- OpenAlex
- W2135274583
- Cited by
- 1,059
- References
- 16
- FWCI
- 64.43
- 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
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.