This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1976 (vol. 2 no. 4)
pp. 285-292
S.L. Gerhart, Department of Computer Science, Duke University
Backtracking is a well-known technique for solving combinatorial problems. It is of interest to programming methodologists because 1) correctness of backtracking programs may be difficult to ascertain experimentally and 2) efficiency is often of paramount importance. This paper applies a programming methodology, which we call control structure abstraction, to the backtracking technique. The value of control structure abstraction in the context of correctness is that proofs of general properties of a class of programs with similar control structures are separated from proofs of specific properties of individual programs of the class. In the context of efficiency, it provides sufficient conditions for correctness of an initial program which may subsequently be improved for efficiency while preserving correctness.
Index Terms:
program schema, Abstraction, backtracking, correctness-preserving transformations, program correctness, programming methodology
Citation:
S.L. Gerhart, L. Yelowitz, "Control Structure Abstractions of the Backtracking Programming Technique," IEEE Transactions on Software Engineering, vol. 2, no. 4, pp. 285-292, Dec. 1976, doi:10.1109/TSE.1976.233834
Usage of this product signifies your acceptance of the Terms of Use.