ISO/IEC 8652. Ada Reference manual, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....problem for k i level pointers is undecideable. However, from this proof it follows that determining k = i (aka single) level pointers is almost trivial [9] solves this problem with polynomial effort whereas the algorithm we use (cf. 11] is almost linear w.r.t. time. Aliases and Ada95 In [8] (6.2) it is stated that parameters in Ada95 are either passed by copy or by reference. If a parameter is passed by copy, any information transfer between formal and actual parameter occurs only before and after execution of the subprogram. By copy parameter types are elementary types, or ....

....under consideration of the parameter passing mechanism. Since we restrict ourselves to acyclic procedure call graphs 2, it is possible to evaluate every callee before its callers (post order traversal of the procedure call graph) The parameter passing mechanism is modelled as it is specified in [8]. A parameter that is passed by copy is treated as follows: Mode in: This entity is not allowed to be used as an 1 value. Thus it is sufficient to replace such a formal parameter by the corresponding actual parameter (or default expression) at the CFG node representing the call site (cf. the ....

[Article contains additional citation context not shown here]

ISO/IEC 8652. Ada Reference manual, 1995.

....call (RPC) is a two way communication. The highest abstraction of the message passing paradigm are distributed object systems like CORBA and DCOM, where object methods can be invoked at remote sites which also results in a two way communication pat tern. Ada s Distributed Systems Annex (see [4]) also favours message passing. Application programs need to be aware of message sending or remote service invocation which means that e.g. fault tolerance has to be implemented explicitely into each distributed application. Adding and or removing sites from the net work of the distributed ....

ISO/IEC 8652, Ada reference manual, 1995.

....Example Figure 4 shows the CFG for the program fragment given in Figure 3. The SymEval equations for this hypothetical example are shown in Table 4. Note that we can restrict our interest to the variables Index, I, R, and Y because E cannot be overwritten within procedure foo (compare [6] for semantic details) Again we solve this set of equations according to the algorithm given in [12] X5 = Index mod 2 = 0) Xa) I (I, E 1) Index, Index 1) R, I Index 1) U( Index mod 2 = 0) Xa) I Fig. 4. Control Flow Graph of Hypothetical Example Procedure XEntry X ....

ISO/IEC 8652. Ada Reference manual, 1995.

....to the nodes of the CFG. In [PS97] it is proved that the employed method can be used to determine the exact timing behavior of a program and not only an upper bound of it. This can also be proved for our approach. In addition our symbolic approach can handle formal and generic parameters (cf. Ada95] too. 7. Partial evaluation is used in [NP93] to estimate the execution time of programs at compile time. This is done by use of compile time variables, i.e. a variable whose value is definitely known at compile time. Taking advantage of these values, programming language constructs can be ....

.... The set of equations for the reaching definitions problem of the power example is shown in Table 1 where we have written X i instead of Reach(B i ) Note that we can restrict our interest to the variables e, h, l, and y because x and n cannot not be overwritten within procedure power (compare [Ada95] for semantic details) We will use this set of equations in the following to solve the reaching definitions problem by an iteration algorithm. # In fact Reaching Definition has much more restrictive properties but those given above are enough to contrast this example with the data flow ....

[Article contains additional citation context not shown here]

ISO/IEC 8652, Ada reference manual, 1995. 2, 6

....interaction through a protected object (instead of the rendezvous) as presented in [10] However, this approach changes the semantics of the rendezvous, as: during rendezvous, the task accepting the entry call inherits the active priority of the caller (D. 1(22) of the Ada Reference Manual [5]) A different approach is to use a monitor object, which performs the synchronisation of the calling clients before the entry call, maintaining the rendezvous. This approach can lead to a priority inversion, which is already present in the rendezvous due to its semantics [1] Although an entry ....

ISO, Information technology - Programming languages - Ada, "Ada Reference Manual", ISO/IEC 8652, 1995.

....derived from Pascal, the Ada vs. Java discussion can be seen as a new battle of the C vs. Pascal war. However, it also became apparent that the Ada 83 standard lacked some features necessary to its main target: Real Time Systems development. The language revision and its standardisation (Ada 95 [6]) brought a more open and extensible language without losing the inherent integrity of Ada 83. It kept the Software Engineering issues, allowing for more flexibility in the software development process. A major evolution in the Ada language was the introduction of a new task model based on ....

ISO, Information technology - Programming languages - Ada, "Ada Reference Manual", ISO/IEC 8652, 1995.

....problem for k 1 level pointers is undecideable. However, from this proof it follows that determining k = 1 (aka single) level pointers is almost trivial [9] solves this problem with polynomial effort whereas the algorithm we use (cf. 11] is almost linear w.r.t. time. Aliases and Ada95 In [8] (6.2) it is stated that parameters in Ada95 are either passed by copy or by reference. If a parameter is passed by copy, any information transfer between formal and actual parameter occurs only before and after execution of the subprogram. By copy parameter types are elementary types, or ....

....consideration of the parameter passing mechanism. Since we restrict ourselves to acyclic procedure call graphs 2 , it is possible to evaluate every callee before its callers (post order traversal of the procedure call graph) The parameter passing mechanism is modelled as it is specified in [8]. A parameter that is passed by copy is treated as follows: Mode in: This entity is not allowed to be used as an l value. Thus it is sufficient to replace such a formal parameter by the corresponding actual parameter (or default expression) at the CFG node representing the call site (cf. the ....

[Article contains additional citation context not shown here]

ISO/IEC 8652. Ada Reference manual, 1995.

....by which the loop variable is incremented or decremented. 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 forloops. These loops include while loops, repeat loops, and loops with exitstatements (cf. e.g. [Ada95]) If a general loop does not complete, the corresponding program usually is incorrect. It is possible to use some logical devices, such as Hoare logic (cf. Hoa69] to prove that a certain loop (and thus the corresponding program) completes. This however implies that the programmer has to be ....

....loops over conventional loops, however, we define an Adalike 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 [Ada95]. 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]

ISO/IEC 8652. Ada Reference manual, 1995.

....Austrian Science Foundation (FWF) under grant P10188 MAT. 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. [Ada95]) Determining the number of iterations of a for loop is trivial. General loops, however, represent a very difficult task. In order to estimate the worst case performance of general loops many methods and tools have been developed, e.g. HS91, Par93, PK89] Summing up, most researchers try to ....

.... suitable for the back end Since only a minor part of the third phase is coded in a language other than Ada, the strengths of the Ada programming language also come into play in the source code of GNAT which properly reflects the structure of the corresponding chapters of the Reference Manual [Ada95]. This leads to a very modular functional design with no coupling between unrelated units. Despite the fact that the current release of GNAT has already been validated, development of the compiler is not yet finished. This means that modifications of the current release of GNAT might have to be ....

ISO/IEC 8652. Ada Reference manual, 1995.

No context found.

ISO/IEC-8652. Ada95 Reference Manual, 1995.

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