Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs

We have intensively used proof scores to theorem prove that equational theory specifications of observational transition systems (OTSs) have properties. The paper describes a way to theorem prove that rewrite theory specifications of OTSs have invariant properties by proof score writing. The method...

Full description

Saved in:
Bibliographic Details
Published inSpecification, Algebra, and Software Vol. 8373; pp. 630 - 656
Main Authors Ogata, Kazuhiro, Futatsugi, Kokichi
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2014
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
(bounded) model checking
proof score
rewrite theory specification
search
theorem proving
Online AccessGet full text

Cover

More Information
Summary:We have intensively used proof scores to theorem prove that equational theory specifications of observational transition systems (OTSs) have properties. The paper describes a way to theorem prove that rewrite theory specifications of OTSs have invariant properties by proof score writing. The method may achieve a more faithfully seamless integration of model checking and theorem proving because no translation is needed for system specifications. The Lowe’s modification (NSLPK) of NSPK authentication protocol is used to describe the method.
Bibliography:This work was partially supported by Kakenhi 23220002.
ISBN:3642546234
9783642546235
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-54624-2_31