This paper studies a recently developed an approach to reasoning about mutable data
structures, which uses an assertion language with spatial conjunction and implication …

The Ambient Calculus is a process calculus where processes may reside within a hierarchy
of locations. The purpose of this calculus is to study mobility; to this end, processes can …

(MATH) We consider a propositional spatial logic for finite trees. The logic includes A????
Par B (tree composition), A???? B (the implication induced by composition), and O (the unit …

The ambient calculus is a formalism for describing the mobility of both software and
hardware. The ambient logic is a modal logic designed to specify properties of distributed …

We define a finite-control fragment of the ambient calculus, a formalism for describing
distributed and mobile computations. A series of examples demonstrates the …

There is great interest in applying nominal calculi—computational formalisms that include
dynamic name generation—to the problems of programming, specifying, and verifying …

The field of pervasive computing has seen a lot of exciting innovations in the past few years.
However, there are currently no mechanisms for describing the properties and capabilities of …

We settle the complexity bounds of the model checking problem for the ambient calculus
with public names against the ambient logic. We show that if either the calculus contains …

In this paper, we develop model checking procedures for three ways of combining
(temporal) logics: temporalization, independent combination, and join. We prove that they …

We consider a propositional spatial logic for finite trees. The logic includes (the unit of
composition). We show that the satisfaction and validity problems are equivalent, and …