A reduced instruction set proof environment

  • Holger Busch
Short Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 901)


A general-purpose proof interface has been created on top of the higher-order-logic theorem prover LAMBDA in order to improve the efficiency of human interaction and minimize the learning overhead. Users are freed from tedious low-level interactions by way of extended proof automation routines. All essential LAMBDA functions for interactive proof development are accessible via a handy set of user commands.


  1. 1.
    H. Busch,'Transformational Design in a Theorem Prover', in THEOREM PROVERS IN CIRCUIT DESIGN, IFIP Transactions A-10, edited by V. Stavridou, T.F. Melham, and R.T. Boute, pp. 175–196, North-Holland, 1992.Google Scholar
  2. 2.
    H. Busch,'Rule-Based Induction', in FORMAL METHODS IN SYSTEM DESIGN Special Issue on HOL'92, Kluwer, Vol. 5, Issue 1 & 2, July/August 1994.Google Scholar
  3. 3.
    H. Busch, ‘First-Order Automation for Higher-Order-Logic Theorem Proving', HOL 1994 — 7th International Conference on Higher Order Logic Theorem Proving and its Applications, edited by T. Melham and J. Camilleri, LNCS 859, Springer, September 21–24, 1994, Malta.Google Scholar
  4. 4.
    S. Finn, M. Fourman, M. Francis, B. Harris, R. Hughes, and E. Mayger, Abstract Hardware Limited, LAMBDA Documentation, 1993.Google Scholar
  5. 5.
    R. Harper, R. Milner, and M. Tofte,'The Definition of Standard ML, Version 3', University of Edinburgh, LFCS Report Series, ECS-LFCS-89-81, May 1989.Google Scholar
  6. 6.
    D. Cyrluk. S. Rajan, N. Shankar, and M.K. Srivas,'Effective Theorem Proving for Hardware Verification', in 2nd Int. Conf, on THEOREM PROVERS IN CIRCUIT DESIGN, edited by R. Kumar and T. Kropf, LNCS, Springer, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Holger Busch
    • 1
  1. 1.Corporate ResearchSIEMENS AGMünchenGermany

Personalised recommendations