Impartiality, justice and fairness: The ethics of concurrent termination

D. Lehmann, A. Pnueli, J. Stavi

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

195 Scopus citations

Abstract

The method of well founded structures for proving termination of programs is extended to concurrent programs. The more complicated case is when a program terminates only for fair executions. Different versions of fairness are introduced: Impartiality, Fairness and Justice, and Methods for proving their termination are presented.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 8th Colloquium
EditorsShimon Even, Oded Kariv
PublisherSpringer Verlag
Pages264-277
Number of pages14
ISBN (Print)9783540108436
DOIs
StatePublished - 1981
Event8th International Colloquium on Automata, Languages and Programming, ICALP 1981 - Acre, Israel
Duration: 13 Jul 198117 Jul 1981

Publication series

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

Conference

Conference8th International Colloquium on Automata, Languages and Programming, ICALP 1981
Country/TerritoryIsrael
CityAcre
Period13/07/8117/07/81

Bibliographical note

Publisher Copyright:
© 1981, Springer-Verlag.

Fingerprint

Dive into the research topics of 'Impartiality, justice and fairness: The ethics of concurrent termination'. Together they form a unique fingerprint.

Cite this