A tool proving well-definedness of streams using termination tools

DOI10.1007/978-3-642-03741-2_32MaRDI QIDQ2888504zbMATH OpenOpenAlexFDO

Authors Hans Zantema

Publication date 1 June 2012

Published in Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03741-2_32

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Well-Definedness of Streams by Termination
• Well-definedness of streams by transformation and termination
• Proving equality of streams automatically
• Concrete stream calculus: an extended study
• Productivity of stream definitions

Cites work

• CIRC: A Circular Coinductive Prover
• Data-Oblivious Stream Productivity
• Well-Definedness of Streams by Termination

Cited in

(4)

• Proving equality of streams automatically
• Behavioral rewrite systems and behavioral productivity
• Well-definedness of streams by transformation and termination
• Well-Definedness of Streams by Termination

Describes a project that uses

Uses Software

• AProVE
• Tyrolean
• CIRC

This page was built for publication: A tool proving well-definedness of streams using termination tools

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888504)