uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
DEDUCING FAIRNESS PROPERTIES IN UNITY LOGIC - A NEW COMPLETENESS RESULT
Uppsala University.
Uppsala University.
1995 (English)In: ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, ISSN 0164-0925, Vol. 17, no 1, 16-27 p.Article in journal (Other scientific) Published
Abstract [en]

We explore the use of UNITY logic in specifying and verifying fairness properties of UNITY and UNITY-like programs whose semantics can be modeled by weakly fair transition systems. For such programs, strong fairness properties in the form of ''if p holds

Place, publisher, year, edition, pages
ASSOC COMPUTING MACHINERY , 1995. Vol. 17, no 1, 16-27 p.
Keyword [en]
VERIFICATION; COMPLETENESS; FAIRNESS PROPERTIES; TEMPORAL LOGIC; UNITY
Identifiers
URN: urn:nbn:se:uu:diva-27289OAI: oai:DiVA.org:uu-27289DiVA: diva2:55183
Note
Addresses: TSAY YK, UNIV UPPSALA, DEPT COMP SYST, POB 325, S-75105 UPPSALA, SWEDEN. UNIV CALIF LOS ANGELES, DEPT COMP SCI, LOS ANGELES, CA 90024.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-16

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 368 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf