Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Towards more precise typing rules for Xcerpt
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Descriptive typing rules for xcerpt
PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
Modular web queries: from rules to stores
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Towards more precise typing rules for Xcerpt
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
A type system for regular expressions
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs
Hi-index | 0.00 |
The paper presents a prototype implementation of a descriptive type system for the XML query language Xcerpt. Its intended application is finding (a certain kind of) errors in programs. The implementation is able to check correctness of an Xcerpt program with respect to a type specification. A type specification describes a set of possible data bases to which the program is to be applied and an expected set of results. Program correctness means that all its results are in the expected set. Failure of a correctness check suggests an error in the program. Under certain conditions such failure indeed means that the program is incorrect. Current implementation works for a restricted, but interesting subset of Xcerpt. The system provides (approximations of) the set of program results and the sets of values of program variables; this information is useful for programmers (and is produced even when the specification of the expected set of results is not given).