Pages that link to "Item:Q5278212"
From MaRDI portal
The following pages link to Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212):
Displaying 11 items.
- ATLAS: automated amortised complexity analysis of self-adjusting data structures (Q832253) (← links)
- Loop detection by logically constrained term rewriting (Q1629968) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← links)
- (Q4993362) (← links)
- Type-based analysis of logarithmic amortised complexity (Q5875895) (← 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)
- On complexity bounds and confluence of parallel term rewriting (Q6622000) (← links)
- Transforming concurrent programs with semaphores into logically constrained term rewrite systems (Q6671788) (← links)
