Now Australia's Biggest Toy Shop

Turn your Clutter Into Cash with SmartSell.TM Book a Courier Pickup Today!

First International Workshop on Larch
By

Rating
The LARCH family of formal specification languages and tools was originally developed in the USA. Its user community has now spread to Europe and several industrial trial firms are interested in using it in their system development programs. It differs from the other "higher profile file" languages such as Z and VDM in three respects: firstly, it was designed to specify programs rather than mathematical models and therefore addresses the complexities of real programs; secondly, it has been specifically developed as a practical tool for use in several major application domains; finally, it has a state-of-the-art semantic analysis tool in the form of the LARCH Prover. This volume contains the papers presented at the First International Workshop on LARCH, held in Dedham, USA, 13-15 July 1992. The workshop brought together for the first time those who have designed the LARCH languages, built tool support for them, and used them to specify and reason about soft- and hardware systems. It encouraged discussion about how the LARCH languages and Prover are being used, and assessed plans for development oping them. The aim of the workshop was to raise the profile of LARCH, and to provide impetus for continued research into its tools and languages. Among the topics covered in this volume are: the mechanical verification of concurrent systems with TLA; the DECspec project; the preliminary design of LARCH/C++; generating proof obligations for circuits; lock-level verification; checking software design using formal specifications; optimising programs with specifications; and a report on the formal basis of generics. "First International Workshop on LARCH" provides a comprehensive overview of the international use and development of LARCH. It should be useful to researchers and practitioners who are already involved with, or who wish to know more about, this important specification language.
Product Details

Promotional Information

Springer Book Archives

Table of Contents

Is Engineering Software Amenable to Formal Specification?.- How to Prove Observational Theorems with LP.- Using SOS Definitions in Term Rewriting Proofs.- An exercise in LP: The Proof of a Non Restoring Division circuit.- Integrating ASSPEGIQUE and LP.- Mechanical Verification of Concurrent Systems with TLA.- The DECspec Project: Tools for Larch/C.- Formal Verification of Ada Programs.- A Semantics for a Larch/Modula-3 Interface Language.- Preliminary Design of Larch/C++.- Generating Proof Obligations for Circuits.- Using Transformations and Verification in Circuit Design.- Using LP to Study the Language PL 0 + .- Semantic Analysis of Larch Interface Specifications.- Optimizing Programs with Partial Specifications.- A new Front-End for the Larch Prover.- Thoughts on a Larch/ML and a New Application for LP.

Look for similar items by category
People also searched for
How Fishpond Works
Fishpond works with suppliers all over the world to bring you a huge selection of products, really great prices, and delivery included on over 25 million products that we sell. We do our best every day to make Fishpond an awesome place for customers to shop and get what they want — all at the best prices online.
Webmasters, Bloggers & Website Owners
You can earn a 5% commission by selling First International Workshop on Larch: Proceedings of the First International Workshop on Larch, Dedham, USA, 13-15 July 1992 (Workshops in Computing) on your website. It's easy to get started - we will give you example code. After you're set-up, your website can earn you money while you work, play or even sleep! You should start right now!
Authors / Publishers
Are you the Author or Publisher of a book? Or the manufacturer of one of the millions of products that we sell. You can improve sales and grow your revenue by submitting additional information on this title. The better the information we have about a product, the more we will sell!
Back to top