Specifying compositional units for correct program development in computational logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3049, Issue , 2004, Pages 1-29

  Lau, Kung Kiu ^a   Ornaghi, Mario ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749600791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25951-0_1     Document Type: Article

References (47)

1. J.R. Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
2. E. Astesiano, H.-J. Kreowski, and B. Krieg-Brückner, editors. Algebraic Foundations of Systems Specifications. Springer, 1999.
3. G. Atkinson et al. Component-based Product Line Engineering with UML. AddisonWesley, 2001.
4. J. Barwise, editor. Handbook of Mathematical Logic. North Holland, 1977.
5. 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.
6. R.H. Bourdeau and B. H.C. Cheng. A formal semantics for object model diagrams. IEEE Trans. Soft. Eng., 21(10):799-821, 1995.
7. M. Bugliesi, E. Lamma, and P. Mello. Modularity in logic programming. J. Logic Programming, 19,20:443-502, 1994. Special issue: Ten years of logic programming.
8. K.L. Clark. Predicate Logic as a Computational Formalism. Report 79/59, Imperial College of Science and Technology, University of London, 1979.
9. S. Cook, A. Kleppe, R. Mitchelf, B. Rumpe, J. Warmer, and A. Wills. The Amsterdam manifesto on OCL. In T. Clark and J. Warmer, editors, Object Modeling with the OCL: The Rationale behind the Object Constraint Language, LNCS 2263, pages 115-149. Springer, 2002.
10. Y. Deville. Logic Programming. Systematic Program Development. AddisonWesley, 1990.
11. Y. Deville and K.-K. Lau. Logic program synthesis. J. Logic Programming, 19,20:321-350, 1994. Special Issue: Ten Years of Logic Programming.
12. D.F. D'Souza and A.C. Wills. Objects, Components, and Frameworks with UML: The Catalysis Approach. Addison-Wesley, 1999.
13. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1. Springer-Verlag, 1987.
14. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 2. Springer-Verlag, 1989.
15. P. Flener, K.-K. Lau, and M. Ornaghi. On correct program schemas. In N. Fuchs, editor, Proc. LOPSTR 97, Lecture Notes in Computer Science 1463, pages 124-143. Springer-Verlag, 1998.
16. P. Flener, K.-K. Lau, M. Ornaghi, and J. Richardson. An abstract formalisation of correct schemas for program synthesis. Journal of Symbolic Computation, 30(1):93-127, July 2000.
17. J.H. Gallier. Logic for Computer Science: Foundations for Automatic Theorem Proving. Harper and Row, 1986.
18. C. Ghezzi, M. Jazayeri, and D.Mandrioli. Fundamentals of Sotware Engineering. Prentice Hall, second edition, 2003.
19. J.A. Goguen and R.M. Burstall. Institutions: Abstract model theory for specification and programming. J. ACM, 39(1):95-146, 1992.
20. J.V. Guttag and J.J. Horning. Larch: Languages and Tools for Formal Specification. Springer-Verlag, 1993.
21. W. Hodges. Logical Features of Horn Clauses. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 1:449-503, Oxford University Press, 1993.
22. C.J. Hogger. Derivation of Logic Programs. J. ACM, 28(2):372-392, 1981.
23. Isabelle: www.cl.cam.ac.uk/Research/HVG/Isabelle
24. C.B. Jones. Systematic Software Development Using VDM. Prentice Hall, second edition, 1990.
25. R.M. Jimenez, F. Orejas, and H. Ehrig. Compositionality and Compatibility of Parametrization and Parameter Passing in Specification Languages. Math. Struct, in Computer Science, 5:283-314, 1995.
26. C. Kreitz, K.-K. Lau, and M. Ornaghi. Formal reasoning about modules, reuse and their correctness. In D.M. Gabbay and H.J. Ohlbach, editors, Proc. Int. Conf. on Formal and Applied Practical Reasoning, Lecture Notes in Artificial Intelligence 1085, pages 384-399. Springer-Verlag, 1996.
27. 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.
28. K.-K. Lau and M. Ornaghi. Forms of logic specifications: A preliminary study. In J. Gallagher, editor, Proc. LOPSTR 96, Lecture Notes in Computer Science 1207, pages 295-312. Springer-Verlag, 1997.
29. K.-K. Lau and M. Ornaghi. The relationship between logic programs and specifications -the subset example revisited. J. Logic Programming, 30(3):239-257, March 1997.
30. K.-K. Lau and M. Ornaghi. OOD frameworks in component-based software development in computational logic. In P. Flener, editor, Proc. LOPSTR 98, Lecture Notes in Computer Science 1559, pages 101-123. Springer-Verlag, 1999.
31. K.-K. Lau and M. Ornaghi. Isoinitial semantics for logic programs. In J.W. Lloyd et al, editor, Proc. 1st Int. Conf. on Computational Logic, Lecture Notes in Artificial Intelligence 1861, pages 223-238. Springer-Verlag, 2000.
32. K.-K. Lau and M. Ornaghi. Correct object-oriented systems in computational logic. In A. Pettorossi, editor, Proc. LOPSTR 01, Lecture Notes in Computer Science 2372, pages 168-190. Springer-Verlag, 2002.
33. K.-K. Lau and M. Ornaghi. Specifying object-oriented systems in computational logic. In M. Bruynooghe, editor, Pre-Proceedings of LOPSTR 03, pages 49-64, 2003. Report CW 365, Dept. of Computer Science, Katholieke Universiteit Leuven, Belgium.
34. K.-K. Lau, M. Ornaghi, and S.-Å. Tärnlund. Steadfast logic programs. J. Logic Programming, 38(3):259-294, March 1999.
35. J.W. Lloyd. Foundations of Logic Programming. 2nd edn., Springer-Verlag, 1987.
36. T. Maibaum. Conservative extensions, interpretations between theories and all that. In M. Bidoit and M. Dauchet, editors, Proc. TAPSOFT '97: Theory and Practice of Software Developement, pages 40-67. Springer-Verlag, 1997. LNCS 1214.
37. Yu.V. Matijacevic. Recursively enumerable sets are Diophantine. Dokl. Akad. Nauk SSSR, 191:279-282, 1970.
38. P. Miglioli, U.Moscato, and M. Ornaghi. Abstract parametric classes and abstract data types defined by classical and constructive logical methods. J. Symbolic Computation, 18:41-81, 1994. -
39. P. Miglioli, U.Moscato, and M. Ornaghi. An algebraic framework for the definition of compositional semantics of normal logic programs. The Journal of Logic Programming, 40:89-123, 1999.
40. M.G. Read and E.A. Kazmierczak. Formal program development in modular Prolog: A case study. In T.P. Clement and K.-K. Lau, editors, Proc. LOPSTR 91, pages 69-93. Springer-Verlag, 1992.
41. J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison-Wesley, 1999.
42. D. Sannella, S. Sokolowski, and A. Tarlecki. Toward formal development of programs from algebraic specifications: parametrisation revisited. Acta. Informatica, 29(8):689-736, 1992.
43. D. Sannella and A. Tarlecki. Extended ML: past, present and future. In Proc. 7th workshop on specification of abstract data types, LNCS 534, pages 297-322. Springer-Verlag, 1991.
44. D. Sannella and L.A. Wallen. A calculus for the construction of mdular prolog programs. In IEEE 4th Symposium on Logic Programming, IEEE, 1987.
45. J.M. Spivey. The Z Notation: A Reference Manual. Prentice Hall, second edition, 1992.
46. C. Szyperski, D. Gruntz, and S. Murer. Component Software: Beyond ObjectOriented Programming. Addison-Wesley, second edition, 2002.
47. M. Wirsing. Algebraic specification. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 675-788. Elsevier, 1990.