Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Logic Programming Synthesis and Transformation

LOPSTR 1997: Logic Program Synthesis and Transformation pp 1–27Cite as

A Multi-level Approach to Program Synthesis

  • Conference paper
  • First Online:

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

Abstract

We present an approach to a coherent program synthesis system which integrates a variety of interactively controlled and automated techniques from theorem proving and algorithm design at different levels of abstraction. Besides providing an overall view we summarize the individual research results achieved in the course of this development.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Basin & T. Walsh. A calculus for and termination of rippling. Journal of Automated Reasoning, 16(1–2), pp. 147–180, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. L. Bates & R. L. Constable. Proofs as programs. ACM Transactions on Programming Languages and Systems, 7(1):113–136, 1985.

    Article  MATH  Google Scholar 

  3. J. Van Benthem Correspondence Theory In D. Gabbay & F. Guenther, eds., Handbook of Philosophical Logic, II, pp. 167–247, Reidel, 1984.

    Google Scholar 

  4. W. Bibel. On matrices with connections. Journal of the ACM, 28(633–645), 1981.

    Google Scholar 

  5. W. Bibel. Automated Theorem Proving. Vieweg Verlag, 1987.

    Google Scholar 

  6. W. Bibel. Toward predicative programming. In M. R. Lowry & R. McCartney, eds., Automating Software Design, pp. 405–424, AAAI Press / The MIT Press, 1991.

    Google Scholar 

  7. W. Bibel, S. Brüning, U. Egly, T. Rath. Komet. In 12 th Conference on Automated Deduction, LNAI 814, pp. 783–787. Springer Verlag, 1994.

    Google Scholar 

  8. W. Bibel, D. Korn, C. Kreitz, S. Schmitt. Problem-oriented applications of automated theorem proving. In J. Calmet & C. Limongelli, eds., Design and Implementation of Symbolic Computation Systems, LNCS 1126, Springer Verlag, pp. 1–21, 1996.

    Google Scholar 

  9. A. Bundy, F. van Harmelen, A. Ireland, A. Smaill. Rippling: a heuristic for guiding inductive proofs. ArtiFIcial Intelligence, 1992.

    Google Scholar 

  10. R. L. Constable, et. al. Implementing Mathematics with the NuPRL proof development system. Prentice Hall, 1986.

    Google Scholar 

  11. M. Davis & H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Davis, G. Logemann, D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394–397, 1962.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. C. Fitting. First-Order Logic and Automated Theorem Proving. Springer Verlag, 1990.

    Google Scholar 

  14. G. Gentzen. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39:176–210, 405–431, 1935.

    Article  MathSciNet  Google Scholar 

  15. P. Jackson. NuPRL’s Metalanguage ML. Reference Manual and User’s Guide, Cornell University, 1994.

    Google Scholar 

  16. P. Jackson. The NuPRL Proof Development System, Version 4.1. Reference Manual and User’s Guide, Cornell University, 1994.

    Google Scholar 

  17. D. Korn & C. Kreitz. Deciding intuitionistic propositional logic via translation into classical logic. In W. McCune, ed., 14 th Conference on Automated Deduction, LNAI 1249, pp. 131–145, Springer Verlag, 1997.

    Google Scholar 

  18. C. Kreitz. METASYNTHESIS: Deriving Programs that Develop Programs. Thesis for Habilitation, TH Darmstadt, 1992. Forschungsbericht AIDA-93-03.

    Google Scholar 

  19. C. Kreitz. Formal mathematics for verifiably correct program synthesis. Journal of the IGPL, 4(1):75–94, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  20. C. Kreitz. Formal reasoning about communication systems I: Embedding ML into type theory. Technical Report TR 97-1637, Cornell University, 1997.

    Google Scholar 

  21. C. Kreitz, H. Mantel, J. Otten, S. Schmitt. Connection-Based Proof Construction in Linear Logic. In W. McCune, ed., 14 th Conference on Automated Deduction, LNAI 1249, pp. 207–221, Springer Verlag, 1997.

    Google Scholar 

  22. C. Kreitz, J. Otten, S. Schmitt. Guiding Program Development Systems by a Connection Based Proof Strategy. In M. Proietti, ed., 5th International Workshop on Logic Program Synthesis and Transformation, LNCS 1048, pp. 137–151. Springer Verlag, 1996.

    Google Scholar 

  23. F. Kurucz. Realisierung verschiedender Induktionsstrategien basierend auf dem Rippling-Kalkül. Diplomarbeit, TH Darmstadt, 1997.

    Google Scholar 

  24. R. Letz, J. Schumann, S. Bayerl, W. Bibel. Setheo: A high-performance theorem prover. Journal of Automated Reasoning, 8:183–212, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  25. T. van thanh Liem. Induktion im NuPRL System. Diplomarbeit, TH Darmstadt, 1996.

    Google Scholar 

  26. R. C. Moore. Reasoning about Knowledge and Action IJCAI-77, pp 223–227, 1977.

    Google Scholar 

  27. H. J. Ohlbach. Semantics-Based Translation Methods for Modal Logics Journal of Logic and Computation, 1(6), pp 691–746, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  28. J. Otten. ileanTAP: An intuitionistic theorem prover. In Didier Galmiche, ed., International Conference TABLEAUX’ 97. LNAI 1227, pp. 307–312, Springer Verlag, 1997.

    Google Scholar 

  29. J. Otten. On the advantage of a non-clausal Davis-Putnam procedure. Forschungsbericht AIDA-97-01, TH Darmstadt, 1997.

    Google Scholar 

  30. J. Otten & C. Kreitz. A connection based proof method for intuitionistic logic. In P. Baumgartner, R. Hähnle, J. Posegga, eds., 4 th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI 918, pp. 122–137, Springer Verlag, 1995.

    Google Scholar 

  31. J. Otten & C. Kreitz. T-String-Unification: Unifying Prefixes in Non-Classical Proof Methods. In U. Moscato, ed., 5 th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071, pp. 244–260, Springer Verlag, 1996.

    Google Scholar 

  32. J. Otten & C. Kreitz. A Uniform Proof Procedure for Classical and Non-classical Logics. In G. Görz & S. Hölldobler, eds., KI-96: Advances in Artificial Intelligence, LNAI 1137, pp. 307–319. Springer Verlag, 1996.

    Google Scholar 

  33. D. Plaisted & S. Greenbaum. A structure-preserving clause form translation. Journal of Symbolic Computation, 2:293–304, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  34. S. Schmitt. Avoiding redundancy in proof reconstruction 1 st International Workshop on Proof Transformation and Presentation, Schloß Dagstuhl, Germany, 1997.

    Google Scholar 

  35. S. Schmitt. Building Efficient Conversion Procedures using Proof Knowledge. Technical Report, TH Darmstadt, 1997.

    Google Scholar 

  36. S. Schmitt & C. Kreitz. On transforming intuitionistic matrix proofs into standard-sequent proofs. In P. Baumgartner, R. Hähnle, J. Posegga, eds., 4 th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, LNAI 918, pp. 106–121. Springer Verlag, 1995.

    Google Scholar 

  37. S. Schmitt & C. Kreitz. Converting non-classical matrix proofs into sequent-style systems. In M. McRobbie & J. Slaney, eds., 13 th Conference on Automated Deduction, LNAI 1104, pp. 418–432. Springer Verlag, 1996.

    Google Scholar 

  38. S. Schmitt & C. Kreitz. A uniform procedure for converting non-classical matrix proofs into sequent-style systems. Technical Report AIDA-96-01, TH Darmstadt 1996.

    Google Scholar 

  39. D. R. Smith. Structure and design of global search algorithms. Technical Report KES.U.87.12, Kestrel Institute, 1987.

    Google Scholar 

  40. D. R. Smith & M. R. Lowry. Algorithm theories and design tactics. Science of Computer Programming, 14(2–3):305–321, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  41. D. R. Smith & E. A. Parra. Transformational approach to transportation scheduling. 8 th Knowledge-Based Software Engineering Conference, pp. 60–68, 1993.

    Google Scholar 

  42. G. Stolpmann. Datentypen und Programmsynthese. Studienarbeit, TH Darmstadt, 1996.

    Google Scholar 

  43. G. Stolpmann. Schematische Konstruktion von Globalsuchalgorithmen. Diplomarbeit, TH Darmstadt, 1997.

    Google Scholar 

  44. L. Wallen. Automated deduction in nonclassical logic. MIT Press, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachgebiet Intellektik, Fachbereich Informatik, Darmstadt University of Technology, Alexanderstr. 10, 64283, Darmstadt, Germany

    W. Bibel, D. Korn, F. Kurucz, S. Schmitt & G. Stolpmann

  2. Department of Computer Science, Cornell University, Ithaca, NY, 14853, USA

    C. Kreitz & J. Otten

Authors
  1. W. Bibel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Korn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Kreitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. F. Kurucz
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. Otten
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. S. Schmitt
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. G. Stolpmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Zurich, CH-8057, Zurich, Switzerland

    Norbert E. Fuchs

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bibel, W. et al. (1998). A Multi-level Approach to Program Synthesis. In: Fuchs, N.E. (eds) Logic Program Synthesis and Transformation. LOPSTR 1997. Lecture Notes in Computer Science, vol 1463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49674-2_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-49674-2_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65074-4

  • Online ISBN: 978-3-540-49674-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation