Operational semantics and program verification using many-sorted hybrid modal logic

05/13/2019
by   Ioana Leustean, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2021

From Matching Logic To Parallel Imperative Language Verification

Program verification is to develop the program's proof system, and to pr...
research
06/20/2009

Hybrid Rules with Well-Founded Semantics

A general framework is proposed for integration of rules and external fi...
research
03/05/2021

Modal Reasoning = Metric Reasoning, via Lawvere

Graded modal types systems and coeffects are becoming a standard formali...
research
07/02/2020

Many-Sorted Hybrid Modal Languages

We continue our investigation into hybrid polyadic multi-sorted logic wi...
research
05/17/2022

Local Completeness Logic on Kleene Algebra with Tests

Local Completeness Logic (LCL) has been put forward as a program logic f...
research
07/23/2020

Dataflow Analysis With Prophecy and History Variables

Leveraging concepts from state machine refinement proofs, we use prophec...
research
08/27/2018

Reversing Parallel Programs with Blocks and Procedures

We show how to reverse a while language extended with blocks, local vari...

Please sign up or login with your details

Forgot password? Click here to reset