Anytime, anywhere

DOI10.1145/325694.325742zbMath1323.68405OpenAlexW2167998587MaRDI QIDQ5178865

Publication date: 17 March 2015

Published in: Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/325694.325742

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (63)

Specification and refinement of mobile systems in MTLA and mobile UML ⋮ On the expressive power of movement and restriction in pure mobile ambients ⋮ A spatial logic for concurrency. II ⋮ Linear and affine logics with temporal, spatial and epistemic operators ⋮ Model checking mobile ambients ⋮ A generic type system for the pi-calculus ⋮ A spatial logic for concurrency. I ⋮ XML schema, tree logic and sheaves automata ⋮ Axiomatisation and decidability of multi-dimensional Duration Calculus ⋮ Expressiveness and complexity of graph logic ⋮ Fair ambients ⋮ Resources, concurrency, and local reasoning ⋮ A process calculus for privacy-preserving protocols in location-based service systems ⋮ Exponential-Size Model Property for PDL with Separating Parallel Composition ⋮ Separation logics and modalities: a survey ⋮ Adjunct Elimination in Context Logic for Trees ⋮ Concurrent weighted logic ⋮ Realist Consequence, Epistemic Inference, Computational Correctness ⋮ A Spatial Logic for Simplicial Models ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Minimisation of spatial models using branching bisimilarity ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ Spatial and behavioral types in the pi-calculus ⋮ A Spatial Equational Logic for the Applied π-Calculus ⋮ A logic of behaviour in context ⋮ Domain theory for concurrency ⋮ Spatial-behavioral types for concurrency and resource control in distributed systems ⋮ A semantic framework for open processes ⋮ Tutorial on separation results in process calculi via leader election problems ⋮ Modular Markovian Logic ⋮ Unnamed Item ⋮ Separation Logic Semantics for Communicating Processes ⋮ On Symbolic Semantics for Name-decorated Contexts ⋮ Hybrid logical analyses of the ambient calculus ⋮ Adjunct elimination in context logic for trees ⋮ Elimination of spatial connectives in static spatial logics ⋮ Deciding Reachability in Mobile Ambients with Name Restriction ⋮ A coordination approach to mobile components ⋮ When ambients cannot be opened ⋮ Name-passing in an ambient-like calculus and its proof using spatial logic ⋮ A Complete Axiomatic System for a Process-Based Spatial Logic ⋮ Elimination of quantifiers and undecidability in spatial logics for concurrency ⋮ A spatial equational logic for the applied \(\pi \)-calculus ⋮ Spatial-Behavioral Types, Distributed Services, and Resources ⋮ Model checking mobile stochastic logic ⋮ Decidable Extensions of Hennessy-Milner Logic ⋮ Probabilistic mobile ambients ⋮ Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding ⋮ Spatial Logic and Spatial Model Checking for Closure Spaces ⋮ Kind Bigraphs ⋮ On Model Checking Boolean BI ⋮ Possible worlds and resources: The semantics of \(\mathbf{BI}\) ⋮ Deciding reachability problems in Turing-complete fragments of Mobile Ambients ⋮ A Type Inference Algorithm for Secure Ambients ⋮ A Fully Abstract Model for Mobile Ambients ⋮ Applying a testing approach to the Calculus of Fair Ambients ⋮ Local Reasoning about Data Update ⋮ Manipulating Trees with Hidden Labels ⋮ Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic ⋮ Extensionality of Spatial Observations in Distributed Systems ⋮ A Coq Library for Verification of Concurrent Programs ⋮ Validating firewalls using flow logics ⋮ Modular Games for Coalgebraic Fixed Point Logics

This page was built for publication: Anytime, anywhere