BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help
Not What You Meant?  There are 45 definitions for LP.

Larch Prover

Print-Friendly
About 1 pages (135 words)

Bookmark and Share Questions on this topic? Just ask!

Larch Prover, or LP for short, is an interactive theorem proving system for multisorted first-order logic. It is currently used at MIT and elsewhere to reason about designs for circuits, concurrent algorithms, hardware, and software. Unlike most theorem provers, which attempt to find proofs automatically for correctly stated conjectures, LP is intended to assist users in finding and correcting flaws in conjectures — the predominant activity in the early stages of the design process. LP works efficiently on large problems, has many important user amenities, and can be used by relatively naïve users. It was developed and is being maintained by Stephen J. Garland and John V. Guttag at the MIT Laboratory for Computer Science.

See also

External links

View More Summaries on Larch Prover
 
Ask any question on Larch Prover and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Larch Prover from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy