The following pages link to Term Rewriting and Applications (Q5703846):
Displaying 12 items.
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
- Partial specifications and compositional verification (Q1177172) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Metalevel algorithms for variant satisfiability (Q2413027) (← links)
- Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- Towards Complete Reasoning about Axiomatic Specifications (Q3075488) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296) (← links)
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies (Q6487297) (← links)