United States Department of Defence, Reference Manual for the Ada Programming Language. ANSI MIL-STD-1815, 1983.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the stubs must copy the data into and out of the memory used to move arguments between address spaces. Safety is not increased by first doing an extra kerneLlevel copy of the data. Copying in the kernel is not sufficient for ensuring safety when using type safe languages such as Modula2 or Ada [1] since each actual parameter must be checked by the stubs for conformity with the type of its corresponding formal. Without such checking, for example, a client could crash the server by passing in an illegal (e.g. out of range) value for a parameter. These points motivate the use of pair wise ....

United States Department of Defense. Reference Manual for the Ada Programming Language, July 1980.

....language represents a high level model of the computer on which we expect the resulting system to run. The above description is for a von Neumann computer. I would not expect the base language for a massively parallel computer to be the same. F r all of these considerations, we have chosen Ada[USDODAda83] as our base language for o future work. In addition, we hope to do future mechanism work in Ada. The choice of a base language is not important as long as one is chosen and it meets the above criteria. The construction of large, reliable, application systems in the base language is the problem; ....

United States Department of Defense, Reference Manual for the Ada Programming Language , ANSI/MIL STD 1815A-1983 , U . S . Government Printing Office. Ada is a registered trademark of the U.S. Government (Ada Joint Program Office). February 1983.

....package declarations [168] which allow more direct calls out to routines written in C than were previously possible. Perhaps the most famous of all SETL programs to date is Ada Ed [2, 135, 173] the first validated translator and executable semantic model for the language now known as Ada 83 [198]. It established convincingly that SETL is well suited for the rapid prototyping of complex systems of significant size, and that when care is taken in the construction of such prototypes, they can serve as readable, definitive specifications to inform and guide the building of production ....

United States Department of Defense. Reference Manual for the ADA Programming Language, ANSI/MIL-STD-1815A-1983. Springer-Verlag, New York, February 1983.

....subnets are denoted by squares. The weights between neurons b i and neurons 01 and 10 are not presented for clarity reasons. But the main idea is to activate one specific neuron for each binary string obtained. 2.10. Exceptions In high level languages, like Eiffel [Interactive 89] or Ada [USDD 83] exceptions are unexpected events occurring during the execution of a system and disrupting the normal flow of execution (e.g. division by zero or an operation overflow) Some exceptions are raised by the system, others by the program itself. The (hypothetical) neural net hardware is ....

United States Department of Defence, Reference Manual for the Ada Programming Language, American National Standards Institute Inc., 1983.

....Concurrent functional languages For a language to be useful it must be possible to write and execute programs in it. Languages for concurrency have essentially existed since the sixties, usually being in the traditional imperative model. Modern examples of such languages are occam [INM84] and Ada [DoD83]. 3.1 Process calculi in functional languages More recent approaches try to put concurrency features into the functional language model. A concurrent program can of course not be described in terms of a function from input to output. The resulting programming paradigm is best described as being ....

United States Department of Defense, Reference Manual for the Ada Programming Language, 1983.

....programs not necessarily must be correlated. However, if a single Ada program is to be distributed, the program would be erroneous if the task with the highest priority on each node is scheduled to execute, i.e. T2 and T3 respectively. According to the definition of Ada Language Reference Manual [1], LRM9.8(4) If two tasks with different priorities are both eligible for execution and could sensibly be executed using the same physical processors and the same other processing resources, then it cannot be the case that the task with the lower priority is executing while the task with the ....

United States Department of Defence, "Reference Manual for the Ada Programming Language", ANSI/MIL--STD--1815A, 1983.

....Ada 3 [2] now supports subclass dispatching. Tagged types provide the functionality of subclasses, and a dispatching call is similar in effect to sending a message to an object without knowing its specific class. The parent class must still be specified at compile time. The first Ada standard[3] was non dispatching. 1 Dynamic type checking requires each object to have a tag that tells the run time environment what its type is. Statically typed languages determine all types at compile time, so the types are implicit at run time. 2 Static binding implies that a function invocation in ....

United States Department of Defense. Reference Manual for the Ada Programming Language. U.S. Government Printing Office, Washington, D.C., 1983.

....framework. The language concepts described in this paper are intended to serve as a platform for the design of the prototyping language Griffin [D 90] currently under development at New York University. Our linguistic mechanisms can be seen as a combination of Ada (generic) packages [Uni83] ML polymorphism, signatures and structures [MTH90] Eiffel object classes [Mey88] Haskell type classes [HW90] and (partially) abstract types [MP88] Our design is most closely related to the recently proposed extension of Standard ML with subtyping and inheritance [MMM91] Supported by the ....

United States Department of Defense. Reference Manual for the ADA Programming Language. Springer-Verlag, 1983.

....changed, deleted, or possibly added. The effort involved in such tasks is expected to increase as a result of the Ada9x project, which is currently soliciting suggestions for changes to the language definition [3] Although the test suite is indexed by section numbers of the Ada Reference Manual [2], identifying where various features occur within the suite is not straightforward. First, the items of interest are often feature combinations rather than solitary features, and as such may be found in many different tests, even ones which are indexed by a manual section not pertaining to these ....

United States Department of Defense. Reference Manual for the Ada Programming Language. SpringerVerlag, 1983.

....that depend on the incorrect guess and restart them, running the computation in the original serial order. 2 Formulation and Example We assume a high level model in which independent sequential processes communicate by message passing or by making inter process calls, as in CSP [3] Ada [12], or Hermes [8] A feasible target environment is the Mach operating system [1] which supports both parallelism and distribution. Each process is written as a sequential program. However, the processes are compiled and instantiated separately. This means that there is no a priori ordering of ....

United States Department of Defense. Reference Manual for the Ada Programming Language, ANSI/MIL-STD-1815-1983 ed., February 1983. 13

....environment in which many people work simultaneously to meet development goals, and in which changes of design are common, regular inspection and validation of the design blueprints is desired. Compatibility of the design with the released code should be observed as well. The introduction of Ada [30] had two primary goals: to promote reusability of code through the wealth of the language constructs and to assist system design through its abstraction mechanisms. The elementary building block of Ada is the subprogram structure [9] Ada offers packages, tasks and generics as major structural ....

United States Department of Defense. Reference Manual for the Ada Programming Language, ANSI--MIL-- STD--1815A--1983 edition, February 1983.

....or difficult to reason about [20] None of these proposals define a formal semantic treatment of modules, and all these systems incorporate modules as a new primitive datatype orthogonal to other kinds of modularity structures such as records or objects. Languages such as Modula 3 [3] or Ada [24] also provide support for modules; however, the semantics of modules in these systems requires them to be statically defined at the top level and necessitates non trivial syntactic and semantic extensions to express parameterized modules. In the case of languages such as Haskell [10] or SML [19, ....

....along with their types) that are visible to the outside. The set of bindings associated with a given signature defines the module interface. Depending on the semantics desired, a module could be instantiated multiple times (e.g. as in Scheme 48 [12] or ML [18] or only once (e.g. as in Ada [24] or Clu [17] In high level programming languages such as Scheme [4] ML [19] or Haskell [10] the exclusive use of lexical binding and the absence of abstractions to construct and manipulate namespaces necessitates the inclusion of a module facility as part of the language kernel. This is ....

[Article contains additional citation context not shown here]

United States Dept. of Defense. Reference Manual for the ADA Programming Language, 1982.

....all these features. The following paragraphs list various parallel languages and point out the di erences between them and ParC. Programming Model Most of the imperative parallel languages are designed for distributed architectures rather than for shared memory machines [1] The Occam [29] Ada [30], Joyce [31] Concurrent C [32] and Cosmic C [33] languages, for example, provide facilities for synchronous or asynchronous message passing between parallel processes. This allows for ecient implementations on both shared memory and message passing architectures. However, programs written in ....

.... just like the closed control structures advocated for sequential languages [17] While this idea has caught on in sequential languages, and the use of goto has all but disappeared, most parallel languages still supply fork and join primitives instead of closed constructs; examples include Ada [30] and Concurrent C [32] In many cases, such as the C threads package [56] and MPC [14] the support for parallelism is limited to a direct interface to the run time system. Many other systems have no direct support for expressing parallelism within the language they assume a copy of the program ....

[Article contains additional citation context not shown here]

United States Department of Defence, Reference Manual for the Ada Programming Language. ANSI MIL-STD-1815, 1983.

No context found.

United States Department of Defense. Reference Manual for Ada Programming Language. ANSI/MIL-STD-1815A, 1983.

....example, as a layered implementation, where lower layers implement infrastructure to support particular kinds of interactions, while higher layers correspond to architectural components. In this model, the module structure, defined in a programming language such as Standard ML [HMM86] or Ada [DoD83] can be taken to represent the architecture of the system. However, when interpreted this way, calls that appear to communicate with modules at lower layers of the infrastructure may actually represent indirect, abstract communications with other components at the same level as the caller. The ....

....a mapping between WRIGHT and ACME is currently being developed. 2.5 Programming Languages, MILs, and IDLs 2.5.1 Programming Language Module Facilities A number of programming languages have facilities for describing the composition of systems at the module level. Examples include Ada packages [DoD83] Modula 3 modules [CDG 89] and Standard ML structures and functors [HMM86] These provide a means of developing components semi independently of each other and composing them based on their interfaces. Ada packages provide a means of limiting the visibility of the definitions of a program and ....

United States Department of Defense. Reference Manual for the Ada Programming Language, January 1983.

....Language Extensions Integrated with Advanced Database Extended Semantics) which provides many of the object management capabilities required to support software engineering environments. Pleiades is a database programming language in that it extends a programming language (in this case, Ada [57]) with capabilities associated with traditional databases. It does not provide these capabilities in the traditional database style, however. Whereas database systems have commonly focused on efficiency and a strict model of consistency, rejecting capabilities that violate these requirements, the ....

....the definition of, for example, varying length integer arrays is not supported directly and must be simulated with appropriate relation definitions. Programming languages generally support ordered sequences with array constructors or with linked lists, but most popular languages (e.g. Ada [57], C [25] C [49] do not support varying length arrays directly application code must simulate varying length arrays using other types. Object oriented databases often provide array constructors (e.g. 3, 60] but these are generally limited in the same ways that programming language arrays ....

[Article contains additional citation context not shown here]

United States Department of Defense, Washington DC. Reference Manual for the Ada Programming Language, Jan 1983. Military Standard Ada Programming Language.

....terminate in a similar manner. 5.7 Abortion The Ada abort statement allows a task to cause other tasks (or itself) to terminate, subject to Ada termination processing. An aborted task becomes abnormal, 8 but it can continue to run until it reaches a synchronization point as defined in the ARM [13]; these are roughly the places where the task could suspend. However, we have chosen to abort a task executing user code immediately when permitted by Ada. Otherwise, a runaway task could not be aborted, if it is caught in an infinite loop that does not contain any of the operations specified as ....

United States Department of Defense, Ada Joint Program Office. Reference Manual for the Ada Programming Language, February 1983. ANSI/MILSTD -1815A-1983.

....system. We suggest a hardware implementation of Ada tasking as a separate node in a distributed system [2] 3] The concept is not language dependent. Any language with a clearly defined tasking mechanism could benefit from such hardware support, but we have primarily concentrated on Ada 83 [4], since it is standardized (with Ada we mean Ada 83 in this paper) Most important of the previous work in the area of hardware implementation of Ada tasking, is ATAC [5] Full Ada 83 tasking is implemented as a co processor. ATAC in its current version 2.0 handles 32 tasks on chip, but the number ....

United States Department of Defence, "Reference Manual for the Ada Programming Language", ANSI/ MIL--STD--1815A, 1983. ATAC

....message sent by process src from the queue. If argument src is not provided, the first message in the queue is removed regardless of its source process. A receive statement that does not specify a source process for the message to be received is semantically similar to the select statement in Ada [4]. Communication occurs non deterministically by selecting whatever message arrives first. We call such a receive statement a non deterministic receive. The communication in a program is deterministic if and only if all receive statements specify a source process. Using Weiser s terminology [20] ....

United State Department of Defense, "Reference manual for the Ada programming language," (ANSI/MIL-SDT-1815A), Washington, D.C., 1983.

....of concurrent programs. Understanding and programming in concurrent programming languages appears to be significantly harder than in sequential languages. At the same time more and more programming is for multi processing systems. We are concerned specifically with the programming language Ada [16]. Ada is one of the few languages with high level constructs for concurrent and real time programming. Ada has a construct called a task which allows separate threads of execution to be done (potentially) in parallel. Tasks communicate and synchronize through what is called rendezvous, a form ....

United States Department of Defense. Reference Manual for the Ada Programming Language. United States Government Printing Office, 1983.

....a binary combining tree to share in the computation of the algorithm. 3. The nondeterministic divide can be implemented as a divide just before the last component of a vector (or just after the first component) thereby 6 A slice of a vector is a sequence of consecutive components of the vector [Uni83]. 3 yielding a sequential loop. Such a loop is often more efficient than the use of recursion to implement a diva algorithm on a sequential computer. Thus during a single use of a diva algorithm, some of the recursive activations such as those near the beginning of execution of the algorithm ....

....the base language because the examples given can then be both general and simple, since programmer accessible attributes (such as LENGTH and FIRST) and generics are available. In addition, most readers either will be familiar with Ada or have ready access to an Ada reference, such as [Bar84] and [Uni83]. In view of Ada s existing complexity, the author is not recommending that Ada be extended with syntax to support diva algorithms. Furthermore, a construct should be fully integrated within a language during the initial design of the language, since retrofitting a construct to an existing ....

United States Department of Defense. Reference Manual for the Ada Programming Language. ANSI/MIL-STD-1815A-1983, American National Standards Institute, 1983.

....allows object oriented programming in Common Lisp. Some languages combine the object oriented paradigm with concurrent computing. Examples of such languages are Actors [Agh86] and 69 Concurrent Smalltalk [Yok90] Some other languages also partially support the object oriented paradigm such as Ada [Uni80] Modula 2 [Wir85] etc. We have based our program model on Smalltalk since it seems to be the simplest language and is unencumbered with non object oriented features. We want to study on line changes in the object oriented model not just because it is a popular programming paradigm but also ....

United States Department of Defense. Reference Manual for the Ada Programming Language, 1980.

No context found.

United States Department of Defense, Reference Manual for the Ada programming language, ANSI/MIL-STD-1815A-1983, Department of Defense, Washington, D.C., January 1983.

No context found.

United States Department of Defence. Reference Manual for the Ada Programming Language. American National Standards Institute Inc., 1983.

No context found.

United States Department of Defence. Reference Manual for the Ada Programming Language. American National Standards Institute Inc., 1983.

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