Pages that link to "Item:Q1799091"
From MaRDI portal
The following pages link to A coinductive approach to proving reachability properties in logically constrained term rewriting systems (Q1799091):
Displaying 8 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- (Co)inductive proof systems for compositional proofs in reachability logic (Q1996855) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Operationally-based program equivalence proofs using LCTRSs (Q6052946) (← links)
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
- Transforming concurrent programs with semaphores into logically constrained term rewrite systems (Q6671788) (← links)