The following pages link to Ralf Treinen (Q437025):
Displayed 32 items.
- Item:Q437025 (redirect page) (← links)
- Reducing equational theories for the decision of static equivalence (Q437026) (← links)
- Automata for unordered trees (Q515668) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- How to win a game with features (Q1271569) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- On rewrite constraints and context unification (Q1607044) (← links)
- A formally verified interpreter for a shell-like programming language (Q1630019) (← links)
- Deciding the first-order theory of an algebra of feature trees with updates (Q1799104) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- (Q2762628) (← links)
- (Q2762872) (← links)
- Logics for Unordered Trees with Data Constraints on Siblings (Q2799171) (← links)
- (Q3358706) (← links)
- Proving Group Protocols Secure Against Eavesdroppers (Q3541693) (← links)
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or (Q3591419) (← links)
- Reducing Equational Theories for the Decision of Static Equivalence (Q3656844) (← links)
- Records for logic programming (Q4290618) (← links)
- (Q4508312) (← links)
- (Q4954438) (← links)
- (Q4995369) (← links)
- Equational and membership constraints for infinite trees (Q5055789) (← links)
- The first-order theory of one-step rewriting is undecidable (Q5055866) (← links)
- First order data types and first order logic (Q5096240) (← links)
- How to win a game with features (Q5096316) (← links)
- The first-order theory of subtyping constraints (Q5178907) (← links)
- Verification: Theory and Practice (Q5305643) (← links)
- Term Rewriting and Applications (Q5703858) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)