Software

Mu-Calculus Satisfiability Solver - XPath Containment Checker

A system for checking XPath containment, XPath satisfiability under type constraints (DTDs, XML Schemas, Relax NG...), XPath equivalence, and many other related problems. The whole system is based on a new tree logic (see our publications) and consists in:

• a very efficient satisfiability solver for a μ-calculus with converse over finite trees;
• compilers for translating XPath and regular tree types including DTDs into the logic;
• a user-friendly predicate language that allow XML designers who are not familiar with the logic to directly describe their problem specification using native XML concepts (XPath, XML Schemas...), and check for instance backward schema compatibility, or query equivalence with evolving XML schemas.

The solver is directly usable as a web application: try it online!

Old Commercial Software

A long time ago (in a galaxy far far away...), in my spare time (aka: my undergraduate studies) I have developed some software I found convenient. They finally happened to be marketed almost worldwide by a few (french, german, and canadian) software companies. I created WCK, one of the very first french web page editor in 1996-97. In 1999, I founded pierresoft.com. A bit later, in 2001, I completed the design and development of Adesign: a graphic software for layered image authoring and retouching.