Title :
Eliminating non-traversable paths from structured programs
Author :
Pleszkoch, Mark G. ; Linger, Richard C. ; Hevner, Alan R.
Author_Institution :
IBM Corp., Gaithersburg, MD, USA
Abstract :
A formal procedure is given based on the use of regular expressions, to identify and eliminate nontraversable paths in a structured program. By reducing the use of control variables, the program is transformed into an unstructured variant and then restructured into a semantic equivalent of the original program with nontraversable paths eliminated. The authors demonstrate this procedure with an example and discuss its maintenance advantages
Keywords :
software maintenance; structured programming; control variables; formal procedure; nontraversable paths; reengineering; regular expressions; semantic equivalent; software maintenance; structured program; unstructured variant; Educational institutions; IEEE Policy and Procedures; Information systems; Lakes; Logic; Milling machines; Productivity; Programming profession; Software maintenance; Technology management;
Conference_Titel :
Software Maintenance, 1992. Proceerdings., Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
0-8186-2980-0
DOI :
10.1109/ICSM.1992.242547
