The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Context-sensitive synchronization-sensitive analysis is undecidable
Open accessAbstract
Static program analysis is concerned with the computation of approximations of the runtime behavior of programs. Precise information about a program's runtime behavior is, in general, uncomputable for various different reasons, and each reason may necessitate making certain approximations in the information computed. This article illustrates one source of difficulty in static analysis of concurrent programs. Specifically, the article shows that an analysis that is simultaneously both context-sensitive and synchronization-sensitive (that is, a context-sensitive analysis that precisely takes into account the constraints on execution order imposed by the synchronization statements in the program) is impossible even for the simplest of analysis problems.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
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
守屋, 悦. (1980) · 情報処理 · Cited by 1,791
Precise interprocedural dataflow analysis via graph reachability
Reps, T., Horwitz, S., & Sagiv, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199462 · Cited by 1,170
A unified approach to global program optimization
Kildall, G. A. (1973) · Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73 · doi:10.1145/512927.512945 · Cited by 916
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 84
Cited by
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
A Survey of Automated Techniques for Formal Software Verification
D'Silva, V., Kroening, D., & Weissenbacher, G. (2008) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2008.923410 · Cited by 378
Interprocedural slicing using dependence graphs
Horwitz, S., Reps, T., & Binkley, D. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989419 · Cited by 372
A brief survey of program slicing
Xu, B., Qian, J., Zhang, X., Wu, Z., & Chen, L. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1050849.1050865 · Cited by 313
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
Metadata
- Authors
- Ramalingam, G.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 2000-03
- Volume
- 22
- Issue
- 2
- Pages
- 416-430
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2060345611
- Cited by
- 275
- References
- 7
- FWCI
- 6.66
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Context-sensitive synchronization-sensitive analysis is undecidable. https://app.cochat.ai/papers/10.1145/349214.349241
- The paper
- Ramalingam, G. (2000). Context-sensitive synchronization-sensitive analysis is undecidable. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/349214.349241
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.