The following pages link to (Q4385532):
Displaying 50 items.
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Ground confluence of order-sorted conditional specifications modulo axioms (Q2291829) (← links)
- Confluence by critical pair analysis revisited (Q2305423) (← links)
- Conditions for confluence of innermost terminating term rewriting systems (Q2321950) (← links)
- SMELS: satisfiability modulo equality with lazy superposition (Q2351265) (← links)
- Web ontology representation and reasoning via fragments of set theory (Q2360184) (← links)
- Closure properties of linear context-free tree languages with an application to optimality theory (Q2368942) (← links)
- Nominal rewriting (Q2373703) (← links)
- LARS: a learning algorithm for rewriting systems (Q2384128) (← links)
- On confluence and residuals in Cauchy convergent transfinite rewriting (Q2390300) (← links)
- On explicit substitution with names (Q2392486) (← links)
- Metalevel algorithms for variant satisfiability (Q2413027) (← links)
- Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- Multiset rewriting over Fibonacci and tribonacci numbers (Q2453583) (← links)
- A reconstruction and extension of Maple's assume facility via constraint contextual rewriting (Q2456557) (← links)
- A survey of strategies in rule-based program transformation systems (Q2456575) (← links)
- Evaluation strategies for functional logic programming (Q2456576) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- E-generalization using grammars (Q2457667) (← links)
- Compositional synthesis of maximally permissive supervisors using supervision equivalence (Q2465421) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- Essential unifiers (Q2494722) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- Ensuring termination by typability (Q2500473) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- More efficient left-to-right matching for overlapping pattern (Q2569399) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Structures for abstract rewriting (Q2642463) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Nominal syntax with atom substitutions (Q2662669) (← links)
- Unification of drags and confluence of drag rewriting (Q2683036) (← links)
- Reasoning on Schemas of Formulas: An Automata-Based Approach (Q2799178) (← links)
- Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
- Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
- Evaluation strategies for functional logic programming (Q2841220) (← links)
- Declarative debugging of functional logic programs (Q2841221) (← links)
- Compact normalisation trace via lazy rewriting (Q2841224) (← links)
- A survey of rewriting strategies in program transformation systems (Q2841225) (← links)
- Induction for termination with local strategies (Q2841240) (← links)
- Knuth-Bendix completion for non-symmetric transitive relations (Q2841250) (← links)
- Timed term rewrite systems (Q2841289) (← links)
- Defining actions in concurrent declarative programming (Q2841291) (← links)
- An account of implementing applicative term rewriting (Q2866805) (← links)
