Pages that link to "Item:Q5308437"
From MaRDI portal
The following pages link to Foundations of Software Science and Computation Structures (Q5308437):
Displaying 9 items.
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)