ANSI, Inc. Reference Manual for the Ada Programming Language. American National Standards Institute, Inc., Washington, D.C., January 1983.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... the multiplicity of forms, much of the work on concurrency is aligned with one of two basic paradigms: communication via shared variables (e.g. Concurrent Pascal [5] UNITY [10] communication via message passing (e.g. CSP [18] and Actors [1] including remote operations (e.g. Ada [3] and Argus [23] which we view as a highly structured message passing protocol. The two paradigms di#er in the mechanisms they provide for communication among concurrent processes. However, both rely upon the use of names to identify (directly or indirectly) the communicating parties. Given this ....

ANSI, Inc. Reference Manual for the Ada Programming Language. American National Standards Institute, Inc., Washington, D.C., January 1983.

....systems, worst case timing analysis. J. BLIEBERGER general loops: The other loop statement is of a very general form and is considered for implementing those loops that can not be handled by for loops. These loops include while loops, repeat loops, and loops with exit statements (cf. e.g. [4]) Determining the number of iterations of a for loop is trivial. For example the loop body of the loop loop body is performed exactly N times. Even nested loops do not constitute any problem. For example the innermost body of the loops for il in 1. N loop for i2 in 1. il loop for i3 in ....

....loops over conventional loops, however, we define an Ada like syntax which will be used in the following examples. But it is important to note that an appropriate syntax can be defined for other languages too. The syntax of a monotonical discrete loop is given by a notation similar to that in [4]. loop statement : loop simple name: iteration scheme] loop sequence of statements identifier : initial value in [reverse] discrete range For a loop with a discrete iteration scheme, the loop parameter specification is the declaration of the loop variable with the given ....

[Article contains additional citation context not shown here]

ANSI/MIL-STD 1815 A. Reference manual for the Ada programming language, 1983.

....[NH82] decentralise the operating system across a number of nodes. One of the design aims of these systems is to hide the distribution and create the illusion of a 2 single system. In contrast many programming languages provide language features such as RPC [Nel81, BN84] and the Ada rendezvous [DOD83] that enable the programmer to exploit distribution. Many different models of distribution in persistent and object oriented systems have been proposed and implemented [Lis84, Li86, LH89, Mos89, Wai89, KSD 90, WF90, HRK91] Each of these models operates on the data in different ways, such as ....

ANSI "Reference Manual for the Ada Programming Language". U.S. Department of Defense Technical Report ANSI/MIL-STD-1815A (1983).

....[Agha 1990] on the other. Generally speaking, such languages support concurrency of either objects or processes. Attempting to build a conversation tool within concurrent objects seemed unnatural, while the languages with concurrency of processes did not meet our practical requirements. Ada [ANSI 1983] has neither conversation nor atomic transaction tools, but it has data encapsulation with abstract data type features which can be used to implement atomic transactions. Its concurrency features are quite powerful, allowing both interacting processes with equal rights (for building a conversation ....

ANSI, ANSI/MIL-Std-1815a Reference Manual for the Ada Programming Language, American National Standards Institute, 1983.

....systems, worst case timing analysis. 1 2 J. Blieberger general loops: The other loop statement is of a very general form and is considered for implementing those loops that can not be handled by for loops. These loops include while loops, repeat loops, and loops with exit statements (cf. e.g. [4]) Determining the number of iterations of a for loop is trivial. For example the loop body of the loop for i in 1. N loop loop body end loop; is performed exactly N times. Even nested loops do not constitute any problem. For example the innermost body of the loops for i1 in 1. N loop ....

....loops over conventional loops, however, we define an Ada like syntax which will be used in the following examples. But it is important to note that an appropriate syntax can be defined for other languages too. The syntax of a monotonical discrete loop is given by a notation similar to that in [4]. loop statement : loop simple name: iteration scheme] loop sequence of statements end loop [loop simple name] iteration scheme : while condition j for for loop parameter specification j discrete discrete loop parameter specification for loop parameter specification : ....

[Article contains additional citation context not shown here]

ANSI/MIL-STD 1815 A. Reference manual for the Ada programming language, 1983.

....measures for the high level design of object based 1 software systems, to study whether information available at this development stage can be used to support the issues raised in points 1. 4. above. We worked in the context of high level designs for Flight Dynamics software, written in Ada83 [DoD83], in the Software Engineering Laboratory at NASA Goddard Space Flight Center (GSFC) Our goal was to define and validate a set of high level design measures to evaluate the quality of the high level design of a software system with respect to its fault proneness and understand which highlevel ....

ANSI/MIL-STD-1815A-1983, Reference Manual of the Ada Programming Languages, U.S. Department of Defense, 1983

....by the project. In the second year this constraint will be relaxed. Criticality: Highly desirable Criterion SW2 : The following options related to pragmas should be supported: Warning messages for all unrecognized pragmas Reference 1 Manual for the Ada Programming Language [2. 8(11) ANSI 83] Pragma INLINE should be supported (the compiler should detect and flag any situations where the pragma cannot be executed, for example, a recursive subprogram) LRM 6.3.2(4) Pragma INTERFACE should be supported for the assembly language of the target machine and for other languages for ....

ANSI. Reference Manual for the Ada Programming Language. ANSI/MIL-STD-1815A, 1983.

....in the routine execution tree is no longer needed or has been re attached to the receiving frame. 4.5.2.2 Frame Heap Many languages permit arrays to be allocated in a routine execution frame on the stack with an array size not determined until execution of the routine. Some languages (e.g. Ada [ANS83] permit such arrays to be returned as result values to CHAPTER 4. EXECUTION FLOW 131 the caller of the routine. The frame heap addresses these needs. It is a heap where ordinary objects may be allocated, as long as pointers to these objects are only stored in registers or value lists. This ....

ANSI, Washington, DC. Reference Manual for the Ada Programming Language, 1983.

No context found.

ANSI, `Reference manual for the Ada programming language', ANSI/MIL-STD 1815 A, American National Standards Institute, Washington, D.C., January 1983.

No context found.

ANSI, Inc., Reference Manual For The Ada Programming Language, ANSI/MIL-STD-1815A-1983, 1983.

No context found.

ANSI/MIL-STD 1815A, Reference Manual for the Ada Programming Language, February 1983

No context found.

ANSI/MIL-STD-1815A-1983, Reference Manual of the Ada Programming Languages, U.S. Department of Defense, 1983

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