Induction for Positive Almost Sure Termination

Isabelle Gnaedig 1
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : In this paper, we propose an inductive approach to prove positive almost sure termination of probabilistic rewriting under the innermost strategy. We extend to the probabilistic case a technique we proposed for termination of usual rewriting under strategies. The induction principle consists in assuming that terms smaller than the starting terms for an induction ordering are positively almost surely terminating. The proof is developed in generating proof trees, modelizing rewriting trees, in alternatively applying abstraction steps, expressing the application of the induction hypothesis, and narrowing steps, simulating the possible rewriting steps after abstraction. This technique can be fully automatized, in particular for rewrite systems on constants, very useful to modelize probabilistic protocols.
Type de document :
Communication dans un congrès
9th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming - PPDP 2007, Jul 2007, Wroclaw, Poland. ACM, pp.167-177, 2007
Liste complète des métadonnées

https://hal.inria.fr/inria-00182435
Contributeur : Isabelle Gnaedig <>
Soumis le : jeudi 25 octobre 2007 - 23:48:57
Dernière modification le : jeudi 11 janvier 2018 - 06:21:25

Identifiants

  • HAL Id : inria-00182435, version 1

Collections

Citation

Isabelle Gnaedig. Induction for Positive Almost Sure Termination. 9th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming - PPDP 2007, Jul 2007, Wroclaw, Poland. ACM, pp.167-177, 2007. 〈inria-00182435〉

Partager

Métriques

Consultations de la notice

191