The Larch family of formal specification languages are intended for the precise specification of computing systems. They allow the clean specification of computer programs and the formulation of proofs about program behavior.[1]

The Larch family was developed primarily in the United States in the 1980s and 1990s, involving researchers at Xerox PARC, DEC Systems Research Center (DEC/SRC), Massachusetts Institute of Technology (MIT), and other places. Unlike the Z notation, the Larch family has one language for algebraic specification of abstract data types (the Larch Shared Language (LSL)), and a separate interface language tailored to each language in which programs are to be written, such as C, Modula-3, Smalltalk, etc. The Larch project also developed tools to support the use of formal specifications, including the Larch Prover (LP).

See also

References

  1. ↑ Guttag, John V.; Horning, James J. (1993). Larch: Languages and Tools for Formal Specification (PDF). Springer-Verlag. ISBN 978-1-4612-2704-5.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.