Algorithm synthesis by lazy thinking: Examples and implementation in theorema

Electronic Notes in Theoretical Computer Science

Volumn 93, Issue , 2004, Pages 24-59

  Buchberger, Bruno ^a   Crǎciun, Adrian ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Algorithm correctness; Algorithm invention; Algorithm schemes; Algorithm verification; Conjecture generation; Didactics of programming; Lazy thinking; Learning from failure; Program synthesis; Re usable algorithms; Requirement engineering

Indexed keywords

COMPUTER PROGRAMMING; KNOWLEDGE BASED SYSTEMS; LEARNING SYSTEMS; MERGING; SORTING; THEOREM PROVING;

ALGORITHM CORRECTNESS; ALGORITHM INVENTION; ALGORITHM SCHEMES; ALGORITHM VERIFICATION; CONJECTURE GENERATION; LAZY THINKING; LEARNING FROM FAILURE; PROGRAM SYNTHESIS; RE-USABLE ALGORITHMS; REQUIREMENT ENGINEERING;

ALGORITHMS;

EID: 18944377207     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2003.12.027     Document Type: Conference Paper

References (21)

1. Armando A., Smaill A., Green I. Automatic Synthesis of Recursive Programs: the Proof-Planning Paradigm. Automated Software Engineering. 6:1999;329-356
2. Asperti A., Buchberger B., Davenport J.H. Mathematical Knowledge Management, Proc. of the Second International Conference on Mathematical Knowledge Management, MKM 2003, February 2003, Bertinoro, Italy. Lecture Notes in Computer Science. Vol. 2594:2003;223 Springer, Berlin - Heidelberg - New York
3. Basin, D., Y. Deville, P. Flener, A. Hamfelt, J. Fischer Nilsson. Synthesis of Programs in Computational Logic. In: M. Bruynooghe and K.K. Lau, "Program Development in Computational Logic", Springer-Verlag, to appear
4. Buchberger B. Theory Exploration with Theorema. Jebelean T., Negru V., Popovici A. Proceedings of SYNASC 2000, 2nd International Workshop on Symbolic and Numeric Algorithms in Scientific Computing, Oct. 4-6, 2000, Timisoara, Rumania Analele Universitatii Din Timisoara, Ser. Matematica-Informatica. XXXVIII:(Fasc.2):2000;9-32
5. Buchberger B. Algorithm Invention and Verification by Lazy Thinking. Petcu D., Negru V., Zaharie D., Jebelean T. Proceedings of SYNASC 2003 (Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, October 1-4). 2003;2-26 Mirton Publishing. ISBN 973-661-104-3
6. Buchberger, B., Algorithm Retrieval: Concept Clarification and Case Study in Theorema. SFB Scientific Computing, Technical Report 2003-25, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, October 2003
7. Buchberger B., Caprotti O. Electronic Proceedings of the 1st International Workshop of Mathematical Knowledge Management. September 24-26, 2001;Research Institute for Symbolic Computation (RISC), Hagenberg, Austria, http://www.risc.uni-linz.ac.at/institute/conferences/MKM2001/
8. Buchberger B., Jebelean T., Kriftner F., Marin M., Vasaru D. An Overview on the Theorema Project. Kuechlin W. Proceedings of ISSAC'97. International Symposium on Symbolic and Algebraic Computation, Maui, Hawaii, July 21-23, 1997 :1997;384-391 ACM Press
9. Buchberger B., Dupre C., Jebelean T., Kriftner F., Nakagawa K., Vasaru D., Windsteiger W. Theorema: A Progress Report. Kerber M., Kohlhase M. Symbolic Computation and Automated Reasoning. Proceedings of CALCULEMUS 2000, Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, August 6-7, 2000, St. Andrews, Scotland :2000;98-113 A.K. Peters, Natick, Massachusetts
10. Buchberger B., Gonnet G., Hazewinkel M. Mathematical Knowledgement Management. Special Issue of the Journal Annals of Mathematics and Artificial Intelligence. 38:(1-3):2003;. Kluwer Academic Publishers
11. Farmer, W. (ed.), The First North American Workshop on MKM (NA-MKM2002) in Hamilton, Ontario, Canada, http://imps.mcmaster.ca/na-mkm-2002/
12. Flener, P., Logic Program Schemata: Synthesis and Analysis. Technical Report BU-CEIS-9502, Bilkent University, Ankara (Turkey), 1995
13. Flener P., Lau K.K., Ornaghi M. Correct-schema-guided Synthesis of Steadfast Programs. Proceedings of the Twelfth IEEE International Automated Software Engineering Conference. 1997;153-160 IEEE Computer Society
14. Kraan, I., "Logic Program Synthesis via Proof Planning". Phd. thesis, Department of Artificial Intelligence, University of Edinburgh, 1993
15. Schmidt D.C., Johnson R.E., Fayad M. Software Patterns. Guest editorial for the Communications of the ACM, Special Issue on Patterns and Pattern Languages. 39:(10):October 1996
16. Smith D.R. Top-Down Synthesis of Divide-and-Conquer Algorithms. Artificial Intelligence. 27:(1):1985;43-96
17. Reprinted Rich C., Waters R. Readings in Artificial Intelligence and Software Engineering. 1986;35-61 Morgan Kaufmann Pub. Co, Los Altos, CA
18. Smith D.R. KIDS: A semiautomatic program development system. Kerber M., Kohlhase M. (eds.)IEEE Transactions on Software Engineering Special Issue on Formal Methods in Software Engineering. 16:(9):1990;1024-1043
19. Smith D.R. Mechanizing the Development of Software. Broy M., Steinbrueggen R. Calculational System Design, Proceedings of the NATO Advance Study Institute. 1999;251-292 IOS Press, Amsterdam
20. Srinivas Y.V., Jüllig R. Specware: Formal support for composing software. Moeller B. Proceedings of the Conference on Mathematics of Program Construction. LNCS. 947:1995;399-422 Springer-Verlag, Berlin
21. http://hillside.net/patterns