標(biāo)題: Titlebook: Coordination Models and Languages; 13th International C Wolfgang Meuter,Gruia-Catalin Roman Conference proceedings 2011 IFIP International [打印本頁(yè)] 作者: ODDS 時(shí)間: 2025-3-21 17:58
書目名稱Coordination Models and Languages影響因子(影響力)
書目名稱Coordination Models and Languages影響因子(影響力)學(xué)科排名
書目名稱Coordination Models and Languages網(wǎng)絡(luò)公開度
書目名稱Coordination Models and Languages網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coordination Models and Languages被引頻次
書目名稱Coordination Models and Languages被引頻次學(xué)科排名
書目名稱Coordination Models and Languages年度引用
書目名稱Coordination Models and Languages年度引用學(xué)科排名
書目名稱Coordination Models and Languages讀者反饋
書目名稱Coordination Models and Languages讀者反饋學(xué)科排名
作者: 背帶 時(shí)間: 2025-3-21 23:31 作者: Evolve 時(shí)間: 2025-3-22 02:36 作者: 轎車 時(shí)間: 2025-3-22 07:51
R. Youngculus, called CAB, that models composite components as the combination of a . (using BIP terminology) and subcomponents, and that constitutes a conservative extension of BIP with more dynamic forms of glues. We study the Turing completeness of CAB variants that differ only in their language for glue作者: 杠桿 時(shí)間: 2025-3-22 08:53
R. Younge language concepts of Reo include synchronization, mutual exclusion, data manipulation, memory and context-dependency. Context-dependency facilitates the precise specification of a connector’s possible actions in situations where it would otherwise exhibit nondeterministic behavior. All existing fo作者: UNT 時(shí)間: 2025-3-22 16:40 作者: UNT 時(shí)間: 2025-3-22 18:48
R. Younghelps us to reduce the complexities of such systems making them easier to design and to understand. However, there is still a gap between formal approaches to coordination and their implementation in programming languages. For example, CSP is often used as a coordination model but only subsets of CS作者: 幼兒 時(shí)間: 2025-3-23 00:06 作者: jungle 時(shí)間: 2025-3-23 03:15
R. Young intuitive and industry-testedimplementation of process-oriented programming, combining pattern-matching with message mailboxes, resulting in concise, elegant programs. However, it lacks a successful static verification mechanism that ensures safety and determinism of communications with respect to 作者: Mhc-Molecule 時(shí)間: 2025-3-23 09:11 作者: 染色體 時(shí)間: 2025-3-23 12:06
R. Youngsubtyping relation for multi-party session types that preserves liveness, we relate it with the standard subtyping relation, and we give algorithms for deciding it. As a side effect, we provide an original and remarkably simple coinductive characterization of the fair testing preorder for nondetermi作者: craving 時(shí)間: 2025-3-23 16:26 作者: 剝削 時(shí)間: 2025-3-23 20:12 作者: Onerous 時(shí)間: 2025-3-24 01:54
istributed abstract machines for executing Safe Ambients, a variant of the Ambient calculus. However, in order to use them or to exploit their implementation techniques, we must assume all-to-all and permanent connectivity in the underlying network; this is inappropriate for most real-world wide-are作者: 記憶法 時(shí)間: 2025-3-24 02:48 作者: Exuberance 時(shí)間: 2025-3-24 07:22
aspect-oriented programming language based on distributed tuple spaces to tackle this issue. One of the key features in AspectKE* is the program analysis predicates and functions that provide information on future behavior of a program. With a dual value evaluation mechanism that handles results of作者: 慢跑鞋 時(shí)間: 2025-3-24 14:11 作者: 承認(rèn) 時(shí)間: 2025-3-24 15:45 作者: 極小 時(shí)間: 2025-3-24 22:20
Fault in the Future,nside futures. We present an extension for those languages where futures are used to return fault notifications and to coordinate error recovery between the caller and callee. This can be exploited to ensure that invariants involving many objects are restored after faults.作者: 友好關(guān)系 時(shí)間: 2025-3-24 23:40 作者: Graduated 時(shí)間: 2025-3-25 05:25
R. Youngnside futures. We present an extension for those languages where futures are used to return fault notifications and to coordinate error recovery between the caller and callee. This can be exploited to ensure that invariants involving many objects are restored after faults.作者: Rankle 時(shí)間: 2025-3-25 08:01
https://doi.org/10.1007/978-3-642-21464-6concurrent computing; coordination languages; distributed computing; mobile environments; multi-party co作者: 帶來(lái)墨水 時(shí)間: 2025-3-25 14:18 作者: 重畫只能放棄 時(shí)間: 2025-3-25 16:38 作者: 教育學(xué) 時(shí)間: 2025-3-25 21:28
Revisiting Glue Expressiveness in Component-Based Systems,culus, called CAB, that models composite components as the combination of a . (using BIP terminology) and subcomponents, and that constitutes a conservative extension of BIP with more dynamic forms of glues. We study the Turing completeness of CAB variants that differ only in their language for glue作者: 忘川河 時(shí)間: 2025-3-26 02:03
Encoding Context-Sensitivity in Reo into Non-Context-Sensitive Semantic Models,e language concepts of Reo include synchronization, mutual exclusion, data manipulation, memory and context-dependency. Context-dependency facilitates the precise specification of a connector’s possible actions in situations where it would otherwise exhibit nondeterministic behavior. All existing fo作者: 反省 時(shí)間: 2025-3-26 07:57
The Context of Coordinating Groups in Dynamic Mobile Networks,pon context information. Entities in these environments are not in isolation, and oftentimes the manner in which entities coordinate depends on some (implicit) notion of their . context. In this paper, we are motivated by the need to explicitly construct notions of the . that can support better coor作者: nonchalance 時(shí)間: 2025-3-26 11:03
CSP as a Coordination Language,helps us to reduce the complexities of such systems making them easier to design and to understand. However, there is still a gap between formal approaches to coordination and their implementation in programming languages. For example, CSP is often used as a coordination model but only subsets of CS作者: Germinate 時(shí)間: 2025-3-26 14:13
An Efficient Management of Correlation Sets with Broadcast,ns and, in particular, to assign incoming messages to the correct sessions (also known as service instances). A relevant mechanism for solving this problem, first introduced by BPEL and then used in other languages (e.g. Jolie) is that one based on .. The BPEL and Jolie languages are currently allow作者: dissolution 時(shí)間: 2025-3-26 20:35 作者: Fantasy 時(shí)間: 2025-3-26 21:49
Safe Parallel Programming with Session Java,ing for communications and compile-time safety. This paper investigates the use of SJ for session-typed parallel programming, and introduces new language primitives for . and .. These primitives allow the efficient coordination of parallel computation across multiple processes, thus enabling SJ to e作者: 加強(qiáng)防衛(wèi) 時(shí)間: 2025-3-27 04:29
Fair Subtyping for Multi-party Session Types,subtyping relation for multi-party session types that preserves liveness, we relate it with the standard subtyping relation, and we give algorithms for deciding it. As a side effect, we provide an original and remarkably simple coinductive characterization of the fair testing preorder for nondetermi作者: –DOX 時(shí)間: 2025-3-27 09:16
Enabling Cross-Technology Mobile Applications with Network-Aware References,e applications only use a small subset of the networking technologies at their disposal. Building applications that use multiple networking technologies simultaneously or exploit knowledge about the available connections is a laborious task. Programmers must manually keep track of the connectivity s作者: ordain 時(shí)間: 2025-3-27 09:35
Coordination and Concurrency in Multi-engine Prolog,isms for a Prolog based agent infrastructure..We advocate a combination of coroutining constructs with focus on expressiveness and a simplified, multi-threading API that ensures optimal use available parallelism..In this context, native multi-threading is made available to the application programmer作者: 怪物 時(shí)間: 2025-3-27 15:38
Abstract Machines for Safe Ambients in Wide-Area and Mobile Networks,istributed abstract machines for executing Safe Ambients, a variant of the Ambient calculus. However, in order to use them or to exploit their implementation techniques, we must assume all-to-all and permanent connectivity in the underlying network; this is inappropriate for most real-world wide-are作者: CANT 時(shí)間: 2025-3-27 20:33 作者: Evacuate 時(shí)間: 2025-3-27 23:51
Combining Static Analysis and Runtime Checking in Security Aspects for Distributed Tuple Spaces, aspect-oriented programming language based on distributed tuple spaces to tackle this issue. One of the key features in AspectKE* is the program analysis predicates and functions that provide information on future behavior of a program. With a dual value evaluation mechanism that handles results of作者: 無(wú)節(jié)奏 時(shí)間: 2025-3-28 03:03
R. Youngloses Turing-completeness. We also show that adding a simple form of dynamic component creation in the control language without priorities is enough to regain Turing completeness. These results complement those obtained on BIP, highlighting in particular the key role of priorities for expressivity.作者: 打包 時(shí)間: 2025-3-28 06:15
R. Youngireless connections without incurring a significant communication overhead. Second we provide precise semantics for different types of groups, each with compelling use cases in these dynamic computing environments. Finally, we define and demonstrate protocols for efficiently computing groups and their context in a distributed manner.作者: Arbitrary 時(shí)間: 2025-3-28 13:11
R. Young as a coordination language. Our approach allows us to use standard CSP tools for verifying the coordination processes of a system and to use these processes at runtime to coordinate the systems’ components.作者: 支柱 時(shí)間: 2025-3-28 17:02
R. Youngof the language. In this system, structured types are used to govern the interaction of Erlang processes, ensuring that their behaviour is safe with respect to a defined protocol. The expected properties of subject reduction and type safety are established.作者: 易彎曲 時(shí)間: 2025-3-28 20:23 作者: PHON 時(shí)間: 2025-3-29 01:23
butions. To this end we introduce a transition structure, which enables a simulation approach for performance evaluation in Reo, enabling the use of arbitrary distributions and predefined probabilistic behaviors. Our approach supports steady-state and transient analysis and, moreover, scales much better than the existing automata-based algorithms.作者: 哭得清醒了 時(shí)間: 2025-3-29 06:26 作者: 閑蕩 時(shí)間: 2025-3-29 09:25
Revisiting Glue Expressiveness in Component-Based Systems,loses Turing-completeness. We also show that adding a simple form of dynamic component creation in the control language without priorities is enough to regain Turing completeness. These results complement those obtained on BIP, highlighting in particular the key role of priorities for expressivity.作者: 單調(diào)性 時(shí)間: 2025-3-29 12:13
The Context of Coordinating Groups in Dynamic Mobile Networks,ireless connections without incurring a significant communication overhead. Second we provide precise semantics for different types of groups, each with compelling use cases in these dynamic computing environments. Finally, we define and demonstrate protocols for efficiently computing groups and their context in a distributed manner.作者: Spina-Bifida 時(shí)間: 2025-3-29 18:46 作者: Chronological 時(shí)間: 2025-3-29 22:05
Session Typing for a Featherweight Erlang,of the language. In this system, structured types are used to govern the interaction of Erlang processes, ensuring that their behaviour is safe with respect to a defined protocol. The expected properties of subject reduction and type safety are established.作者: CHURL 時(shí)間: 2025-3-30 03:22
Enabling Cross-Technology Mobile Applications with Network-Aware References,traction that eases multi-networking for mobile applications and allows programmers to react to changes in the connectivity of different networks around them. We show how network-aware references are implemented and evaluate how well they switch between technologies.作者: Blemish 時(shí)間: 2025-3-30 04:51 作者: LUCY 時(shí)間: 2025-3-30 09:45
Combining Static Analysis and Runtime Checking in Security Aspects for Distributed Tuple Spaces,. Our two-staged implementation strategy gathers fundamental static analysis information at load-time, so as to avoid performing all analysis at runtime. We built a compiler for AspectKE*, and successfully implemented security aspects for a distributed chat system and an electronic healthcare record workflow system.作者: FLAX 時(shí)間: 2025-3-30 13:23
Conference proceedings 2011Reykjavik, Iceland, in June 2011, as one of the DisCoTec 2011 events. .The 14 revised full papers presented were carefully reviewed and selected from 35 submissions. The conference focuses on the design and implementation of models that allow compositional construction of large-scale concurrent and 作者: Bmd955 時(shí)間: 2025-3-30 18:08 作者: Fortuitous 時(shí)間: 2025-3-30 21:28
0302-9743 entation of models that allow compositional construction of large-scale concurrent and distributed systems, including both practical and foundational models, run-time systems, and related verification and analysis techniques..978-3-642-21463-9978-3-642-21464-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Grievance 時(shí)間: 2025-3-31 02:47
Fair Subtyping for Multi-party Session Types,r deciding it. As a side effect, we provide an original and remarkably simple coinductive characterization of the fair testing preorder for nondeterministic, sequential processes consisting of internal choices of outputs and external choices of inputs.
