
	Where results make sense

Topic: Larch Prover

	Larch - Encyclopedia Glossary Meaning Explanation Larch (Site not responding. Last check: 2007-10-15)
		Larches are among the dominant plants in the immense boreal forests of Russia and Canada.
		Larch cones are erect, small, 1-9 cm long, green or purple, ripening brown 5-8 months after pollination; in about half the species the bract scales are long and visible, and in the others, short and hidden between the seed scales.
		Larch is valued in forestry for its wood, which is tough, waterproof and durable, with top quality knot-free timber being in great demand for building yachts and other small boats.
	www.encyclopedia-glossary.com /en/Larch.html (492 words)

	Larch Prover - Wikipedia, the free encyclopedia
		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.
	en.wikipedia.org /wiki/Larch_Prover (141 words)

	Larch Frequently Asked Questions (comp.specification.larch FAQ) - faqs.org.ru
		Larch [Guttag-Horning93] may be thought of as an approach to formal specification of program modules.
		The main difference between LSL and a Larch BISL is that in LSL one specifies mathematical theories of the operators that are used in the pre- and postcondition specifications of a Larch BISL.
		In comparison to Larch family BISLs, the first thing to note is that VDM-SL is not a BISL itself, as it is not tailored to the specification of interfaces for some particular programming language.
	faqs.org.ru /en/misc/larch-faq.htm (3864 words)

	An overview of Larch
		Specifications for the pGVT algorithm components were written in the Larch Shared Language (LSL) [13], the Larch Interface Language, LCPP [17] and verified using the Larch Prover [11].
		The Larch style of specification is described as a two-tiered approach because specifications are written using two languages, that describe: (1) general purpose constructs and (2) language specific component interfaces.
		The Larch Prover [11] is a proof assistant compatible with the LSL specifications.
	www.ececs.uc.edu /~paw/pvs/TimeWarp/main/node5.html (407 words)

	Larch Frequently Asked Questions (comp.specification.larch FAQ)
		Although you can use the Larch languages and tools without subscribing to any particular view on the utility of formal methods, there is an emerging view of this question in the Larch community.
		Although LP is a general proof assistant, its main uses in the context of Larch are to: * aid the debugging of specifications (i.e., theories), by helping develop redundant conjectures and their proofs, and * checking old proofs in the context of changed theories, to see if the proof is still valid.
		See section 3.1 What is the Larch Prover (LP)?, for the steps to follow in debugging your trait by trying to prove the conjectures in its implies section.
	www.faqs.org /faqs/larch-faq (21103 words)

	Larch
		Larch is a multi-site project exploring methods, languages, and tools for the practical use of formal specifications.
		Much of the early work was done at MIT in the former Systematic Program Development Group in the Laboratory for Computer Science and at Digital Equipment in the Systems Research Center in Palo Alto, California.
		It has been replaced by the usenet newsgroup comp.specification.larch, which is intended for discussion of all aspects of the Larch methdology, languages, and tools.
	www.sds.lcs.mit.edu /spd/larch (294 words)

	Introduction to Larch (Site not responding. Last check: 2007-10-15)
		Larch is a family of Languages that supports a two tiered, definitional style of specification.
		The lectures on Larch are based on Larch: Language And Tools for Formal Specification by John V. Guttag and James J Horning, Springer-Verlag.
		LP (Larch prover) uses a system of deduction which is sound and effective.
	www.cs.binghamton.edu /~lander/cs380f/cs380fn.html (1994 words)

	MINT Group Project: UPC - Larch/VSPEC Review
		Larch is a family of languages, used for specification only.
		There is a basic split in Larch, between things specified in the Larch Shared Language, and the Interface languages.
		The Larch Prover is not an automated theorem prover, but rather an assistant that automates parts of the proof, relying on a human to guide the process.
	mint.cs.man.ac.uk /Projects/UPC/Languages/Larch.html (520 words)

	Larch Frequently Asked Questions (comp.specification.larch FAQ) FAQ
		Introduction This document is a draft of a list of frequently asked questions (FAQ) and their answers for the Larch family of specification languages.
		Another problem with this comparison is that Larch has two tiers, but VDM-SL [Jones90], Z [Hayes93] [Spivey92], and COLD-K [Feijs-Jonkers92] are all integrated languages, which mix aspects of both of the tiers of the Larch family.
		The "Larch" is the common name of a species of fir tree that is found in this book.
	www.non.com /news.answers/larch-faq.html (17902 words)

	Citations: Larch: Languages and Tools for Formal Specications - Guttag, Horning, Garland, Jones, Modet, Wing ... (Site not responding. Last check: 2007-10-15)
		LSL is a member of the Larch family of speci cation languages [7] which supports a two tiered, de nitional style of speci cation.
		It is based on conditional equational logic, with many sorted total operators, the built in equality predicate as the unique predicate and the free data type construction as the abstract data type speci cation mechanism.
		Each Larch speci cation has components written in two languages: one designed for a speci c programming language, the Larch interface language, and another common to all programming languages, the Larch shared language LSL.
	citeseer.ifi.unizh.ch /context/720726/0 (4091 words)

	Docs.Rage.Net: /faq/larch-faq (Site not responding. Last check: 2007-10-15)
		However, we do not use the term "Larch interface language" as a synonym for "BISL", because there are BISLs outside the Larch family (such as those in the RESOLVE family [Edwards-etal94]).
		However, "Larch interface language" is a synonym for "Larch BISL".
		The first Larch BISL was Larch/CLU [Wing83] [Wing87].
	docs.rage.net /faq/larch-faq (15792 words)

	TDS - Computer-Aided Verification
		Larch Prover; some current work also involves model-checking.
		A partial verification, using Larch Prover, of the Randomized Digning Philosophers Algorithm.
		A formal representation and machine-checked proof using the Larch Prover for the Bounded Concurrent Timestamp (BCTS) algorithm of Dolev and Shavit [1].
	theory.lcs.mit.edu /tds/cav.html (559 words)

	[No title] (Site not responding. Last check: 2007-10-15)
		LP is designed for a middle ground between proof checkers that require detailed guidance and theorem provers that work completely automatically.
		It allows the user to direct the proof process at a fairly high level, with the goal that the ``obvious'' steps will be taken automatically.
		Avalon Project - J.M. Wing and C. Gong, ``Experience with the Larch Prover,'' Proceedings of the ACM Workshop on Formal Methods in Software Development, Napa, CA, May 9-11, 1990, 140-143.
	www-formal.stanford.edu /clt/ARS/Entries/larch (747 words)

	Debugging Larch Shared Language Specifications - Garland, Guttag, Horning (ResearchIndex) (Site not responding. Last check: 2007-10-15)
		The former are called Larch interface languages, and the latter the Larch Shared Language (LSL).
		The Larch style of specification emphasizes brevity and clarity rather than executability.
		Comparison of IMPS, PVS and Larch with respect to Theory..
	citeseer.ifi.unizh.ch /garland90debugging.html (633 words)

	Larch Frequently Asked Questions
		This document is a list of frequently asked questions (FAQ) and their answers for the Larch family of specification languages.
		Something that might seem to be a disadvantage of the Larch approach is that one sometimes finds oneself writing out a very similar specifications in both LSL and a BISL.
		The "Larch" is the common name of a species of fir tree.
	www.cs.iastate.edu /~leavens/larch-faq.html (15434 words)

	The World Wide Web Virtual Library: Formal Methods
		Isabelle, a generic theorem prover, supporting higher-order logic, ZF set theory, etc.
		Larch family of languages and tools supporting a two-tiered definitional style of specification.
		See also Larch Project at SRC Home Page and the CMU Larch Project.
	vl.fmnet.info (1641 words)

	Automation of Reasoning Netlinks
		PVS is a verification system: that is, a specification language integrated with support tools and a theorem prover.
		Its prover, LP, is an interactive theorem proving system for multisorted first-order logic.
		Otter's inference rules are based on resolution and paramodulation, and it includes facilities for term rewriting, term orderings, Knuth-Bendix completion, weighting, and strategies for directing and restricting searches for proofs.
	www.rbjones.com /rbjpub/cs/ai003.htm (319 words)

	Citations: A guide to LP - Garland, Guttag (ResearchIndex) (Site not responding. Last check: 2007-10-15)
		General purpose theorem provers remain, however, primarily the tool of the academic researcher.
		The mathematical conditions to be proven are specified in the Larch Shared Language [23] and the connection between these conditions and the VHDL entities is provided by special interface specifications.
		We are pursuing specification matching in the context of Larch [Guttag and Horning 1993] and Larch ML [Wing et al.
	citeseer.ist.psu.edu /context/171373/0 (1953 words)

	[No title]
		A theorem prover and a Presburger formulas calculator are used to perform the underlying proofs.
		Moreover, we try to make the semantics denotation as close as possible to the usual programming notation; the aim being to make easy the reasoning at the semantics level.
		This formalization is embedded within the HOL interactive theorem prover and consequently reusable as a framework for general programming by refinement.
	www.brics.dk /NS/95/2/TACAS/TACAS.bib (1155 words)

	Citations: the Larch Prover - Garland, Guttag (ResearchIndex) (Site not responding. Last check: 2007-10-15)
		Citations: the Larch Prover - Garland, Guttag (ResearchIndex)
		For concrete examples we have successfully proved observational theorems with the Larch Prover LP (cf.
		In fact, once the theorems corresponding to our subtyping rules are formally stated in Larch, their proofs are almost completely mechanical a matter of symbol manipulation and could be done with the assistance of the Larch Prover
	citeseer.ist.psu.edu /context/61773/0 (2809 words)

	Proving LGVT Less Than Or Equal To GVT (Site not responding. Last check: 2007-10-15)
		Because the statement has to hold for all possible states of the logical process, a proof by induction over states is required.
		The Larch Prover command to attempt a proof by induction is as follows:
		A close examination of the new conjecture shows that the present set of rewrite rules should be enough to prove the conjecture.
	www.ececs.uc.edu /~paw/pvs/TimeWarp/main/node15.html (199 words)

	Prover - Yan Internet - Seu provedor em Itaúna/MG (Site not responding. Last check: 2007-10-15)
		linTAP is a tableau prover for the multiplicative and exponential The linTAP prover is invoked with prove(F).
		The Prover window shows all of the theorems and their proof scripts, the current sequent, an input area, and a message area.
		Let L be a language that has an interactive proof in which the prover sends few (say m) bits to the verifier.
	www.topnewssite.com /tns/prover.html (287 words)

	Virginia Tech - CS6104 Class Projects
		Rob Ellis proposed to use the Larch Prover to assist in his thesis research on cubical complexes.
		Craig Struble proposed to use the Larch Prover to prove theorems in graph theory.
		Here Larch and Larch Prover would be good tools for developing educational materials.
	courses.cs.vt.edu /~cs6104/1996/projects.html (920 words)

	Find in a Library: First International Workshop on Larch : proceedings of the First International Workshop on Larch, ...
		Find in a Library: First International Workshop on Larch : proceedings of the First International Workshop on Larch, Dedham, Massachusetts, USA, 13-15 July 1992
		First International Workshop on Larch : proceedings of the First International Workshop on Larch, Dedham, Massachusetts, USA, 13-15 July 1992
		WorldCat is provided by OCLC Online Computer Library Center, Inc. on behalf of its member libraries.
	worldcatlibraries.org /wcpa/ow/597dcd269e2a4077a19afeb4da09e526.html (81 words)

	Research Directed by Gary T. Leavens
		Hua Zhong's master's project describes how to translate Z specifications into Larch.
		TR #96-04d discusses one criteria for helping debug Larch interface specifications.
		It combines the approaches of Eiffel and Larch, with some elements of the refinement calculus.
	www.cs.iastate.edu /~leavens/main.html (2261 words)

	CV for Jeannette M. Wing
		J.M. Wing and C. Gong, "Experience with the Larch Prover,'' Proceedings of the ACM Workshop on Formal Methods in Software Development,'' Napa, CA, May 1990, pp.
		J.M. Wing, "Specifying Avalon Objects in Larch,'' Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Barcelona, March 13-17, 1989, Lecture Notes in Computer Science 352, Springer-Verlag, pp.
		J.M. Wing, "A Larch Specification of the Library Problem,'' Proceedings of the Fourth International Workshop on Software Specification and Design, Monterey, CA, April 1987, pp.
	www-2.cs.cmu.edu /afs/cs.cmu.edu/user/wing/www/resume.html (9944 words)

	Rewriting354---Release 3.1 of LP the Larch Prover (Site not responding. Last check: 2007-10-15)
		Release 3.1 of LP, the Larch Prover, is available now over the WWW or by anonymous ftp from larch.lcs.mit.edu.
		The distribution contains on-line documentation, which can be read using LP or using a Web browser such as Mosaic.
		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.
	www.dcs.st-and.ac.uk /~sal/Rewriting/354.html (230 words)

	LARCH THEOREM PROVER COURSE (Site not responding. Last check: 2007-10-15)
		UNIVERSITY OF ST ANDREWS COMPUTER SCIENCE DIVISION LARCH THEOREM PROVER COURSE PROFESSOR STEVE GARLAND, MIT 17-18 March 1994 LARCH PROVER The Larch Prover LP is an interactive proof-assistant for a subset of multisorted first-order logic.
		It has been developed by Steve Garland and John Guttag at MIT, in collaboration with DEC-SRC.
		=========================================================================== LARCH THEOREM PROVER COURSE REGISTRATION FORM/TEMPLATE ------------------------------------------------------ Academic Industrial REGISTRATION: 100 [ ] 150 [ ] CONFERENCE DINNER 25 [ ] 25 [ ] Name_________________________________________ Organisation_________________________________ Address______________________________________ _____________________________________________ _____________________________________________ E-mail_______________________________ Tel______________________________ ============================================================================== Special dietary needs: Other special needs: Arrival date____________ Departure Date____________ I will be travelling by AIR/TRAIN/CAR _________ =======================================================================
	research.compaq.com /SRC/larch/msg00081.html (444 words)

	Formal Verification of Concurrent Program using the Larch Prover (Site not responding. Last check: 2007-10-15)
		This paper describes, by means of an example, how one may mechanically verify concurrent programs on the theorem prover LP.
		The chosen specification environment is UNITY, a subset of ordinary temporal logic for specifying and verifying programs.
		We present the proof of a lift-control program, we explain how we can use the theorem proving methodology to prove safety and liveness, and to get semi-automated proofs.
	www.brics.dk /NS/95/2/TACAS/Che/TACAS-Che/TACAS-Che.html (83 words)

Try your search on: Qwika (all wikis)