Finite-state unification automata and relational languages
Information and Computation
Theoretical Computer Science
Theoretical Computer Science
Intractability of decision problems for finite-memory automata
Theoretical Computer Science - Special issue on universal machines and computations
ACM SIGMOD Record
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
Automata theory for XML researchers
ACM SIGMOD Record
A logical characterization of data languages
Information Processing Letters
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Automates a pile sur des alphabets infinis
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Automatic verification of recursive procedures with one integer parameter
Theoretical Computer Science - Mathematical foundations of computer science
A Kleene/Büchi-like theorem for clock languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
A Web odyssey: from codd to XML
ACM SIGMOD Record
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
An algebraic approach to data languages and timed languages
Information and Computation
XML with data values: typechecking revisited
Journal of Computer and System Sciences - Special issu on PODS 2001
An algebraic characterization of deterministic regular languages over infinite alphabets
Theoretical Computer Science
ACM SIGMOD Record
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Small Substructures and Decidability Issues for First-Order Logic with Two Variables
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Minimizing tree automata for unranked trees
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Static analysis of active XML systems
ACM Transactions on Database Systems (TODS)
Comparing workflow specification languages: a matter of views
Proceedings of the 14th International Conference on Database Theory
Comparing workflow specification languages: A matter of views
ACM Transactions on Database Systems (TODS)
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Highly expressive query languages for unordered data trees
Proceedings of the 15th International Conference on Database Theory
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Querying graph databases with XPath
Proceedings of the 16th International Conference on Database Theory
| Hi-index | 0.00 |
Most theoretical work on static analysis for XML and its query languages models XML documents by labeled ordered unranked trees, where the labels are from a finite set. Attribute values are usually ignored. This was quite successful for many applications like, to mention only some of them, the study of the navigational fragment of XPath known as Core-XPath [20], a complete picture of the complexity of satisfiability and inclusion of XPath queries without joins [4], XML-schema design with no integrity constraints [28, 31], type-checking [40]. The reader is invited to have a look at the Database Theory columns [32, 37, 40, 39] for an introduction on this rich production.