Model Checking Multithreaded Programs with Asynchronous Atomic Methods
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Gamma et al.'s 1994 book Design Patterns outlined patterns useful for object-oriented programming.
“An example is Gamma et al.'s 1994 book Design Patterns, which outlined patterns useful for object-oriented programming.12”
From A view of the parallel computing landscape (2009) · cites this paper as [12]
The Introduction discusses an asynchronous-method design idiom and cites Holub’s Taming Java Threads, while the References do not list Gamma et al.’s Design Patterns. Searches for Gamma, Design Patterns, and patterns for object-oriented programming found no passage addressing what that book outlined. (LLM, conf=0.78)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Construction of abstract state graphs with PVS
Graf, S., & Saı̈di, H. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63166-6_10 · Cited by 1,463 · see citing works
Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503279 · Cited by 1,167 · see citing works
Parikh, R. (1966) · Journal of the ACM · doi:10.1145/321356.321364 · Cited by 788 · see citing works
Well-structured transition systems everywhere!
Finkel, A., & Schnoebelen, P. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00102-x · Cited by 720 · see citing works
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
Dickson, L. E. (1913) · American Journal of Mathematics · doi:10.2307/2370405 · Cited by 502 · see citing works
Context-Bounded Model Checking of Concurrent Software
Qadeer, S., & Rehof, J. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31980-1_7 · Cited by 404 · see citing works
Learning Assumptions for Compositional Verification
Cobleigh, J. M., Giannakopoulou, D., & Păsăreanu, C. S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36577-x_24 · Cited by 400 · see citing works
The theory of well-quasi-ordering: A frequently discovered concept
Kruskal, J. B. (1972) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(72)90063-5 · Cited by 341 · see citing works
Modular verification of software components in C
Chaki, S., Clarke, E. M., Groce, A., et al. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.22 · Cited by 311 · see citing works
A type and effect system for atomicity
Flanagan, C., & Qadeer, S. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781169 · Cited by 304 · see citing works
Qadeer, S., & Wu, D. (2004) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/996841.996845 · Cited by 301 · see citing works
Ball, T., & Rajamani, S. K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44585-4_25 · Cited by 285 · see citing works
Context-sensitive synchronization-sensitive analysis is undecidable
Ramalingam, G. (2000) · ACM Transactions on Programming Languages and Systems · doi:10.1145/349214.349241 · Cited by 278 · see citing works
Context-Free Languages and Pushdown Automata
Autebert, J.-M., Jean Berstel, A., & Luc Boasson, B. (1997) · Springer eBooks · doi:10.1007/978-3-642-59136-5_3 · Cited by 245 · see citing works
A type and effect system for atomicity
Flanagan, C., & Qadeer, S. (2003) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/781131.781169 · Cited by 241 · see citing works
Decidability and complexity of Petri net problems — An introduction
Esparza, J. (1998) · Lecture notes in computer science · doi:10.1007/3-540-65306-6_20 · Cited by 217 · see citing works
A direct symbolic approach to model checking pushdown systems
Finkel, A., Willems, B., Wolper, P., et al. (1997) · ORBi (University of Liège) · Cited by 176 · see citing works
On the regular structure of prefix rewriting
Caucal, D. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90278-n · Cited by 161 · see citing works
A generic approach to the static analysis of concurrent programs with procedures
Bouajjani, A., Esparza, J., & Touili, T. (2003) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/604131.604137 · Cited by 146 · see citing works
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
Bouajjani, A., Müller-Olm, M., & Touili, T. (2005) · Lecture notes in computer science · doi:10.1007/11539452_36 · Cited by 131 · see citing works
Thread-Modular Abstraction Refinement
Henzinger, T. A., Jhala, R., Majumdar, R., et al. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45069-6_27 · Cited by 118 · see citing works
Transactional Monitors for Concurrent Objects
Welc, A., Jagannathan, S., & Hosking, A. L. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24851-4_24 · Cited by 102 · see citing works
Ringenburg, M. F., & Grossman, D. (2005) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1086365.1086378 · Cited by 100 · see citing works
Moller, F. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61604-7_56 · Cited by 91 · see citing works
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Esparza, J., & Podelski, A. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325697 · Cited by 83 · see citing works
Reachability analysis of multithreaded software with asynchronous\n communication
Bouajjani, A., Esparza, J., Schwoon, S., et al. (2005) · Fachbereich Informatik (University of Stuttgart) · Cited by 62 · see citing works
The regular viewpoint on PA-processes
Lugiez, D., & Schnoebelen, P. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00306-6 · Cited by 52 · see citing works
Holub, A. (2000) · Apress eBooks · doi:10.1007/978-1-4302-1129-7 · Cited by 27 · see citing works
Constraint-Based Inter-Procedural Analysis of Parallel Programs
Seidl, H., & Steffen, B. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46425-5_23 · Cited by 22 · see citing works
Precise interprocedural dependence analysis of parallel programs
Müller-Olm, M. (2003) · Theoretical Computer Science · doi:10.1016/j.tcs.2003.09.002 · Cited by 7 · see citing works
Flagged first, then by citations
Research works printed but not linked: 4
- [16]16. T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer. Thread-modular abstraction refine- ment. In Proc. of the 15th International Conference on Computer-Aided Verification (CAV), volume 2725 of LNCS, pages 262-274. Springer, 2003.
- [21]21. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Sys- tems. PhD thesis, Technical University Munich, 1998.
- [25]25. S. Qadeer, S. Rajamani, , and J. Rehof. Procedure summaries for model checking multi- threaded software. In Principles of Programming Languages (POPL'04), 2004.
- [27]27. S. Qadeer and D. Wu. KISS: keep it simple and sequential. In ACM SIGPLAN 2004 confer- ence on Programming language design and implementation, pages 14-24, 2004.
Cited by
Sorted by citations
A view of the parallel computing landscape
Asanovic, K., Bodik, R., Demmel, J., Keaveny, T., Keutzer, K., Kubiatowicz, J., Morgan, N., Patterson, D., Sen, K., Wawrzynek, J., et al. (2009) · Communications of the ACM · doi:10.1145/1562764.1562783 · Cited by 627 · see citing works
Self-citation
- Authors
- Sen, K., & Viswanathan, M.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 300-314
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1563374799
- Cited by
- 95
- References
- 30
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 1 · 2022: 3 · 2021: 5 · 2020: 2 · 2019: 3 · 2018: 1 · 2017: 6 · 2016: 5 · 2015: 9 · 2014: 9 · 2013: 9 · 2012: 13
- FWCI
- 4.83
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Lecture notes in computer science (publishedVersion)
- Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) (submittedVersion)
- Funders
- National Science Foundation (CAREER)
- Office of Naval Research (N00014-02-1-0715, N00014)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Keywords
- model checking, multithreaded programs, decidability, counterexample-guided abstraction refinement
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
