Runtime verification for biochemical programs

Andrei, O. and Kirchner, H. (2013) Runtime verification for biochemical programs. Electronic Notes in Theoretical Computer Science, 297, pp. 27-46. (doi:10.1016/j.entcs.2013.12.003)

[img]
Preview
Text
93294.pdf - Published Version

563kB

Abstract

The biochemical paradigm is well-suited for modelling autonomous systems and new programming languages are emerging from this approach. However, in order to validate such programs, we need to define precisely their semantics and to provide verification techniques. In this paper, we consider a higher-order biochemical calculus that models the structure of system states and its dynamics thanks to rewriting abstractions, namely rules and strategies. We extend this calculus with a runtime verification technique in order to perform automatic discovery of property satisfaction failure. The property specification language is a subclass of LTL safety and liveness properties.

Item Type:Articles (Other)
Keywords:Biochemical calculus; Rewriting strategies; Autonomous systems; Runtime verification
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Andrei, Dr Oana
Authors: Andrei, O., and Kirchner, H.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Electronic Notes in Theoretical Computer Science
Publisher:Elsevier B.V.
ISSN:1571-0661
ISSN (Online):1571-0661
Copyright Holders:Copyright © 2013 Elsevier B.V.
First Published:First published in Electronic Notes in Theoretical Computer Science 297:27-46
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

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