Induction for Positive Almost Sure Termination - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Induction for Positive Almost Sure Termination

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.
Fichier principal
Vignette du fichier
ppdp11b-gnaedig-preprint.pdf (414.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00182435 , version 1 (10-10-2018)

Identifiers

  • HAL Id : inria-00182435 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More