The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Hybrid type checking
Open accessAbstract
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specifications they support. Dynamically-checked contracts can enforce more precise specifications, but these are not checked until run time, resulting in incomplete detection of defects. Hybrid type checking is a synthesis of these two approaches that enforces precise interface specifications, via static analysis where possible, but also via dynamic checks where necessary. This paper explores the key ideas and implications of hybrid type checking, in the context of the simply-typed A-calculus with arbitrary refinements of base types.
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
Object-Oriented Software Construction
Meyer, B. (1988) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 4,011
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
Object-oriented software construction
America, P. (1989) · Science of Computer Programming · doi:10.1016/0167-6423(89)90034-8 · Cited by 2,008
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
DART: 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
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
Self-citationA Syntactic Approach to Type Soundness
Wright, A. K., & Felleisen, M. (1994) · Information and Computation · doi:10.1006/inco.1994.1093 · Cited by 1,136
Simplify: a theorem prover for program checking
Detlefs, D., Nelson, G., & Saxe, J. B. (2005) · Journal of the ACM · doi:10.1145/1066100.1066102 · Cited by 786
A technique for software module specification with examples
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/355602.361309 · Cited by 726
An overview of JML tools and applications
Burdy, L., Cheon, Y., Cok, D. R., Ernst, M. D., Kiniry, J. R., Leavens, G. T., Leino, K. R. M., & Poll, E. (2005) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-004-0167-4 · Cited by 714
Automatic 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
Definitional interpreters for higher-order programming languages
Reynolds, J. C. (1972) · Proceedings of the ACM annual conference on - ACM '72 · doi:10.1145/800194.805852 · Cited by 669
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
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
Contracts for higher-order functions
Findler, R. B., & Felleisen, M. (2002) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/581478.581484 · Cited by 510
Necula, G. C., McPeak, S., & Weimer, W. R. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442786 · Cited by 502
Siek, J. G., & Taha, W. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73589-2_2 · Cited by 482
Automatic predicate abstraction of C programs
Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K. (2001) · Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation · doi:10.1145/378795.378846 · Cited by 442
Hybrid dynamic data race detection
O'Callahan, R., & Choi, J.-D. (2003) · Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/781498.781528 · Cited by 432
Freeman, T., & Pfenning, F. (1991) · Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91 · doi:10.1145/113445.113468 · Cited by 424
Necula, G. C., McPeak, S., & Weimer, W. R. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503286 · Cited by 375
von Praun, C., & Gross, T. R. (2001) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/504282.504288 · Cited by 327
TIL: a type-directed optimizing compiler for ML
Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., & Lee, P. (1996) · Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation · doi:10.1145/231379.231414 · Cited by 317
Cayenne—a language with dependent types
Augustsson, L. (1998) · Proceedings of the third ACM SIGPLAN international conference on Functional programming · doi:10.1145/289423.289451 · Cited by 286
An overview of JML tools and applications1 1www.jmlspecs.org
Burdy, L., Cheon, Y., Cok, D., Ernst, M. D., Kiniry, J., Leavens, G. T., Rustan, K., Leino, M., & Poll, E. (2003) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)80810-7 · Cited by 206
Inheritance as implicit coercion
Breazu-Tannen, V., Coquand, T., Gunter, C. A., & Scedrov, A. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90055-7 · Cited by 184
Temporal-Safety Proofs for Systems Code
Henzinger, T. A., Necula, G. C., Jhala, R., Sutre, G., Majumdar, R., & Weimer, W. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45657-0_45 · Cited by 167
The Turing programming language
Holt, R. C., & Cordy, J. R. (1988) · Communications of the ACM · doi:10.1145/53580.53581 · Cited by 103
Frisch, A., Castagna, G., & Benzaken, V. (2003) · Proceedings - Symposium on Logic in Computer Science · doi:10.1109/lics.2002.1029823 · Cited by 97
An effective theory of type refinements
Mandelbaum, Y., Walker, D., & Harper, R. W. (2003) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/944705.944725 · Cited by 75
Imperative 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
Typechecking dependent types and subtypes
Cardelli, L. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19129-1_2 · Cited by 30
Cited by
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Stateful Contracts for Affine Types
Tov, J. A., & Pucella, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11957-6_29 · Cited by 43
Metadata
- Authors
- Flanagan, C.
- Venue
- Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2006-01-11
- Pages
- 245-256
- OpenAlex
- W2141210774
- Cited by
- 265
- References
- 33
- FWCI
- 18.97
- 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.