DocumentCode
1509145
Title
State constraints and pathwise decomposition of programs
Author
Huang, J.C.
Author_Institution
Dept. of Comput. Sci., Houston Univ., TX, USA
Volume
16
Issue
8
fYear
1990
fDate
8/1/1990 12:00:00 AM
Firstpage
880
Lastpage
896
Abstract
A state constraint is a programming construct designed to restrict a program´s domain of definition. It can be used to decompose a program pathwise, i.e. dividing the program into subprograms along the control flow, as opposed to dividing the program across the control flow when the program is decomposed into functions and procedures. As a result, a program consisting of one or more execution paths of another program can be constructed and manipulated. The author describes the idea involved, examines the properties of state constraints, establishes a formal basis for pathwise decomposition and discusses their uses in program simplification, testing and verification
Keywords
computational complexity; program testing; software engineering; control flow; execution paths; formal basis; pathwise decomposition; program pathwise; program simplification; programming construct; state constraint; subprograms; testing; verification; Aggregates; Capacitive sensors; Computer science; Testing;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.57625
Filename
57625
Link To Document