An automatic abstraction technique for verifying featured, parameterised systems

Calder, M. and Miller, A. (2008) An automatic abstraction technique for verifying featured, parameterised systems. Theoretical Computer Science, 404(3), pp. 235-255. (doi: 10.1016/j.tcs.2008.03.034)

40516.pdf - Submitted Version



A general technique combining model checking and abstraction is presented that allows property based analysis of systems consisting of an arbitrary number of featured components. We show how parameterised systems can be specified in a guarded command form with constraints placed on variables which occur in guards. We prove that results that hold for a small number of components can be shown to scale up. We then show how featured systems can be specified in a similar way, by relaxing constraints on guards. The main result is a generalisation theorem for featured systems which we apply to two well known examples.

Item Type:Articles
Additional Information:NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, 404, 3, 2008.
Glasgow Author(s) Enlighten ID:Miller, Professor Alice and Calder, Professor Muffy
Authors: Calder, M., and Miller, A.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Theoretical Computer Science
Copyright Holders:Copyright © 2008 Elsevier B.V.
First Published:First published in Theoretical Computer Science 404(3):235-255
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

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