Larch: Languages and Tools for Formal Specification

Guttag, John V.; Horning, James J.

doi:10.1007/978-1-4612-2704-5

Cited by 418 publications

(179 citation statements)

References 47 publications

Supporting

Mentioning

177

Contrasting

Unclassified

Order By: Relevance

“…Also variously the application of formal methods to computer algebra has been investigated. For example [9] applied the formal specification language Larch [11] to the computer algebra system AXIOM respective its programming language Aldor. A methodology for Aldor program analysis and verification was devised by defining abstract specifications for AXIOM primitives and then providing an interface between these specifications and Aldor code.…”

Section: State Of the Artmentioning

confidence: 99%

Towards the Formal Specification and Verification of Maple Programs

Khan¹,

Schreiner²

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we present our ongoing work and initial results on the formal specification and verification of MiniMaple (a substantial subset of Maple with slight extensions) programs. The main goal of our work is to find behavioral errors in such programs w.r.t. their specifications by static analysis. This task is more complex for widely used computer algebra languages like Maple as these are fundamentally different from classical languages: they support non-standard types of objects such as symbols, unevaluated expressions and polynomials and require abstract computer algebraic concepts and objects such as rings and orderings etc. As a starting point we have defined and formalized a syntax, semantics, type system and specification language for MiniMaple.

show abstract

Section: State Of the Artmentioning

confidence: 99%

Towards the Formal Specification and Verification of Maple Programs

Khan¹,

Schreiner²

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…As explained in the introduction, we use the Larch Shared Language (LSL) [11] to illustrate how object types, associations, and navigation expressions are incorporated into structured specification. LSL uses specification modules, called traits, to describe abstract data types and theories.…”

Section: Interpreting Class Diagramsmentioning

confidence: 99%

“…In our formalisation, an object type is associated with an LSL basic sort consisting of elements that uniquely represent objects (instances) of the type, which can be thought of as object identifiers. The trait Type-String specifies the sort of strings String, which is available in the Larch HandBook of specification modules [11]. Any constraints on the attribute title are expressed as axioms on the function title in the asserts section of the trait.…”

Section: Object Typesmentioning

confidence: 99%

“…The semantics is characterised in terms of the Larch Shared language (LSL) [11] which is essentially a syntax for writing and composing theories in many-sorted first order predicate logic with equality. This follows a well-rehearsed approach to semantics, dating back at least to Burstall and Goguen [9], whereby specifications are given a semantics in terms of (compositions of) theories of some logic.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Navigation expressions in object-oriented modelling

Hamié

Howse

Kent

1998

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. In component-based development, object-oriented modelling notations such as UML are being proposed as a way of providing richer specifications of components. Much more so than in bespoke software development, this requires a high level of precision coupled with sufficient expressive power. Expressive power is delivered by adding textual annotations, such as invariants, pre & post conditions, to diagrams. Navigation expressions, which identify collections of objects by navigating associations, are central to making such annotations precise. We give a semantics to navigation expressions as they are used in recently proposed extensions to object-oriented modelling notations in widespread use by practitioners. The semantics is given using Larch (essentially FOPL), which makes it as accessible as possible while enabling some support for reasoning. The semantics helps to clarify some subtle issues to do with navigation expressions, including the meaning of navigating across collections (sets, bags and sequences) as opposed to just single objects, and the use of filters on collections within expressions.

show abstract

“…The notion of IOA is formalized in the Larch Shared Language (LSL) [18] which is supported by a tool that produces input for LP. LP is a theorem prover for first-order logic designed to assist users who employ standard proof techniques such as proofs by cases, induction, and contradiction.…”

mentioning

confidence: 99%

A proof of burns N-process mutual exclusion algorithm using abstraction

Jensen

Lynch

1998

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Within the Input/Output Automata framework, we state and prove a general abstraction theorem giving conditions for preservation of safety properties from one automaton to another. We use our abstraction theorem to verify that Burns distributed mutual exclusion algorithm parameterized in the number of processes n satisfies the mutual exclusion property. The concrete n-process algorithm is abstracted by a simple 2-process algorithm which is property preserving with respect to the mutual exclusion property. The condition for property preservation is proved to be satisfied by use of the LP theorem prover with a minimum of user assistance, and the 2-process abstraction is automatically verified using the SPIN model checker.

show abstract

Larch: Languages and Tools for Formal Specification

Cited by 418 publications

References 47 publications

Towards the Formal Specification and Verification of Maple Programs

Towards the Formal Specification and Verification of Maple Programs

Navigation expressions in object-oriented modelling

A proof of burns N-process mutual exclusion algorithm using abstraction

Contact Info

Product

Resources

About