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
Verifying safety properties of a class of infinite-state distributed algorithms
Uppsala University.
Uppsala University.
1995 (English)In: COMPUTER AIDED VERIFICATION, ISSN 0302-9743, Vol. 939, 42-53 p.Article in journal (Other scientific) Published
Abstract [en]

We consider the problem of verifying correctness properties of a class of programs with states that are sets of ground atoms. Such programs can model specifications of telephone services, in which we are particularly interested. For this class of systems,

Place, publisher, year, edition, pages
SPRINGER-VERLAG BERLIN , 1995. Vol. 939, 42-53 p.
Keyword [en]
LOGIC
Identifiers
URN: urn:nbn:se:uu:diva-27248OAI: oai:DiVA.org:uu-27248DiVA: diva2:55142
Note
Addresses: Jonsson B, UNIV UPPSALA, DEPT COMP SYST, POB 325, S-75105 UPPSALA, SWEDEN.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: 329 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