Pages that link to "Item:Q2849501"
From MaRDI portal
The following pages link to Term Rewriting with Logical Constraints (Q2849501):
Displaying 17 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- An approach to analyzing the properties of programs (Q1103383) (← links)
- Loop detection by logically constrained term rewriting (Q1629968) (← links)
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← 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)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Term rewriting with type-safe traversal functions (Q2843609) (← links)
- Generic Literals (Q3453109) (← links)
- (Q4993362) (← links)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← 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)
- Analysing parallel complexity of term rewriting (Q6160759) (← 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)