Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover

  • Mark T. Vandevoorde
  • Deepak Kapur
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1103)


The Distributed Larch Prover, DLP, is a distributed and parallel version of LP, an interactive prover. DLP helps users find proofs by creating and managing many proof attempts that run in parallel. Parallel attempts may work independently on different subgoals of an inference method, and they may compete by using different inference methods to prove the same goal. DLP runs on a network of workstations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Avenhaus, J., and Denzinger, D., “Distributed equational theorem proving,” Proc. 5th Conf. on Rewriting Techniques and Applications, LNCS 690 (ed. Kirchner), Montreal, 62–76, 1993.Google Scholar
  2. 2.
    Bonacina, M. P., and McCune, W., “Distributed theorem proving by Peers,” Proc. 12th Intl. Conf. on Automated Deduction (CADE-12), LNAI 814 (ed. Bundy), Nancy, France, 1994, 841–845.Google Scholar
  3. 3.
    Fronhoefer, B., and Wrightson, G. (eds). Parallelization in Inference Systems. Proc. of Intl. Workshop, Germany, Dec. 1990, Springer LNAI 590, 1992.Google Scholar
  4. 4.
    Garland, S., and Guttag, J., “An overview of LP,” Proc. 3rd Conf. on Rewriting Techniques and Applications, LNCS 355 (ed. Dershowitz), 1989, 137–151.Google Scholar
  5. 5.
    Kapur, D. and Vandevoorde, M.T., “DLP: A paradigm for parallel interactive theorem proving,” Scholar
  6. 6.
    J. Guttag. Personal communication. September 1995.Google Scholar
  7. 7.
    McCarthy, J., “The mutilated checkerboard in set theory,” in The QED II Workshop report (ed. R. Matuszewski), L/1/95, Warsaw University, Oct. 1995, Scholar
  8. 8.
    Saxe, J., Guttag, J., Horning, J., and Garland, S., “Using transformations and verification in circuit design,” Formal Methods in System Design, 1993, 181–209.Google Scholar
  9. 9.
    Vandevoorde, M.T., and Kapur, D., Parallel user interfaces for parallel applications, Scholar
  10. 10.
    Voisin, F., “A New Proof Manager and Graphic Interface for the Larch Prover,” 7th Conf. on Rewriting Techniques and Applications, 1996.Google Scholar
  11. 11.
    Winker, S., “Robbins algebra: conditions that make a near-boolean algebra boolean,” J. of Automated Reasoning, 6, 4, 1990, 465–489.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Mark T. Vandevoorde
    • 1
  • Deepak Kapur
    • 2
  1. 1.Lab. for Computer ScienceMassachusetts Institute of TechnologyCambridge
  2. 2.Dept. of Computer ScienceState University of New YorkAlbany

Personalised recommendations