Abstract
We report on a case study to assess the use of an advanced knowledge-based software design technique with programmers who have not participated in the technique's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a transportation net. Construction of the second algorithm involves extending the KIDS knowledge base. Experience with the case study leads us to integrate the approach with the spiral and prototyping models of software engineering, and to discuss ways to deal with incomplete design knowledge.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bibel, W. 1980. Syntax-directed, semantics-supported program synthesis. Artificial Intelligence, 14:243-261.
Boehm, B.W. 1988. A spiral model of software development and enhancement. IEEE Computer, 21(5):61-72.
Constable, R. et al. 1986. Implementing Mathematics with the Nuprl Proof Development System, Prentice Hall.
Dershowitz, N. 1983. The Evolution of Programs, Birkhäuser.
Dick, S. 1994. Eine Fallstudie zur Entwicklung korrekter Software: Steuerung einer Gepäckförderanlage. Master's thesis, Dept. of Computer Science, Technical University of Berlin.
Gries, D. 1981. The Science of Programming, Springer-Verlag.
Heisel, M., Santen, T., and Zimmermann, D. 1995. Tool support for formal software development: A generic architecture. In Software Engineering—ESEC'95, W. Schäfer and P. Botella (Eds.), LNCS 989, Springer Verlag, pp. 272-293.
Kolyang, Santen, T., and Wolff, B. 1996. Correct and user-friendly implementation of transformation systems. In FME'96—Industrial Benefits and Advances in Formal Methods, LNCS, Springer Verlag.
Kreitz, C. 1993. Meta-Synthesis. Deriving Programs that Develop Programs, Technische Hochschule Darmstadt.
Lowry, M. and McCartney, R.D. (Eds.) 1991. Automating Software Design, Menlo Park: AAAI Press.
Manna, Z. and Waldinger, R. 1980. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, 2:90-121.
Morgan, C. 1990. Programming from Specifications, Prentice Hall.
Paulson, L.C. 1994. Isabelle—A Generic Theorem Prover, LNCS 828, Springer Verlag.
Smith, D.R. and Lowry, M.R. 1989. Algorithm theories and design tactics. In Proc. International Conference on Mathematics of Program Construction, J. van de Snepscheut (Ed.), Lecture Notes in Computer Science 375, Springer Verlag, 379-398.
Smith, D.R. 1987. Structure and design of global search algorithms. Technical Report Kes.U.87.12, Kestrel Institute.
Smith, D.R. 1990. KIDS: A semiautomatic program development system. IEEE Transactions on Software Engineering, 16(9):1024-1043.
Smith, D.R. and Parra, E.A. 1993. Transformational approach to transportation scheduling. In Proceedings of the Eighth Knowledge-Based Software Engineering Conference, Chicago.
Smith, D.R., Parra, E.A., and Westfold, S.J. 1995. Synthesis of high-performance transportation schedulers. Technical Report KES.U.95.6, Kestrel Institute.
Srinivas, J.V. and Jüllig, J. 1995. Specware: Formal support for composing software. In Proceedings of the Third Conference on Mathematics of Program Construction.
Pressburger, T.T., Gilham, L., and Smith, D.R. 1991. Kestrel Interactive Development System, Version 1.0, Kestrel Institute.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dick, S., Santen, T. Searching for a Global Search Algorithm. Automated Software Engineering 4, 7–31 (1997). https://doi.org/10.1023/A:1008651528183
Issue Date:
DOI: https://doi.org/10.1023/A:1008651528183