On the public citation graph

Frontiers of tractability for typechecking simple XML transformations

0 signed · 66 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-36285-1_12openalex-snapshot
Processing XML Streams with Deterministic Automata
inferredcites →https://doi.org/10.1007/3-540-36285-1_20openalex-snapshot
Containment for XPath Fragments under DTD Constraints
inferredcites →https://doi.org/10.1007/3-540-36285-1_21openalex-snapshot
XPath Containment in the Presence of Disjunction, DTDs, and Variables
inferredcites →https://doi.org/10.1007/3-540-36285-1_4openalex-snapshot
Incremental Validation of XML Documents
inferredcites →https://doi.org/10.1007/3-540-44543-9openalex-snapshot
Research Issues in Structured and Semistructured Database Programming
inferredcites →https://doi.org/10.1007/3-540-44543-9_13openalex-snapshot
Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model
inferredcites →https://doi.org/10.1007/3-540-44543-9_6openalex-snapshot
Structured Document Transformations Based on XSL
inferredcites →https://doi.org/10.1007/3-540-46093-4_1openalex-snapshot
Typechecking for Semistructured Data
inferredcites →https://doi.org/10.1007/978-3-540-28629-5_70openalex-snapshot
Complexity of Decision Problems for Simple Regular Expressions
inferredcites →https://doi.org/10.1007/s00236-003-0120-0openalex-snapshot
A comparison of pebble tree transducers with macro tree transducers
inferredcites →https://doi.org/10.1007/s007780050084openalex-snapshot
UnQL: a query language and algebra for semistructured data based on structural recursion
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/j.ic.2008.01.002openalex-snapshot
Typechecking top-down XML transformations: Fixed input or output schemas
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.035openalex-snapshot
On the complexity of typechecking top-down XML transformations
inferredcites →https://doi.org/10.1016/s0022-0000(02)00030-2openalex-snapshot
Typechecking for XML transformers
inferredcites →https://doi.org/10.1016/s0022-0000(03)00032-1openalex-snapshot
XML with data values: typechecking revisited
inferredcites →https://doi.org/10.1016/s0022-0000(74)80046-2openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1016/s0306-4379(01)00033-3openalex-snapshot
A formal model for an expressive fragment of XSLT
inferredcites →https://doi.org/10.1109/sfcs.1977.16openalex-snapshot
Lower bounds for natural proof systems
inferredcites →https://doi.org/10.1109/sfcs.1994.365747openalex-snapshot
Proceedings 35th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1145/1065167.1065172openalex-snapshot
XPath satisfiability in the presence of DTDs
inferredcites →https://doi.org/10.1145/1065167.1065182openalex-snapshot
Security analysis of cryptographically controlled access to XML documents
inferredcites →https://doi.org/10.1145/230514.571645openalex-snapshot
Introduction to the Theory of Computation
inferredcites →https://doi.org/10.1145/2500365openalex-snapshot
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
inferredcites →https://doi.org/10.1145/303976.303998openalex-snapshot
Type inference for queries on semistructured data
inferredcites →https://doi.org/10.1145/335168.335173openalex-snapshot
DTD inference for views of XML data
inferredcites →https://doi.org/10.1145/502187openalex-snapshot
Proceedings of the 2001 ACM Symposium on Document engineering
inferredcites →https://doi.org/10.1145/502187.502191openalex-snapshot
Towards static type checking for XSLT
inferredcites →https://doi.org/10.1145/507338.507360openalex-snapshot
The XML typechecking problem
inferredcites →https://doi.org/10.1145/601858.601869openalex-snapshot
Automata theory for XML researchers
inferredcites →https://doi.org/10.1145/767193.767195openalex-snapshot
XDuce
inferredcites →https://doi.org/10.1145/772062.772065openalex-snapshot
Typechecking XML views of relational databases
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1145/944705.944711openalex-snapshot
CDuce
inferredcites →https://doi.org/10.1145/962446.962448openalex-snapshot
Containment and equivalence for a fragment of XPath
inferredcites →https://doi.org/10.1201/9781482276367-14openalex-snapshot
Tree Languages

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11965893_17openalex-snapshot
Complexity of Typechecking XML Views of Relational Databases
inferred← citeshttps://doi.org/10.1007/11965893_19openalex-snapshot
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_788openalex-snapshot
XML Typechecking
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_788openalex-snapshot
XML Typechecking
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_788-2openalex-snapshot
XML Typechecking
inferred← citeshttps://doi.org/10.1007/978-3-030-18579-4_5openalex-snapshot
Learning k-Occurrence Regular Expressions with Interleaving
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_33openalex-snapshot
Reasoning Formally About Database Queries and Updates
inferred← citeshttps://doi.org/10.1007/978-3-642-28472-4_2openalex-snapshot
Foundations of XML Based on Logic and Automata: A Snapshot
inferred← citeshttps://doi.org/10.1007/978-3-642-31644-9_5openalex-snapshot
Cooperating Distributed Tree Automata
inferred← citeshttps://doi.org/10.1007/s00224-008-9132-zopenalex-snapshot
Modulo Constraints and the Complexity of Typechecking XML Views
inferred← citeshttps://doi.org/10.1007/s00224-018-9874-1openalex-snapshot
A Logic for Document Spanners
inferred← citeshttps://doi.org/10.1016/j.ic.2008.01.002openalex-snapshot
Typechecking top-down XML transformations: Fixed input or output schemas
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.03.011openalex-snapshot
Deciding definability by deterministic regular expressions
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.05.002openalex-snapshot
Visibly pushdown transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.005openalex-snapshot
Look-ahead removal for total deterministic top-down tree transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.012openalex-snapshot
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
inferred← citeshttps://doi.org/10.1137/070697367openalex-snapshot
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
inferred← citeshttps://doi.org/10.1145/1166074.1166076openalex-snapshot
Expressiveness and complexity of XML Schema
inferred← citeshttps://doi.org/10.1145/1166160.1166182openalex-snapshot
Comparing XML path expressions
inferred← citeshttps://doi.org/10.1145/1982185.1982530openalex-snapshot
XEvolve
inferred← citeshttps://doi.org/10.1145/1989284.1989316openalex-snapshot
The complexity of text-preserving XML transformations
inferred← citeshttps://doi.org/10.1145/2362355.2362362openalex-snapshot
Decidability of Downward XPath
inferred← citeshttps://doi.org/10.1145/2463664.2463675openalex-snapshot
On XPath with transitive axes and data tests
inferred← citeshttps://doi.org/10.1145/3212019.3212021openalex-snapshot
Satisfiability of Xpath on data trees
inferred← citeshttps://doi.org/10.1145/3584372.3588654openalex-snapshot
Static Analysis of Graph Database Transformations
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:5)2021openalex-snapshot
Axiomatizing Hybrid XPath with Data
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2400openalex-snapshot
Look-Ahead Removal for Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.48550/arxiv.2304.05070openalex-snapshot
Static Analysis of Graph Database Transformations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0606094openalex-snapshot
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.