Algorithmic analysis of programs with well quasi-ordered domains
2000 (English)In: INFORMATION AND COMPUTATION, ISSN 0890-5401, Vol. 160, no 1-2, 109-127 p.Article in journal (Refereed) Published
Over the past few years increasing research effort has been directed towards the automatic verification of infinite-state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achiev
Place, publisher, year, edition, pages
2000. Vol. 160, no 1-2, 109-127 p.
INFINITE-STATE; VERIFICATION; WELL QUASI-ORDERING
IdentifiersURN: urn:nbn:se:uu:diva-36476OAI: oai:DiVA.org:uu-36476DiVA: diva2:64375
Addresses: Abdulla PA, Univ Uppsala, Dept Comp Syst, POB 325, S-75105 Uppsala, Sweden. Univ Uppsala, Dept Comp Syst, S-75105 Uppsala, Sweden. Univ Latvia, Inst Math & Comp Sci, Riga, Latvia. Natl Taiwan Univ, Dept Informat Management, Taipei 10764, Taiwan2007-02-192007-02-192011-01-14