X. Liu and D. Walker. Confluence of processes and systems of objects. In Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzback, editors, TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, pages 217--231. Springer-Verlag, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....be the main reason why the use of formal methods cannot be scaled up and widely accepted in large scale software developments. Another difficulty to scale up the use of formal methods and to use it in industries might be due to the fact that most formal methods, including those for OO development [Jon94, LW95, Jon96, AC96, CN00], are developed in a bottom up approach. In such an approach, a formal semantics is defined for a low level programming language like specification language. This language is so expressive that even implementation details can be described, though it can also be used at relatively hight levels of ....

....is that one has to study the very complicated semantics for such a low level language to be confident to use the formal method. Also it is not trivial to extract the right subset of the notation that is proper for higher level specifications as the semantics of these languages are very complicated [Jon94, Jon96, LW95, CN00]. Our work in [LHL01] is to support the formal use of UML in OO system development processes and development of tools for consistency checking. In contrast to most work on formal methods for OO development that uses a bottom up approach [LW95, Jon96, CN00] it follows the UML evolutionary ....

[Article contains additional citation context not shown here]

X. Liu and D. Walker. Confluence of processes and systems of objects. In P.D. Mosses, M. Nielsen, and M.I. Schwartzback, editors, Theorey and Practice of Software Development, Lecture Notes in Computer Science 915, pages 217--231. Springer-Verlag, 1995.

....co operate concurrently to achieve the system large activities. Component diagrams and deployment diagrams give the system construction management, and thus their semantic is not concerned relevant to system design. Most work on formal methods for OO development uses a bottom up approach [Jon94, LW95, Jon96, AC96, CN00]. In such an approach, a formal semantics is defined for a low level programming language like specification language. This language is so expressive that even implementation details can be described. One of the advantages of this approach is that most of the semantic issues are solved once for ....

....is that one has to study the very complicated semantics for such a low level language to be confident to use the formal method. Also it is not trivial to extract the right subset of the notation that is proper for higher level specifications as the semantics of these languages are very complicated [Jon94, Jon96, LW95, CN00]. Another problem is that it is not yet clear what kind of properties of an object oriented program can be described and proven in such a model. Therefore, these semantic models cannot be used for software development as we do not know from what a specification that the system is to be developed ....

X. Liu and D. Walker. Confluence of processes and systems of objects. In P.D. Mosses, M. Nielsen, and M.I. Schwartzback, editors, Theory and Practice of Software Development, Lecture Notes in Computer Science 915, pages 217--231. Springer-Verlag, 1995.

....recognized as an important feature of the behaviour of distributed communicating systems. In both [15] and [16] a chapter is devoted to determinate and confluent processes, showing that certain operators preserve confluence, and showing how confluence can be used to verify certain processes. In [13] these notions have been extended to the calculus. In [9] an extensive investigation into various notions of global confluence for processes is given, where it is shown that by applying priorisation, state spaces could be reduced substantially. In particular the use of confluence for ....

X. Liu and D. Walker. Confluence of Processes and Systems of Objects. In Proceedings of TAPSOFT '95, pages 217-231, LNCS 915, 1995.

....theory, based on simple extensions of the proof techniques of the ordinary calculus. We exploit this theory, of which we give a brief account in Section 3, to prove that [ Seq] and [ Par] are behaviourally equivalent. Liu and Walker have already given calculus proofs of this transformation [LW95]. Our proof is shorter and, we hope, easier to read. We overcome the problem of the inequality between [ Seq] and [ Par] in the ordinary calculus by adding types, which capture appropriate behavioural 2 properties of the legal contexts, and then exploiting the theory of the typed calculus. By ....

....7 4 The validation of Jones s transformation 4. 1 Translating ofi into the calculus Compositional translations of ofi (as well as of similar languages, like those in the POOL family [Ame89] into the calculus (or related calculi) are studied in a few of papers in the literature, including [Jon93b, Wal95a, LW95, Wal95b]. When the semantics of a language L is given as a compositional translation into the calculus, then the meaning of a (well formed) program is an equivalence class of calculus processes, where the equivalence relation is the behavioural equivalence = chosen on the calculus. If = should be ....

X. Liu and D. Walker. Confluence of processes and systems of objects. In Mosses P. et al. editor, Proc. TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, pages 217--231. Springer Verlag, 1995.

....forwarded to ff 1 when it will be available (i.e. returned by ff 3 ) in an automatic and transparent manner. There are analogous mechanisms in the literature. However, unlike the automatic continuation, these mechanisms introduce some extrat syntatic constructors (for instance commit in POOL [11]) which prevent any systematic reuse of the code. The aim of this work is thus to formally describe the automatic continuation. Our example shows a particular case: all objects are processes and the result at the end of service of the request search(2) is entirely awaited. In the general case ....

Xinxin Liu and David Walker. Confluence of processes and systems of objects. In TAPSOFT'95, 1995.

....the notion of linearity has been developed by Steffen and Nestmann [SN95] for the purpose of analyzing confluence in pi calculus processes arising in the semantics of concurrent object oriented programs. The same problem has been tackled by Liu and Walker using purely semantic techniques [LW95a] Our analysis is also related to the one used by Niehren [Nie96] to guarantee uniform confluence in a pi calculus fragment with only replicated inputs. Effects similar to our linear typing have also been achieved by more syntactic means, as in Honda and Yoshida s notion of beta reduction ....

Xinxin Liu and David Walker. Confluence of processes and systems of objects. In Proceedings of CAAP'95, pages 217--231. Springer, 1995.

....compared to other value passing caluli, since the scope of channel names may be extended by passing bound names as data to other processes that were previously outside the name s scope. Milner s notions of confluence have been generalized and adapted to name passing calculi by Liu and Walker [LW95]. Below, we discuss two issues strongly related to the confluence of namepassing systems that were the basis for our own investigation. Uniqueness In order to characterize friendly name passing system with good properties, Milner formulated syntactic naming invariants in process communities ....

X. Liu and D. Walker. Confluence of Processes and Systems of Objects. In TAPSOFT'95, LNCS 915, pages 217--231. Springer, 1995.

....the notion of linearity has been developed by Steffen and Nestmann [SN95] for the purpose of analyzing confluence in pi calculus processes arising in the semantics of concurrent object oriented programs. The same problem has been tackled by Liu and Walker using purely semantic techniques [LW95a]. Our analysis is also related to the one used by Niehren [Nie96] to guarantee uniform confluence in a pi calculus fragment with only replicated inputs. 8 Variants and Extensions We have focused here on a fragment of the original polyadic calculus of [Mil91] omitting output guards ....

Xinxin Liu and David Walker. Confluence of processes and systems of objects. In Proceedings of CAAP'95, pages 217--231. Springer, 1995.

....the notion of linearity, has been developed by Nestmann and Steffen [NS95] for the purpose of analyzing confluence in pi calculus processes arising in the semantics of concurrent object oriented programs. The same problem has also been tackled by Liu and Walker, using purely semantic techniques [LW95]. The immediate spur for our work came from a paper by Takeuchi, Honda, and Kubo [THK94] describing a modified pi calculus whose syntax guarantees that certain channels can only be shared between two processes. This suggested that one might try to achieve the same effect in a standard pi calculus ....

Xinxin Liu and David Walker. Confluence of processes and systems of objects. In Proceedings of CAAP'95, pages 217--231. Springer, 1995.

No context found.

X. Liu and D. Walker. Confluence of processes and systems of objects. In Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzback, editors, TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, pages 217--231. Springer-Verlag, 1995.

No context found.

Xinxin Liu and David Walker. Confluence of processes and systems of objects. In Proceedings of CAAP'95, pages 217--231. Springer, 1995.

No context found.

X. Liu and D. Walker. Confluence of processes and systems of objects. In P. D. Mosses, M. Nielsen, and M. I. Schwarzbach, editors, TAPSOFT '95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, volume 915 of LNCS, pages 217--231. Springer, 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