Term Rewriting with Logical Constraints
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4090846
- scientific article; zbMATH DE number 1303731
- scientific article; zbMATH DE number 4155899
- Term rewriting systems in logic programming and in functional programming
- Constrained term rewriting tooL
- scientific article; zbMATH DE number 1231695
- scientific article; zbMATH DE number 1368955
- Completion for logically constrained rewriting
- A rewrite approach for constraint logic programming
Cited in
(30)- An approach to analyzing the properties of programs
- Loop detection by logically constrained term rewriting
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- Runtime complexity analysis of logically constrained rewriting
- Transforming orthogonal inductive definition sets into confluent term rewrite systems
- On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs
- Generalized rewrite theories, coherence completion, and symbolic methods
- Term rewriting with type-safe traversal functions
- Generic literals
- Constrained term rewriting tooL
- Rewriting modulo SMT and open system analysis
- scientific article; zbMATH DE number 3947599 (Why is no real title available?)
- Completion for logically constrained rewriting
- Verifying procedural programs via constrained rewriting induction
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Operationally-based program equivalence proofs using LCTRSs
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting
- Analysing parallel complexity of term rewriting
- Confluence Criteria for Logically Constrained Rewrite Systems
- On complexity bounds and confluence of parallel term rewriting
- Transforming concurrent programs with semaphores into logically constrained term rewrite systems
- Difference of constrained patterns in logically constrained term rewrite systems
- Constraint solving over multiple similarity relations
- From innermost to full probabilistic term rewriting: almost-sure termination, complexity, and modularity
- Termination of generalized term rewriting systems
- Equational theories and validity for logically constrained term rewriting
- Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms
- A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems
- Confluence of logically constrained rewrite systems revisited
- Higher-order constrained dependency pairs for (universal) computability
This page was built for publication: Term Rewriting with Logical Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849501)
