Process algebra for event-driven runtime verification: a case study of wireless network management

Calder, M. and Sevegnani, M. (2012) Process algebra for event-driven runtime verification: a case study of wireless network management. Lecture Notes in Computer Science, 7321(2012), pp. 21-23. (doi: 10.1007/978-3-642-30729-4)

Abstract

Runtime verification is analysis based on information extracted from a running system. Traditionally this involves reasoning about system states, for example using trace predicates. We have been investigating runtime verification for event-driven systems and in that context we propose a higher level of abstraction can be useful, namely reasoning at the level of user-perceived system events. And when considering events, then the natural formalism for verification is a form of process algebra.

• Item Type: Articles
• Additional Information: The original publication is available at www.springerlink.com
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Sevegnani, Dr Michele and Calder, Professor Muffy
• Authors: Calder, M., and Sevegnani, M.
• College/School: College of Science and Engineering > School of Computing Science
• Journal Name: Lecture Notes in Computer Science
• Publisher: Springer-Verlag
• ISSN: 0302-9743
• Copyright Holders: Copyright © 2012 Springer
• First Published: First published in Lecture Notes in Computer Science 7321(2012):21-23
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher

Project Code	Award No	Project Name	Principal Investigator	Funder's Name	Funder Ref	Lead Dept
47810	1	Homework: Shaping future user centred domestic infrastructures	Joseph Sventek	Engineering & Physical Sciences Research Council (EPSRC)	EP/F064225/1	School of Computing Science