Verifying safety properties of a class of infinite-state distributed algorithms
1995 (English)In: COMPUTER AIDED VERIFICATION, ISSN 0302-9743, Vol. 939, 42-53 p.Article in journal (Other scientific) Published
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.
IdentifiersURN: urn:nbn:se:uu:diva-27248OAI: oai:DiVA.org:uu-27248DiVA: diva2:55142
Addresses: Jonsson B, UNIV UPPSALA, DEPT COMP SYST, POB 325, S-75105 UPPSALA, SWEDEN.2008-10-172008-10-172011-01-16