Skip to Main content Skip to Navigation
Conference papers

Proving Theorems by Folding/Unfolding

Moussa Demba Khaled Bsaïes Francis Alexandre 1
1 DEDALE - Development of specifications
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Proofs techniques can be seen as simplification methods, i.e. formulas are transformed into trivial ones, true. Unfortunately, we are sometimes faced with an unprovable formula because no induction hypothesis can be applied. In this paper, we propose a method that can allows us to apply induction hypothesis.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:15:29 AM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM


  • HAL Id : inria-00100204, version 1



Moussa Demba, Khaled Bsaïes, Francis Alexandre. Proving Theorems by Folding/Unfolding. 2nd International Conference : Sciences of Electronic, Technologies of Information and Telecommunications - SETIT 2004, Mar 2004, Sousse, Tunisie, 6 p. ⟨inria-00100204⟩



Record views