Proving probabilistic correctness statements: The case of Rabin's algorithm for mutual exclusion

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1992, Pages 263-274

  Saias, Isaac ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBABILISTIC LOGICS; RANDOM PROCESSES; SCHEDULING; THEOREM PROVING;

CORRECTNESS STATEMENTS; LOCKOUT; MUTUAL EXCLUSION; RABIN'S ALGORITHMS; RANDOMIZED DISTRIBUTED ALGORITHMS;

MULTIPROGRAMMING;

EID: 0026982462     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)