Abstract
We report on a case study in using logical frameworks to support the formalization of programming calculi and their application to deduction-based program synthesis. Within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development that can simulate those of the deductive tableau proposed by Manna and Waldinger. We have used the resulting theory to synthesize a library of verified programs, focusing on sorting algorithms. Our experience suggests that the methodology we propose is well suited both to implement and use programming calculi, extend them, partially automate them, and even formally reason about their correctness.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Penny Anderson and David Basin. Deriving and applying logic program transformers. In Algorithms, Concurrency and Knowledge (1995 Asian Computing Science Conference), pages 301–318, Pathumthani, Thailand, December 1995. Springer-Verlag, LNCS 1023.
Abdelwaheb Ayari. A reinterpretation of the deductive tableaux system in higher-order logic. Master's thesis, University of Saarbrücken, 1995. Available at http://www.mpi-sb.mpg.de/»bdu/dts.ps.Z.
David Basin. Logic frameworks for logic programs. In 4th International Workshop on Logic Program Synthesis and Transformation, (LOPSTR'94), pages 1–16, Pisa, Italy, June 1994. Springer-Verlag, LNCS 883.
CIP System Group: F. L. Bauer et al. The Munich Project CIP, Volume II: The Program Transformation System CIP-S, volume 292 of Lecture Notes in Computer Science. Springer-Verlag, 1987.
Rod M. Burstall and Joseph A. Goguen. Putting theories together to make specifications. In 5th IJCAI, pages 1045–1058, Boston, Mass, 1977.
Martin David Coen. Interactive program derivation. Technical Report 272, Cambridge University Computer Laboratory, Cambridge, November 1992.
Melvin Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, New York, 1990.
Berthold Hoffmann and Bernd Krieg-Brückner (Eds.). Program Development by Specification and Transformation. Springer LNCS 680, 1993.
Gérard Huet and Bernard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, pages 31–55, 1978.
Ina Kraan, David Basin, and Alan Bundy. Middle-out reasoning for synthesis and induction. To appear in the Journal of Automated Reasoning.
Ina Kraan, David Basin, and Alan Bundy. Middle-out reasoning for logic program synthesis. In 10th International Conference on Logic Programming (ICLP93), pages 441–455, Budapest Hungary, 1993.
Zohar Manna and Richard Waldinger. Fundamentals of the deductive program synthesis. IEEE Transactions on Software Engineering, January 1992.
Lawrence C. Paulson. Isabelle: a generic theorem prover; with contributions by Tobias Nipkow. LNCS-828. Springer, Berlin, 1994.
Frank Pfenning. Logic programming in the LF logical framework. In Logical Frameworks, pages 149–181. Cambridge University Press, 1991.
Franz Regensburger. HOLCF: Eine konservative Erweiterung von HOL um LCF. PhD thesis, Technical University, Munich, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ayari, A., Basin, D.A. (1996). Generic system support for deductive program development. In: Margaria, T., Steffen, B. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1996. Lecture Notes in Computer Science, vol 1055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61042-1_52
Download citation
DOI: https://doi.org/10.1007/3-540-61042-1_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61042-7
Online ISBN: 978-3-540-49874-2
eBook Packages: Springer Book Archive