Fixed Points in the Ambient Logic

05/2001;
Source: CiteSeer

ABSTRACT

. We present an extension of the ambient logic with fixed points operators in the style of the -calculus. We give a simple syntactic condition for the equivalence between minimal and maximal fixpoint formulas and show how to subsume spatial analogues of the usual box and diamond operators. 1

Download full-text

Full-text

Available from: Silvano Dal Zilio, Nov 06, 2012
  • Source

    Preview · Article ·
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Ambient logics have been proposed to describe properties for mobile agents which may evolve over time as well as space. This paper takes a predicate-based approach to extending an ambient logic with recursion, yielding a predicate µ-calculus in which fixpoint formulas are formed using predicate variables. An algorithm is developed for model checking finite-control mobile ambients against formulas of the logic, providing the first decidability result for model checking a spatial logic with recursion.
    Preview · Article · Dec 2004 · Journal of Computer Science and Technology
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Spatial logics have been used to describe properties of tree-like structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separation Logic). We integrat this work by analyzing dynamic updates to tree-like structures with pointers (such as XML with identifiers and idrefs). Naíve adaptations of the Ambient Logic are not expressive enough to capture such local updates. Instead we must explicitly reason about arbitrary tree contexts in order to capture updates throughout the tree. We introduce Context Logic, study its proof theory and models, and show how it generalizes Separation Logic and its general theory BI. We use it to reason locally about a small imperative programming language for updating trees, using a Hoare logic in the style of O'Hearn, Reynolds and Yang, and show that weakest preconditions are derivable. We demonstrate the robustness of our approach by using Context Logic to capture the locality of term rewrite systems.
    Full-text · Conference Paper · Jan 2005
Show more