From model checking to a temporal proof for partial models
Paper i proceeding, 2017

Three-valued model checking has been proposed to support verification when some portions of the model are unspecified. Given a formal property, the model checker returns true if the property is satisfied, false and a violating behavior if it is not, maybe and a possibly violating behavior if it is possibly satisfied, i.e., its satisfaction may depend on how the unspecified parts are refined. Model checking, however, does not explain the reasons why a property holds, or possibly holds. Theorem proving can instead do it by providing a formal proof that explains why a property holds, or possibly holds in a system. Integration of theorem proving with model checking has only been studied for classical two-valued logic – hence, for fully specified models. This paper proposes a unified approach that enriches three-valued model checking with theorem proving to generate proofs which explain why true and maybe results are returned.

Författare

Anna Bernasconi

Politecnico di Milano

Claudio Menghi

Göteborgs universitet

Chalmers, Data- och informationsteknik, Software Engineering

P. Spoletini

Kennesaw State University

Lenore D. Zuck

University of Illinois

Carlo Ghezzi

Politecnico di Milano

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 10469 LNCS 54-69

15th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2017
Trento, Italy,

Ämneskategorier

Inbäddad systemteknik

Datavetenskap (datalogi)

Datorsystem

DOI

10.1007/978-3-319-66197-1_4

Mer information

Senast uppdaterat

2019-12-02