E-Cyclist: Implementation of an Efficient Validation of FOL ID Cyclic Induction Reasoning - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

E-Cyclist: Implementation of an Efficient Validation of FOL ID Cyclic Induction Reasoning

Résumé

Checking the soundness of cyclic induction reasoning for first-order logic with inductive definitions (FOLID) is decidable but the standard checking method is based on an exponential complement operation for Büchi automata. Recently, we introduced a polynomial checking method whose most expensive steps recall the comparisons done with multiset path orderings. We describe the implementation of our method in the Cyclist prover. Referred to as E-Cyclist, it successfully checked all the proofs included in the original distribution of Cyclist. Heuristics have been devised to automatically define, from the analysis of the proof derivations, the trace-based ordering measures that guarantee the soundness property.
Fichier principal
Vignette du fichier
SCSS2021202108020126.pdf (867.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02464242 , version 1 (03-02-2020)
hal-02464242 , version 2 (07-06-2021)
hal-02464242 , version 3 (01-08-2021)
hal-02464242 , version 4 (31-08-2021)

Identifiants

  • HAL Id : hal-02464242 , version 3

Citer

Sorin Stratulat. E-Cyclist: Implementation of an Efficient Validation of FOL ID Cyclic Induction Reasoning. SYMBOLIC COMPUTATION FOR SOFTWARE SCIENCE, Sep 2021, Linz, Austria. ⟨hal-02464242v3⟩
121 Consultations
80 Téléchargements

Partager

Gmail Facebook X LinkedIn More