Sciweavers

2000 search results - page 84 / 400
» Program Transformation and Proof Transformation
Sort
View
EXTREME
2004
ACM
15 years 8 months ago
A Simple Proof for the Turing-Completeness of XSLT and XQuery
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...
Stephan Kepser
DM
2007
119views more  DM 2007»
15 years 3 months ago
Short proofs for cut-and-paste sorting of permutations
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
Daniel W. Cranston, Ivan Hal Sudborough, Douglas B...
121
Voted
ASPDAC
2007
ACM
117views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Short-Circuit Compiler Transformation: Optimizing Conditional Blocks
Abstract-- We present the short-circuit code transformation technique, intended for embedded compilers. The transformation technique optimizes conditional blocks in high-level prog...
Mohammad Ali Ghodrat, Tony Givargis, Alex Nicolau
ADBIS
2004
Springer
111views Database» more  ADBIS 2004»
15 years 8 months ago
A High-Level Language for Specifying XML Data Transformations
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
Tadeusz Pankowski
138
Voted
ICDAR
2003
IEEE
15 years 8 months ago
Document Transformation System from Papers to XML Data Based on Pivot XML Document Method
This paper proposes a new method for document transformation using OCR to generate various XML documents from printed documents. The proposed method adopts a hierarchical transfor...
Yasuto Ishitani