Skip to main content
SpringerLink
Log in

Abstract: Proof Planning with Program Schemas

  • 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))

  • 194 Accesses

Abstract

Schema-based program synthesis and transformation techniques tend to be either pragmatic, designed for carrying out real program transformation or synthesis operations but lacking the logical basis to ensure correctness of the programs they synthesise/transform, or rigorous, with strong theoretical foundations, but generating proof obligations which are difficult to satisfy.

The author is supported by EPSRC Grant GR/L11724

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

References

  1. A. Bundy, A. Smaill, and J. Hesketh. Turning eureka steps into calculations in automatic program synthesis. In S. L.H. Clarke, editor, Proceedings of UK IT 90, pages 221–6. IEE, 1990. Also available from Edinburgh as DAI Research Paper 448.

    Google Scholar 

  2. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62:185–253, 1993. Also available from Edinburgh as DAI Research Paper No. 567.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Flener, K.-K. Lau, and M. Ornaghi. On correct program schemas. In N. E. Fuchs, editor, LOPSTR’ 97: Proceedings of the Seventh International Workshop on Logic Program Synthesis and Transformation, Leuven, Belgium, July 10–12 1997, volume 1463 of Lecture Notes in Computer Science. Springer Verlag, 1998.

    Google Scholar 

  4. J.D.C. Richardson. Proof planning with program schemas. Research Paper, School of Artificial Intelligence, University of Edinburgh. Forthcoming.

    Google Scholar 

  5. J.D.C Richardson, A. Smaill, and I.M. Green. System description: proof planning in higher-order logic with lambdaclam. In C. Kirchner and H. Kirchner, editors, Proceedings of CADE-15, volume 1421 of Lecture Notes in Computer Science. Springer Verlag, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Representation and Reasoning, Division of Informatics, Edinburgh University, 80 South Bridge, Edinburgh, EH1 1HN, Scotland

    Julian Richardson

Authors
  1. Julian Richardson
    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

Richardson, J. (1999). Abstract: Proof Planning with Program Schemas. 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_19

Download citation

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

  • 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