A Grammar-Based Reverse Engineering Framework for Behavior Verification

A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system's actual performance complies with the requirement, an effective reasoning and verification mechanism is needed. This paper presents a graph grammar based reverse engineering framework for the behavior verification of high assurance systems. It casts the program verification problem to a visual language parsing problem, i.e. parsing the graphical representation of program behavior with user-specified constraints and properties expressed as a graph grammar. The approach allows developers to check the acceptable sequence of method calls corresponding to the specifications for some requirements.