From Runtime Verification to Evolvable Systems

Barringer, Howard and Gabbay, Dov and Rydeheard, David (2007) From Runtime Verification to Evolvable Systems. Lecture Notes in Computer Science, 4839. pp. 97-110. ISSN 0302-9743

PDF lncs4839_1.pdf Download (509kB)

Abstract

We consider evolvable computational systems built as hierarchies of evolvable components, where an evolvable component is an encapsulation of a supervisory component and its supervisee. Here, we extend our prior work on a revision-based logical modelling framework for such systems to incorporate programs within each component. We describe mechanisms for combining programs, possibly in different languages, from separate components and outline an operational semantics for programmed evolvable systems. We show how supervisory components extend run-time verifiers/monitors with capabilities for diagnosis and change. We illustrate the logical modelling using an example of an automated bank teller machine.

Item Type:	Article
Uncontrolled Keywords:	CICADA
Subjects:	MSC 2010, the AMS's Mathematics Subject Classification > 68 Computer science
Depositing User:	Dr Margarita Korovina
Date Deposited:	13 Jun 2010
Last Modified:	20 Oct 2017 14:12
URI:	https://eprints.maths.manchester.ac.uk/id/eprint/1477

Actions (login required)

View Item