Provably trustworthy systems | Zendy

Gerwin Klein | Zendy; June Andronick | Zendy; Gabriele Keller | Zendy; Daniel Matichuk | Zendy; Toby Murray | Zendy; Liam O’Connor | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Provably trustworthy systems

Author(s) -

Gerwin Klein,

June Andronick,

Gabriele Keller,

Daniel Matichuk,

Toby Murray,

Liam O’Connor

Publication year - 2017

Publication title -

philosophical transactions of the royal society a mathematical physical and engineering sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.074

H-Index - 169

eISSN - 1471-2962

pISSN - 1364-503X

DOI - 10.1098/rsta.2015.0404

Subject(s) - computer science , microkernel , trustworthiness , scalability , kernel (algebra) , software , code (set theory) , software engineering , operating system , programming language , computer security , mathematics , set (abstract data type) , combinatorics

We present recent work on building and scaling trustworthy systems with formal, machine-checkable proof from the ground up, including the operating system kernel, at the level of binary machine code. We first give a brief overview of the seL4 microkernel verification and how it can be used to build verified systems. We then show two complementary techniques for scaling these methods to larger systems: proof engineering, to estimate verification effort; and code/proof co-generation, for scalable development of provably trustworthy applications.This article is part of the themed issue 'Verified trustworthy software systems'.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research