Abstract
Quality software must be reusable, extensible, and reliable. Object-oriented programming purports to achieve these attributes by the use of classes and inheritance (informally). In this paper, we show how our existing approach to deductive synthesis of logic programs can serve as the basis for an object-oriented methodology for formal program development that achieves reusability, extensibility and correctness (formally).
The first author is on leave from the Department of Computer Science, University of Manchester, UK, and is supported by the European Union HCM project on Logic Program Synthesis and Transformation, contract no. 93/414.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bertoni, G. Mauri and P. Miglioli. On the power of model theory in specifying abstract data types and in capturing their recursiveness. Fundamenta Informaticae VI(2):127–170, 1983.
A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Modular logic programming. ACM TOPLAS 16(4):1361–1398, 1994.
K.M. Bruce. A paradigmatic object-oriented programming language: Design, static typing and semantics. J. Functional Programming 4(2):127–206, 1994. Special issue: Type systems for object-oriented programming.
M. Bugliesi, E. Lamina and P. Mello. Modularity in logic programming. J. Logic Programming 19,20:443–502, 1994. Special issue: Ten years of logic programming.
C.C. Chang and H.J. Keisler. Model Theory. North-Holland, 1973.
Y. Deville and K.K. Lau. Logic program synthesis. J. Logic Programming 19,20:321–350, 1994. Special issue: Ten years of logic programming.
J. Functional Programming 4(2), 1994. Special issue: Type systems for objectoriented programming.
K.K. Lau and M. Ornaghi. On specification frameworks and deductive synthesis of logic programs. In L. Fribourg and F. Turini, editors, Proc. LOPSTR 94 and META 94, Lecture Notes in Computer Science 883, pages 104–121, Springer-Verlag, 1994.
K.K. Lau, M. Ornaghi and S.-A. Tärnlund. The halting problem for deductive synthesis of logic programs. In P. van Hentenryck, editor, Proc. 11th Int. Conf. on Logic Programming, pages 665–683, MIT Press, 1994.
K.K. Lau, M. Ornaghi and S.-Å. Tärnlund. Steadfast logic programs. Submitted to J. Logic Programming.
F.G. McCabe. L& O: Logic and Objects. Prentice-Hall, 1992.
B. Meyer. Object-oriented Software Construction. Prentice Hall, 1988.
B. Meyer. Eiffel the Language. Prentice Hall, 1992.
P. Miglioli, U. Moscato and M. Ornaghi. Abstract parametric classes and abstract data types defined by classical and constructive logical methods. J. Symb. Comp. 18:41–81, 1994.
C.D.S. Moss. Prolog++ The Power of Object-Oriented and Logic Programming. Addison Wesley, 1994.
J. Palsberg and M.I. Schwartzbach. Object-Oriented Type Systems. Wiley, 1994.
M. Wirsing. Algebraic specification. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 675–788. Elsevier, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lau, K.K., Ornaghi, M. (1996). Towards an object-oriented methodology for deductive synthesis of logic programs. In: Proietti, M. (eds) Logic Program Synthesis and Transformation. LOPSTR 1995. Lecture Notes in Computer Science, vol 1048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60939-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-60939-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60939-1
Online ISBN: 978-3-540-49745-5
eBook Packages: Springer Book Archive