Results 1  10
of
10
Logics for unranked trees: an overview
 Logical Methods in Computer Science 2, Issue 3, Paper 2
, 2006
"... Vol. 2 (3:2) 2006, pp. 1–31 www.lmcsonline.org ..."
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.
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.
TQL Algebra and its Implementation (Extended Abstract)
 In Proc. of IFIP TCS
, 2002
"... TQL is a query language for semistructured data. TQL binding mechanism is based upon the ambient logic, a logic to describe trees, originally defined to model properties of distributed processes. This binding mechanism is the key feature of TQL, but its implementation is far from obvious, being bas ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
TQL is a query language for semistructured data. TQL binding mechanism is based upon the ambient logic, a logic to describe trees, originally defined to model properties of distributed processes. This binding mechanism is the key feature of TQL, but its implementation is far from obvious, being based on a logic which includes "difficult" operators such as negation, universal quantification, recursion, and new treerelated operators. In [6] an "implementation model" is presented, in the form of an alternative definition of the semantics of the binding machanism, based on an algebra of infinite relations over trees. Here we first extend that algebra with tree operations, hence obtaining an algebra for the full TQL language. Then we describe the evaluation and optimization techniques that we employ in our implementation.
Bigraphical Logics for XML
, 2005
"... Bigraphs are emerging as an interesting model that can represent both the picalculus and the ambient calculus. Bigraphs are built orthogonally on two structures: a hierarchical `place' graph for locations and a `link' (hyper)graph for connections. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Bigraphs are emerging as an interesting model that can represent both the picalculus and the ambient calculus. Bigraphs are built orthogonally on two structures: a hierarchical `place' graph for locations and a `link' (hyper)graph for connections.
Spatial Tree Logics to Reason about Semistructured Data
 SEBD ’03: Proceedings of 11th Italian Symposium on Advanced Database Systems
, 2003
"... The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations.
A formal validation model for the netconf protocol
 of Lecture Notes in Computer Science
, 2004
"... Abstract. Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate and commit, which currently lack a clear description and an information model. We propose in this paper a model ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate and commit, which currently lack a clear description and an information model. We propose in this paper a model for validation based on XML schema trees. By using an existing logical formalism called TQL, we express important dependencies between parameters that appear in those information models, and automatically check these dependencies on sample XML trees in reasonable time. We illustrate our claim by showing different rules and an example of validation on a Virtual Private Network. 1
BiLog: Spatial Logics for Bigraphs
, 2005
"... Bigraphs are emerging as a (meta)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper)graph for connections. Aiming at describing bigraphical structures, we introduce a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Bigraphs are emerging as a (meta)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper)graph for connections. Aiming at describing bigraphical structures, we introduce a general framework, BiLog, whose formulae describe arrows in monoidal categories. We then instantiate the framework to bigraphical structures and we obtain a logic that is a natural composition of a place graph logic and a link graph logic. We explore the concepts of separation and sharing in these logics and we prove that they generalise well known spatial logics for trees, graphs and tree contexts. As an application, we show how XML data with links and web services can be modelled by bigraphs and described by BiLog. The framework can be extended by introducing dynamics in the model and a standard temporal modality in the logic. However, in some cases, temporal modalities can be already expressed in the static framework. To testify this, we show how to encode a minimal spatial logic for CCS in an instance of BiLog.
ON THE EXPRESSIVENESS OF THE AMBIENT LOGIC
, 2005
"... Vol. 2 (2:3) 2006, pp. 1–35 www.lmcsonline.org ..."
2.3 The Ambient Logic.......................................... 6
, 2005
"... The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. In this paper, we study the expressiveness of AL. We define formulas for capabilities and for communication in MA ..."
Abstract
 Add to MetaCart
The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. In this paper, we study the expressiveness of AL. We define formulas for capabilities and for communication in MA. We also derive some formulas that capture finitess of a term, name occurrences and persistence. We study extensions of the calculus involving more complex forms of communications, and we define characteristic formulas for the equivalence induced by the logic on a subcalculus of MA. This subcalculus is defined by imposing an imagefiniteness condition on the reducts of a MA process.