Conditional circular coinductive rewriting with case analysis.

DOI10.1007/B94458MaRDI QIDQ5900823zbMATH OpenOpenAlexFDO

Authors Joseph Goguen, Kai Lin, Grigore Roşu

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b94458

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Abstract data types; algebraic specification (68Q65)

Recommendations

• Behavioral and coinductive rewriting
• Circular coinduction: a proof theoretical foundation
• CIRC: A Circular Coinductive Prover
• Regular strategies as proof tactics for \textsf{CIRC}
• CIRC: A Behavioral Verification Tool Based on Circular Coinduction

Cited in

(9)

• A coinductive approach to proving reachability properties in logically constrained term rewriting systems
• Closure properties for the class of behavioral models
• Behavioral and coinductive rewriting
• Regular strategies as proof tactics for \textsf{CIRC}
• Circular coinduction: a proof theoretical foundation
• CIRC: A Behavioral Verification Tool Based on Circular Coinduction
• Behavioral equivalence of hidden k-logics: an abstract algebraic approach
• A short overview of hidden logic
• Complete sets of cooperations

This page was built for publication: Conditional circular coinductive rewriting with case analysis.

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