Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Fronhoefer, B., and Wrightson, G. (eds). Parallelization in Inference Systems. Proc. of Intl. Workshop, Germany, Dec. 1990, Springer LNAI 590, 1992.
Garland, S., and Guttag, J., “An overview of LP,” Proc. 3rd Conf. on Rewriting Techniques and Applications, LNCS 355 (ed. Dershowitz), 1989, 137–151.
Kapur, D. and Vandevoorde, M.T., “DLP: A paradigm for parallel interactive theorem proving,” http://larch-www.lcs.mit.edu:8001/∼mtv/pitp96.ps.
J. Guttag. Personal communication. September 1995.
McCarthy, J., “The mutilated checkerboard in set theory,” in The QED II Workshop report (ed. R. Matuszewski), L/1/95, Warsaw University, Oct. 1995, http://www.mcs.anl.gov/qed/index.html.
Saxe, J., Guttag, J., Horning, J., and Garland, S., “Using transformations and verification in circuit design,” Formal Methods in System Design, 1993, 181–209.
Vandevoorde, M.T., and Kapur, D., Parallel user interfaces for parallel applications, http://larch-www.lcs.mit.edu:8001/∼mtv/hpdc96.ps.
Voisin, F., “A New Proof Manager and Graphic Interface for the Larch Prover,” 7th Conf. on Rewriting Techniques and Applications, 1996.
Winker, S., “Robbins algebra: conditions that make a near-boolean algebra boolean,” J. of Automated Reasoning, 6, 4, 1990, 465–489.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vandevoorde, M.T., Kapur, D. (1996). Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover. In: Ganzinger, H. (eds) Rewriting Techniques and Applications. RTA 1996. Lecture Notes in Computer Science, vol 1103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61464-8_71
Download citation
DOI: https://doi.org/10.1007/3-540-61464-8_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61464-7
Online ISBN: 978-3-540-68596-8
eBook Packages: Springer Book Archive