@inproceedings{faa4102c397a4f38b5e27e4611b315f2,
title = "Linear inclusion for XML regular expression types",
abstract = "Type inclusion is a fundamental operation in every type-checking compiler, but it is quite expensive for XML manipulation languages. We recently presented an inclusion checking algorithm for an expressive family of XML type languages which is polynomial, but runs in quadratic time both in the best and in the worst cases. We present here an algorithm that has a linear-time backbone, and resorts to the quadratic approach for some specific parts of the compared types. Our experiments show that the new algorithm typically runs in linear time, hence can be used as a building block for a practical type-checking compiler.",
keywords = "Type inclusion, XML",
author = "Dario Colazzo and Giorgio Ghelli and Luca Pardini and Carlo Sartiani",
year = "2009",
month = jan,
day = "1",
doi = "10.1145/1645953.1645973",
language = "English",
isbn = "9781605585123",
series = "International Conference on Information and Knowledge Management, Proceedings",
publisher = "Association for Computing Machinery",
pages = "137--146",
booktitle = "ACM 18th International Conference on Information and Knowledge Management, CIKM 2009",
note = "ACM 18th International Conference on Information and Knowledge Management, CIKM 2009 ; Conference date: 02-11-2009 Through 06-11-2009",
}