DeepAI AI Chat

A Framework for Modelling, Verification and Transformation of Concurrent Imperative Programs

07/05/2020

∙

by Maksym Bortin, et al.

∙

∙

The paper gives a comprehensive presentation of a framework, embedded into the simply typed higher-order logic, and aimed at providing a sound assistance in formal reasoning about models of imperative programs with interleaved computations. As a case study, a model of the Peterson's mutual exclusion algorithm will be scrutinised in the course of the paper illustrating applicability of the framework.

page 1

page 2

page 3

page 4

∙ 11/28/2020

A Deductive Verification Framework For Higher Order Programs

In this report, we present the preliminary work developed for our resear...

0 Tiago Lopes Soares, et al. ∙

∙ 08/13/2018

Predicate Specialization for Definitional Higher-order Logic Programs

Higher-order logic programming is an interesting extension of traditiona...

0 Antonis Troumpoukis, et al. ∙

∙ 07/22/2022

CoqQ: Foundational Verification of Quantum Programs

CoqQ is a framework for reasoning about quantum programs in the Coq proo...

0 Li Zhou, et al. ∙

∙ 10/07/2008

The meaning of concurrent programs

The semantics of assignment and mutual exclusion in concurrent and multi...

0 Victor Yodaiken, et al. ∙

∙ 06/16/2020

A Hybrid Approach to Formal Verification of Higher-Order Masked Arithmetic Programs

Side-channel attacks, which are capable of breaking secrecy via side-cha...

0 Pengfei Gao, et al. ∙

∙ 07/15/2017

The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs

In (Bezem 1999; Bezem 2001), M. Bezem defined an extensional semantics f...

0 Panos Rondogiannis, et al. ∙

∙ 08/07/2020

Generating Distributed Programs from Event-B Models

Distributed algorithms offer challenges in checking that they meet their...

0 Horatiu Cirstea, et al. ∙