Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Verification of Concurrent Programs: Temporal Proof Principles
Logic of Programs, Workshop
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Logics for probabilistic programming (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Journal of the ACM (JACM) - The MIT Press scientific computation series
Proving liveness for networks of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Reasoning about fair concurrent programs
STOC '86 Proceedings of the eighteenth 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
Reasoning about probabilistic parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of probabilistic verification
Journal of the ACM (JACM)
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Randomized Non-sequential Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Temporal verification of carrier-sense local area network protocols
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Verification of multiprocess probabilistic protocols
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fair termination of communicating processes
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A general result on infinite trees and its applications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Deductive Verification of Probabilistic Real-Time Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Symbolic model checking for probabilistic timed automata
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Liveness Reasoning with Isabelle/HOL
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Parameterized verification by probabilistic abstraction
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
On combining state space reductions with global fairness assumptions
FM'11 Proceedings of the 17th international conference on Formal methods
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
On conspiracies and hyperfairness in distributed computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
Proving liveness property under strengthened compassion requirements
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Proving termination of probabilistic programs using patterns
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Reasoning about almost-certain convergence properties using Event-B
Science of Computer Programming
| Hi-index | 0.00 |
A proof system based on linear temporal logic for the qualitative verification of concurrent probabilistic programs is proposed. The concept of extreme fairness is introduced as an approximation to the notion of probabilistic executions. The proof system proposed is shown to be relatively complete with respect to validity over all extremely fair computations. The proof methodology is demonstrated by proving correctness of a new probabilistic algorithm for solving the mutual exclusion problem ([CLP]).