Pages that link to "Item:Q2291817"
From MaRDI portal
The following pages link to Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817):
Displaying 13 items.
- Capturing constrained constructor patterns in matching logic (Q2096417) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
- (Q5020960) (← links)
- Guest editor's foreword (Q5919131) (← links)
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis (Q6052948) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
- Variants and satisfiability in the infinitary unification wonderland (Q6113018) (← links)
- Symbolic analysis and parameter synthesis for time Petri nets using Maude and SMT solving (Q6535202) (← links)
- Building correct-by-construction systems with formal patterns (Q6562511) (← links)
- A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets (Q6622141) (← links)
- Maude2Lean: theorem proving for Maude specifications using Lean (Q6643468) (← links)
