Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Formal verification of unreliable failure detectors in partially synchronous systems

Date

Authors

Atif, Muhammad

Mousavi, Mohammad Reza

Osaiweran, A

Publisher

Association for Computing Machinery (ACM)

Abstract

We formally verify four algorithms proposed in [M. Larrea, S. Arévalo and A. Fernández, Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems, 1999]. Each algorithm is specified as a network of timed automata an

Keywords

Keywords: Buffer overflows; Failure Detectors; Formal verifications; Large buffer; Model checking tools; Synchronous system; Timed Automata; Unreliable failure detector; Model checking; Parallel algorithms; Algorithms distributed algorithms; failure detectors; formal verification; model checking

URI

http://hdl.handle.net/1885/72439

Collections

ANU Research Publications

Source

Proceedings of the ACM Symposium on Applied Computing

Type

Conference paper

DOI

10.1145/2245276.2245369

Restricted until

2037-12-31

Downloads

File

Description

01_Atif_Formal_verification_of_2012.pdf (108.75 KB)

abcd