Detection and Verification of Program Behavior : A Graph Grammar Approach

M Sivalakshmi, T Devi, K Ayyapparaja
In this work, a semi-automatic graph grammar approach is developed to retrieving the hierarchical structure of the program behavior. The hierarchical structure is built on recurring substructures in a bottom-up fashion. Formulate the behavior discovery and verification problem as a graph grammar induction and parsing problem, i.e., automatically iteratively mining qualified patterns and then constructing graph rewriting rules. The syntax of the grammar represents the behavioral properties of
more » ... al properties of that program. Source code realizing certain functionality could be reused for different programs. Therefore, programs may have similar behavioral properties when they execute similar functionalities. Furthermore, using the induced grammar to parse the behavioral structure of a new program could verify if the program has the same behavioral properties specified by the grammar.