LP: The larch prover

Garland, Stephen J.; Guttag, John V.

doi:10.1007/bfb0012879

Cited by 20 publications

(20 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various tools have been developed to translate IOA specifications to different theorem provers, for example, Larch [3,5], PVS [4], and Isabelle [18,21]. Our implementation of the TIOA to PVS translator builds upon [3].…”

Section: Prior Workmentioning

confidence: 99%

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

Lim

Kaynar

Lynch

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The timed input/output automaton modeling framework is a mathematical framework for specification and analysis of systems that involve discrete and continuous evolution. In order to employ an interactive theorem prover in deducing properties of a timed input/output automaton, its statetransition based description has to be translated to the language of the theorem prover. This thesis describes a tool for translating from TIOA, the formal language for describing timed input/output automata, to the language of the Prototype Verification System (PVS)--a specification system with an integrated interactive theorem prover. We describe the translation scheme, discuss the design decisions, and briefly present case studies to illustrate the application of the translator in the verification process.

show abstract

Section: Prior Workmentioning

confidence: 99%

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

Lim

Kaynar

Lynch

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Among the existing tools supporting verification of (distributed) systems with algebraic specification languages are Larch Prover (LP) [6][10] and BOBJ [8]. The design policy of LP is to make proof assistants easier-to-use especially for engineers, but users of LP are basically required to have similar skills as those needed to use other proof assistants.…”

Section: Related Workmentioning

confidence: 99%

Mechanically supporting case analysis for verification of distributed systems

Seino

Ogato²,

Futatsugi³

2005

International Journal of Pervasive Computing and Communications

View full text Add to dashboard Cite

Abstract-The OTS/CafeOBJ method can be used to formally model, specify and verify distributed systems such as security protocols and railroad systems. A distributed system is modeled as an OTS, a kind of transition system, and the OTS is specified and verified with CafeOBJ, an algebraic specification language. Case analysis (or case splitting) is one of the most intellectual pieces of work in verification. Case analysis should be done entirely by hand in the OTS/CafeOBJ method, which is errorprone. It is indispensable to cover all cases and find necessary lemmas for some sub-cases where desired results are not obtained in case analysis. We propose two methods of mechanically supporting case analysis, which concern these two issues. A case study that the proposed methods are effectively applied to a railroad signaling system is also reported.

show abstract

“…The papers [11,12] describe results of the integration of Daikon and ESC/Java. And the paper [13] describes an experiment of combining Daikon with the Larch Prover [14]. However, the combination of Daikon with the Loop/PVS tool and JMLRAC has not been described before.…”

Section: Related Workmentioning

confidence: 99%

Integrating Tools for Automatic Program Verification

Hubbers

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we describe our findings after integrating several tools based upon the Java Modeling Language (JML) [1], a specification language used to annotate Java programs. The tools we consider are Daikon [2], ESC/Java [3], JML runtime assertion checker [1], and Loop/PVS tool [4]. The first one generates specifications; the others are used to verify them. We find that for the first three it is worthwhile to combine them because this is relatively easy and it improves the specifications. Combining Daikon and the Loop/PVS tool directly works in theory, but in practice it only works if the test suite is very good and hence it is not advisable.

show abstract

LP: The larch prover

Cited by 20 publications

References 0 publications

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

Mechanically supporting case analysis for verification of distributed systems

Integrating Tools for Automatic Program Verification

Contact Info

Product

Resources

About