Identifying Procedural Structure in Cobol Programs
John Field, G. Ramalingam
PASTE 1999
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.
John Field, G. Ramalingam
PASTE 1999
Frank Tip, Jong-Deok Choi, et al.
OOPSLA 1996
G. Ramalingam
Theoretical Computer Science
J. Field, D. Goyal, et al.
Science of Computer Programming