An approach to high-level language bindings to XML

Simeoni, Fabio; Manghi, Paolo; Lievens, David; Connor, Richard; Neely, Steve

doi:10.1016/s0950-5849(02)00011-3

Cited by 4 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The SNAQue tool [40] provides a variant of data binding that does not take schemas into account. From an XML document and a programming language type, it extracts a program value.…”

Section: Techniques For General-purpose Languagesmentioning

confidence: 99%

Static analysis of XML transformations in java

Kirkegaard

Möller

Schwartzbach

2004

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

XML documents generated dynamically by programs are typically represented as text strings or DOM trees. This is a low-level approach for several reasons: 1) Traversing and modifying such structures can be tedious and error prone; 2) Although schema languages, e.g. DTD, allow classes of XML documents to be defined, there are generally no automatic mechanisms for statically checking that a program transforms from one class to another as intended.We introduce Xact, a high-level approach for Java using XML templates as a first-class data type with operations for manipulating XML values based on XPath. In addition to an efficient runtime representation, the data type permits static type checking using DTD schemas as types. By specifying schemas for the input and output of a program, our algorithm will statically verify that valid input data is always transformed into valid output data and that no errors occur during processing.

show abstract

“…The SNAQue tool [40] provides a variant of data binding that does not take schemas into account. From an XML document and a programming language type, it extracts a program value.…”

Section: Techniques For General-purpose Languagesmentioning

confidence: 99%

Static analysis of XML transformations in java

Kirkegaard

Möller

Schwartzbach

2004

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…Elsewhere, we have shown that we could correctly implement the SNAQue architecture, and we did it for a canonical language core L. 3 In doing so, we followed a principle of generality that allows binding mechanisms for other typed languages to be derived directly from L.…”

Section: Formal Definition and Canonical Specificationmentioning

confidence: 99%

“…In the canonical binding mechanism, for example, the binding would require the projection of the following canonical type over d: and result in the identification of the following canonical value equivalent to d′: Our algorithm Ext takes an XML document d and a canonical type T and returns a canonical value v, which is extractable from d according to T. In particular, we have proved the soundness and completeness of Ext with respect to the canonical specification. 3…”

Section: Formal Definition and Canonical Specificationmentioning

confidence: 99%

Language bindings to XML

Simeoni

Lievens²,

Conn³

et al. 2003

IEEE Internet Comput.

Self Cite

View full text Add to dashboard Cite

“…It provides a loose tree-based structure well suited for semi-structured data [2,3]. XML's self-describing nature, human readable element names, and ability to reference external document specifications allows applications to exchange and dynamically interpret data without a shared set of assumptions, such as interface definitions via header files.…”

Section: Introductionmentioning

confidence: 99%