Verification of probabilistic programs
SIAM Journal on Computing
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination of probabilistic concurrent programs: (extended abstract)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Distributed algorithms for synchronizing interprocess communication within real time
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Reasoning about probabilistic algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Reasoning about probabilistic parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of probabilistic verification
Journal of the ACM (JACM)
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Formal Approach to Probabilistic Termination
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Randomized Non-sequential Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
Theoretical Computer Science
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Abstraction and refinement in probabilistic systems
ACM SIGMETRICS Performance Evaluation Review
An elementary proof that Herman's ring is Θ(N2)
Information Processing Letters
State explosion in almost-sure probabilistic reachability
Information Processing Letters
Symbolic model checking for probabilistic timed automata
Information and Computation
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Theoretical Computer Science
An Algebraic Framework for Defining Random Concurrent Behaviours
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Quantitative Analysis With the Probabilistic Model Checker PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
An elementary proof that Herman's Ring is Θ(N2)
Information Processing Letters
Model checking lossy channels systems is probably decidable
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Probabilistic termination in B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Termination of rewriting with right-flat rules
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A bounded statistical approach for model checking of unbounded until properties
Proceedings of the IEEE/ACM international conference on Automated software engineering
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Journal of the ACM (JACM)
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Proof rules for probabilistic loops
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
An Algebraic Framework for Defining Random Concurrent Behaviours
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Reachability and termination analysis of concurrent quantum programs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Quantitative modelling and analysis
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Probabilistic model checking of the PDGF signaling pathway
Transactions on Computational Systems Biology XIV
Reachability probabilities of quantum markov chains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Preface to the special issue on Probabilistic Model Checking
Formal Methods in System Design
| Hi-index | 0.01 |