Mart'in Abadi, Luca Cardelli, Benjamin Pierce, and Gordon Plotkin. Dynamic typing in a staticallytyped language. ACM Transactions on Programming Languages and Systems, 13(2):237--268, April 1991. Revised version of [1].  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the old and new fairness notions coincide, which is shown below. Note that the two requirements for L to be a liveness condition and for (A; L) to be environment free have their analogous counterparts in TLA: the former corresponds to machine closureness and the latter to receptiveness (see [AL93, GSSL93] Lemma 3.3.2 (Correspondence of Fairness Notions) Let A be a safe I O automaton and L a liveness condition which is induced by the TLS formula F = i=1 WFA ( i ) j =1 SFA ( j ) Furthermore, define B to equal A for the safety part, i.e. X (B) X (A) for every component X 2 ....

Martin Abadi and Leslie Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 1(15):73--132, 1993.

....rewrite system was originally designed to facilitate the creation and maintenance of software. The authors state that: The overall aim of our investigation has been to help people to write correct programs which are easy to alter. 9] Although restricted to applicative (functional) languages [13], term rewriting has been successfully applied in the development of transformation tools for legacy COBOL systems [43] A third method for implementing transformations is the manipulation of program representation structures. These structures not only record the syntactic structure of a program, ....

Martin S. Feather. A System for Assisting Program Transformation. ACM Transactions on Programming Languages and Systems, 4(1):1-20, January 1982.

....1: Benchmark characteristics. Sequential time is the run time for the single tile case. Application suite Table 1 lists the characteristics of the benchmarks used for the evaluation. The benchmarks are derived from the following sources: Rawbench [3] SPEC [9] Mediabench [15] UTDSP [16] Jade [24], UC Berkeley MPEG 1 Tools [26] and CHAOS [29] Benchmarks include several dense matrix applications, multimedia applications, and applications with irregular memory access patterns. All the benchmarks are ordinary sequential programs written for a unified address space. Rawcc compiles them ....

M. C. Rinard and M. S. Lam. The Design, Implementation, and Evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May 1998.

....as knowledge of what data is private is critical in understanding parallel and distributed programs. Jade is a safe language that distinguishes local from global pointers, and which allows some heap data to be private. This private data can never be transitively reachable from the shared heap [31], which corresponds to our early enforcement system (Section 3.3) Our results show that where security is not a primary concern, significantly more flexible sharing of data is possible, allowing for more data to be statically identified as private and thereby making privacy dependent analyses ....

M. C. Rinard and M. S. Lam. The design, implementation, and evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May 1998.

....system properties for the system in this simplified context, and if we can prove that the true context models implement these abstractions, we can deduct that the critical system properties are fulfilled for the system model in its true context. We plan to apply the ideas of Abadi and Lamport (cf. [AL93]) to our formalism: They investigate for which classes of properties we can deduct properties of the total system from proved properties of the system components. 1 This module computes the output of a sensor on the belt. 2 MODULE MSensor 52 53 54 56 57 ....

....AS step eut transfer; Fig. 4. The context model A detailed model of the total system might be too large for automatic analyses. Thus, an analysis method taking into account the modular structure of the system would be helpful. We investigate how we can apply the results of Abadi and Lamport [AL93] in our context. Acknowledgements We thank the HyTech team for their work. It was a source of inspiration and ideas to us. ....

Martin Abadi and Leslie Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73 132, 1993.

....information has to be added for each component composition. By contrast, in Themis, the dependence metadata is associated with each component. The dependences between components is automatically calculated from this information. In some sense, Themis can be regarded as an extension of Jade [27]. Jade is a parallel object oriented language based on C . Each method has an associated access descriptor which describes the objects it may read or write. Jade s run time system automatically arranges the synchronization and communication required. In Jade, an access to an object in shared ....

Martin C. Rinard and Monica S. Lam. The design, implementation, and evaluation of jade. ACM Transactions on Programming Languages and Systems, 20(3), May 1998.

....information has to be added for each component composition. By contrast, in THEMIS, the dependence metadata is associated with each component. The dependences between components is automatically calculated from this information. In some sense, THEMIS can be regarded as an extension of Jade [29]. Jade is a parallel object oriented language based on C . Each method has an associated access descriptor which describes the objects it may read or write. Jade s run time system automatically arranges the synchronisation and communication required. In Jade, an access to an object in shared ....

Martin C. Rinard and Monica S. Lam. The design, implementation, and evaluation of jade. ACM Transactions on Programming Languages and Systems, 20(3), May 1998.

....) 9i o c: NAT(m; c) IN(m; i) SOF(i; o)OUT(o; c) Once again the example fails to satisfy this. Like our reference model, the Functional Documentation model insists on a rigid division between system and environment control of designated terminology. Some other systems, like Unity [4] and TLA [9, 1], leave to the user such matters as distinguishing environment from system and domain knowledge from requirements, but support shared control of a designated term by system and environment. For example, in the Unity formalism it is possible to express that both E and M control a Boolean variable ....

....is easier to document and think about than shared control. When necessary, shared control can be modeled by using two variables one controlled by the system, the other by the environment together with an assertion in W that they must be equal. The composition and decomposition theorems of TLA [1] are particularly valuable when parts of the formal documentation are not complete and unconditional (as they are required to be in the Functional Documentation model) For example, the TLA composition theorem can be used to prove adequacy of a specification even when all of the domain knowledge, ....

Martin Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507--534, May 1995.

....properties for the system in this simplified context, and if we can prove that the true context models implement these abstractions, we can deduct that the critical system properties are fulfilled for the system model in its true context. We plan to apply the ideas of Abadi and Lamport (cf. AL93] to our formalism: They investigate for which classes of properties we can deduct properties of the total system from proved properties of the system components. 1 This module computes the output of a sensor on the belt. 2 MODULE MSensor 3 4 INPUT 5 in: SYNC; 6 pos: ANALOG; 7 ....

....46 47 48 Fig. 4. The context model A detailed model of the total system might be too large for automatic analyses. Thus, an analysis method taking into account the modular structure of the system would be helpful. We investigate how we can apply the results of Abadi and Lamport [AL93] in our context. Acknowledgements We thank the HyTech team for their work. It was a source of inspiration and ideas to us. ....

Martin Abadi and Leslie Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73--132, 1993.

....to store them together; un fixed objects can be migrated by the system. Similarly, the COOL [5] programmer can provide locality hints by expressing affinity between objects and threads. In addition there are hierarchical schemes, e.g. zones [23] that avoid pointto point relationships. In Jade [21], the programmer declaratively provides information about how the program access data (read only, write, etc. Although user provided placement information is likely to result in the best performance the main problem is that annotation based mechanisms are prone to inheritance anomalies. ....

Martin C. Rinard and Monica S. Lam. The design, implementation, and evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20(3):483-- 545, May.

No context found.

Mart'in Abadi and Leslie Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems,15(, January 1993.

No context found.

M. Rinard and M. Lam. The design, implementation, and evaluation of jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May 1998.

No context found.

Martin S. Feather. A system for assisting program transformation. ACM Transactions on Programming Languages and Systems, 4(1):1-20, January 1982.

No context found.

M. Rinard and M. Lam. The design, implementation, and evaluation of jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May 1998.

No context found.

Mart'in Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507--534, May 1995.

....(n 1) 0 instantiate (5) n 1) f (n) fold 3 with 5 (6) From equation 3, the desired equation, equations 4 and 6, the original equations, have been produced. By the rede nition rule equations 4 and 6 can be transformed to 3 because 3 can be transformed to 4 and 6. Later on Feather [Fea82] looked at the application of the FUM to larger problems by using meta programs to guide the transformation process. The system he developed introduced additional levels of abstraction above the FUM. The transformation strategy level is for describing overviews guiding the transformation of ....

....the duplication of computation. One function is used to calculate two values which are arrived at via the same intermediate results and return both values in a tuple. By calculating both values together we eliminate duplicated calculation of the intermediate result. Tupling is mentioned in [Fea82] and [PP96] Generalisation of a function can help to increase its eciency indirectly by transforming it into a function which is amenable to further transformation [Dar77] An example of generalisation is the conversion of a recursive function into tail recursive form, by introducing an ....

[Article contains additional citation context not shown here]

Martin S. Feather. A system for assisting program transformation. ACM Transactions on Programming Languages and Systems, 4(1):1 - 20, 1982.

....with other threads and which may not. Escape analysis is an obvious analysis to use for this purpose it recognizes data that is captured within the current thread and therefore inaccessible to other threads [11, 21, 98, 13, 82] The programming model may also separate shared and private data [92, 89, 81, 58], in some cases the analysis may automatically infer when pointers point to private data [65] More elaborate analyses may recognize actions (such as acquiring a mutual exclusion lock or obtaining the only existing reference to an object) that temporarily give the thread exclusive access to ....

M. Rinard and M. Lam. The design, implementation, and evaluation of jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May 1998.

....the effects of each procedure, i.e. the regions that it accesses [8] The type checking algorithm is extended to statically verify that the specified effects correctly reflect the accesses of the procedure. Access declarations in Jade allow programmers to specify how tasks access shared objects [13]. The access declarations are used to parallelize the program, and are dynamically checked by the Jade run time system. In both Jade and FX 87, the specifications operate at the granularity of complete objects there is no way to specify that a procedure or task accesses part of an array or ....

M. Rinard and M. Lam. The design, implementation, and evaluation of jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May 1998.

....the effects of each procedure, i.e. the regions that it accesses [8] The type checking algorithm is extended to statically verify that the specified effects correctly reflect the accesses of the procedure. Access declarations in Jade allow programmers to specify how tasks access shared objects [13]. The access declarations are used to parallelize the program, and are dynamically checked by the Jade run time system. In both Jade and FX 87, the specifications operate at the granularity of complete objects there is no way to specify that a procedure or task accesses part of an array or ....

M. Rinard and M. Lam. The design, implementation, and evaluation of jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May 1998.

No context found.

Mart'in Abadi, Luca Cardelli, Benjamin Pierce, and Gordon Plotkin. Dynamic typing in a staticallytyped language. ACM Transactions on Programming Languages and Systems, 13(2):237--268, April 1991. Revised version of [1].

No context found.

Rinard, M.C., Lam, M. S. The Design, Implementation, and Evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May.

No context found.

Rinard, M.C., Lam, M. S. The Design, Implementation, and Evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May.

No context found.

Rinard, M.C., Lam, M. S. The Design, Implementation, and Evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May.

No context found.

Rinard, M.C., Lam, M. S. The Design, Implementation, and Evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20(3):483--545, May.

No context found.

Martin C. Rinard and Monica S. Lam. The design, implementation, and evaluation of Jade. ACM Transactions on Programming Languages and Systems, 20#3#:483# 545, May.

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