Term Rewriting with Logical Constraints
From MaRDI portal
Publication:2849501
DOI10.1007/978-3-642-40885-4_24zbMath1398.68276OpenAlexW8727156MaRDI QIDQ2849501
Publication date: 20 September 2013
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40885-4_24
Related Items (13)
Verifying Procedural Programs via Constrained Rewriting Induction ⋮ Loop detection by logically constrained term rewriting ⋮ Transforming orthogonal inductive definition sets into confluent term rewrite systems ⋮ Generic Literals ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Rewriting modulo SMT and open system analysis ⋮ On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs ⋮ Operationally-based program equivalence proofs using LCTRSs ⋮ Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting ⋮ Unnamed Item ⋮ Analysing parallel complexity of term rewriting ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ Runtime complexity analysis of logically constrained rewriting
Uses Software
This page was built for publication: Term Rewriting with Logical Constraints
