J. G. P. Barnes. Programming in Ada 95. Addison-Wesley, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a better chance of obtaining a clean and unified parallel programming model. Also, this approach facilitates implementation of efficient compiler optimizations, and the development of effective debugging tools. As a result, many parallel languages have been described in the literature (e.g. Ada [35], Occam [36] and Orca [33] Despite years of intensive research, no parallel language has truly found widespread acceptance (either in the imaging community or elsewhere) One important reason is that it was found to be extremely difficult to design language features that are both generally ....

Barnes J. Programming in Ada 95 (1st edn). Addison-Wesley: Reading, MA, 1995.

....execution of statements in the entry body of the callee task, the caller task will be suspended. When the callee task finishes the execution of its entry body, both caller and callee will resume execution independently. This potential relationship between caller and callee can easily be referred [Bar95] as a rendezvous . 5.1.2 Protected Object Besides sending message directly to each other by using rendezvous, tasks also can communicate with each other by accessing shared data. Hence, synchronization Figure 5.1 The Egg Shell Model must be served. The typical solution of synchronization is ....

Barnes, J. G. P., Programming in Ada 95, Addison-Wesley, Reading, Massachusetts, 1995.

....(e.g. freedom of deadlock) all the proofs in this report are conducted in Z. This is a new and interesting result as now Z tools, usually used for proofs about sequential programs, can be used to provide formal proofs of CSP properties, hence concurrent programs. 1 Introduction Ada [3, 6] is a high level programming language designed specifically to address large systems where issues issues like reliability and safety are major concerns. The language has proved to be successful in industry, namely in the area of highintegrity systems; for example, over 997, of the aviation ....

....In that section we will show that although the motivation for providing a formal semantics for Ravenscar protected objects is a specialised one, the results are of general interests to the area of verifying concurrent programs. 2 Ravenscar Protected Objects By and large, Ada protected objects [3,6, 11] provide a mechanism for asyn chronous communication between tasks over shared variables. The declaration of an Ada protected object comprises two main parts: the private data to be shared between the communicating tasks, and an interface of operations for accessing that data. The data ....

Barnes, J. Programming in Ada 95. Addison-Wesley, 2nd ed. edition, 1998.

....CSP specifications can be applied to Ravenscar programs. In turn, this raises our confidence in these programs and their reliability. We will formally verify our implementation of the CSP chan nel using the Circus model of Ravenscar protected objects provided in [3] 1 Introduction Ada [4, 7] is a high level programming language designed specifically for large systems, where issues like reliability and safety are major concerns. The language has proved to be successful in the area of high integrity industrial systems; for example, over 99 of the avionics software in the Boeing 777 is ....

....provides a CSP model for the Ravenscar implementation. Then, using the CSP model, section 5 shows that the implemented Ravenscar channel has the same semantics as CSP channels. Finally, Section 6 draws con clusions and discusses related work. 2 Ravenscar protected objects Ada protected objects [4, 7, 10] provide a mechanism for asynchronous communi cation between tasks over shared variables. The declaration of an Ada protected object comprises two main parts: the private data to be shared between the communicating tasks, and an interface of operations for accessing that data. The data ....

J. Barnes. Programming in Ada 95. Addison-Wesley, 2nd ed. edition, 1998.

....This has resulted in a concise, compact graphical notation which attempts to combine the best features of diagramming with those of well indented source code. A comparison of the CSD with plain text source code is shown in Figure 1 and Figure 2. Figure 1 contains Ada 95 source code adapted from [3]. Figure 2 contains that same source code rendered as a CSD. While the same structural and control information is available in both figures, the CSD makes the control structures and control flow more visually apparent than does the plain text alone, and it does so 0 7803 5643 8 99 10.00 1999 IEEE ....

Barnes, J. G. P. (1984) Programming in Ada, Second Edition, Menlo Park, CA: Addison-Wesley.

....for short) 4, 10] is the Ada version of PDN. System Dependence Net(SDN for short) 16] is a representation model extended from each of PDN and SDG. It can represent dependences and interprocedural relations which exist in a concurrent program with multiple procedures. In general, since Ada 95[1, 9] programs are concurrent programs including multiple procedures, if we could analyze program dependences and interprocedural relations in Ada 95 programs and represent them with SDNs, it would be very helpful for development and maintenance of the software systems by using many applications of the ....

J. Barnes. Programming in Ada 95. AddisonWesley, 1995.

....and the group behavior is an abstract state transition model inherited and refined from the group level to the object level of our methodology. The synchronization tools provided by the CAOLAC MOP differ from the ones found in usual concurrent objects languages such as Java [14] Ada 95 [5], GUIDE [4] or DRAGOON [3] Java concurrent objects or Ada 95 protected objects, are synchronized with Hoare s monitors. When a method is declared synchronized in Java, only one thread can be run at a time when this method is requested. Thus objects are mono or multi threaded, but there is no ....

J. Barnes. Programming in Ada. Addison-Wesley, 2nd edition, 1995.

....as suppliers, tax auditors and safety inspectors. The generic package containing the protected object must be instantiated for each additional group, and the family of entries extended for additional alternatives in the select statement in the Santa task. This is a well know Ada technique; see [1], p. 436. A SOLUTION IN JAVA Java [5] is a new object oriented language developed at Sun Microsystems, Inc. While superficially similar to C , Java does not contain dangerous features inherited from C, such as explicit pointers, unchecked array access and file scope. In addition to the ....

J. Barnes. Programming in Ada 95. Addison-Wesley, Reading, MA, 1995.

....Composer Connector of Omo 7.3. 3 The Ada 95 Experiment Because of the similar properties and goals of Java and Ada 95 (Object oriented, type safe, concurrent language constructs) it seems to be possible to map the Ada 95 programming language quite well to the virtual machine specification of Java [Taf96, Sun95b, Bar95]. Thus, Intermetrics provides a beta version of an Ada 95 to Java byte code compiler, called AppletMagic. We use this compiler in order to develop a fruitlet for the open message organizer. We implemented another FolderRetrieverConnector fruitlet fully in Ada 95. The functionality is exactly the ....

J. Barnes. Programming in Ada 95. Addison-Wesley, 1995.

....types are signatures and the parameter values are the structures which implement a given signature. This binding of structures to structures using signatures to define communication bears an obvious similarity to the composition operation in BDL. Similar mechanisms are provided by the Ada 83 [DoD1983, Barnes1984] and Ada 95 [ISO1995, Skansholm1997] programming language. Ada uses the term package to describe a module of code, and packages can be parameterised or made generic in Ada terminology. Generic packages differ from ML functors in the type of the parameters used: where ML allows parameterisation by ....

J.G.P. Barnes, "Programming in Ada" Second Edition, Addison-Wesley, 1984.

....of any programming language. If large scale problems are to be solved then there must be an efficient way of partitioning the algorithm into smaller sub cases, and then integrating these into a single program. For this to work the boundaries between the subproblems must be well specified. Ada [ Barnes, 1989 ] does this using a package structure. Each package represents a subproblem that has been solved. A package has a well defined interface allowing other packages to import it, and a body representing the code that performs all of the work. In the BSP model processes must bulk synchronise. If all ....

....construction of Opal programs by many programmers. Since Opal type checks both process and group specifications, well defined interfaces between libraries and user code are formed. Groups follow the package style system of modular languages such as Modula 2, Modula 3 [ Harbison, 1992 ] and Ada [ Barnes, 1989 ] A group specification is all that is needed to be known by a user of that group. The actual method of implementing the group can be hidden, as is the normal method for abstract data types. 4.12.1 Inter Group Communication Overview Unlike processes within a group, multiple groups execute ....

[Article contains additional citation context not shown here]

J Barnes. Programming in Ada. Addison-Wesley, 1989.

....facilities. Persistent data may be written to a file or a preprocessor may provide a database application interface, but individual processes remain essentially stateless. Data modelling techniques developed for programming languages reflect the requirements of their application domains. Ada [Barnes 89] for instance, is intended for high integrity, embedded systems and data abstraction is employed as an information hiding mechanism. Object oriented programming languages (OOPLs) have evolved from the requirements of the AI and process simulation domains. They embody the principle of data ....

Barnes, J.G.P.: 'Programming in Ada', 3rd edition., AddisonWesley, 1989, ISBN 0 201 17566 5.

....modified by a different parallel task. Signals [Wirt77] semaphores [Dijk68] conditional critical regions [Hoar72] Hans73] and monitors [Hoar74] are schemes that have been developed to solve the mutual exclusion problem. Languages based on these concepts have also been developed including Ada [Barn89] and Modula [Wirt77] 3 Delta networks for instance have a cost logarithmic to the number of inputs. CHAPTER 2. THE QUEST FOR HIGH PERFORMANCE 36 2.5.2.2 Distributed Memory MIMD Architectures Message passing MIMD machines have principally been constructed in an effort to provide architectures ....

Barnes, J. G. P., "Programming in Ada", Addison Wesley, 1989.

....we have taken the first steps towards defining a new programming language. This language is a cross between Ada and Lisp. The essential ingredient it takes from Ada is the concept of strong typing and the concept of generics as a way of making strongly typed data and functions practical to use [Barnes 82] The essential ingredient it takes from Lisp is the concept of having programs basically be their parse trees [Steele 84] The resulting language might best be considered a strongly typed Lisp. Note that it is important here to distinguish between a language and its parser. While the underlying ....

Barnes, J. 1982. Programming in Ada. Addison-Wesley.

....is more complicated. Like the standards that it follows (GKS [48] and PHIGS [49] PREMO is intended to be independent of any particular programming language. Thus, just as one can obtain a C [58] binding or a FORTRAN [16] binding for GKS, it should be possible to obtain a C [79] or Ada 95 [7] binding for PREMO. The need to provide this flexibility raises a number of difficult technical questions, not the least being whether it should be possible to bind PREMO to a language with no explicit support for object oriented programming (e.g. FORTRAN 77 [82] For now, the main point is that ....

....towards object oriented implementations. An object type introduces variables that will be part of the state of each instance of that type, and similarly, operations that will be available in the interface of each instance 1) PREMO, like mainstream object oriented languages such as C , Ada 95 [7], and Java [36] has adopted a static object model, where the structure of an object is fixed by its type, and cannot be modified at run time. Models have been proposed in which the structure of an object can be modified dynamically, i.e. while the system is running. Approaches such as CLOS [11] ....

[Article contains additional citation context not shown here]

J. Barnes. Programming in Ada'95. Addison--Wesley, 1996.

....implementations [Harrison Ossher 90] However, a method can be subdivided only for particular values of a parameter or global variable, not its class; this is much like supporting only CLOS s eql specializers. A number of languages, including C [Stroustrup 86, Ellis Stroustrup 90] Ada [Barnes 91] and Haskell [Hudak et al. 90] support static overloading on function arguments, but all overloading is resolved at compile time based on the static types of the arguments (and results, in the case of Ada) rather than on their dynamic types as would be required for true multiple dispatching. ....

J. G. P. Barnes. Programming in Ada, 3rd Edition. Addison-Wesley, Wokingham, England, 1991.

....among the client tasks so that only one task at a time can gain access to the printer object. There are many such practical situations where synchronization is very important. Thus, synchronization among tasks accessing an object is a critical issue. In the specific context of Ada 95 [2], Burns and Wellings have identified three methods to introduce synchronization among objects in a concurrent environment [1] These methods are listed as follows: 1. Synchronization is added if and when it is required, by extending the object. 2. Synchronization is provided by the base (root) ....

J. Barnes, Programming in Ada 95. AddisonWesley, Inc., 1996.

No context found.

J. G. P. Barnes. Programming in Ada 95. Addison-Wesley, 1996.

No context found.

J. Barnes. Programming in Ada 95, first edition. Addison Wesley, 1995.

No context found.

J. Barnes. Programming in Ada 95, first edition. Addison Wesley, 1995.

No context found.

J. Barnes. Programming in ADA 95. Addison-Wesley, 1996.

No context found.

J. G. P. Barnes, Programming In Ada, 3rd edn, Addison-Wesley, 1989.

No context found.

BARNES, J. G. P. Programming in Ada 95. AddisonWesley, 1996.

No context found.

J.G.P. Barnes, "Programming in Ada", Addison-Wesley, l.ondon, 1982.

No context found.

J.G.P. Barnes, Programming in Ada, Addison wesley Publishing Company, 1989

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