A tool proving well-definedness of streams using termination tools

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)
2 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationAlgebra and Coalgebra in Computer Science (Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings)
EditorsA. Kurz, M. Lenisa, A. Tarlecki
Place of PublicationBerlin
PublisherSpringer
Pages449-456
ISBN (Print)978-3-642-03740-5
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5728
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'A tool proving well-definedness of streams using termination tools'. Together they form a unique fingerprint.

Cite this