Randomized algorithms
Term rewriting and all that
Some characteristics of strong innermost normalization
Theoretical Computer Science
Concurrent constraint programming: towards probabilistic abstract interpretation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Introducation to stochastic Petri nets
Lectures on formal methods and performance analysis
Stochastic activity networks: formal definitions and concepts
Lectures on formal methods and performance analysis
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Probabilistic Rewrite Strategies. Applications to ELAN
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
On Proving Termination by Innermost Termination
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
An Operational Semantics for Probabilistic Concurrent Constraint Programming
ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
Formal verification of probabilistic systems
Formal verification of probabilistic systems
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A pattern matching compiler for multiple target languages
CC'03 Proceedings of the 12th international conference on Compiler construction
Proving positive almost-sure termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.