Automatic verification of any number of concurrent, communicating processes

Calder, M. and Miller, A. (2002) Automatic verification of any number of concurrent, communicating processes. In: 17th IEEE International Conference on Automated Software Engineering, Edinburgh, 23-27 September, pp. 227-230. ISBN 0769517366 (doi:10.1109/ASE.2002.1115017)

[img]
Preview
Text
automatic.calder.pdf

280kB

Publisher's URL: http://dx.doi.org/10.1109/ASE.2002.1115017

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.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Calder, Professor Muffy and Miller, Professor Alice
Authors: Calder, M., and Miller, A.
Subjects:Q Science > QA Mathematics > QA76 Computer software
College/School:College of Science and Engineering > School of Computing Science
Publisher:Institute of Electrical and Electronics Engineers
ISSN:1527-1366
ISBN:0769517366
Copyright Holders:Copyright © 2002 Institute of Electrical and Electronics Engineers
First Published:First published in Proceedings of the 17th IEEE International Conference on Automated Software Engineering: 227-235
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record