Program Models for Compositional Verification
2008 (English)In: FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, Berlin: Springer , 2008, 147-166 p.Conference paper (Refereed)
Compositional verification is crucial for guaranteeing the security of systems where new components can be loaded dynamically. In earlier work, we developed a compositional verification principle for control-flow properties of sequential control flow graphs with procedures. This paper discusses how the principle can be generalised to richer program models. We first present a generic program model, of which the original program model is an instantiation, and explicate under what conditions the compositional verification principle applies. We then present two other example instantiations of the generic model: with exceptional and with multi-threaded control flow, and show that for these particular instantiations the conditions hold. The program models we present are specifically tailored to our compositional verification principle, however, they are sufficiently intuitive and standard to be useful on their own. Tool support and practical application of the method are discussed.
Place, publisher, year, edition, pages
Berlin: Springer , 2008. 147-166 p.
, Lecture notes in computer science, ISSN 0302-9743 ; 5256
IdentifiersURN: urn:nbn:se:kth:diva-13466ISI: 000261798200011ScopusID: 2-s2.0-57049119160OAI: oai:DiVA.org:kth-13466DiVA: diva2:325439
10th International Conference on Formal Engineering Methods Kitakyushu-City, JAPAN, OCT 27-31, 2008
QC 201006182010-06-182010-06-182012-03-19Bibliographically approved