Cumulative subgoal fulfillment in software development

Authors:
Eric J. Braude
Affiliations:
Boston University Metropolitan College, Boston, MA
Venue:
SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
Year:
2007

Citing 7
Cited 0

A Formal Model of Program Dependences and its Implications for Software Testing, Debugging, and Maintenance

IEEE Transactions on Software Engineering
Dynamically Discovering Likely Program Invariants to Support Program Evolution

IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
The Science of Programming

The Science of Programming
Applying "Design by Contract"

Computer
Dynamically discovering likely program invariants

Dynamically discovering likely program invariants
Computing versus human thinking

Communications of the ACM - The patent holder's dilemma: buy, sell, or troll?
The Daikon system for dynamic detection of likely invariants

Science of Computer Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper introduces a new approach to programming that facilitates the construction and verification of applications. Called "Cumulative Subgoal Fulfillment" (CSF), it implements procedures by fulfilling and accumulating a sufficient set of subgoals. Each code block fulfilling a subgoal must keep invariant all subgoals already fulfilled. Using well-known programming problems, the paper demonstrates that CSF is new and that its simple form facilitates both the creation and checking of code.