Provably trustworthy systems-Reference-Cited by-同舟云学术

Provably trustworthy systems

Published:2017-09-04 Issue:2104 Volume:375 Page:20150404
ISSN:1364-503X
Container-title:Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
language:en
Short-container-title:Phil. Trans. R. Soc. A.

Author:

Klein Gerwin¹²^ORCID,Andronick June¹²,Keller Gabriele¹²,Matichuk Daniel¹²,Murray Toby¹³,O'Connor Liam²

Affiliation:

1. Data61, CSIRO, Sydney, Australia

2. School of Computer Science and Engineering, UNSW, Sydney, Australia

3. School of Computing and Information Systems, University of Melbourne, Melbourne, Australia

Abstract

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’.

Funder

Air Force Research Laboratory and the Defense Advanced Research Projects Agency

Publisher

The Royal Society

Subject

General Physics and Astronomy,General Engineering,General Mathematics

Link

https://royalsocietypublishing.org/doi/pdf/10.1098/rsta.2015.0404

Reference72 articles.

1. Formal verification of a realistic compiler

2. A Formally Verified Compiler Back-end

3. Klein G et al. 2009 seL4: formal verification of an OS kernel. In Proc. 22nd ACM Symp. on Operating Systems Principles Big Sky MT 11–14 October pp. 207–220. New York NY: ACM.