Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Model checking
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of Functional Programming
ACM SIGMOD Record
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Logic-based XPath optimization
Proceedings of the 2004 ACM symposium on Document engineering
Regular expression types for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Temporal Logics over Unranked Trees
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)
Static analysis for path correctness of XML queries
Journal of Functional Programming
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
Deciding XPath containment with MSO
Data & Knowledge Engineering
A decision procedure for the alternation-free two-way modal µ-calculus
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Type-based optimization for regular patterns
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
The design space of type checkers for XML transformation languages
ICDT'05 Proceedings of the 10th international conference on Database Theory
Analysis of imperative XML programs
Information Systems
Identifying query incompatibilities with evolving XML schemas
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
On the analysis of queries with counting constraints
Proceedings of the 9th ACM symposium on Document engineering
An Automata-Theoretic Approach to Regular XPath
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Debugging standard document formats
Proceedings of the 19th international conference on World wide web
Analysis of imperative XML programs
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Eliminating dead-code from XQuery programs
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
Extending the tractability results on XPath satisfiability with sibling axes
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Calculating tree navigation with symmetric relational zipper
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Satisfiability algorithms for conjunctive queries over trees
Proceedings of the 14th International Conference on Database Theory
Inconsistent path detection for XML IDEs
Proceedings of the 33rd International Conference on Software Engineering
Impact of XML Schema Evolution
ACM Transactions on Internet Technology (TOIT)
An efficient decision procedure for imperative tree data structures
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Set-theoretic foundation of parametric polymorphism and subtyping
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Parametric polymorphism and semantic subtyping: the logical connection
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
On the analysis of cascading style sheets
Proceedings of the 21st international conference on World Wide Web
Query reasoning on trees with types, interleaving, and counting
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
SPARQL query containment under RDFS entailment regime
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
XML query-update independence analysis revisited
Proceedings of the 2012 ACM symposium on Document engineering
Toward automated schema-directed code revision
Proceedings of the 2012 ACM symposium on Document engineering
XPath satisfiability with downward and sibling axes is tractable under most of real-world DTDs
Proceedings of the twelfth international workshop on Web information and data management
XML validation: looking backward - strongly typed and flexible XML processing are not incompatible
Proceedings of the 22nd international conference on World Wide Web companion
Programming errors in traversal programs over structured data
Science of Computer Programming
Hi-index | 0.00 |
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically type-check XPath queries. To this end, we prove the decidability of a logic with converse for finite ordered trees whose time complexity is a simple exponential of the size of a formula. The logic corresponds to the alternation free modal μ-calculus without greatest fixpoint, restricted to finite trees, and where formulas are cycle-free. Our proof method is based on two auxiliary results. First, XML regular tree types and XPath expressions have a linear translation to cycle-free formulas. Second, the least and greatest fixpoints are equivalent for finite trees, hence the logic is closed under negation. Building on these results, we describe a practical, effective system for solving the satisfiability of a formula. The system has been experimented with some decision problems such as XPath emptiness, containment, overlap, and coverage, with or without type constraints. The benefit of the approach is that our system can be effectively used in static analyzers for programming languages manipulating both XPath expressions and XML type annotations (as input and output types).