2000 character limit reached
A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems
Published 23 Apr 2018 in cs.LO | (1804.08308v1)
Abstract: We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the calculus is a circularity proof rule, which allows to obtain finite representations of the infinite coinductive proofs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.