The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
A parameterized type system for race-free Java programs
Abstract
... programs; any well-typed program in our system is free of data races. Our type system is significantly more expressive than previous such type systems. In particular, our system lets programmers write generic code to implement a class, then create dierent objects of the same class that have different protection mechanisms. This flexibility enables programmers to reduce the number of unnecessary synchronization operations in a program without risking data races. We also support default types which reduce the burden of writing the extra type annotations. Our experience indicates that our system provides a promising approach to make multithreaded programs more reliable and efficient.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.223990 · Cited by 3,624
Java Virtual Machine Specification
Lindholm, T., & Yellin, F. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,155
Eraser: a dynamic data race detector for multithreaded programs
Savage, S., Burrows, M., Nelson, G., Sobalvarro, P., & Anderson, T. (1997) · ACM Transactions on Computer Systems · doi:10.1145/265924.265927 · Cited by 1,572
Ownership types for flexible alias protection
Clarke, D. G., Potter, J. M., & Noble, J. (1998) · Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/286936.286947 · Cited by 580
Choi, J.-D., Gupta, M., Serrano, M. J., Sreedhar, V. C., & Midkiff, S. P. (1999) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/320384.320386 · Cited by 506
Flatt, M., Krishnamurthi, S., & Felleisen, M. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268961 · Cited by 487
Lucassen, J. M., & Gifford, D. K. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73564 · Cited by 481
Cited by
Formalising Java’s Data Race Free Guarantee
Aspinall, D., & Ševčík, J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74591-4_4 · Cited by 754
Ownership types for safe programming: preventing data races and deadlocks
Boyapati, C., Lee, R., & Rinard, M. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582440 · Cited by 570
Self-citationEfficient and precise datarace detection for multithreaded object-oriented programs
Choi, J.-D., Lee, K., Loginov, A., O'Callahan, R., Sarkar, V., & Sridharan, M. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512560 · Cited by 441
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
Effective static race detection for Java
Naik, M., Aiken, A., & Whaley, J. (2006) · Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1133981.1134018 · Cited by 431
Atomizer: a dynamic atomicity checker for multithreaded programs
Flanagan, C., & Freund, S. N. (2004) · Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/964001.964023 · Cited by 409
Effective static race detection for Java
Naik, M., Aiken, A., & Whaley, J. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134018 · Cited by 408
A type and effect system for atomicity
Flanagan, C., & Qadeer, S. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781169 · Cited by 304
KISS: keep it simple and sequential
Qadeer, S., & Wu, D. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996845 · Cited by 297
Ownership, encapsulation and the disjointness of type and effect
Clarke, D., & Drossopoulou, S. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582447 · Cited by 257
Metadata
- Authors
- Boyapati, C., & Rinard, M.
- Venue
- Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
- Publisher
- ACM
- Published
- 2001-10
- Pages
- 56-69
- OpenAlex
- W2103957752
- Cited by
- 296
- References
- 23
- FWCI
- 16.76
- 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.