Larch Prover

Known as: LP

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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2003

Une difficulte bien connue concernant la verification de proprietes en UML est le besoin de formalisation. Puisqu'UmL permet a la…

1998

The paper describes the use of the Larch prover to verify concurrent programs. The chosen specification environment is UNITY…

1998

Different libraries of problem-solving methods have been described in the past few years. But they have mostly been defined at an…

1996

Creates "a semantic model within which a core of the stable aspects of LCL [i.e. Larch interface languages] have been formally…

1995

This paper describes the use of the Larch Prover to verify concurrent programs. The chosen speciication environment is Unity…

1995

This thesis focuses on automatic theorem proving. In this area there is usually a tradeoff between the "generality" of a prover…

1995

matching is a way to compare two software components based on descriptions of the components' behaviors. In the context of…

1994

We describe the specification of communication services, with special emphasis being placed on the use of the Temporal Logic of…

1992

We describe a preliminary design for a Larch interface language for the programming language ML. [Since this design covers only a…

1990

Many people have argued the importance of mechanical theorem-proving for reasoning about programs. Proving the correctness of…