K.L. Gasser, F.Nielson, and H.R.Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP '97. ACM Press, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....computer programming. However, it turned out that the algebra of events was observed to have some pleasant properties. An investigation of categorical structure as well as denotational semantics has been developed by Alan Jeffrey [56] CML has also been studied within the field of static analysis [57, 58, 59, 60]. 4.7 Applications and Extensions The design of CML was motivated by the need to support the programming of interactive applications rather than facilitating programming in a loosely coupled distributed environment or exploiting parallelism in the hardware. Its practicality has been demonstrated ....

K.L. Gasser, F.Nielson, and H.R.Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP '97. ACM Press, 1997.

....features in a positive light due to their expressive power. However, their presence poses challenges in detecting the flow of control. The literature contains a wide range of analyses which have been devised to approximate the functions which can be called from a particular point in a program [23, 5, 17, 8]. 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 flow systems to ....

K.L. Gasser, F.Nielson, and H.R.Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of International Conference on Functional Programming (ICFP). ACM Press, 1997.

....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 ....

K.L. Gasser, F.Nielson, and H.R.Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP '97. ACM Press, 1997.

....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 ....

K.L. Gasser, F.Nielson, and H.R.Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP '97. ACM Press, 1997.

....to the set of values that the objects of a program may assume during its execution. It was mainly developed 4 for functional languages [34] but can be used for virtually all programming paradigms, e.g. for analysing imperative or object oriented languages [30] and languages with concurrency [18] and mobility [7] The approach is related to Data Flow Analysis and can be seen as an auxiliary analysis needed to establish the information about the interprocedural flow of control assumed when specifying the familiar equations of Data Flow Analysis. As pointed out in [26] it can also be viewed ....

K.L.S. Gasser, F. Nielson, and H.R. Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP'97, pages 38--51. ACM Press, 1997.

.... systems, which can only perform moves, the inclusions become useless, as all names are bound; in essence we retain only item (1) 4 Construction of Solutions There is also a constructive procedure for obtaining the least solution which operates in O(N 5 ) time in the size of processes (see [18, 31]) To describe it we shall concentrate on a process, P , of interest as well as a marker environment, me , giving the binders and channels of free names in the process. To obtain a finite algorithm we shall prefer to restrict our attention to a 18 finite universe, U , containing all the ....

....needed in order to determine this information. This is a problem that appears all the time in higher order functional languages and many developments of Control Flow Analysis have indeed been performed for functional languages, but also object oriented languages [34] and languages with concurrency [18] can be addressed. Recently, Venet [40, 41] has used Abstract Interpretation [11] to analyse processes in a fragment of the calculus, with particular attention to the usage of channels. Type Systems are intimately connected to ensuring the well formedness of programs. In recent years they have ....

K.L.S. Gasser, F. Nielson, and H.R. Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP'97, pages 38--51. ACM Press, 1997.

....to the set of values that the objects of a program may assume during its execution. It was mainly developed for 4 functional languages [34] but can be used for virtually all programming paradigms, e.g. for analysing imperative or object oriented languages [30] and languages with concurrency [18] and mobility [7] The approach is related to Data Flow Analysis and can be seen as an auxiliary analysis needed to establish the information about the interprocedural flow of control assumed when specifying the familiar equations of Data Flow Analysis. As pointed out in [26] it can also be viewed ....

K.L.S. Gasser, F. Nielson, and H.R. Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP'97, pages 38--51. ACM Press, 1997.

.... For example, Data Flow Analysis [11] was mainly developed for imperative languages but is also used for object oriented languages, and Control Flow Analysis [18] was mainly developed for functional languages but can be used also for object oriented languages [14] and languages with concurrency [9]. Program analysis provides automatic and decidable methods for analysing properties of programs. Since most of them implicitly involve questions about termination, the properties are intended to err on the safe side . For each analysis an ordering is imposed on the properties, for example ....

....) j (ae; j= me P (ae; w (ae; g is a Moore family. This result guarantees that there always is a least solution to the specification in Tab. 2; just take (ae; There is also a constructive procedure for obtaining the least solution, which is cubic in the size of processes (see [9]) Essentially, establishing (ae; j= me P amounts to checking a number of individual constraints. In the full paper we define a function GC [ P ] me for explicitly extracting these constraints, proceeding by induction on the structure of processes. For instance, in case of output xy:P , the ....

K.L.S. Gasser, F. Nielson, and H.R. Nielson. Systematic realisation of control flow analysis for CML. In Proceedings of ICFP'97, pages 38--51. ACM Press, 1997.

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