Skip to Main content Skip to Navigation
Conference papers

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

Sorin Stratulat 1 
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Sorin Stratulat Connect in order to contact the contributor
Submitted on : Tuesday, August 31, 2021 - 11:03:58 AM
Last modification on : Sunday, June 26, 2022 - 3:12:43 AM


Files produced by the author(s)


  • HAL Id : hal-02464242, version 4



Sorin Stratulat. E-Cyclist: Implementation of an Efficient Validation of FOL ID Cyclic Induction Reasoning. SCSS 2021 - 9th International Symposium on Symbolic Computation in Software Science, Sep 2021, Linz, Austria. pp.129--135. ⟨hal-02464242v4⟩



Record views


Files downloads