HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Validating Back-links of FOLID Cyclic Pre-proofs

Sorin Stratulat 1, 2
1 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
2 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 : Cyclic pre-proofs can be represented as sets of finite tree derivations with back-links. In the frame of the first-order logic with inductive definitions (FOLID), the nodes of the tree derivations are labelled by sequents and the back-links connect particular terminal nodes, referred to as buds, to other nodes labelled by a same sequent. However, only some back-links can constitute sound pre-proofs. Previously , it has been shown that special ordering and derivability conditions, defined along the minimal cycles of the digraph representing a particular normal form of the cyclic pre-proof, are sufficient for validating the back-links. In that approach, a same constraint could be checked several times when processing different minimal cycles, hence one may require additional recording mechanisms to avoid redundant computation in order to downgrade the time complexity to polynomial. We present a new approach that does not need to process minimal cycles. It based on a normal form that allows to define the validation conditions by taking into account only the root-bud paths from the non-singleton strongly connected components of its digraph.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

Contributor : Sorin Stratulat Connect in order to contact the contributor
Submitted on : Friday, September 28, 2018 - 5:40:01 PM
Last modification on : Wednesday, November 3, 2021 - 7:56:59 AM
Long-term archiving on: : Monday, December 31, 2018 - 10:27:37 AM


Files produced by the author(s)


  • HAL Id : hal-01883826, version 1
  • ARXIV : 1810.07374



Sorin Stratulat. Validating Back-links of FOLID Cyclic Pre-proofs. CL&C'18 - Seventh International Workshop on Classical Logic and Computation, Jul 2018, Oxford, United Kingdom. pp.39--53. ⟨hal-01883826⟩



Record views


Files downloads