Proof-Assistant-Based Verification of Programs

Total Page:16

File Type:pdf, Size:1020Kb

Proof-Assistant-Based Verification of Programs Proof-assistant-based verification of programs Valentin Robert University of California, San Diego [email protected] Abstract essentially removing the gap between the programming and Proof assistants are now widely used in the field of pro- the logical fragments. gramming languages research to reason formally about ob- In a system with dependent types, the return type of jects of increasing complexity, like advanced type systems, a function can refer to the value of its argument, and large programming languages, compilers, or mathematical thus express properties about this value. This allows the constructs. This research examination report focuses on the user of these tools to write functions and verify strong use of proof assistants in reasoning about programs, and specifications, by following one of two approaches. surveys the methods developed to tame the complexity of The intrinsic approach uses dependent types as a pro- representing languages and their semantics, as well as the gramming tool which lets one write certified computations. difficulties encountered in reasoning about programs in im- One can use inductive type families to describe correct-by- perative and concurrent settings. We also examine concrete construction data types with strong invariants, or use de- tools developed to perform this reasoning, and consider their pendent records to package simpler data types with proof trade-offs in expressivity and proof automation. terms that characterize such invariants. A classic example of the former is the vector inductive family, indexed by its 1. Introduction size: Over the past decades, proof assistants have changed the Inductive Vec (T : Type) : nat -> Type := social process of exchanging formal results about program- | Nil : Vec O ming languages, and has opened the way, along with solver- | Cons : ∀ {n}, T -> Vec n -> Vec (S n) based techniques, to tackling challenges much more realistic . than what was usually done using pen and paper. Interactive By construction, an element of the type Vec T n must theorem provers can be used to formalize existing bodies of contain exactly n elements. An example of the latter could mathematics, to develop new mathematical theories in a for- be a type for a particular tree structure (balanced, red-black, mal setting, to reason about type systems, or to implement etc.) represented as a dependent record containing a raw tree verified programs. It is now common to see formal develop- and a proof of the expected property: ments attached to publications in the field of programming languages, where the proofs used to be detailed informally, Record Type BST (T : Type) := { often in an informal combination of mathematical notations t : BinaryTree T, and natural language. _ : IsOrdered t, In this report, we focus on the use of proof assistants in }. the verification of programs, and highlight some of the main directions of research in this area, and for each of those, Consumers of this data type have access to both the un- some of the most succesful or promising techniques. derlying tree t, and a proof that t is a search tree. Using Section 2 focuses on the use of proof assistants to im- this proof, they can derive more facts about the ordering plement and verify functional programs. In section 3, we of the values in t if necessary, without requiring dynamic describe the meta-theoretic tools developed by the commu- tests. Producers of this data type, on the other hand, have nity to reason about programming languages. In section 4, additional work, since they need not only build t, but also we give an overview of several verified compilers for different construct the proof term for the IsOrdered property. This flavors of languages. Section 5 focuses on separation logic, a construction can be done either in the form of programming, logic designed to reason about imperative programs. In sec- or, in some systems, it can be dispatched on the side, either tion 6, we describe the most recent developments in verify- fully-automatically with solvers, or manually with tactics. ing low-level code. Finally, in section 7, we address a cross- In pratice, this approach can become extremely verbose, be- cutting concern in all of these directions, the challenge of cause dependently-typed elimination can require complex automating the proof effort. user annotations for the return types and complex propaga- tion patterns for the facts that are known to be true (like the convoy pattern). Systems like Agda mitigate this hurdle 2. Functional programs by using stronger axioms and performing some automated Modern proof assistants are often built on top of a higher- propagation of equalities when performing elimination on order dependent type theory. By leveraging the Curry- inductive type families. Howard isomorphism, a mathematical correspondence be- On the other hand, the extrinsic approach separates tween programs and proofs, types and propositions, they the programming and reasoning phases. Extrinsic code is allow their user to build higher-order functional programs written in the higher-order polymorphic part of the calculus, and to prove theorems using the exact same mechanisms, and properties of the intended behavior are captured a 1 2015/5/4 posteriori, in theorems that make up the specification of siderations are internalized (for instance, Twelf), but most the code. The benefits here is that the code is much easier don’t. An opposite approach is that of de Bruijn indices, to read and write, and clearly separated from the proofs. which encode binders as their distance to their abstraction The inconvenience is that the code does not benefit from location. This representation is immediately canonical, and the static guarantees that the intrinsic style captures, and avoids the need for substitutions altogether, but it cannot therefore, needs to often deal with cases that cannot happen represent terms with free variables without further quotient- in actual executions. ing, and manipulation of such terms becomes cluttered with Most proof assistants require intrinsic termination anno- shifting binders. tations even for extrinsic code, as non-terminating computa- An approach introduced by Coquand [13] and later tions can make the logical fragment inconsistent. Casinghino reused by McKinna et al. [28][29] consists in separating et al. [7] propose a more flexible phase distinction that lets syntactically bound and free occurences of variables. This one write non-terminating functional programs in the pro- makes substitutions for free variables simpler since names gramming fragment, and allows transportation to and from cannot be captured. This idea is further refined by Leroy [27] the logical fragment whenever it is safe to do so. To achieve and Charguéraud [8] with the locally nameless approach. In this, they index their typing judgement by the fragment in this setting, bound variables are nameless, that is, they are which it holds. When one obtains a derivation in the logical represented by their de Bruijn index, but free variables are fragment, they may use the term either as a proof or as a named. This has two advantages: α-equivalence is syntactic program (following the Curry-Howard isomorphism). On the equality, and free variables can have meaningful names. other hand, a derivation in the programming fragment only In Engineering Formal Meta-theory [1], the authors ad- allows running the program, not using it as a proof. As a dress another hurdle of formal reasoning with names in the result, they may allow more constructs in the programming locally nameless approach. The issue is that the classic typ- fragment than the safe ones available in the logical one, but ing rule for abstraction: they let the languages overlap so that safe programs are mobile across fragments. x∈ / FV (t) E, x : S ` tx : T A problem somewhat related to that of termination anal- Exists-fresh ysis is that of dealing with infinite-size data and computa- E ` Lam t : S → T tion over it. A functional programmer may wish to describe gives rise to an arguably poor induction principle (tx stands infinite constructions, either by virtue of their circularity or for the body of the abstraction where de Bruijn variables by expliciting a generating function that could be expanded referring to the opened Lam are replaced with FreeVar x). as much as needed. For instance, one may wish to describe Upon introduction, this rule is easy to use as we need only circular graphs, or to define a possibly-infinite sequence of come up with a given x that is sufficiently fresh with respect elements. These are meant either to be consumed only to to the body of the abstraction. The issue is that upon a finite depth, using mechanisms to delay the evaluation, elimination, we obtain again a fixed variable name x, which or to be processed ad infinitum by a recursive process. For is only guaranteed to be fresh with respect to the body of the the same consistency arguments, these patterns are not ex- abstraction. Often, we need to rather pick an x which is fresh pressible safely within an inductive dependently-typed the- with respect to both the body of the abstraction, and some ory. Coinduction can be used to implement functions work- other set of variable names, say S. This should be achievable ing over infinite data, as long as there is a guarantee that because we can arbitrarily rename variables according to the the function will produce an output within a finite number Barendregt convention (that is, in an α-equivalent way), but of execution steps. Furthermore, the system ensures this by this presentation forces the user to perform this substitution an over-conservative, mostly syntactic check. This is good and prove its correctness. They propose this alternative rule: enough for most purposes, but some seemingly-reasonable programs cannot be written (for instance, a stream filter, x since it could potentially never output anything).
Recommended publications
  • Experiments in Validating Formal Semantics for C
    Experiments in validating formal semantics for C Sandrine Blazy ENSIIE and INRIA Rocquencourt [email protected] Abstract. This paper reports on the design of adequate on-machine formal semantics for a certified C compiler. This compiler is an optimiz- ing compiler, that targets critical embedded software. It is written and formally verified using the Coq proof assistant. The main structure of the compiler is very strongly conditioned by the choice of the languages of the compiler, and also by the kind of semantics of these languages. 1 Introduction C is still widely used in industry, especially for developing embedded software. The main reason is the control by the C programmer of all the resources that are required for program execution (e.g. memory layout, memory allocation) and that affect performance. C programs can therefore be very efficient, but the price to pay is a programming effort. For instance, using C pointer arithmetic may be required in order to compute the address of a memory cell. However, a consequence of this freedom given to the C programmer is the presence of run-time errors such as buffer overflows and dangling pointers. Such errors may be difficult to detect in programs, because of C type casts and more generally because the C type system is unsafe. Many static analysis tools attempt to detect such errors in order to ensure safety properties that may be ensured by more recent languages such as Java. For instance, CCured is a program transformation system that adds memory safety guarantees to C programs by verifying statically that memory errors cannot oc- cur and by inserting run-time checks where static verification is insufficient [1].
    [Show full text]
  • Introduction to Model Checking and Temporal Logic¹
    Formal Verification Lecture 1: Introduction to Model Checking and Temporal Logic¹ Jacques Fleuriot [email protected] ¹Acknowledgement: Adapted from original material by Paul Jackson, including some additions by Bob Atkey. I Describe formally a specification that we desire the model to satisfy I Check the model satisfies the specification I theorem proving (usually interactive but not necessarily) I Model checking Formal Verification (in a nutshell) I Create a formal model of some system of interest I Hardware I Communication protocol I Software, esp. concurrent software I Check the model satisfies the specification I theorem proving (usually interactive but not necessarily) I Model checking Formal Verification (in a nutshell) I Create a formal model of some system of interest I Hardware I Communication protocol I Software, esp. concurrent software I Describe formally a specification that we desire the model to satisfy Formal Verification (in a nutshell) I Create a formal model of some system of interest I Hardware I Communication protocol I Software, esp. concurrent software I Describe formally a specification that we desire the model to satisfy I Check the model satisfies the specification I theorem proving (usually interactive but not necessarily) I Model checking Introduction to Model Checking I Specifications as Formulas, Programs as Models I Programs are abstracted as Finite State Machines I Formulas are in Temporal Logic 1. For a fixed ϕ, is M j= ϕ true for all M? I Validity of ϕ I This can be done via proof in a theorem prover e.g. Isabelle. 2. For a fixed ϕ, is M j= ϕ true for some M? I Satisfiability 3.
    [Show full text]
  • PROGRAM VERIFICATION Robert S. Boyer and J
    PROGRAM VERIFICATION Robert S. Boyer and J Strother Moore To Appear in the Journal of Automated Reasoning The research reported here was supported by National Science Foundation Grant MCS-8202943 and Office of Naval Research Contract N00014-81-K-0634. Institute for Computing Science and Computer Applications The University of Texas at Austin Austin, Texas 78712 1 Computer programs may be regarded as formal mathematical objects whose properties are subject to mathematical proof. Program verification is the use of formal, mathematical techniques to debug software and software specifications. 1. Code Verification How are the properties of computer programs proved? We discuss three approaches in this article: inductive invariants, functional semantics, and explicit semantics. Because the first approach has received by far the most attention, it has produced the most impressive results to date. However, the field is now moving away from the inductive invariant approach. 1.1. Inductive Assertions The so-called Floyd-Hoare inductive assertion method of program verification [25, 33] has its roots in the classic Goldstine and von Neumann reports [53] and handles the usual kind of programming language, of which FORTRAN is perhaps the best example. In this style of verification, the specifier "annotates" certain points in the program with mathematical assertions that are supposed to describe relations that hold between the program variables and the initial input values each time "control" reaches the annotated point. Among these assertions are some that characterize acceptable input and the desired output. By exploring all possible paths from one assertion to the next and analyzing the effects of intervening program statements it is possible to reduce the correctness of the program to the problem of proving certain derived formulas called verification conditions.
    [Show full text]
  • Formal Verification, Model Checking
    Introduction Modeling Specification Algorithms Conclusions Formal Verification, Model Checking Radek Pel´anek Introduction Modeling Specification Algorithms Conclusions Motivation Formal Methods: Motivation examples of what can go wrong { first lecture non-intuitiveness of concurrency (particularly with shared resources) mutual exclusion adding puzzle Introduction Modeling Specification Algorithms Conclusions Motivation Formal Methods Formal Methods `Formal Methods' refers to mathematically rigorous techniques and tools for specification design verification of software and hardware systems. Introduction Modeling Specification Algorithms Conclusions Motivation Formal Verification Formal Verification Formal verification is the act of proving or disproving the correctness of a system with respect to a certain formal specification or property. Introduction Modeling Specification Algorithms Conclusions Motivation Formal Verification vs Testing formal verification testing finding bugs medium good proving correctness good - cost high small Introduction Modeling Specification Algorithms Conclusions Motivation Types of Bugs likely rare harmless testing not important catastrophic testing, FVFV Introduction Modeling Specification Algorithms Conclusions Motivation Formal Verification Techniques manual human tries to produce a proof of correctness semi-automatic theorem proving automatic algorithm takes a model (program) and a property; decides whether the model satisfies the property We focus on automatic techniques. Introduction Modeling Specification Algorithms Conclusions
    [Show full text]
  • Formal Verification of Diagnosability Via Symbolic Model Checking
    Formal Verification of Diagnosability via Symbolic Model Checking Alessandro Cimatti Charles Pecheur Roberto Cavada ITC-irst RIACS/NASA Ames Research Center ITC-irst Povo, Trento, Italy Moffett Field, CA, U.S.A. Povo, Trento, Italy mailto:[email protected] [email protected] [email protected] Abstract observed system. We propose a new, practical approach to the verification of diagnosability, making the following contribu• This paper addresses the formal verification of di• tions. First, we provide a formal characterization of diagnos• agnosis systems. We tackle the problem of diagnos• ability problem, using the idea of context, that explicitly takes ability: given a partially observable dynamic sys• into account the run-time conditions under which it should be tem, and a diagnosis system observing its evolution possible to acquire certain information. over time, we discuss how to verify (at design time) Second, we show that a diagnosability condition for a given if the diagnosis system will be able to infer (at run• plant is violated if and only if a critical pair can be found. A time) the required information on the hidden part of critical pair is a pair of executions that are indistinguishable the dynamic state. We tackle the problem by look• (i.e. share the same inputs and outputs), but hide conditions ing for pairs of scenarios that are observationally that should be distinguished (for instance, to prevent simple indistinguishable, but lead to situations that are re• failures to stay undetected and degenerate into catastrophic quired to be distinguished. We reduce the problem events). We define the coupled twin model of the plant, and to a model checking problem.
    [Show full text]
  • Theorem Proving for Verification
    Theorem Proving for Verification John Harrison Intel Corporation CAV 2008 Princeton 9th July 2008 0 Formal verification Formal verification: mathematically prove the correctness of a design with respect to a mathematical formal specification. Actual requirements 6 Formal specification 6 Design model 6 Actual system 1 Essentials of formal verification The basic steps in formal verification: Formally model the system • Formalize the specification • Prove that the model satisfies the spec • But what formalism should be used? 2 Some typical formalisms Propositional logic, a.k.a. Boolean algebra • Temporal logic (CTL, LTL etc.) • Quantifier-free combinations of first-order arithmetic theories • Full first-order logic • Higher-order logic or first-order logic with arithmetic or set theory • 3 Expressiveness vs. automation There is usually a roughly inverse relationship: The more expressive the formalism, the less the ‘proof’ is amenable to automation. For the simplest formalisms, the proof can be so highly automated that we may not even think of it as ‘theorem proving’ at all. The most expressive formalisms have a decision problem that is not decidable, or even semidecidable. 4 Logical syntax English Formal false ⊥ true ⊤ not p p ¬ p and q p q ∧ p or q p q ∨ p implies q p q ⇒ p iff q p q ⇔ for all x, p x. p ∀ there exists x such that p x. p ∃ 5 Propositional logic Formulas built up from atomic propositions (Boolean variables) and constants , using the propositional connectives , , , and ⊥ ⊤ ¬ ∧ ∨ ⇒ . ⇔ No quantifiers or internal structure to the atomic propositions. 6 Propositional logic Formulas built up from atomic propositions (Boolean variables) and constants , using the propositional connectives , , , and ⊥ ⊤ ¬ ∧ ∨ ⇒ .
    [Show full text]
  • Safety Standards and WCET Analysis Tools Daniel Kästner, Christian Ferdinand
    Safety Standards and WCET Analysis Tools Daniel Kästner, Christian Ferdinand To cite this version: Daniel Kästner, Christian Ferdinand. Safety Standards and WCET Analysis Tools. Embedded Real Time Software and Systems (ERTS2012), Feb 2012, Toulouse, France. hal-02192406 HAL Id: hal-02192406 https://hal.archives-ouvertes.fr/hal-02192406 Submitted on 23 Jul 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Safety Standards and WCET Analysis Tools Daniel Kastner¨ Christian Ferdinand AbsInt GmbH, Science Park 1, D-66123 Saarbrucken,¨ Germany http://www.absint.com Abstract of-the-art techniques for verifying software safety re- quirements have to be applied to make sure that an appli- In automotive, railway, avionics, automation, and cation is working properly. To do so lies in the responsi- healthcare industries more and more functionality is im- bility of the system designers. Ensuring software safety plemented by embedded software. A failure of safety- is one of the goals of safety standards like DO-178B, critical software may cause high costs or even endan- DO-178C, IEC-61508, ISO-26262, or EN-50128. They ger human beings. Also for applications which are not all require to identify functional and non-functional haz- highly safety-critical, a software failure may necessitate ards and to demonstrate that the software does not vio- expensive updates.
    [Show full text]
  • QWIRE Practice: Formal Verification of Quantum Circuits In
    WIRE Practice: Formal Verification of Quantum Circuits in Coq Q Robert Rand Jennifer Paykin Steve Zdancewic [email protected] [email protected] [email protected] University of Pennsylvania We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq’s theorem proving features. The implementation uses higher-order abstract syntax to represent variable binding and provides a type-checking algorithm for linear wire types, ensuring that quantum circuits are well-formed. We formalize a denotational semantics that interprets QWIRE circuits as superoperators on density matrices, and prove the correctness of some simple quantum programs. 1 Introduction The last few years have witnessed the emergence of lightweight, scalable, and expressive quantum cir- cuit languages such as Quipper [10] and LIQUiS⟩ [22]. These languages adopt the QRAM model of quantum computation, in which a classical computer sends instructions to a quantum computer and re- ceives back measurement results. Quipper and LIQUiS⟩ programs classically produce circuits that can be executed on a quantum computer, simulated on a classical computer, or compiled using classical tech- niques to smaller, faster circuits. Since both languages are embedded inside general-purpose classical host languages (Haskell and F#), they can be used to build useful abstractions on top of quantum circuits, allowing for general purpose quantum programming. As is the case with classical programs, however, quantum programs in these languages will invariably have bugs. Since quantum circuits are inherently expensive to run (either simulated or on a real quantum computer) and are difficult or impossible to debug at runtime, numerous techniques have been developed to verify properties of quantum programs.
    [Show full text]
  • Overview on Formal Verification  State of the Art in Formal Verification  Ingredients in Formal Verification  Classification
    Outline Overview on Formal Verification State of the art in Formal Verification Ingredients in Formal Verification Classification P.Camurati G.Cabodi S.Nocco S.Quer Formal Methods Group Department of Computer Engineering Politecnico di Torino Torino, Italy 2 Outline Simulation: The Current Picture State of the art in Formal Verification Ingredients in Formal Verification Classification Hard to generate high quality input stimuli . A lot of user effort . No formal way to identify unexercised aspects No good measure of comprehensiveness of validation . Low bug detection rate is the main criterion . Only means that current method of stimulus generation is not achieving more. 3 Formal Verification: An Alternative to Simulation! Formal Verification is the process of constructing a proof that a target system will behave in accordance with its specification . Use of mathematical reasoning to prove that an implementation satisfies a specification . Like a mathematical proof: correctness of a formally verified hardware design holds regardless of input values . Consideration of all cases is implicit in formal verification Must establish . A formal specification (properties or high-level behavior) . A formal description of the implementation (design at higher level of abstraction — model (observationally) equivalent to implementation or implied by implementation). Formal Verification: Pros Formal Verification: Cons Just because we have proved something correct does not Complete with respect to a given property mean it will work! Correctness
    [Show full text]
  • A Case Study on Formal Verification of the Anaxagoros Hypervisor Paging System with Frama-C Allan Blanchard, N
    A case study on formal verification of the anaxagoros hypervisor paging system with frama-C Allan Blanchard, N. Kosmatov, M. Lemerre, Frédéric Loulergue To cite this version: Allan Blanchard, N. Kosmatov, M. Lemerre, Frédéric Loulergue. A case study on formal verification of the anaxagoros hypervisor paging system with frama-C. FMICS 2015 - Formal Methods for Industrial Critical Systems, Jun 2015, Oslo, Norway. pp.15-30, 10.1007/978-3-319-19458-5_2. cea-01834977 HAL Id: cea-01834977 https://hal-cea.archives-ouvertes.fr/cea-01834977 Submitted on 11 Jul 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. A Case Study on Formal Verification of the Anaxagoros Hypervisor Paging System with Frama-C? Allan Blanchard1;3, Nikolai Kosmatov1, Matthieu Lemerre1, and Fr´ed´ericLoulergue2;3 1 CEA, LIST, Software Reliability Laboratory, PC 174, 91191 Gif-sur-Yvette France [email protected] 2 Inria πr2, PPS, Univ Paris Diderot, CNRS, Paris, France 3 Univ Orl´eans,INSA Centre Val de Loire, LIFO EA 4022, Orl´eans,France [email protected] Abstract. Cloud hypervisors are critical software whose formal verifi- cation can increase our confidence in the reliability and security of the cloud.
    [Show full text]
  • Overview of Formal Methods in Software Engineering
    Overview of formal methods in software engineering IOANA RODHE, MARTIN KARRESAND FOI, Swedish Defence Research Agency, is a mainly assignment-funded agency under the Ministry of Defence. The core activities are research, method and technology development, as well as studies conducted in the interests of Swedish defence and the safety and security of society. The organisation employs approximately 1000 personnel of whom about 800 are scientists. This makes FOI Sweden’s largest research institute. FOI gives its customers access to leading-edge expertise in a large number of fi elds such as security policy studies, defence and security related analyses, the assessment of various types of threat, systems for control and management of crises, protection against and management of hazardous substances, IT security and the potential offered by new sensors. FOI Swedish Defence Research Agency Phone: +46 8 555 030 00 www.foi.se FOI-R--4156--SE SE-164 90 Stockholm Fax: +46 8 555 031 00 ISSN 1650-1942 December 2015 Ioana Rodhe, Martin Karresand Overview of formal methods in software engineering Bild/cover: Martin Karresand FOI-R--4156--SE Titel Översikt över formella metoder i programvaruutveckling Title Overview of formal methods in software engineering Report no FOI-R--4156--SE Month December Year 2015 Pages 50 ISSN ISSN-1650-1942 Customer The Swedish Armed Forces Project no E36077 Approved by Christian Jönsson Division Information- and Aeronautical Systems FOI Research area Armed Forces R&T area Command and control FOI Swedish Defence Research Agency This work is protected under the Act on Copyright in Literary and Artistic Works (SFS 1960:729).
    [Show full text]
  • Reflections on Industrial Use of Frama-C
    Reflections on Industrial Use of Frama-C Joseph R. Kiniry and Daniel M. Zimmerman Sound Static Analysis for Security Workshop NIST — Gaithersburg, Maryland — 28 June 2018 About Galois • established in 1999 to apply functional programming and formal methods to the problem of information assurance • over 40 active projects for numerous clients, both U.S. government (NSA, DARPA, IARPA, Homeland Security, Air Force Research Lab) and commercial (Amazon, LG, others) • over the years, we have substantially broadened our scope to high assurance everything ‹#› © 2018 Galois, Inc. !2 © 2018 Galois, Inc. Galois and Frama-C • Galois has used Frama-C on some projects • DARPA Crowdsourced Formal Verification • WP plugin to generate verification conditions • custom plugins to generate schematic assertions and program traces • DARPA SHAVE • Our clients rarely ask for formal verification in Frama-C’s “sweet spot”‹#› © 2018 Galois, Inc. !3 © 2018 Galois, Inc. SHAVE: Software/Hardware Assurance Verified End-to-End • DARPA MTO seedling for the SSITH program • a bump-in-wire encryption device • single, one-time AES key provisioning • encryption or decryption mutual exclusion • open hardware, firmware, and software • crypto realized as a MMIO RISC-V extension • custom development of a verification system for Bluespec hardware description language ‹#› © 2018 Galois, Inc. !4 © 2018 Galois, Inc. SHAVE Assurance Concept Silicon Verilog Informal Architec- BSV Netlist GDSII Artifacts RTL specs ture spec spec spec spec spec Refinement manual design automatic synthesis and manual design Technology Today's manual inspection, runtime testing, Assurance manual inspection model checking, formal verification Technique SHAVE formal verification that produces independently verifiable claims and proofs Assurance ‹#› © 2018 Galois, Inc.
    [Show full text]