Self-stabilization preserving compiler

Shlomi Dolev*, Yinnon Haviv, Mooly Sagiv

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Self-Stabilization is an elegant approach for designing fault tolerant systems. A system is considered self-stabilizing if, starting in any state, it converges to the desired behavior. Self-stabilizing algorithms were designed for solving fundamental distributed tasks, such as leader election, token circulation and communication network protocols. The algorithms were expressed using guarded commands or pseudo-code. The realization of these algorithms requires the existence of (self-stabilizing) infrastructure for their execution such as a self-stabilizing microprocessor and a self-stabilizing operating system. Moreover, the high-level description of the algorithms needs to be converted into machine language of the microprocessor. In this work, we present a design for a self-stabilization preserving compiler designed for programs written in a language similar to the abstract state machine (ASM). The compiler preserves the stabilization property of the high level program.

Original languageEnglish
Title of host publicationSelf-Stabilizing Systems - 7th International Symposium, SSS 2005, Proceedings
Number of pages15
StatePublished - 2005
Event7th International Symposium on Self-Stabilizing Systems, SSS 2005 - Barcelona, Spain
Duration: 26 Oct 200527 Oct 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3764 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th International Symposium on Self-Stabilizing Systems, SSS 2005


Dive into the research topics of 'Self-stabilization preserving compiler'. Together they form a unique fingerprint.

Cite this