Cited in
(only showing first 100 items - show all)- Programming and verifying component ensembles
- Coordination Models and Languages
- Network Conscious π-calculus: A Concurrent Semantics
- Expressiveness of concurrent intensionality
- Space-aware ambients and processes
- Global computing in a dynamic network of tuple spaces
- Quantitative information in the tuple space coordination model
- An efficient abstract machine for safe ambients
- Comparing three coordination models: Reo, ARC, and PBRD
- Semantic subtyping for the pi-calculus
- Typed behavioural equivalences for processes in the presence of subtyping
- Quantitative static analysis of distributed systems
- Coordinating asynchronous and open distributed systems under semiring-based timing constraints
- Static analysis for the \(\pi\)-calculus with applications to security
- Comparing three coordination models: Reo, ARC, and RRD
- A language-based approach to modelling and analysis of Twitter interactions
- Using bisimulation proof techniques for the analysis of distributed abstract machines
- A formal approach to the engineering of domain-specific distributed systems
- Causal-consistent rollback in a tuple-based language
- Protelis
- Model checking spatial logics for closure spaces
- Resource access control in systems of mobile agents
- A coordination language for databases
- On the expressive power of \textsc{Klaim}-based calculi
- Specification and refinement of mobile systems in MTLA and mobile UML
- A performance-based methodology to early evaluate the effectiveness of mobile software architectures
- Reversibility in the higher-order \(\pi\)-calculus
- Network-conscious -calculus -- a model of Pastry
- MOMI: a calculus for mobile mixins
- Secure guarded commands
- A process algebraic view of shared dataspace coordination
- scientific article; zbMATH DE number 2087391 (Why is no real title available?)
- A calculus for attribute-based memory updates
- Timed soft concurrent constraint programs: an interleaved and a parallel approach
- A higher-order calculus of computational fields
- From distributed coordination to field calculus and aggregate computing
- Formal Methods for Components and Objects
- Event based choreography
- A model checking-based approach for security policy verification of mobile systems
- On the expressive power of \textsc{Klaim}-based calculi
- Model checking mobile stochastic logic
- From flow logic to static type systems for coordination languages
- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications
- M-nets: a survey
- Coordination Models and Languages
- Assisting the design of a groupware system - Model checking usability aspects of thinkteam
- A network-conscious \(\pi\)-calculus and its coalgebraic semantics
- Assigning types to processes
- Reversible session-based pi-calculus
- Monitoring networks through multiparty session types
- Structuring operational semantics: simplification and computation
- Basic observables for a calculus for global computing
- Encoding Asynchronous Interactions Using Open Petri Nets
- Linear forwarders
- Klava
- PiDuce
- MetaKlaim
- JoCaml
- LEAP
- MANIFOLD
- Maria
- MWB
- Punf
- SLMC
- CliffMath
- CliffSymNil
- CliffOC
- Moise+
- Reo
- 2APL
- COWS
- MarCaSPiS
- ComFoRT
- MetaKlaim: a type safe multi-stage language for global computing
- MultiVeStA
- Pirlo
- Facile
- PAGODA
- Reoservice
- LIME
- Linda
- MOMI
- ULM
- dSPIN
- Sumatra
- Viptos
- XPi
- SCELlight
- MoMo
- Succinct
- tKlaim
- TLPVS
- GroupKit
- EnvyMyCar
- XMLTK
- SDEF
- Jolie
- ITACA
- PEP
- NoDoSE
This page was built for software: KLAIM
