Handbook of theoretical computer science (vol. B)
A new method for undecidability proofs of first order theories
Journal of Symbolic Computation
Complete axiomatizations of some quotient term algebras
Theoretical Computer Science
An attack on a recursive authentication protocol. A cautionary tale
Information Processing Letters
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Unification and Matching Modulo Nilpotence
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Mechanized proofs for a recursive authentication protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
On the complexity of the theories of weak direct products (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A decision procedure for the verification of security protocols with explicit destructors
Proceedings of the 11th ACM conference on Computer and communications security
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
An E-unification algorithm for analyzing protocols that use modular exponentiation
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Hierarchical combination of intruder theories
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
Towards an Automatic Analysis of Web Service Security
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Effectively Checking the Finite Variant Property
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Challenges in the Automated Verification of Security Protocols
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
Proceedings of the 15th ACM conference on Computer and communications security
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Improving Automatic Verification of Security Protocols with XOR
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Associative-commutative deducibility constraints
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Normal proofs in intruder theories
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Maude coherence checker tool for conditional order-sorted rewrite theories
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach
Journal of Automated Reasoning
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Trace equivalence decision: negative tests and non-determinism
Proceedings of the 18th ACM conference on Computer and communications security
Protocol analysis modulo combination of theories: a case study in Maude-NPA
STM'10 Proceedings of the 6th international conference on Security and trust management
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Soundness of removing cancellation identities in protocol analysis under Exclusive-OR
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Automated verification of equivalence properties of cryptographic protocols
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Deducibility constraints, equational theory and electronic money
Rewriting Computation and Proof
Proving more observational equivalences with proverif
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
CADE'13 Proceedings of the 24th international conference on Automated Deduction
The TAMARIN prover for the symbolic analysis of security protocols
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We consider the following problem: Given a term t, a rewrite system $\cal R$, a finite set of equations E′ such that $\cal R$ is E′-convergent, compute finitely many instances of t: t1,...,tn such that, for every substitution σ, there is an index i and a substitution θ such that $t\sigma\mathord\downarrow =_{E'} t_i\theta$ (where $t\sigma\mathord\downarrow$ is the normal form of tσ w.r.t. $\to_{E'\mathord{\setminus}\mathcal R}$). The goal of this paper is to give equivalent (resp. sufficient) conditions for the finite variant property and to systematically investigate this property for equational theories, which are relevant to security protocols verification. For instance, we prove that the finite variant property holds for Abelian Groups, and a theory of modular exponentiation and does not hold for the theory ACUNh (Associativity, Commutativity, Unit, Nilpotence, homomorphism).