Proving Positive Almost Sure Termination Under Strategies

DOI10.1007/11805618_27MaRDI QIDQ3527308zbMATH OpenOpenAlexFDO

Authors Florent Garnier, Olivier Bournez

Publication date 25 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11805618_27

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Term Rewriting and Applications
• On probabilistic term rewriting
• New approaches for almost-sure termination of probabilistic programs
• Termination of rewriting under strategies
• On Lexicographic Proof Rules for Probabilistic Termination

Cited in

(8)

• On probabilistic term rewriting
• Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
• Inferring expected runtimes of probabilistic integer programs using expected sizes
• Probabilistic rewriting: normalization, termination, and unique normal forms
• Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
• Term Rewriting and Applications
• A distribution semantics for probabilistic term rewriting
• A rewriting theory for quantum -calculus

Describes a project that uses

Uses Software

• APMC
• PRISM

This page was built for publication: Proving Positive Almost Sure Termination Under Strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527308)