Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB: (Short Paper)
Paper i proceeding, 2018

LCF-style provers emphasise that all results are secured by logical inference, and yet their current facilities for code extraction or code generation fall short of this high standard. This paper argues that extraction mechanisms with a small trusted computing base (TCB) ought to be used instead, pointing out that the recent CakeML and Œuf projects show that this is possible in HOL and within reach in Coq.

Författare

R. Kumar

Commonwealth Scientific and Industrial Research Organisation (CSIRO)

University of New South Wales (UNSW)

Eric Mullen

University of Washington

Zachary Tatlock

University of Washington

Magnus Myreen

Chalmers, Data- och informationsteknik, Formella metoder

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 10895 LNCS 362-369

9th International Conference on Interactive Theorem Proving, ITP 2018
Oxford, United Kingdom,

Ämneskategorier

Filosofi

Datavetenskap (datalogi)

Datorsystem

DOI

10.1007/978-3-319-94821-8_21

Mer information

Senast uppdaterat

2018-09-12