DocumentCode
2570909
Title
Path expression in data flow program testing
Author
Laski, Janusz
Author_Institution
Dept. of Comput. Sci. & Eng., Oakland Univ., Rochester, MI, USA
fYear
1990
fDate
31 Oct-2 Nov 1990
Firstpage
570
Lastpage
576
Abstract
The language of regular expressions is used for the identification of constructors of definition-use chains. Activation of the chains is essential for all data flow testing strategies. The algorithm is based on the node-elimination method of J.A. Brzozowski and E.J. McCluskey (1963). It generates a regular expression that represents the (possibly infinite) set of all constructors of the chain involved. A particular path can then be derived from that expression. The algorithm has been implemented as an extension to STAD, a recently implemented system for testing and debugging
Keywords
program testing; programming theory; STAD; data flow program testing; definition-use chains; node-elimination method; regular expressions; Algorithm design and analysis; Automation; Computer science; Data analysis; Data flow computing; Debugging; Flow graphs; Input variables; Pattern analysis; System testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1990. COMPSAC 90. Proceedings., Fourteenth Annual International
Conference_Location
Chicago, IL
Print_ISBN
0-8186-2054-4
Type
conf
DOI
10.1109/CMPSAC.1990.139433
Filename
139433
Link To Document