David A. Watt, Brian A. Wichmann, and William Findlay. ADA Language and Methodology. Prentice-Hall, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A CSP Approach To Action Systems - Butler (1992) (14 citations) (Correct)
.... may be modelled in CSP with events of the form c:i :j [Len88] A communication on a bi directional channel is described using the notation c x e, and we have (c x e P x ) b = i 2 values P (c) ffl c:i :e P i ) This is similar to the rendezvous mechanism in the programming language Ada [WWF87] which allows synchronised value passing in two directions. In this section, value passing action systems are extended to include bi directional channels. A bi directional channel is represented by an action that is parameterised 94 by both x and y, where x is the input parameter and y is the ....
....programming language, since they contain no explicit flow of control, but rather any action may be executed if it is enabled. However, it should be possible to implement certain action systems as sequential programs in languages that provide synchronised communication such as occam [JG88] and Ada [WWF87]. For example, Figure 8.A contains an action system that accepts a value on channel left and then outputs that value on channel right . Figure 8.A also contains an occam program that implements the action system COPY . In the action system, the flow of control is determined by the boolean variable ....
D.A. Watt, B.A. Wichmann, and W. Findlay. ADA: Language and Methodology. Prentice--Hall, 1987.
Towards a Second Generation of Formal Description.. - Garavel, Sighireanu (1998) (1 citation) (Correct)
.... a user defined type can contain an equation true = false that corrupts the semantics of the standard boolean type) These problems have been known for long and various solutions have been proposed, borrowing ideas from programming languages supporting modularity, such as Modula 2 [Wir83] Ada [WWF87] Sml [MTH90] Our proposal [SG96] was retained as the basis of E Lotos [Que98] It builds upon both Sml and [BL95] which itself improves over a previous proposal [Bri88] The main ideas are presented below. Towards a Second Generation of Formal Description Techniques E Lotos modules ....
D. Watt, B. Wichmann, and W. Findlay. ADA Language and Methodology. Prentice-Hall, 1987.
LOTOS NT User Manual - Sighireanu (2000) (Correct)
....It follows the main concepts of E Lotos and offers other features, in order to provide versatility, compilation and verification efficiency. Sig99] exposes the main differences between Lotos NT and E Lotos. We cite only two examples: ffl In Lotos NT, functions names may be overloaded as in Ada [WWF87] i.e. two or more functions may have the same name provided they have different profiles (list of parameters types and result type) This is an useful feature because it improves the semantic consistency of an Lotos NT specification two similar operations on different types need not have ....
D. Watt, B. Wichmann, and W. Findlay. ADA Language and Methodology. Prentice-Hall,
Compiling Standard ML to Java - Gammage (1997) (Correct)
....from ad hoc and subtype (or inclusion) polymorphism) Parametric polymorphism allows the SML programmer to write generic routines which operate uniformly over a range of types. While C and Ada address the issue of generic code by providing template and generic and facilities respectively [41, 52], these are not type checked or compiled to object code until instantiation, and hence amount to little more than macro substitution. The flexibility and power afforded the programmer by a polymorphic type system is not without penalty, however. An immediate consequence of the polymorphic type ....
David A. Watt, Brian A. Wichmann, and William Findlay. ADA Language and Methodology. Prentice-Hall, 1987.
Stepwise Refinement of Communicating Systems - Michael Butler (1994) (11 citations) (Correct)
....since they contain no explicit flow of control, but rather any action may be executed if it is enabled. However, it should be possible to develop proof rules for implementing action systems as sequential programs in languages that provide synchronised communication such as occam [14] and Ada [32]. The designers of the specification language SL 0 [25] have achieved a similar aim. In SL 0 , a combination of CSP algebraic notation and the transition system approach of [9, 16] is used to specify a communicating system. A set of compositional proof rules are provided for transforming SL 0 ....
D.A. Watt, B.A. Wichmann, and W. Findlay. ADA: Language and Methodology. Prentice-- Hall, 1987.
Compiling Standard ML to Java - An (Correct)
No context found.
David A. Watt, Brian A. Wichmann, and William Findlay. ADA Language and Methodology. Prentice-Hall, 1987.
Stepwise Refinement of Communicating Systems - Michael Butler Dept (1994) (11 citations) (Correct)
No context found.
D.A. Watt, B.A. Wichmann, and W. Findlay. ADA: Language and Methodology. Prentice-- Hall, 1987.
People-oriented Software Reuse: the Very Thought - Maiden, Sutcliffe (1993) (3 citations) (Correct)
No context found.
Watt D.A., Wichmann B.A. & Findlay W., 1987, Ada Language and Methodology, Prentice-Hall (UK) Ltd.
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