Automatic verification of Finite Variant Property beyond convergent equational theories - INRIA - Institut National de Recherche en Informatique et en Automatique
Conference Papers Year : 2025

Automatic verification of Finite Variant Property beyond convergent equational theories

Abstract

Computer-aided analysis of security protocols heavily relies on equational theories to model cryptographic primitives. Most automated verifiers for security protocols focus on equational theories that satisfy the Finite Variant Property (FVP), for which solving unification is decidable. However, they either require to prove FVP by hand or at least to provide a representation as an E-convergent rewrite system, usually E being at most the equational theory for an associative and commutative function symbol (AC). The verifier ProVerif is probably the only exception amongst these tools as it automatically proves FVP without requiring a representation, but on a small class of equational theories. In this work, we propose a novel semidecision procedure for proving FVP, without the need for a specific representation, and for a class of theories that goes beyond the ones expressed by an E-convergent rewrite system. We implemented a prototype and successfully applied it on several theories from the literature.

Fichier principal
Vignette du fichier
main.pdf (627.52 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04748770 , version 1 (22-10-2024)

Identifiers

Cite

Vincent Cheval, Caroline Fontaine. Automatic verification of Finite Variant Property beyond convergent equational theories. 2025 IEEE 38th Computer Security Foundations Symposium (CSF 2025), IEEE, Jul 2025, Santa Cruz, United States. ⟨hal-04748770⟩
0 View
0 Download

Altmetric

Share

More