Issue No. 08 - August (1990 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.57625
<p>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.</p>
state constraint; programming construct; program pathwise; subprograms; control flow; execution paths; formal basis; pathwise decomposition; program simplification; testing; verification; computational complexity; program testing; software engineering.
J. Huang, "State Constraints and Pathwise Decomposition of Programs," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 880-896, 1990.