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 language | English |
---|---|
Title of host publication | Automata, Languages and Programming - 8th Colloquium |
Editors | Shimon Even, Oded Kariv |
Publisher | Springer Verlag |
Pages | 264-277 |
Number of pages | 14 |
ISBN (Print) | 9783540108436 |
DOIs | |
State | Published - 1981 |
Event | 8th International Colloquium on Automata, Languages and Programming, ICALP 1981 - Acre, Israel Duration: 13 Jul 1981 → 17 Jul 1981 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 115 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 8th International Colloquium on Automata, Languages and Programming, ICALP 1981 |
---|---|
Country/Territory | Israel |
City | Acre |
Period | 13/07/81 → 17/07/81 |
Bibliographical note
Publisher Copyright:© 1981, Springer-Verlag.