KLAIM

swMATH9424MaRDI QIDQ21407

No author found.

Described by source

• Types for access control
• Global Computing. Programming Environments, Languages, Security, and Analysis of Systems
• Unnamed Publication
• Unnamed Publication

Related Items (60)

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

This page was built for software: KLAIM