Abstract
We present a way of program derivation that is applicable to a wide class of searching problems. Compared to more conventional approaches, this method yields very elegant programs. For a general problem specification, we derive a rather general program scheme. For the specific problem at hand, the general scheme is refined — depending on the mathematical properties of the objects involved — to a particular program. This is illustrated by some examples, varying from elementary problems to more advanced problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W., Feijen, W.H.J. A method of programming. Addison-Wesley (1988)
Manber, Udi Using induction to design algorithms. Communications of the ACM 31 (Nov. 1988) 1300–1313
Dijkstra, E.W., Feijen, W.H.J. The linear search revisited. EWD1029, The University of Texas at Austin (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaldewaij, A., Schoenmakers, B. (1989). Searching by elimination. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-51305-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51305-6
Online ISBN: 978-3-540-46191-3
eBook Packages: Springer Book Archive