Résumé Les preuves par récurrence sont parfaitement adaptées au raisonnement sur des
structures de données non-bornées, comme par exemple les entiers et les listes, ou, de …

Noetherian induction is an effective formal proof method to finitely capture the cyclic
reasoning encountered during the traditional schemata-based induction proofs, ie, when the …

In this thesis we propose a design for a ubiquitous and interoperable device based on the
smart card architecture to meet the challenges of privacy, trust, and security for traditional …

This first edition of the Coq workshop aimed at gathering the community of Coq users and
developers around refereed contributed talks (to be later on re-submitted for publication to …

項書き換え系は関数型言語のモデルとして考えられた等式論理に基づく計算モデルであり,
ソフトウェア検証や定理自動証明の分野の基礎として重要である. プログラムの性質は項書き換え …