John Guttag, James Horning and Jeannette Wing, "The Larch Family of Specification Languages", IEEE Software, Sept. 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a generic sort routine could be specified. This routine is written at a high enough level that it could sort any data type (e.g. integer, real, programmer defined) When a specific kind of sorting is needed, another refinement of the routine is performed with the data type needed [65] Larch [66] is an example of a system that supports the process based specification technique. A model based specification is a formal mathematical model of the entire software system. The specification not only describes the interfaces and data structures of the software system, but also describes state ....

Guttag, J.V., J.J. Horning, and J.M. Wing, The Larch family of specification languages. IEEE Software, 1985. 2(5):24-36.

....carried forward into commercial quality tools. We also think the use of the functional notation of algebraic ADT axioms is an advantage over the trace spec approach; such axiom can be expressed in a functional programming language (we give our examples in ML) giving executable specs. Larch [13,14,15] is another research effort in which formal program specs are used to gain leverage over software problems. In Larch, program specifications have a portion written in Guttags functional style, along with a second portion written to express semantic specific details for a particular programming ....

J. Guttag, J. Horning, J. Wing, The Larch Family of Specification Languages, IEEE Software, 2(5), Sept. 1985, pp. 24-36.

....during the design phase. 1 Introduction in nature [1, 21] and (2) requirements are usually conflicting with each other [7, 15, 11, 21] Most existing formal specification methodologies either require the requirements to be stated precisely as formal specification language Z [18] Larch [5], etc. or convert informal requirements into formal ones as ARIES [8] SAFE [1] Requirement Apprentice [13] and SCENARIO [9] The basic formal tool used for the specification of software systems is predicate logic and set theory[12] Although they are powerful, it is difficult to use them to ....

J.V. Guttag, J.J. Horning, and J.M. Wing, "The larch family of specification languages", IEEE Software, 2(5):24--36, 1985.

....define the behaviour of modules through claims and responsibilities the contracts. The specification of contracts pre and post conditions for each method of a type is possible in several existing assertion languages iContract [8] COLD 1 [10] Jass [2] Eiffel [14] ContractJava [4] Larch family [6], JML [12] among them. Some of these Jass, iContract, Eiffel as well as, for example, jContractor [11] Handshake [3] allow the monitoring of contracts at runtime. Specifying contracts is very important to the correct reuse of software. Clients must know the rules of the business. Thus, methods ....

# J.V.Guttag, J.J.Horning and J.M.Wing, The Larch Family of Specification Languages, IEEE Software, 2(5), p.24-36, Sept. 1985.

....1.2 Speckle Speckle is a combined programming language and formal specification language that I designed to enhance the efficiency of programs that make use of interfaces. The programming language portion is mostly a subset of CLU [36] and the specification language portion is based on Larch [21, 22]. CLU has several features that make it an appropriate starting point for Speckle. CLU supports both procedural and data abstraction, which are the primary ways to simplify reasoning about programs. CLU has static typing, so there is no need to optimize away runtime type checks. CLU has side ....

J. V. Guttag, J. J. Horning, and J. M. Wing. The Larch Family of Specification Languages. IEEE Software, 2(5):24--36, 1985.

....carried forward into commercial quality tools. We also think the use of the functional notation of algebraic ADT axioms is an advantage over the trace spec approach; such axiom can be expressed in a functional programming language (we give our examples in ML) giving executable specs. Larch [13,14,15] is another research effort in which formal program specs are used to gain leverage over software problems. In Larch, program specifications have a portion written in Guttags functional style, along with a second portion written to express semantic specific details for a particular programming ....

J. Guttag, J. Horning, J. Wing, The Larch Family of Specification Languages, IEEE Software, 2(5),

....a data abstraction by describing the effects of individual operations. Rather, the behavior of a data abstraction is often specified by describing the observable effects of sequences of operations, or by relating the results of different sequences of operations, as in algebraic specifications [GHW85, Gut77] For the case in which the local data encapsulated in an Ada package is used to represent an instance of an abstract data type, Anna provides a way to denote the whole internal state of a package and to denote the state of a package after a sequence of operations. Example 4 Anna package ....

John V. Guttag, James J. Horning, and Jeanette M. Wing. The Larch Family of Specification Languages. IEEE Software, 8(3):24--36, September 1985.

.... effectiveness, even though some projects have demonstrated significant cost savings through using formal methods [Hall90] Model based methods, such as VDM [Jone80] and Z [Spiv92] are mostly used to foster more abstract thinking about a design, while algebraic methods, such as OBJ [Futa85] Larch [Gutt85] come with full term rewriting engines for inductive theorem proving and Lotos [Bolo87] uses traceinclusion to demonstrate the equivalent behaviour of parts of state machines. Each approach has certain advantages and disadvantages. The VDM and Z style of specification constructs models for ....

J Guttag, J Horning and J Wing, "The Larch family of specification languages", IEEE Software, 2 (5), 1985, 24-36.

.... about concurrent processes [53, 70] Misra and Chandy, who invented the UNITY logic [71] and Lamport, who invented the Temporal Logic of Actions [61] 4 While some researchers were focusing on program verification, others were developing powerful specification methods like Z, VDM, and Larch [91, 58, 44]. These methods were used successfully to specify and perform analysis on large software systems. Early success stories include IBM s use of VDM to define the programming language ALGOL 60 [19] The efforts on program specification and verification also inspired research into the modelling and ....

J.V. Guttag, J. J. Horning, and J. M. Wing. The Larch family of specification languages. IEEE Software, 2(5):24--36, Sept. 1985.

.... some as a convenient vehicle for proving assertions about type correctness (e.g. 58] The denotational semantics definition is based on 42 the lambda calculus [66] The algebraic definition comes from mathematics and finds a place in group theory, software specification languages (e.g. Larch [27]) and other areas. The operation based definition (e.g. 1, 16] is closely related to the software engineering notion of an abstract data type (ADT) and is adopted in this dissertation as explained in Chapter 2. 4.4.1 Object Oriented Type Theory Most type theories for procedural and ....

....is needed. 12.2.2 Type Related Issues Specification matching. PolySPIN s formal framework of Chapter 6 is based on the work of Zaremski and Wing on signature matching. These authors have extended this work to specification matching [76] in which formal specifications in the Larch language 1 [27] are attached to functions. Pairs of functions are then matched, using relaxed matching on the specifications rather than the signatures. It is natural to suppose that specification matching could be applied across programming languages as well. Exception handling. The interlanguage method ....

Guttag, J. V., Horning, J. J., and Wing, J. M. The Larch family of specification languages. IEEE Software 2, 5 (1985).

....formal analysis. Support for this work was provided in part by the Advanced Research Projects Agency and monitored by Wright Labs under the RASSP Technology Program, contract number F33615 93 C 1316 and by Air Force MANTECH, contract number F33615 93 C 4303 vspec is a Larch interface language [6, 7] for vhdl. The Larch family of specification languages supports a two tiered, model based approach to specifying software. A Larch specification is written in two languages: a Larch Interface Language (lil) and the Larch Shared Language (lsl) Larch Interface Language definitions specify the ....

J. Guttag, J. Horning, and J. Wing. The Larch Family of Specification Languages. IEEE Software, 2(5):24--36, 1985.

....1 This is not a term or acronym in widespread use but we introduce it here for convenience. 1 true during prototyping or the rapid development of smaller applications, where it is somewhat arbitrary where specification ends and implementation begins. Of course, many IDLs (for example [9, 10, 15]) are (or are embedded in) true specification languages, and support computer assisted reasoning about the specification itself, apart from any implementation. For these languages, the independence of the specification language is a necessary feature, and we are in no way suggesting that it is a ....

J.V. Guttag, J.J. Hornung, and J.M. Wing. The larch family of specification languages. IEEE Software, 2(5):24--36, Sept. 1985.

....from Larch C. 1 Introduction A pre condition for reading this paper is that you understand the basics of object oriented programming (see [Cox86] otherwise) have some familiarity with C or C [Str91] and have a good understanding of model oriented interface specifications using Larch [GHW85] The post condition of this paper is that you should understand the rationale for our design of Larch C . 1.1 Challenges of C The programming language C [ES90] Str91] is an object oriented extension to C. Although it is difficult to find hard data about language usage, anecdotal ....

John V. Guttag, James J. Horning, and Jeannette M. Wing. The Larch Family of Specification Languages. IEEE Software, 2(4), September 1985.

....of all the abstract types with the same name and number of arguments. 2. 1 Traits Larch LOAL specifications describe behavior in terms of the abstract values of objects [29] 43] 35] 26] In Larch LOAL, the abstract values of objects are specified by a trait written in the Larch Shared Language [28] [27] 26] The Larch Shared language is used by Larch LOAL, but is a distinct language. Both are distinct from LOAL itself. A LOAL program uses the abstract types specified in Larch LOAL, and the assertions in a Larch LOAL specification are stated using the trait functions described in a trait. ....

Guttag, J. V., Horning, J. J., and Wing, J. M. The Larch family of specification languages. IEEE Software, 2(4), September 1985.

....define the relationships between operations in the system. They can be axiomatic or algebraic. In the axiomatic approach, first order predicate logic pre conditions and post conditions are used for the specification of each operation of an abstract data type. Anna [Luc85] OBJ2 [Fut85] and Larch [GHW85] are examples of axiomatic specification languages. The algebraic approach is based on multi sorted algebras, where properties of the system s behaviour are connected to the equations over the entities of the algebra [PKT92] Examples of algebraic specification languages include Clear [BG80] and ....

Guttag, J.V., Horning, J.J. and Wing, J.M. The Larch Family of Specification Languages. IEEE Software, Vol.2, No.5, pp.24-36, September 1985.

....class invariant the additional clauses serving to specify conditions on the new data members introduced in the derived class. So the specification of a class will consist of a number of items. First, the conceptual model of the class which can be given, for instance, in terms of a Larch style [GHW85]trait, although in order to keep the presentation simple, we will omit the formal details. Next we need an abstraction or encapsulation function that maps from the concrete domain (of actual data members) to the conceptual model. Thus (oe) is the abstract state , or the client s view, ....

J. Guttag, J. Horning, and J. Wing. The larch family of specification languages. IEEE Software, 2, 1985.

....that are in the same package as B to access all members of B except those declared private. But these other classes themselves are not visible outside so it should be possible to extend our approach to deal with this case. concrete specification of B. A will be the usual ADT type specification [4], consisting of a conceptual model of B, and the specifications of the methods of B in terms of pre and post conditions in this model. The pre condition of a method will be an assertion on the (conceptual) state of the object that must be satisfied when the method is invoked; the post condition ....

J. Guttag, J. Horning, and J. Wing. The larch family of specification languages. IEEE Software, 2, 1985.

No context found.

J.V. Guttag, J.J. Horning, and J.M. Wing. The larch family of specification languages. IEEE Software, 2(5):24--36, September 1985.

No context found.

J.V. Guttag, J.J. Horning, and J.M. Wing. The larch family of specification languages. IEEE Software, 2(5):24--36, September 1985.

No context found.

John V. Guttag, James J. Horning and Jeannette M. Wing. The Larch Family of Specification Languages. IEEE Software 2(5):24-36, sept, 1985. 47

....be the property that the procedure does not modify any of the elements in its list argument. To test out our ideas, we built a prototype utility for specification matching in Prolog for a library of Standard ML (ML) functions [13] each of which we specify following Larch s two tiered approach [7]. In Section 2 we highlight the features of Prolog, ML, and Larch necessary to understand our examples. We refer the reader to the references for details. Our prototype s basic utility supports signature matching, described in Section 3, as what might be done in the first stage of a pipelined ....

....Standard ML [13] is a typed functional programming language that treats functions as first class objects and supports user defined abstract data types as well as a host of other modern programming language features. We specify each ML function or abstract type following Larch s two tiered approach [7]. We defer a description of this approach to Section 4. For readers familiar with Larch, we essentially use Prolog as the assertion language of a Larch interface specification instead of the Larch Shared Language (a fragment of first order logic with equality) We assume familiarity with Prolog ....

J. V. Guttag, J. J. Horning, and J. M. Wing. The Larch family of specification languages. IEEE Software, 2(5):24--36, September 1985.

No context found.

John Guttag, James Horning and Jeannette Wing, "The Larch Family of Specification Languages", IEEE Software, Sept. 1985.

No context found.

John V. Guttag and James J. Horning and Jeannette M. Wing. The Larch Family of Specification Languages. IEEE Software, 2(5):24-36 (Sept. 1985).

No context found.

John V. Guttag and James J. Horning and Jeannette M. Wing. The Larch Family of Specification Languages. IEEE Software, 2(5):24-36 (Sept. 1985).

No context found.

Guttag, J., J. Hornung, J. Wing, "The Larch Family of Specification Languages," IEEE Software, Vol. 2, No. 5, Sept. 1985.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC