DocumentCode
2599504
Title
Automatic verification of any number of concurrent, communicating processes
Author
Calder, Muffy ; Miller, Alice
Author_Institution
Dept. of Comput. Sci., Glasgow Univ., UK
fYear
2002
fDate
2002
Firstpage
227
Lastpage
230
Abstract
The automatic verification of concurrent systems by model-checking is limited due to the inability to generalise results to systems consisting of any number of processes. We use abstraction to prove general results, by model-checking, about feature interaction analysis of a telecommunications service involving any number of processes. The key idea is to model-check a system of constant number (m) of concurrent processes, in parallel with an "abstract" process which represents the product of any number of other processes. The system, for any specified set of selected features, is generated automatically using Perl scripts.
Keywords
automatic programming; concurrency theory; program diagnostics; program verification; Perl scripts; automatic verification; concurrent systems; feature interaction analysis; model-checking; Concrete; Gold; Logic; Peer to peer computing; Telecommunication computing; Telecommunication services;
fLanguage
English
Publisher
ieee
Conference_Titel
Automated Software Engineering, 2002. Proceedings. ASE 2002. 17th IEEE International Conference on
ISSN
1938-4300
Print_ISBN
0-7695-1736-6
Type
conf
DOI
10.1109/ASE.2002.1115017
Filename
1115017
Link To Document