Operational semantics and program verification using many-sorted hybrid modal logic
We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal logic, for which we prove completeness results. We believe tha...
Saved in:
Main Authors | , , |
---|---|
Format | Journal Article |
Language | English |
Published |
13.05.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We propose a general framework to allow: (a) specifying the operational
semantics of a programming language; and (b) stating and proving properties
about program correctness. Our framework is based on a many-sorted system of
hybrid modal logic, for which we prove completeness results. We believe that
our approach to program verification improves over the existing approaches
within modal logic as (1) it is based on operational semantics which allows for
a more natural description of the execution than Hoare's style weakest
precondition used by dynamic logic; (2) being multi-sorted, it allows for a
clearer encoding of semantics, with a smaller representational distance to its
intended meaning. |
---|---|
DOI: | 10.48550/arxiv.1905.05036 |