Results 1  10
of
25
Mobile ambients
 In Proceedings of POPL'98
, 1998
"... Laboratory We introduce a calculus describing the movement of processes and devices, including movement through administrative domains. ..."
Abstract

Cited by 814 (29 self)
 Add to MetaCart
Laboratory We introduce a calculus describing the movement of processes and devices, including movement through administrative domains.
Deciding Validity in a Spatial Logic for Trees
 TLDI'03
, 2003
"... We consider a propositional spatial logic for finite trees. The logic includes (tree composition), (the implication induced by composition), and 0 (the unit of composition) . We show that the satisfaction and validity problems are equivalent, and decidable. The crux of the argument is devisi ..."
Abstract

Cited by 52 (5 self)
 Add to MetaCart
We consider a propositional spatial logic for finite trees. The logic includes (tree composition), (the implication induced by composition), and 0 (the unit of composition) . We show that the satisfaction and validity problems are equivalent, and decidable. The crux of the argument is devising a finite enumeration of trees to consider when deciding whether a spatial implication is satisfied. We introduce a sequent calculus for the logic, and show it to be sound and complete with respect to an interpretation in terms of satisfaction. Finally, we describe a complete proof procedure for the sequent calculus. We envisage applications in the area of logicbased type systems for semistructured data. We describe a small programming language based on this idea.
TQL: A Query Language for Semistructured Data Based on the Ambient Logic
 Mathematical Structures in Computer Science
, 2003
"... this paper we present TQL, a query language for semistructured data that is based on the ambient logic ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
this paper we present TQL, a query language for semistructured data that is based on the ambient logic
Describing semistructured data
 SIGMOD Record, Database Principles Column
"... We introduce a rich language of descriptions for semistructured treelike data, and we explain how such descriptions relate to the data they describe. Various query languages and data schemas can be based on such descriptions. 1 ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We introduce a rich language of descriptions for semistructured treelike data, and we explain how such descriptions relate to the data they describe. Various query languages and data schemas can be based on such descriptions. 1
A Logic You Can Count On
 In POPL 2004 – 31st Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages
, 2004
"... We prove the decidability of the quantifierfree, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression language for semistructured data. The essence of this result is a surprising connection between formulas of the ambient logic ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We prove the decidability of the quantifierfree, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression language for semistructured data. The essence of this result is a surprising connection between formulas of the ambient logic and counting constraints on (nested) vectors of integers.
Expressiveness and complexity of graph logic
, 2007
"... We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner, and Ghelli, and provides the simplest setting in which to explore such results for spatial logics. We study several forms of the logic: the log ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner, and Ghelli, and provides the simplest setting in which to explore such results for spatial logics. We study several forms of the logic: the logic with and without recursion, and with either an exponential or a linear version of the basic composition operator. We study the combined complexity and the expressive power of the four combinations. We prove that, without recursion, the linear and exponential versions of the logic correspond to significant fragments of firstorder (FO) and monadic secondorder (MSO) logics; the two versions are actually equivalent to FO and MSO on graphs representing strings. However, when the two versions are enriched withstyle recursion, their expressive power is sharply increased. Both are able to express PSPACEcomplete problems, although their combined complexity and data complexity still belong to PSPACE.
Expressiveness of a spatial logic for trees
 In LICS 2005
, 2005
"... In this paper we investigate the quantifierfree fragment of the TQL logic proposed by Cardelli and Ghelli. The TQL logic, inspired from the ambient logic, is the core of a query language for semistructured data represented as unranked and unordered trees. The fragment we consider here, named STL, c ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
In this paper we investigate the quantifierfree fragment of the TQL logic proposed by Cardelli and Ghelli. The TQL logic, inspired from the ambient logic, is the core of a query language for semistructured data represented as unranked and unordered trees. The fragment we consider here, named STL, contains as main features spatial composition and location as well as a fixed point construct. We prove that satisfiability for STL is undecidable. We show also that STL is strictly more expressive than the Presburger monadic secondorder logic (PMSO) of Seidl, Schwentick and Muscholl when interpreted over unranked and unordered edgelabelled trees. We define a class of tree automata whose transitions are conditioned by arithmetical constraints; we show then how to compute from a closed STL formula a tree automaton accepting precisely the models of the formula. Finally, still using our tree automata framework, we exhibit some syntactic restrictions over STL formulae that allow us to capture precisely the logics MSO and PMSO. 1
Behavioral and Spatial Observations in a Logic for the πCalculus
, 2004
"... In addition to behavioral properties, spatial logics can talk about other key properties of concurrent systems such as secrecy, freshness, usage of resources, and distribution. We study an expressive spatial logic for systems specified in the synchronous πcalculus with recursion, based on a small s ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In addition to behavioral properties, spatial logics can talk about other key properties of concurrent systems such as secrecy, freshness, usage of resources, and distribution. We study an expressive spatial logic for systems specified in the synchronous πcalculus with recursion, based on a small set of behavioral and spatial observations. We give coinductive and equational characterizations of the equivalence induced on processes by the logic, and conclude that it strictly lies between structural congruence and strong bisimulation. We then show that modelchecking is decidable for a useful class of processes that includes the finitecontrol fragment of the πcalculus.
When Ambients Cannot be Opened
 In Proceedings of FoSSaCS 2003
, 2003
"... We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the has been removed, in terms of the reachability problem of the reduct ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the has been removed, in terms of the reachability problem of the reduction relation. Surprisingly, we show that even for this very restricted fragment, the reachability problem is not decidable. At a second step, for a slightly weaker reduction relation, we prove that reachability can be decided by reducing this problem to markings reachability for Petri nets. Finally, we show that the nameconvergence problem as well as the modelchecking problem turn out to be undecidable for both the original and the weaker reduction relation. 1
Decidability of Freshness, Undecidability of Revelation
 IN PROC. OF INTERNATIONAL CONFERENCE ON FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES (FOSSACS), VOLUME 2987 OF LNCS
, 2003
"... We study decidability of a logic for describing processes with restricted names. We choose a minimal fragment of the Ambient Logic, but the techniques we present should apply to every logic which uses Cardelli and Gordon revelation and hiding operators, and Gabbay and Pitts freshness quantifier. We ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We study decidability of a logic for describing processes with restricted names. We choose a minimal fragment of the Ambient Logic, but the techniques we present should apply to every logic which uses Cardelli and Gordon revelation and hiding operators, and Gabbay and Pitts freshness quantifier. We start from the static fragment of ambient logic that Calcagno Cardelli and Gordon proved to be decidable. We prove that the addition of a hiding quantifier makes the logic undecidable. Hiding can be decomposed as freshness plus revelation. Quite surprisingly, freshness alone is decidable, but revelation alone is not.