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.
Type de document :
Communication dans un congrès
2nd International Conference : Sciences of Electronic, Technologies of Information and Telecommunications - SETIT 2004, Mar 2004, Sousse, Tunisie, 6 p, 2004
Liste complète des métadonnées

https://hal.inria.fr/inria-00100204
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:15:29
Dernière modification le : jeudi 11 janvier 2018 - 06:20:08

Identifiants

  • HAL Id : inria-00100204, version 1

Collections

Citation

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, 2004. 〈inria-00100204〉

Partager

Métriques

Consultations de la notice

80