Filters








4,493 Hits in 3.5 sec

Safe Dynamic Binding in the Join Calculus [chapter]

Alan Schmitt
2002 Foundations of Information Technology in the Era of Network and Mobile Computing  
This paper presents an extension of the distributed Join Calculus with messages dynamically bound to definitions according to their location.  ...  New dynamic channels and new definitions for dynamic channels may be created at runtime. A dynamic message is rebound when the location containing the message migrates.  ...  The JoCaml system [15] , an implementation of the distributed Join Calculus, provides some form of dynamic binding to functions defined in the current runtime.  ... 
doi:10.1007/978-0-387-35608-2_46 dblp:conf/ifipTCS/Schmitt02 fatcat:rpct24m6gbdpvfzf4dcb7kruky

The m-calculus

Alan Schmitt, Jean-Bernard Stefani
2003 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '03  
routing in the calculus.  ...  The calculus retains the implementable character of the Distributed Join calculus while overcoming several important limitations: insufficient control over communication and mobility, absence of dynamic  ...  A simulation of the Dynamic Join calculus [20] in the M-Calculus presented in [19] illustrates how to use addressed messages to get transparent locality based binding.  ... 
doi:10.1145/604131.604136 fatcat:6qolkpbiczhijjnzxm5fs32oeu

The m-calculus

Alan Schmitt, Jean-Bernard Stefani
2003 SIGPLAN notices  
routing in the calculus.  ...  The calculus retains the implementable character of the Distributed Join calculus while overcoming several important limitations: insufficient control over communication and mobility, absence of dynamic  ...  A simulation of the Dynamic Join calculus [20] in the M-Calculus presented in [19] illustrates how to use addressed messages to get transparent locality based binding.  ... 
doi:10.1145/640128.604136 fatcat:x64e2vf32raitowi3fhdlec534

Modeling Concurrency and Reconfiguration in Vehicular Systems: A π-calculus Approach [article]

Joseph Campbell, Cumhur Erkan Tuncali, Theodore P. Pavlic, Georgios Fainekos
2016 arXiv   pre-print
Current approaches in the control of collaborative vehicles primarily consider homogeneous simplified vehicle dynamics and usually ignore any communication issues.  ...  In this work, we propose a modeling framework where communication and system reconfiguration is modeled through π-calculus expressions while the closed-loop control systems are modeled through hybrid automata  ...  Conclusions In this paper, we have introduced a new framework which utilizes π-calculus to model complex vehicular networks.  ... 
arXiv:1604.02122v1 fatcat:muu4ueb3bral5e6a43gyzb4234

Essential AOP: The A Calculus [chapter]

Bruno De Fraine, Erik Ernst, Mario Südholt
2010 Lecture Notes in Computer Science  
We use calculus parameters to cover type safety for a wide design space of other features. Type soundness is verified in Coq.  ...  In AOP, advice may intercept method invocations, and proceed executes the suspended call. Proceed is an ad hoc mechanism, only usable inside advice bodies.  ...  Flexible type-safe advice with type ranges. Another key property of our approach is the flexible but safe mechanisms for the use of different argument and result types in advice and proceed.  ... 
doi:10.1007/978-3-642-14107-2_6 fatcat:qgm5ui6nabb6bks4iuzlb3lupm

Essential AOP

Bruno De Fraine, Erik Ernst, Mario Südholt
2012 ACM Transactions on Programming Languages and Systems  
We use calculus parameters to cover type safety for a wide design space of other features. Type soundness is verified in Coq.  ...  In AOP, advice may intercept method invocations, and proceed executes the suspended call. Proceed is an ad hoc mechanism, only usable inside advice bodies.  ...  Flexible type-safe advice with type ranges. Another key property of our approach is the flexible but safe mechanisms for the use of different argument and result types in advice and proceed.  ... 
doi:10.1145/2362389.2362391 fatcat:njs7wsaofzhujog35joxaqghye

Information Hiding in the Join Calculus [chapter]

Qin Ma, Luc Maranget
2007 Lecture Notes in Computer Science  
We study the issue both at the object level and class level, in the context of an object-oriented extension of the Join calculus -a process calculus in the tradition of the π-calculus.  ...  We define the formal semantics of our new operation in terms of α-converting hidden names to fresh names, and its typing in terms of eliminating hidden names from class types.  ...  Formalism: the OJoin H calculus We formalize our improved object-oriented extension of Join as the OJoin H calculus, given in Fig. 1 .  ... 
doi:10.1007/978-3-540-77505-8_19 fatcat:2n3o2ebszngulit5i65ij4bumu

CPL: a core language for cloud computing

Oliver Bračevac, Sebastian Erdweg, Guido Salvaneschi, Mira Mezini
2016 Proceedings of the 15th International Conference on Modularity - MODULARITY 2016  
The considerable complexity of these tasks resulted in the emergence of declarative JSON-based domain-specific deployment languages to develop deployment programs.  ...  Running distributed applications in the cloud involves deployment. That is, distribution and configuration of application services and middleware infrastructure.  ...  Acknowledgments We thank the anonymous reviewers for their helpful comments. This work has been supported by the European Research Council, grant No. 321217.  ... 
doi:10.1145/2889443.2889452 dblp:conf/aosd/BracevacESM16 fatcat:ki6z42ugjreqzmdfc7hv72ddny

An Abstract Machine for a Higher-Order Distributed Process Calculus

Florence Germain, Marc Lacoste, Jean-Bernard Stefani
2002 Electronical Notes in Theoretical Computer Science  
Thus, the M-calculus supports a form of dynamic binding, whereby the same resource names may give access to different resources in different cells.  ...  mobility, and dynamic binding.  ...  The M-calculus can be understood as a significant extension of the Join calculus, with programmable localities, higherorder processes, process mobility and dynamic binding.  ... 
doi:10.1016/s1571-0661(04)80420-1 fatcat:xqlypuombvbx5durj5qq66woym

Specializing continuations a model for dynamic join points

Christopher J. Dutchyn
2007 Proceedings of the 6th workshop on Foundations of aspect-oriented languages - FOAL '07  
Dynamic join points develop in a principled and natural way as activations of continuation frames.  ...  By modeling dynamic join points, pointcuts, and advice in a defunctionalized continuation-passing style interpreter, we provide a fundamental account of these AOP mechanisms.  ...  We demonstrate that dynamic join points arise naturally in this formulation, as continuation frames. Therefore, advice can specialize their behaviour directly in our construction.  ... 
doi:10.1145/1233833.1233840 dblp:conf/foal/Dutchyn06 fatcat:gxiaujnr4berrftuntekpubmky

Membrane Calculus: A Formal Method for Grid Transactions [chapter]

Zhengwei Qi, Cheng Fu, Dongyu Shi, Jinyuan You, Minglu Li
2004 Lecture Notes in Computer Science  
However, the formal method about transactions is not fully investigated in the literature.  ...  We introduce five kinds of transition rules in Membrane Calculus (including object rules and membrane rules) and the operational semantics of transition rules is defined.  ...  , e.g., CCS, Join Calculus, etc.  ... 
doi:10.1007/978-3-540-30208-7_16 fatcat:xgh7folx6bgt7cboom7x65juiy

Membrane Calculus: a formal method for Grid transactions

Zhengwei Qi, Minglu Li, Cheng Fu, Dongyu Shi, Jinyuan You
2006 Concurrency and Computation  
However, the formal method about transactions is not fully investigated in the literature.  ...  We introduce five kinds of transition rules in Membrane Calculus (including object rules and membrane rules) and the operational semantics of transition rules is defined.  ...  , e.g., CCS, Join Calculus, etc.  ... 
doi:10.1002/cpe.1030 fatcat:snoqtn3asje7dc7jgasmrnzlwm

A Mobile Agent Service-Oriented Scripting Language Encoded on a Process Calculus [chapter]

Hervé Paulino, Luís Lopes
2006 Lecture Notes in Computer Science  
Agents provide and require services dynamically as they move through the network.  ...  The LSDπcalculus is, in turn, a form of the π-calculus extended with support for distributed execution and mobility of resources and, with a well-studied semantics.  ...  The M-Calculus [27] is an extension of the Distributed Join calculus, that incorporates several new notions, such as programmable localities and dynamic binding.  ... 
doi:10.1007/11860990_24 fatcat:ykoag5lntfc6bdgu6w2hseujym

The reflexive CHAM and the join-calculus

Cédric Fournet, Georges Gonthier
1996 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96  
It can also be seen as a process calculus, the join-calculus, which we prove equivalent to the -calculus of Milner, Parrow and Walker. * ) 'readyhlaseri j jobh1i jobh2i Denoted D or J .  ...  P , a reaction consumes compound molecules that have a speci c join pattern J, and produces new molecules in the solution that are copies of P where the formal parameters of J have been instantiated to  ...  Acknowledgments This works started from a seminar on \distributing the -calculus" held in 1995 at INRIA, with the participation of Damien Doligez, Florent Guillaume, Jean-Jacques L evy, Luc Maranget, and  ... 
doi:10.1145/237721.237805 dblp:conf/popl/FournetG96 fatcat:3qgfhojuofhxzebzgbga5gy4me

A Calculus for Modeling Software Components [chapter]

Oscar Nierstrasz, Franz Achermann
2003 Lecture Notes in Computer Science  
We present the design rationale for the Piccola calculus, and briefly outline some of the results obtained.  ...  We adopt a minimalist view in which components can be distinguished by composable interfaces.  ...  Acknowledgments We gratefully acknowledge the financial support of the Swiss National Science Foundation for projects No. 20-61655.00, "Meta-models and Tools for Evolution Towards Component Systems", and  ... 
doi:10.1007/978-3-540-39656-7_14 fatcat:tw7cbheuvnetrhe3eeytzxeifi
« Previous Showing results 1 — 15 out of 4,493 results