The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Extended static checking for Java
Abstract
Software development and maintenance are costly endeavors. The cost can be reduced if more software defects are detected earlier in the development cycle. This paper introduces the Extended Static Checker for Java (ESC/Java), an experimental compile-time program checker that finds common programming errors. The checker is powered by verification-condition generation and automatic theorem-proving techniques. It provides programmers with a simple annotation language with which programmer design decisions can be expressed formally. ESC/Java examines the annotated software and warns of inconsistencies between the design decisions recorded in the annotations and the actual code, and also warns of potential runtime errors in the code. This paper gives an overview of the checker architecture and annotation language and describes our experience applying the checker to tens of thousands of lines of Java programs.
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
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
Object-Oriented Software Construction
Meyer, B. (1988) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 4,011
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
Construction of abstract state graphs with PVS
Graf, S., & Saidi, H. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63166-6_10 · Cited by 1,454
Visser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
Bandera: extracting finite-state models from Java source code
Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Păsăreanu, C. S., Robby, & Zheng, H. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337234 · Cited by 1,059
Proof of correctness of data representations
Hoare, C. A. R. (1972) · Acta Informatica · doi:10.1007/bf00289507 · Cited by 966
Preliminary design of JML: a behavioral interface specification language for java
Leavens, G. T., Baker, A. L., & Ruby, C. (2006) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1127878.1127884 · Cited by 790
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
Automatically Validating Temporal Safety Properties of Interfaces
Ball, T., & Rajamani, S. K. (2001) · Cited by 599
Mercator: A scalable, extensible Web crawler
Heydon, A., & Najork, M. (1999) · World Wide Web · doi:10.1023/a:1019213109274 · Cited by 582
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
A static analyzer for finding dynamic programming errors
Bush, W. R., Pincus, J. D., & Sielaff, D. (2000) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(200006)30:7<775::aid-spe309>3.0.co;2-h · Cited by 512
Houdini, an Annotation Assistant for ESC/Java
Flanagan, C., & Leino, K. R. M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45251-6_29 · Cited by 405
Self-citationLeino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
Self-citationReport on the programming language Euclid
Lampson, B., Horning, J. J., London, R. L., Mitchell, J. G., & Popek, G. J. (1977) · ACM SIGPLAN Notices · doi:10.1145/954666.971189 · Cited by 385
Dynamically discovering likely program invariants to support program evolution
Ernst, M. D., Cockrell, J., Griswold, W. G., & Notkin, D. S. (1999) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/302405.302467 · Cited by 357
Predicate abstraction for software verification
Flanagan, C., & Qadeer, S. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503291 · Cited by 284
Self-citationJohnson, S. C., & Hill, M. G. (1978) · Cited by 280
Avoiding exponential explosion: generating compact verification conditions
Flanagan, C., & Saxe, J. B. (2001) · Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/360204.360220 · Cited by 220
Self-citationLeino, K. R. M. (1998) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/286936.286953 · Cited by 157
Self-citationData abstraction and information hiding
Leino, K. R. M., & Nelson, G. (2002) · ACM Transactions on Programming Languages and Systems · doi:10.1145/570886.570888 · Cited by 134
Self-citationUsing data groups to specify and check side effects
Leino, K. R. M., Poetzsch‐Heffter, A., & Zhou, Y. (2002) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/512529.512559 · Cited by 114
Self-citationImperative programming with dependent types
Xi, H. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2000.855785 · Cited by 75
Extended Static Checking: A Ten-Year Perspective
Leino, K. R. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44577-3_11 · Cited by 62
Self-citationAnnotation inference for modular checkers
Cormac Flanagan, A., Joshi, R., & Leino, K. R. M. (2001) · Information Processing Letters · doi:10.1016/s0020-0190(00)00196-4 · Cited by 56
Self-citationSpecification of the Javacard API in JML
Poll, E., van den Berg, J., & Jacobs, B. (2000) · Springer eBooks · doi:10.1007/978-0-387-35528-3_8 · Cited by 48
Automatic Generation and Checking of Program Specifications
Nimmer, J. W. (2002) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 15
Cited by
The Daikon system for dynamic detection of likely invariants
Ernst, M. D., Perkins, J. H., Guo, P. J., McCamant, S., Pacheco, C., Tschantz, M. S., & Xiao, C. (2007) · Science of Computer Programming · doi:10.1016/j.scico.2007.01.015 · Cited by 1,080
The Spec# Programming System: An Overview
Barnett, M., Leino, K. R. M., & Schulte, W. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30569-9_3 · Cited by 986
Self-citationDafny: An Automatic Program Verifier for Functional Correctness
Leino, K. R. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17511-4_20 · Cited by 940
Self-citationBoogie: A Modular Reusable Verifier for Object-Oriented Programs
Barnett, M., Chang, B.-Y. E., DeLine, R., Jacobs, B., & Leino, K. R. M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11804192_17 · Cited by 799
Self-citationPex–White Box Test Generation for .NET
Tillmann, N., & de Halleux, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79124-9_10 · Cited by 791
Metadata
- Authors
- Flanagan, C., Leino, K. R. M., Lillibridge, M., Nelson, G., Saxe, J. B., & Stata, R.
- Venue
- Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 2002-05-17
- Pages
- 234-245
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W1993836075
- Cited by
- 1,340
- References
- 29
- FWCI
- 72.31
- 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.