W.R. Mallgren, Formal Specification of Interactive Graphics Programming Languages, The MIT Press, Cambridge, MA, 1983; an ACM Distinguished Dissertation.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....constructs (such as process communication in CSP [14] see the commentary in [16] but they have also provided inadequate definitions for language designers and implementors. There has been a strong desire to formalize many aspects of programming languages (such as those described in [13, 15, 20, 30, 36, 38]) This desire has been partly motivated by improving the correctness of programs written in the languages concerned, and partly to delimit more clearly the semantics of various language features. Several methods have been used to specify these semantic aspects operational and denotational ....

....for the application of the operations of the ADT. The data structure to be modelled in describing the semantics of a parallel programming language must have the ability to be accessed concurrently by several different processes. Consequently, we will employ the technique described by Mallgren [20] for the specification of shared data abstractions (SDA s) which permit the description of ADT s which are shared among parallel processes. In the next section, a brief introduction to the SDA technique will be given. Following this, the model of the semantics of communication and synchronization ....

[Article contains additional citation context not shown here]

W.R. Mallgren. Formal Specification of Interactive Graphics Programming Languages. M.I.T. Press, Cambridge, Massachusetts, 1983.

....processes; in our style of semantic model, this interaction leads to an ADT being accessed by multiple concurrent execution sequences. Fortunately, a suitable technique for the specification of concurrently accessed ADTs is available in the form of the shared data abstractions (SDAs) of Mallgren [13, 14]. This kind of ADT has subsequently been used to describe and compare a number of parallel programming languages [3] and in a formal description of intertask communication in Ada [17] This paper first considers Mallgren s approach to SDAs and discusses difficulties encountered with the technique ....

....normally used in specifying the operations of ADTs; in particular, notice that the type state occurs frequently in the specification of the functions in Figure 1. A little more unusual is the notation employed for the specification of the high level routines; following the convention used in [14], the state type is omitted from these operations in order to simplify specifications. For an abstract data type to be shown correct, there are two issues which must be dealt with: sufficientcompleteness and consistency [7, 10] The same properties are required of a shared data abstraction. ....

W.R. Mallgren. Formal Specification of Interactive Graphics Programming Languages. MIT Press, Cambridge, Massachusetts, 1983.

....languages, the underlying information structure model needs to be expanded. This can be done by introducing a new layer, directly above the ADT layer, to handle several processes trying to access the information structures; this layer would employ Shared Data Abstractions (SDA s) described in [Freidel84, Freidel88, Mallgren83]. ATLANTIS would then provide a language definition technique able to describe both sequential and parallel languages, whilst providing a formal and readable language definition from which an interpreter or compiler prototype can be produced automatically. 5. Acknowledgements Part of the work ....

W.R. Mallgren. Formal Specification of Interactive Graphics Programming Languages. M.I.T. Press, Cambridge, Massachusetts, 1983.

....program. More recently, there has been a revival of interest in the handling of multi threaded dialogues. The fundamental perception is of the user as a real time system asynchronous and unpredictable [128] and that therefore interaction should be treated as a problem in parallel computation [76]. Syntactic input parsing suffers two further fundamental objections. Firstly, whereas some use of formal grammars in input parsing is for descriptive and analytical purposes [102, 97, 85] current use in UIMS is prescriptive. That is, the grammar determines the acceptable input sequences. We can ....

W.R. Mallgren. Formal Specification of Interactive Graphics Programming Languages. MIT Press, 1983.

....structure model needs to be enhanced. Work is proceeding in this area through the introduction of a new layer, directly above the ADT layer, to handle several processes trying to simultaneously access the information structures; this layer employs shared data abstractions (SDAs) as described in [3, 19, 21, 23]. However, until the issues involved in the definition of parallel programming languages is more fully explored, it remains unclear which generation technique is most appropriate for the automatic translation of ADT specification. These issues are currently being investigated; in the meantime ....

W.R. Mallgren. Formal Specification of Interactive Graphics Programming Languages. MIT Press, Cambridge, Massachusetts, 1983.

....the application of the operations of the ADT. The data structure to be modelled in describing the semantics of a parallel programming language must admit the possibility of being accessed concurrently by several different processes. Consequently, we will employ the technique described by Mallgren [9] for the specification of shared data abstractions (SDA s) this technique permits the description of ADT s which are shared among parallel processes. In the next section, the Ada rendezvous concept is briefly discussed. The following section presents a model based on the concepts outlined above. ....

....may attempt to access the queues associated with the entry e1 of T1 at the same time. Such queues must be protected to ensure data integrity and suitable behaviour. In this context, ordinary abstract data types are insufficient. The model described here uses shared data abstractions (SDA s) [9] to represent such objects. Operation Description read If there is a value to read in the communication port, it is read and the value returned; otherwise, the calling process is forced to wait until there is a value to read. write(A) Write the value A to the communication port. The writer must ....

W.R. Mallgren. Formal Specification of Interactive Graphics Programming Languages. M.I.T. Press, Cambridge, Massachusetts, 1983.

....mathematical description, we try to identify and to describe the basic operations needed to build them before to choose any concrete data structures and programming language. In order to do that, we use a formal specification method which has lead to significant results in computer graphics [12, 13]. More precisely, we use the algebraic specification framework, a well know methodology [15] which has produced good results in geometric modeling, particularly in topology [3] With the help of this method we describe a modules hierarchy specifying various models of varieties. These modules use ....

W. R. Mallgren. Formal specification of interactive graphic programming languages. ACM dist. dissertation, MIT Press, USA, 1982.

....the application of the operations of the ADT. The data structure to be modelled in describing the semantics of a parallel programming language must admit the possibility of being accessed concurrently by several different processes. Consequently, we will employ the technique described by Mallgren[7] for the specification of shared data abstractions (SDA s) this technique permits the description of ADT s which are shared among parallel processes. In the next section, the Ada rendezvous concept is briefly discussed. The following section presents a model based on the concepts outlined ....

....may attempt to access the queues associated with the entry e1 of T1 at the same time. Such queues must be protected to ensure data integrity and suitable behaviour. In this context, ordinary abstract data types are insufficient. The model described here uses shared data abstractions (SDA s)[7] to represent such objects. Task T1; accept e1; Task T2; accept e2; T1.e1; Task T3; T1.e1; T2.e2; in list in list out list out list T1.e1 T2.e2 info in info out info in info out T1 T2 T1.e1 T2.e2 T3 e1 e2 T1.e1 (a) b) Figure 1. Communication paths of Ada tasks. ....

W.R. Mallgren. Formal Specification of Interactive Graphics Programming Languages. M.I.T. Press, Cambridge, Massachusetts, 1983.

....Specifications can be made operational in a term rewriting system [8] with a correct orientation of equations and sometimes completion. Then, techniques of logical prototyping can be used to point out possible design errors. These techniques have been fulfilling in computer graphics languages [9, 10], mechanical proof in geometry [11] and geometric modeling [12] The method we propose is more abstract, general and productive than conventional ones for our geometric problem. It allows us to completely and logically define the self refinement. Then, by appropriate choices of control structures ....

W.R. Mallgren. Formal specification of interactive graphic programming languages. ACM Dist. Dissertation. MIT Press, USA, 1982.

No context found.

W.R. Mallgren, Formal Specification of Interactive Graphics Programming Languages, The MIT Press, Cambridge, MA, 1983; an ACM Distinguished Dissertation.

No context found.

W.R. Mallgren, Formal Specification of Interactive Graphics Programming Languages, MIT Press, Cambridge, Massachusetts, 1983.

No context found.

W.R. Mallgren, Formal Specification of Interactive Graphics Programming Languages, The MIT Press, Cambridge, MA, 1983, An ACM Distinguished Dissertation.

No context found.

William R. Mallgren. Formal Specification of Interactive Graphics Programming Languages. PhD thesis, Univ. of Washington, 1982. ACM Distinguished Dissertation.

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