Filters








463 Hits in 1.4 sec

Typechecking for XML transformers

Tova Milo, Dan Suciu, Victor Vianu
2000 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00  
We study the typechecking problem for XML (eXtensible Markup Language) transformers: given an XML transformation program and a DTD for the input XML documents, check whether every result of the program  ...  Consequently, typechecking can be performed for a broad range of XML transformation languages, including XML-QL and a fragment of XSLT. r 2003 Published by Elsevier Science (USA). 0022-0000/03/$ -see front  ...  Acknowledgments We thank Nils Klarlund for his comments.  ... 
doi:10.1145/335168.335171 dblp:conf/pods/MiloSV00 fatcat:hc2feri2lvetnoduhkntza2lwu

Typechecking for XML transformers

Tova Milo, Dan Suciu, Victor Vianu
2003 Journal of computer and system sciences (Print)  
We study the typechecking problem for XML (eXtensible Markup Language) transformers: given an XML transformation program and a DTD for the input XML documents, check whether every result of the program  ...  Consequently, typechecking can be performed for a broad range of XML transformation languages, including XML-QL and a fragment of XSLT. r 2003 Published by Elsevier Science (USA). 0022-0000/03/$ -see front  ...  Acknowledgments We thank Nils Klarlund for his comments.  ... 
doi:10.1016/s0022-0000(02)00030-2 fatcat:a2bxrrse3vf2pha25mrbwnaulu

Frontiers of tractability for typechecking simple XML transformations

Wim Martens, Frank Neven
2007 Journal of computer and system sciences (Print)  
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type.  ...  By restricting schema languages and transformations, we identify several practical settings for which typechecking is in polynomial time.  ...  Acknowledgment We thank Giorgio Ghelli for raising the question about the complexity of typechecking in the setting of a fixed output schema. We thank Dirk Leinders, Thomas Schwentick, and  ... 
doi:10.1016/j.jcss.2006.10.005 fatcat:svotzzqmfjcbnpae3mjbyaiicu

Frontiers of tractability for typechecking simple XML transformations

Wim Martens, Frank Neven
2004 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '04  
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type.  ...  By restricting schema languages and transformations, we identify several practical settings for which typechecking is in polynomial time.  ...  Acknowledgment We thank Giorgio Ghelli for raising the question about the complexity of typechecking in the setting of a fixed output schema. We thank Dirk Leinders, Thomas Schwentick, and  ... 
doi:10.1145/1055558.1055563 dblp:conf/pods/MartensN04 fatcat:zt4zz55nirdo3ltg5wff3rvgsi

Flux: FunctionaL Updates for XML (extended report) [article]

James Cheney
2008 arXiv   pre-print
We are developing an XML update language called Flux, which stands for FunctionaL Updates for XML, drawing upon ideas from functional programming languages.  ...  XML database query languages have been studied extensively, but XML database updates have received relatively little attention, and pose many challenges to language design.  ...  Static typing for XML processing We will focus on only the most closely related work on XML typechecking; Møller and Schwartzbach (2005) provide a much more complete survey of type systems for XML transformation  ... 
arXiv:0807.1211v1 fatcat:nnw7so2g7ras7olnpz4kmhstn4

Typechecking XML views of relational databases

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2003 ACM Transactions on Computational Logic  
Motivated by the need to export relational databases as XML data in the context of the Web, we investigate the typechecking problem for transformations of relational data into tree data (XML).  ...  The problem consists of statically verifying that the output of every transformation belongs to a given output tree language (specified for XML by a DTD), for input databases satisfying given integrity  ...  However, typechecking becomes decidable for several restrictions on the class of transformations and/or the tree types.  ... 
doi:10.1145/772062.772065 fatcat:y5vsikjxqbbffm6oonsaasuphy

Page 4092 of Mathematical Reviews Vol. , Issue 2004e [page]

2004 Mathematical Reviews  
Consequently, typechecking can be performed for a broad range of XML transformation languages, including XML-QL and a fragment of XSLT.”  ...  Summary: “We study the typechecking problem for XML (eXten- sible Markup Language) transformers: given an XML transfor- mation program and a document type definition (DTD) for the input XML documents,  ... 

Adventures in Bidirectional Programming [chapter]

Benjamin C. Pierce
2007 Lecture Notes in Computer Science  
The typing rules for these combinators are designed so that the target structure can be updated with no knowledge of the source structure or the transformation between them. l.put can be applied to any  ...  have to work hard to make the typechecker happy Building an efficient typechecker is challenging...  ...  Basic string lenses align by absolute position Dictionary lenses align chunks using keys But for many interesting forms of data, it is difficult to identify "chunks" or "keys" raw text structured documents  ... 
doi:10.1007/978-3-540-77050-3_3 fatcat:eca42cjf2jb45e4w2zoc6a3muu

Typechecking Top-Down Uniform Unranked Tree Transducers [chapter]

Wim Martens, Frank Neven
2002 Lecture Notes in Computer Science  
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input schema.  ...  As typechecking quickly turns undecidable for query languages capable of testing equality of data values, we return to the limited framework where we abstract XML documents as labeled ordered trees.  ...  Milo, Suciu, and Vianu argued that the capability of most XML transformation languages can be encompassed by k-pebble transducers when data values are ignored and XML documents can be abstracted by labeled  ... 
doi:10.1007/3-540-36285-1_5 fatcat:tqikbk5yrrdsxl6g7ow44ejtgy

Typechecking Higher-Order Security Libraries [chapter]

Karthik Bhargavan, Cédric Fournet, Nataliya Guts
2010 Lecture Notes in Computer Science  
Our main applications are X.509 certificate chains, secure logs for multi-party games, and XML digital signatures.  ...  We implement our method by extending the F7 typechecker with automated support for these predicates. We evaluate our approach experimentally by verifying a series of security libraries and protocols.  ...  Code transformation We specify this semantics by translating every syntactic function Modifying the typechecker We achieve the same effect as the transformation by directly injecting formulas when typechecking  ... 
doi:10.1007/978-3-642-17164-2_5 fatcat:gs6afzebnreobolyt6ktd3g544

XML with data values: typechecking revisited

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2003 Journal of computer and system sciences (Print)  
XML query languages, including recursive traversals like in XSLT [7], and described a method for typechecking all transformations in this class.  ...  The typechecking problem takes as input a query and two schemes (or types), one for the input XML documents and one for the output XML documents generated by the query.  ...  We briefly discuss the relation between that work and the typechecking of XML-to-XML transformations investigated in the present paper.  ... 
doi:10.1016/s0022-0000(03)00032-1 fatcat:lievrskogndkzgl6qtmr7gwntq

XML with data values

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
2001 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '01  
XML query languages, including recursive traversals like in XSLT [7], and described a method for typechecking all transformations in this class.  ...  The typechecking problem takes as input a query and two schemes (or types), one for the input XML documents and one for the output XML documents generated by the query.  ...  We briefly discuss the relation between that work and the typechecking of XML-to-XML transformations investigated in the present paper.  ... 
doi:10.1145/375551.375570 dblp:conf/pods/AlonMNSV01 fatcat:izvhnayfyfgfhnnjqrqk76ylx4

XML: Model, Schemas, Types, Logics, and Queries [chapter]

Nils Klarlund, Thomas Schwentick, Dan Suciu
2004 Logics for Emerging Applications of Databases  
XML Transformations The class of XML transformations for which we discuss inverse type inference and typechecking are k-pebble transducers [61] .  ...  Sect. 6.3 presents in more detail results on a specific, important question: the typechecking problem for XSLT transformations.  ... 
doi:10.1007/978-3-642-18690-5_1 fatcat:f5mtevnovffhnpfgdpb7rqlmji

Towards Practical Typechecking for Macro Forest Transducers

Kazuhiro Abe, Keisuke Nakano
2017 Journal of Information Processing  
Typechecking of transformations in these models is performed to verify if any tree of an input type is always transformed into a tree of an output type, which is useful for validating XML transformations  ...  Macro tree transducers (MTTs) and macro forest transducers (MFTs) have been used as good models of tree-structured data transformations such as XML transformations.  ...  Further, we wish to express our gratitude to Alain Frisch for providing his source code of a typechecker for MTTs, and Hiroshi Unno for providing a typechecker for higher-order multi-parameter tree transducers  ... 
doi:10.2197/ipsjjip.25.962 fatcat:5cwvxe5bzjc2zga6lr3dvjosxm

A formal security policy for xenon

John McDermott, Leo Freitas
2008 Proceedings of the 6th ACM workshop on Formal methods in security engineering - FMSE '08  
language is extendedGeneral Circus AST• enables transformation between (3) different formats.• Java (AST) code generation from XML (metadata) schemas• some Circus tools based on this AST: 1. typechecker  ...  v → AddOp ; X ) Circus tools summary Textual UI • SPM: parsing, pretty-printing, typechecking • compiler for process behaviour (ProBE-like) exploration • model checker for refinement (FDR-like) checking  ... 
doi:10.1145/1456396.1456401 dblp:conf/ccs/McDermottF08 fatcat:q3zausysdbgbndabdnhhjapx7u
« Previous Showing results 1 — 15 out of 463 results