Describing semistructured data

Cardelli, Luca

doi:10.1145/604264.604278

Cited by 12 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are many other operators which further extend TQL's rich semantics [2], [3]. However, all of the interesting constraints we encountered in our work are expressible by means of those mentioned in this section.…”

Section: Expressing Configuration Rulesmentioning

confidence: 98%

See 1 more Smart Citation

A Formal Validation Model for the Netconf Protocol

et al. 2004

View full text Add to dashboard Cite

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.

show abstract

Section: Expressing Configuration Rulesmentioning

confidence: 98%

“…This conversion has the advantage that many formalisms have been developed in recent years [2], [7] that allow such description. Among them, the Tree Query Logic (TQL) [3] is particularly noteworthy, as it supports both property and query descriptions.…”

Section: Tree Rule 2 the Value Of The Ip Address Of The Interface Loomentioning

confidence: 99%

A Formal Validation Model for the Netconf Protocol

et al. 2004

View full text Add to dashboard Cite

show abstract

“…An ambient logic for trees. Ambient logics are modal logics for trees that have been proposed in the context of mobile computation [CG00] and later adapted for treerepresented data [Car01,CG01]. One views trees as edge-labeled and defines them by the grammar…”

Section: 2mentioning

confidence: 99%

Logics for Unranked Trees: An Overview

Libkin

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees.

show abstract

“…Many such formalisms have been developed in recent years [1], [4], [9], [11], [14], [21]. In particular, [5] introduced a logic called TQL (Tree Query Logic), which supports both property and query descriptions.…”

Section: Modelling the Service Configuration Rulesmentioning

confidence: 99%

“…Let us also mention that TQL contains a fix-point operator which can be used to recursively express properties at any depth in a tree [4], [5]. This makes TQL suitable for any configuration property.…”

Section: A Formalism For Expressing Configuration Rulesmentioning

confidence: 99%

Automated Validation of Service Configuration on Network Devices

Hallé

Deca

Cherkaoui

et al. 2004

Management of Multimedia Networks and Services

View full text Add to dashboard Cite

Abstract. Due to the significant development of network services in the past few years, their validation has become increasingly difficult. The advent of novel approaches to the issue of validation is therefore vital for keeping services manageable, safe, and reliable. We present a model for the validation of service configurations on network devices. A service configuration is modelled by a tree structure, and its properties are described by validation rules expressed in terms of these tree elements. By using an existing logical formalism called TQL, we have succeeded in expressing complex dependencies between parameters, and in automatically checking these dependencies against real-world network descriptions in feasible time.

show abstract

Describing semistructured data

Abstract: We introduce a rich language of descriptions for semistructured tree-like 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.

Cited by 12 publications

References 10 publications

A Formal Validation Model for the Netconf Protocol

A Formal Validation Model for the Netconf Protocol

Logics for Unranked Trees: An Overview

Automated Validation of Service Configuration on Network Devices

Contact Info

Product

Resources

About