DocumentCode
1709466
Title
A formal automated approach for reverse engineering programs with pointers
Author
Gannod, Gerald C. ; Cheng, Betty H C
fYear
1997
Firstpage
219
Lastpage
226
Abstract
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S,Q), is defined as the strongest condition that holds after the execution of S, given that S terminates. By defining the formal semantics of each of the constructs of a programming language, a formal specification of the behavior of a program written using the given programming language can be constructed. In this paper we address the formal semantics of pointers in order to handle a realistic model of programming languages that incorporate the use of pointers. In addition, we present a tool for supporting the construction of formal specifications of programs that include the use of pointers
Keywords
formal specification; reverse engineering; software maintenance; formal automated approach; formal semantics; formal specification; formal specifications; pointers; programming language; reverse engineering programs; Computer languages; Computer science; Costs; Electronic mail; Formal specifications; NASA; Programming; Propulsion; Reverse engineering; Software maintenance;
fLanguage
English
Publisher
ieee
Conference_Titel
Automated Software Engineering, 1997. Proceedings., 12th IEEE International Conference
Conference_Location
Incline Village, NV
Print_ISBN
0-8186-7961-1
Type
conf
DOI
10.1109/ASE.1997.632842
Filename
632842
Link To Document