XML Reasoning Solver
Participants : Pierre Genevès, Nabil Layaïda.
The XML Reasoning Solver is a tool for the static analysis of XPath queries and XML schemas, based on the latest theoretical advances. It performs automated verification of properties that are expressed as logical formulas over trees. A logical formula may for instance express structural constraints or navigation properties (like e.g. path existence and node selection) in finite trees.
The tool can solve many fundamental XML problems such as satisfiability of XPath expressions in the presence of XML schemas, containment and equivalence of XPath expressions, and many other problems that can be formulated with XPath expressions and schemas like DTDs, XML Schemas, and Relax-NGs.
The solver is avaliable on-line.