M.D. Harrison, P. Masci, J.C. Campos and P. Curzon
Automated theorem proving for the systematic analysis of interactive systems
Electronic Communications of the EASST, 69: Formal Methods for Interactive Systems 2011. 2013. (ISSN: 1863-2122)

Abstract

This paper describes the use of an automated theorem prover to analyse properties of interactive behaviour. It offers an alternative to model checking for the analysis of interactive systems. There are situations, for example when demonstrating safety, in which alternative complementary analyses provide assurance to the regulator. The rigour and detail offered by theorem proving makes it possible to explore features of the design of the interactive system, as modelled, beyond those that would be revealed using model checking. Theorem proving can also speed up proof in some circumstances. The paper illustrates how a theory generated as a basis for theorem proving (using PVS) was developed systematically from a MAL model used to model check the same properties. It also shows how the CTL properties used to check the original model can be translated into theorems.

  visit publisher

@article{HarrisonMCC:2013,
 author = {M.D. Harrison and P. Masci and J.C. Campos and P. Curzon},
 title = {Automated theorem proving for the systematic analysis of interactive systems},
 journal = {Electronic Communications of the EASST},
 volume = {69: Formal Methods for Interactive Systems 2011},
 year = {2013},
 url = {http://journal.ub.tu-berlin.de/eceasst/article/view/962/943},
 note = {ISSN: 1863-2122},
 abstract = {This paper describes the use of an automated theorem prover to analyse properties of interactive behaviour. It offers an alternative to model checking for the analysis of interactive systems. There are situations, for example when demonstrating safety, in which alternative complementary analyses provide assurance to the regulator. The rigour and detail offered by theorem proving makes it possible to explore features of the design of the interactive system, as modelled, beyond those that would be revealed using model checking. Theorem proving can also speed up proof in some circumstances. The paper illustrates how a theory generated as a basis for theorem proving (using PVS) was developed systematically from a MAL model used to model check the same properties. It also shows how the CTL properties used to check the original model can be translated into theorems.}
}

Generated by mkBiblio 2.6.16