KLAIM
From MaRDI portal
Software:21407
swMATH9424MaRDI QIDQ21407FDOQ21407
Author name not available (Why is that?)
Cited In (60)
- A White Box Perspective on Behavioural Adaptation
- Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints
- Specification and refinement of mobile systems in MTLA and mobile UML
- A performance-based methodology to early evaluate the effectiveness of mobile software architectures
- Network-conscious \(\pi\)-calculus -- a model of Pastry
- Reversibility in the higher-order \(\pi\)-calculus
- MOMI: a calculus for mobile mixins
- Title not available (Why is that?)
- A process algebraic view of shared dataspace coordination
- A calculus for attribute-based memory updates
- Model Checking Spatial Logics for Closure Spaces
- Formal Methods for Components and Objects
- From distributed coordination to field calculus and aggregate computing
- Event based choreography
- Programming and Verifying Component Ensembles
- On the expressive power of \textsc{Klaim}-based calculi
- A model checking-based approach for security policy verification of mobile systems
- Model checking mobile stochastic logic
- From flow logic to static type systems for coordination languages
- Coordination Models and Languages
- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications
- M-nets: a survey
- Secure Guarded Commands
- Assisting the design of a groupware system - Model checking usability aspects of thinkteam
- A network-conscious \(\pi\)-calculus and its coalgebraic semantics
- MetaKlaim: a type safe multi-stage language for global computing
- Assigning types to processes
- Structuring operational semantics: simplification and computation
- Encoding Asynchronous Interactions Using Open Petri Nets
- Basic observables for a calculus for global computing
- Linear forwarders
- Reversible session-based pi-calculus
- Monitoring networks through multiparty session types
- Security types for dynamic web data
- A framework for specifying and verifying the behaviour of open systems
- Spatial-behavioral types for concurrency and resource control in distributed systems
- Towards a formal foundation to orchestration languages
- Dynamic management of capabilities in a network aware coordination language
- Coordination Models and Languages
- Title not available (Why is that?)
- Network Conscious π-calculus: A Concurrent Semantics
- Expressiveness of concurrent intensionality
- Timed soft concurrent constraint programs: An interleaved and a parallel approach
- Space-aware ambients and processes
- Quantitative information in the tuple space coordination model
- Global computing in a dynamic network of tuple spaces
- A Higher-Order Calculus of Computational Fields
- An efficient abstract machine for safe ambients
- Comparing three coordination models: Reo, ARC, and PBRD
- Quantitative static analysis of distributed systems
- Typed behavioural equivalences for processes in the presence of subtyping
- Semantic subtyping for the pi-calculus
- Static analysis for the \(\pi\)-calculus with applications to security
- Comparing three coordination models: Reo, ARC, and RRD
- Using bisimulation proof techniques for the analysis of distributed abstract machines
- A language-based approach to modelling and analysis of Twitter interactions
- A formal approach to the engineering of domain-specific distributed systems
- Causal-consistent rollback in a tuple-based language
- Resource access control in systems of mobile agents
- On the expressive power of \textsc{Klaim}-based calculi
This page was built for software: KLAIM
