STATE CONSTRAINTS AND PATHWISE DECOMPOSITION OF PROGRAMS

被引：5

作者：

HUANG, JC

机构：

[1] Department of Computer Science, University of Houston, Houston

来源：

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1990年 / 16卷 / 08期

关键词：

Pathwise decomposition; program analysis; program decomposition; program simplification; program testing; program understanding; state constraints;

D O I：

10.1109/32.57625

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 [计算机软件与理论]; 0835 [软件工程];

摘要：

A state constraint is a new programming construct designed to restrict the domain of definition of a program. It can be used to decompose a program pathwise, i.e., to divide the program into subprograms along the control flow, as opposed to divide the program across the control flow when the program is decomposed into functions and procedures. As a result one can now construct and manipulate a program consisting of one or more execution paths of another program. This paper describes the idea involved, examines the properties of state constraints, establishes a formal basis for pathwise decomposition, and discusses their utilities in program simplification, testing, and verification. © 1990 IEEE

引用

页码：880 / 896

页数：17