Skip to main content
SpringerLink
Log in

Specialising Logic Programs with Respect to Call/Post Specifications

  • Conference paper
  • First Online:
Logic-Based Program Synthesis and Transformation (LOPSTR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1559))

  • 196 Accesses

Abstract

In this paper we present a program specialisation method which, given a call/post specification, transforms a logic program into a weakly call-correct one satisfying the post-condition. The specialisation is applied to specialised partially correct programs. This notion is based on the definition of specialised derivation which is intended to describe program behaviour whenever some properties on procedure calls are assumed. Top-down and bottom-up semantics of specialised derivations are recalled.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. K. R. Apt. Introduction to Logic Programming. In J. vanLeeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.

    Google Scholar 

  2. K. R. Apt. Program verification and prolog. In E. Börger, editor, Specification and Validation Methods for Programming Languages and Systems, pages 55–95. Oxford University Press, Oxford, 1995.

    Google Scholar 

  3. K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.

    Google Scholar 

  4. A. Bossi and N. Cocco. Verifying Correctness of Logic Programs. In G. Levi and M. Martelli, editors, Proc. Sixth Int’l Conf. on Logic Programming, pages 96–110. Springer-Verlag, Berlin, 1989.

    Google Scholar 

  5. A. Bossi, N. Cocco, and S. Dulli. A Method for Specializing Logic Programs. ACM Transactions on Programming Languages and Systems, 12(2):253–302, 1990.

    Article  Google Scholar 

  6. A. Bossi, M. Martelli, M. Gabrielli, and G. Levi. The s-semantics approach: theory and applications. Journal of Logic Programming, 19-20:149–197, 1994.

    Article  Google Scholar 

  7. A. Bossi and S. Rossi. Specialised semantics of logic programs. Technical Report CS-98-11, Dipartimento di Matematica e Informatica, Università di Venezia, 1998.

    Google Scholar 

  8. K. L. Clark. Predicate logic as a computational formalism. Research Report DOC 79/59, Imperial College, Department of Computing, London, 1979.

    Google Scholar 

  9. L. Colussi and E. Marchiori. Proving correctness of logic programs using axiomatic semantics. In Proc. Eighth Int’l Conf. on Logic Programming, pages 629–644. The MIT Press, Cambridge,Mass., 1991.

    Google Scholar 

  10. P. Deransart. Proof methods of declarative properties of definite programs. Theoretical Computer Science, 118:99–166, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  11. W. Drabent and J. Maluszynski. Inductive Assertion Method for Logic Programs. Theoretical Computer Science, 59(1):133–155, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A new Declarative Semantics for Logic Languages. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int’l Conf. on Logic Programming, pages 993–1005. The MIT Press, Cambridge,Mass., 1988.

    Google Scholar 

  13. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3):289–318, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A model-theoretic reconstruction of the operational semantics of logic programs. Theoretical Computer Science, 103(1):86–113, 1993.

    MATH  MathSciNet  Google Scholar 

  15. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.

    MATH  Google Scholar 

  16. J. W. Lloyd and J. C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11:217–242, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  17. Lee Naish. Types and the intended meaning of logic programs. In Frank Pfenning, editor, Types in logic programming, pages 189–216. MIT Press, Cambridge, Massachusetts, 1992.

    Google Scholar 

  18. Lee Naish. Verification of logic programs and imperative programs. In Jean-Marie Jacquet, editor, Constructing logic programs, pages 143–164. Wiley, Chichester, England, 1993.

    Google Scholar 

  19. Lee Naish. A three-valued semantics for horn clause programs. Technical Report 98/4, Department of Computer Science, University of Melbourne, Melbourne, Australia, March 1998.

    Google Scholar 

  20. A. Pettorossi and M. Proietti. A theory of logic program specialization and generalization for dealing with input data properties. In Proceedings of Partial Evaluation, International Seminar, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

    Google Scholar 

  21. A. Takeuchi and K. Furukawa. Partial evaluation of Prolog programs and its application to metaprogramming. In Information Processing 86, pages 415–420, 1986.

    Google Scholar 

  22. M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733–742, 1976.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, via Torino 155, 30173, Venezia, Italy

    Annalisa Bossi & Sabina Rossi

Authors
  1. Annalisa Bossi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sabina Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Science, Uppsala University, Box 311, S-751 05, Uppsala, Sweden

    Pierre Flener

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bossi, A., Rossi, S. (1999). Specialising Logic Programs with Respect to Call/Post Specifications. In: Flener, P. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 1998. Lecture Notes in Computer Science, vol 1559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48958-4_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-48958-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65765-1

  • Online ISBN: 978-3-540-48958-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation