Paul Steckler. Detecting local channels in Distributed Poly/ML. Technical Report ECSLFCS -96-340, Laboratory for the Foundations of Computer Science, Edinburgh University, January 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to approximate which functions can be called from a particular point in the program. Some instances of these static analyses are also known as closure analysis, setbased analysis and constraint based analysis which differ in their formulations, the precision they offer and their practicality [9, 10, 11, 12, 13, 14]. More recently, some authors have pointed out the intuitive connection between reasoning about types and control flow in higher order languages in the sense that they both derive invariants about the potential bindings of variables in a program. Research has been carried out in extending control ....

.... Another direction of research has focused on systematic comparisons of type systems and control flow systems by establishing correspondences between certain type systems and control flow analyses [17, 18] Variations for control flow analyses developed for concurrent programming languages such as [10, 11, 13] could offer a solution to the problem of detecting potentially transmissible functions. However, an effect based analysis which exploits the existing type system would be more easily applicable. The latter is also the one which is proposed by [3] We propose an effect based solution to the above ....

P. Steckler. Detecting local channels in Distributed Poly/ML. Technical Report ECS-LFCS-96-340, LFCS, University of Edinburgh, 1996.

....Riely and Hennessy [RH98] for a distributed calculus with site failure. Several authors have given type systems that enforce information flow properties, e.g. HR98, SV98] A type system that enforces secrecy and freshness for the Spi Calculus [AG97] has been proposed by Abadi in [Aba97] In [Ste96] Steckler has given a static analysis technique for distributed Poly ML with similar motivation to ours to detect when channels are guaranteed to be local to a single processor. It incorporates also some reachability analysis, but does not separate input and output capabilities. Finally, ....

Paul Steckler. Detecting local channels in distributed Poly/ML. Technical Report ECSLFCS -96-340, University of Edinburgh, January 1996.

....of barbed bisimulation congruences for a CCS like calculus extended with locations and failure. Finally, in [SY97] Sekiguchi and Yonezawa give a calculus in which a number of different mechanisms for code and data migration can be described. Related type systems and static analyses In [Ste96] Steckler has given a static analysis technique for distributed Poly ML with similar motivation to ours to detect when channels are guaranteed to be local to a single processor. It incorporates also some reachability analysis, but does not separate input and output capabilities. Nielson and ....

Paul Steckler. Detecting local channels in distributed Poly/ML. Technical Report ECSLFCS -96-340, University of Edinburgh, January 1996.

....potentially greater than of detecting local channels. We then deliberately omit channels from our treatment and adopt references as our mutable objects of study. We give a small step operational semantics for the language in a style similar to the semantics of concurrent ML given in [2] 9] and [11]. We use evaluation contexts in order to reduce the number of rules in the operational semantics [3] Evaluation contexts are terms with a hole in them, given by the grammar: E[ j E[ M j V E[ j (E[ M) j (V; E[ j if E[ then M else M 0 j let x = E[ in M The notation ....

....; 8) By the Concurrent Type Preservation theorem there is j respecting S j , j i . Hence by (8) above and Lemma 9 we have that if r 2 Reach i i ;S i ( and r 2 Reach j j ;S j ( 0 ) then = 0 . 5. 1 Related work Locality issues in Distributed Poly ML are addressed in [11] where a global data ow analysis to detect local channels is presented. The syntactic approach to data ow analysis used there built upon earlier work for sequential languages, for example, 12] and [13] Such global analyses, contrary to the type based analysis designed here, are inherently ....

Paul Steckler. Detecting local channels in Distributed Poly/ML. Technical Report ECSLFCS -96-340, Laboratory for the Foundations of Computer Science, Edinburgh University, January 1996.

.... [1994, Chapter 5] eliminates redundant binding of procedure parameters; the selective thunkification transformation in Steckler [1994, Chapter 6] and Steckler and Wand [1994a] prevents thunking of procedure arguments that are certain to be evaluated under call by name; and the analysis in [Steckler 1996] detects local channels in a concurrent, distributed language. 13. CONCLUSIONS We have presented a method for proving the correctness of an optimized closure conversion transformation. Our analysis relies on applying deduction rules to provide program annotations. Some components of our ....

Steckler, P. 1996. Detecting local channels in Distributed Poly/ML. LFCS Rep. ECS-LFCS96 -340, Univ. of Edinburgh, Scotland. Jan.

.... [1994, Chapter 5] eliminates redundant binding of procedure parameters; the selective thunkification transformation in Steckler [1994, Chapter 6] and Steckler and Wand [1994a] prevents thunking of procedure arguments that are certain to be evaluated under call by name; and the analysis in Steckler [1996] detects local channels in a concurrent, distributed language. 13. CONCLUSIONS We have presented a method for proving the correctness of an optimized closure conversion transformation. Our analysis relies on applying deduction rules to provide program annotations. Some components of our ....

Steckler, P. 1996. Detecting local channels in Distributed Poly/ML. LFCS Rep. ECS-LFCS96 -340, Univ. of Edinburgh, Scotland. Jan.

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