By the same authors

From the same journal

From the same journal

Automated verification of reactive and concurrent programs by calculation

Research output: Contribution to journalArticlepeer-review

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

JournalJournal of Logical and Algebraic Methods in Programming
DateSubmitted - 30 Apr 2019
DateAccepted/In press - 9 Apr 2021
DatePublished (current) - 14 Apr 2021
Volume121
Original languageEnglish

Abstract

Reactive programs combine traditional sequential programming constructs with primitives to allow communication with other concurrent agents. They are ubiquitous in modern applications, ranging from components systems and web services, to cyber-physical systems and autonomous robots. In this paper, we present an algebraic verification strategy for concurrent reactive programs, with a large or infinite state space. We define novel operators to characterise interactions and state updates, and an associated equational theory. With this we can calculate a reactive program's denotational semantics, and thereby facilitate automated proof. Of note is our reasoning support for iterative programs with reactive invariants, based on Kleene algebra, and for parallel composition. We illustrate our strategy by verifying a reactive buffer. Our laws and strategy are mechanised in Isabelle/UTP, our implementation of Hoare and He's Unifying Theories of Programming (UTP) framework, to provide soundness guarantees and practical verification support.

Bibliographical note

This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy.

    Research areas

  • cs.LO, cs.PL

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations