Generating Program Contexts

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2628)


In the previous chapter we have introduced a new data structure named program contexts. Moreover, we have explained how to compute program contexts for a variety of program statements. However, the denotational semantic approach as used in the previous chapter cannot deal with more complex control flow such as GOTO statements. Although there are algorithms [4] that translate a program containing GOTOs to a well-structured program, the relationship between analyzed program and analysis information would be hidden. Hence, we introduce an algorithm that computes program contexts for programs that are represented by control flow graphs(CFG). By using CFGs the control flow of a program is abstracted as a graph and syntactical details such as GOTOs, IFs, etc. are encoded in the graph.


Path Condition Control Flow Graph Call Graph Loop Body Successor Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Personalised recommendations