On the Hardness of Almost–Sure Termination
- 11 August 2015
- book chapter
- Published by Springer Nature
- p. 307-318
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Probabilistic TerminationACM SIGPLAN Notices, 2015
- Operational versus weakest pre-expectation semantics for the probabilistic guarded command languagePerformance Evaluation, 2014
- Probabilistic Relational Reasoning for Differential PrivacyACM Transactions on Programming Languages and Systems, 2013
- Probabilistic Termination of CHRiSM ProgramsLecture Notes in Computer Science, 2012
- Proving Termination of Probabilistic Programs Using Patterns2012
- Parameterized Verification by Probabilistic Abstraction2003
- Proof rules for probabilistic loopsElectronic Workshops in Computing, 1996
- Probabilistic termination versus fair terminationTheoretical Computer Science, 1989
- Semantics of probabilistic programsJournal of Computer and System Sciences, 1981
- Recursive predicates and quantifiersTransactions of the American Mathematical Society, 1943