Abstract
The use of the temporal logic formalism for program reasoning is reviewed. Several aspects of responsiveness and fairness are analyzed, leading to the need for an additional temporal operator: the 'until' operator-U. Some general questions involving the 'until' operator are then discussed. It is shown that with the addition of this operator the temporal language becomes expressively complete. Then, two deductive systems DX and DUX are proved to be complete for the languages without and with the new operator respectively.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980 |
| Publisher | Association for Computing Machinery |
| Pages | 163-173 |
| Number of pages | 11 |
| ISBN (Print) | 0897910117 |
| DOIs | |
| State | Published - 28 Jan 1980 |
| Event | 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980 - Las Vegas, United States Duration: 28 Jan 1980 → 30 Jan 1980 |
Publication series
| Name | Conference Record of the Annual ACM Symposium on Principles of Programming Languages |
|---|---|
| ISSN (Print) | 0730-8566 |
Conference
| Conference | 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980 |
|---|---|
| Country/Territory | United States |
| City | Las Vegas |
| Period | 28/01/80 → 30/01/80 |
Bibliographical note
Publisher Copyright:© 1980 ACM.