Separability in the Ambient Logic

@article{Lozes2008SeparabilityIT,
  title={Separability in the Ambient Logic},
  author={{\'E}tienne Lozes and Daniel Hirschkoff and Davide Sangiorgi},
  journal={Log. Methods Comput. Sci.},
  year={2008},
  volume={4}
}
The Ambient Logic (AL) has been proposed for expressing properties of pro- cess mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the discriminating power of AL, focusing on the equivalence on processes induced by the logic (=L). As underlying calculi besides MA we consider a subcalculus in which an image-finiteness condition holds and that we prove to be Turing complete. Synchronous variants of… 

Figures and Tables from this paper

On the Expressiveness of the Ambient Logic

TLDR
This paper defines formulas for capabilities and for communication in MA, and derives some formulas that capture finitess of a term, name occurrences and persistence, and study extensions of the calculus involving more complex forms of communications.

Trees over Infinite Structures and Path Logics with Synchronization

TLDR
This work deals with the tree iteration of a relational structure M in the sense of Shelah-Stupp, and shows decidability of the tree model-checking problem for logics that allow only path quantifiers and chain quantifiers.

Shape Analysis in the Absence of Pointers and Structure

TLDR
It is argued that an abstract-interpretive control-flow analysis can analyze the “shape” of higher-order functions and promotes “anodization” as a way to generalize both singleton abstraction and the notion of focusing.

Observational Equivalences in a Bio-Inspired Formalism Involving Mobility and Lifetimes

TLDR
A formalism inspired by cell biology in which mobility and timing are explicitly specified and several observational equivalences based on observations correspond to several combinations of mobility operations that can be performed, timing aspects of the objects involved in mobility and their explicit positions inside membranes are introduced.

References

SHOWING 1-10 OF 33 REFERENCES

Separability, expressiveness, and decidability in the ambient logic

TLDR
The Ambient Logic has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients, and as a basis for query languages on semistructured data by imposing a semantic and a syntactic constraint on process prefixes.

On the Expressiveness of the Ambient Logic

TLDR
This paper defines formulas for capabilities and for communication in MA, and derives some formulas that capture finitess of a term, name occurrences and persistence, and study extensions of the calculus involving more complex forms of communications.

Elimination of quantifiers and undecidability in spatial logics for concurrency

Deciding Reachability in Mobile Ambients

TLDR
The problem of reachability is tackled and a public (i.e., restriction free) fragment is characterized for which it is decidable and has been shown to be Turing complete by Maffeis and Phillips.

Relevance logic and concurrent composition

  • M. Dam
  • Mathematics
    [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
  • 1988
TLDR
The author considers program logics in which this notion of deduction is internalized by the corresponding implication, and presents two completeness results: first for a modal extension of positive propositional linear logic with respect to the equational class of algebras containing the safety testing quotient of the author's process system as its free member.

On the Computational Strength of Pure Ambient Calculi

Deciding validity in a spatial logic for trees

TLDR
A sequent calculus is introduced for the logic, and it is shown to be sound and complete with respect to an interpretation in terms of satisfaction and validity, and a small programming language is described based on this idea.

Elimination of spatial connectives in static spatial logics

  • É. Lozes
  • Computer Science
    Theor. Comput. Sci.
  • 2005

Proving Congruence of Bisimulation in Functional Programming Languages

TLDR
This work uses this method to show that some generalizations of Abramsky's applicative bisimulation are congruences whenever evaluation can be specified by a certain natural form of structured operational semantics.

A Distribution Law for CCS and a New Congruence Result for the p-calculus

TLDR
To the authors' knowledge, this is the only nontrivial subcalculus of the pi-calculus that includes the full output prefix and for which strong bisimilarity is a congruence.