@inproceedings{2f70fdf2b5f84a6e8388310e8c4cde13,
title = "A tool proving well-definedness of streams using termination tools",
abstract = "A stream specification is a set of equations intended to define a stream, that is, an infinite sequence over a given data type. In [5] a transformation from such a stream specification to a TRS is defined in such a way that termination of the resulting TRS implies that the stream specification admits a unique solution. In this tool description we present how proving such well-definedness of several interesting boolean stream specifications can be done fully automatically using present powerful tools for proving TRS termination.",
author = "H. Zantema",
year = "2009",
doi = "10.1007/978-3-642-03741-2_32",
language = "English",
isbn = "978-3-642-03740-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "449--456",
editor = "A. Kurz and M. Lenisa and A. Tarlecki",
booktitle = "Algebra and Coalgebra in Computer Science (Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings)",
address = "Germany",
}