Affiliation:
1. IBM T.J. Watson Research Center, Yorktown Heights, NY
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference14 articles.
1. Lecture Notes in Computer Science;GRUNWALD D.
2. HOPCROFT J. E. AND ULLMAN J. D. 1979. Introduction to Automata Theory Languages and Computation. Addison-Wesley Reading MA. HOPCROFT J. E. AND ULLMAN J. D. 1979. Introduction to Automata Theory Languages and Computation. Addison-Wesley Reading MA.
Cited by
173 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Round- and context-bounded control of dynamic pushdown systems;Formal Methods in System Design;2023-07-07
2. Fast Graph Simplification for Interleaved-Dyck Reachability;ACM Transactions on Programming Languages and Systems;2022-05-27
3. Study on the classification model of lock mechanism in operating system;2022 IEEE 2nd International Conference on Power, Electronics and Computer Applications (ICPECA);2022-01-21
4. Efficient algorithms for dynamic bidirected Dyck-reachability;Proceedings of the ACM on Programming Languages;2022-01-12
5. Context-bounded verification of thread pools;Proceedings of the ACM on Programming Languages;2022-01-12