The Compcert C Verified Compiler: Documentation and User’S Manual Xavier Leroy
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Xavier Leroy's Phd Thesis
Rapp orts de Recherche N UNITE DE RECHERCHE INRIAROCQUENCOURT Programme Calcul symb olique Programmation et Genie logiciel POLYMORPHIC TYPING OF AN ALGORITHMIC LANGUAGE Institut National de Recherche Xavier LEROY en Informatique et en Automatique Domaine de Voluceau Ro cquencourt BP Le Chesnay Cedex France Tel Octobre Polymorphic typing of an algorithmic language 1 Xavier Leroy Abstract The p olymorphic typ e discipline as in the ML language ts well within purely applicative lan guages but do es not extend naturally to the main feature of algorithmic languages inplace up date of data structures Similar typing diculties arise with other extensions of applicative languages logical variables communication channels continuation handling This work studies in the setting of relational semantics two new approaches to the p olymorphic typing of these nonapplicative features The rst one relies on a restriction of generalization over typ es the notion of dangerous variables and on a rened typing of functional values closure typing The resulting typ e system is compatible with the ML core language and is the most expressive typ e systems for ML with imp erative features prop osed so far The second approach relies on switching to byname seman tics for the constructs of p olymorphism instead of the usual byvalue semantics The resulting language diers from ML but lends itself easily to p olymorphic typing Both approaches smo othly integrate nonapplicative features and p olymorphic typing Typage p olymorphe dun langage algorithmique Xavier -
The Compcert C Verified Compiler: Documentation and User's Manual
The CompCert C verified compiler: Documentation and user’s manual Xavier Leroy To cite this version: Xavier Leroy. The CompCert C verified compiler: Documentation and user’s manual: Version 2.4. [Intern report] Inria. 2014. hal-01091802v1 HAL Id: hal-01091802 https://hal.inria.fr/hal-01091802v1 Submitted on 6 Dec 2014 (v1), last revised 9 Dec 2020 (v8) 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. The CompCert C verified compiler Documentation and user’s manual Version 2.4 Xavier Leroy INRIA Paris-Rocquencourt September 17, 2014 Copyright 2014 Xavier Leroy. This text is distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. The text of the license is available at http://creativecommons.org/ licenses/by-nc-sa/4.0/ Contents 1 CompCert C: a trustworthy compiler 5 1.1 Can you trust your compiler? .................................. 5 1.2 Formal verification of compilers ................................ 6 1.3 Structure of the CompCert C compiler ............................. 9 1.4 CompCert C in practice ..................................... 11 1.4.1 Supported target platforms ............................... 11 1.4.2 The supported C dialect ................................ 12 1.4.3 Performance of the generated code .......................... -
An Executable Semantics for Compcert C⋆
An Executable Semantics for CompCert C? Brian Campbell LFCS, University of Edinburgh, [email protected] Abstract. CompCert is a C compiler developed by Leroy et al, the ma- jority of which is formalised and verified in the Coq proof assistant. The correctness theorem is defined in terms of a semantics for the `CompCert C' language, but how can we gain faith in those semantics? We explore one approach: building an equivalent executable semantics that we can check test suites of code against. Flaws in a compiler are often reflected in the output they produce: buggy compilers produce buggy code. Moreover, bugs can evade testing when they only manifest themselves on source code of a particular shape, when particular opti- misations are used. This has made compilers an appealing target for mechanized verification, from early work such as Milner and Weyhrauch's simple compiler in LCF [15] to modern work on practical compilers, such as the Verisoft C0 compiler [10] which is used as a key component of a larger verified software system. The CompCert project [11] has become a nexus of activity in recent years, in- cluding the project members' own efforts to refine the compiler and add certified optimisations [22,18,8], and external projects such as an extensible optimisation framework [20] and compiling concurrent programs [23]. The main result of the project is a C compiler which targets the assembly languages for a number of popular processor architectures. Most of the compiler is formalised in the Coq proof assistant and accompanied by correctness results, most notably proving that any behaviour given to the assembly output must be an acceptable be- haviour for the C source program. -
Fourth ACM SIGPLAN Workshop on Commercial Users of Functional Programming
Fourth ACM SIGPLAN Workshop on Commercial Users of Functional Programming Jeremy Gibbons November 2007 The goal of the Commercial Users of Functional Programming series of workshops is \to build a community for users of functional programming languages and tech- nology". The fourth workshop in the series took place in Freiburg, Germany on 4th October 2007, colocated as usual with the International Conference on Functional Programming. The workshop is flourishing, having grown from an intimate gath- ering of 25 people in Snowbird in 2004, through 40 in Tallinn in 2005 and 57 in Portland in 2006, to 104 registered participants (and more than a handful of casual observers) this time. For the first time this year, the organisers had the encouraging dilemma of receiv- ing more offers of presentations than would fit in the available time. The eventual schedule included an invited talk by Xavier Leroy, eleven contributed presentations, and an energetic concluding discussion. Brief summaries of each appear below. Industrial uses of Caml: Examples and lessons learned from the smart card industry (Xavier Leroy, INRIA) Abstract: The first part of this talk will show some examples of uses of Caml in industrial contexts, especially at companies that are part of the Caml con- sortium. The second part discusses my personal experience at the Trusted Logic start-up company, developing high-security software components for smart cards. While technological limitations prevent running functional lan- guages on such low-resource systems, the development and certification of smart card software present a number of challenges where functional pro- gramming can help. The workshop started with an invited talk by Xavier Leroy, introduced as \the father of OCaml". -
The Dule Module System and Programming Language Project
The Dule Module System and Programming Language Project Mikołaj Konarski [email protected] Institute of Informatics, Warsaw University The Dule project is an experiment in large-scale fine-grained modular pro- gramming employing a terse notation based on an elementary categorical model. The Dule module system remedies the known bureaucratic, debugging and main- tenance problems of functor-based modular programming (SML, OCaml) by intro- ducing simple modular operations with succinct notation inspired by the simplicity of its semantic categorical model and a modularization methodology biased to- wards program structuring, rather than code-reuse. The same categorical model and its natural extensions induce an abstract machine based on their equational theories and inspire novel functional core language features that sometimes com- plement nicely the modular mechanisms and sometimes are language experiments on their own. The assets of the project are gathered on its homepage at http://www. mimuw.edu.pl/~mikon/dule.html, where the formal definition of the cur- rent version of the language as well as an experimental compiler with a body of Dule programs can be obtained. In its current state, the definition is complete, but some of the theoretical hypotheses it has brought out are unverified and some of the suggested ideas for future user language and abstract machine mechanisms are unexplored. The compiler works adequately, but it still does not bootstrap and the lack of low-level libraries precludes practical applications. The compiler (except the type reconstruction algorithms) and the abstract machine are a straightforward implementation of the formal definition, so their efficiency can (and should) be vastly improved. -
An Extension of Isabelle/UTP with Simpl-Like Control Flow
USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow Joshua Alexander Bockenek Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements for the degree of Masters of Science in Computer Engineering Binoy Ravindran, Chair Peter Lammich Robert P. Broadwater December 8, 2017 Blacksburg, Virginia Keywords: Formal Verification, Formal Methods, Isabelle, Unifying Theories of Programming, Verification Condition Generation © 2018, Joshua Alexander Bockenek USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow Joshua Alexander Bockenek (ABSTRACT) Writing bug-free code is fraught with difficulty, and existing tools for the formal verification of programs do not scale well to large, complicated codebases such as that of systems software. This thesis presents USIMPL, a component of the Orca project for formal verification that builds on Foster’s Isabelle/UTP with features of Schirmer’s Simpl in order to achieve a modular, scalable framework for deductive proofs of program correctness utilizing Hoare logic and Hoare-style algebraic laws of programming. This work is supported in part by the Office of Naval Research (ONR) under grants N00014- 17-1-2297 and N00014-16-1-2818, and the Naval Sea Systems Command (NAVSEA)/the Naval Engineering Education Consortium (NEEC) under grant N00174-16-C-0018. Any opinions, findings, and conclusions or recommendations expressed in this thesis are those of the author and do not necessarily reflect the views of ONR or NAVSEA/NEEC. USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow Joshua Alexander Bockenek (GENERAL AUDIENCE ABSTRACT) Writing bug-free code is fraught with difficulty, and existing tools for the formal verification of programs do not scale well to large, complicated codebases such as that of systems software (OSes, compilers, and similar programs that have a high level of complexity but work on a lower level than typical user applications such as text editors, image viewers, and the like). -
A Multipurpose Formal RISC-V Specification Without Creating New Tools
A Multipurpose Formal RISC-V Specification Without Creating New Tools Thomas Bourgeat, Ian Clester, Andres Erbsen, Samuel Gruetter, Andrew Wright, Adam Chlipala MIT CSAIL Abstract experimentation in basic research, progressively extensible RISC-V is a relatively new, open instruction set architecture to full-fledged realistic systems. with a mature ecosystem and an official formal machine- readable specification. It is therefore a promising playground 1.2 From a golden standard to formal-methods for formal-methods research. infrastructure However, we observe that different formal-methods re- There is the potential for a mutually beneficial relationship search projects are interested in different aspects of RISC-V between the community of formal methods and the RISC-V and want to simplify, abstract, approximate, or ignore the community. other aspects. Often, they also require different encoding On the one hand, the RISC-V Foundation already adopted a styles, resulting in each project starting a new formalization golden standard in the form of an ISA specification in the Sail from-scratch. We set out to identify the commonalities be- language [6]. There is now an agreed-on, machine-processed tween projects and to represent the RISC-V specification as description of authorized behaviors for a significant portion a program with holes that can be instantiated differently by of the spec, beyond the usual natural-language description. different projects. On the other hand, the formal-methods community can Our formalization of the RISC-V specification is written leverage RISC-V as a great laboratory to prototype ideas, in Haskell and leverages existing tools rather than requiring where researchers will be able to get mature compilation new domain-specific tools, contrary to other approaches. -
Project-Team CAMBIUM
IN PARTNERSHIP WITH: Collège de France Activity Report 2019 Project-Team CAMBIUM Programming languages: type systems, concurrency, proofs of programs RESEARCH CENTER Paris THEME Proofs and Verification Table of contents 1. Team, Visitors, External Collaborators :::::::::::::::::::::::::::::::::::::::::::::::::::: 1 2. Overall Objectives :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 2 2.1. Overall Objectives2 2.2. Software reliability and reusability2 2.3. Qualities of a programming language3 2.4. Design, implementation, and evolution of OCaml4 2.5. Software verification4 2.6. Shared-memory concurrency5 3. Research Program :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 6 4. Application Domains ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::7 4.1. Formal methods7 4.2. High-assurance software7 4.3. Design and test of microprocessors7 4.4. Teaching programming8 5. New Software and Platforms :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 8 5.1. OCaml 8 5.2. Compcert 8 5.3. Diy 9 5.4. Menhir 9 5.5. CFML 9 5.6. TLAPS 9 5.7. ZENON 10 5.8. hevea 10 6. New Results ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 10 6.1. Programming language design and implementation 10 6.1.1. The OCaml system 10 6.1.2. Evolution of the OCaml type system 11 6.1.3. Refactoring with ornaments in ML 11 6.1.4. A better treatment of type abbreviations during type inference 11 6.2. Software specification and verification 12 6.2.1. The CompCert formally-verified compiler 12 6.2.2. Time credits and time receipts in Iris 12 6.2.3. A program logic for Multicore Ocaml 13 6.2.4. Verifying a generic local solver in Iris 13 6.2.5. Formal reasoning about asymptotic complexity 14 6.2.6. TLA+ 14 6.3. Shared-memory concurrency 14 6.3.1. -
Certification of an Instruction Set Simulator Xiaomu Shi
Certification of an Instruction Set Simulator Xiaomu Shi To cite this version: Xiaomu Shi. Certification of an Instruction Set Simulator. Systèmes embarqués. Université de Grenoble, 2013. Français. tel-00937524v1 HAL Id: tel-00937524 https://tel.archives-ouvertes.fr/tel-00937524v1 Submitted on 28 Jan 2014 (v1), last revised 28 Jun 2017 (v2) 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. THÈSE Pour obtenir le grade de DOCTEUR DE L’UNIVERSITÉ DE GRENOBLE Spécialité : Informatique Arrêté ministérial : 7 août 2006 Présentée par Xiaomu SHI Thèse dirigée par Jean-François MONIN et codirigée par Vania JOLOBOFF préparée au sein de VERIMAG et de Mathématiques, Sciences et Technologies de l’Information, Informatique Certification of an Instruction Set Simulator Thèse soutenue publiquement le 10 juillet 2013, devant le jury composé de : M. Yves Bertot Directeur de Recherche, INRIA Sophia-Antipolis, Examinateur Mme Sandrine Blazy Professeur, IRISA, Rapporteur M. Vania Joloboff Directeur de Recherche, LIAMA, Co-Directeur de thèse M. Xavier Leroy Directeur de Recherche, INRIA Rocquencourt, Examinateur M. Laurent Maillet-Contoz Ingénieur, STMicroelectronics, Examinateur M. Claude Marché Directeur de Recherche, INRIA Saclay - Île-de-France et LRI, Rapporteur M. -
A Trustworthy Monadic Formalization of the Armv7 Instruction Set Architecture
A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture Anthony Fox and Magnus O. Myreen Computer Laboratory, University of Cambridge, UK Abstract. This paper presents a new HOL4 formalization of the cur- rent ARM instruction set architecture, ARMv7. This is a modern RISC architecture with many advanced features. The formalization is detailed and extensive. Considerable tool support has been developed, with the goal of making the model accessible and easy to work with. The model and supporting tools are publicly available { we wish to encourage others to make use of this resource. This paper explains our monadic specifica- tion approach and gives some details of the endeavours that have been made to ensure that the sizeable model is valid and trustworthy. A novel and efficient testing approach has been developed, based on automated forward proof and communication with ARM development boards. 1 Introduction Instruction set architectures (ISAs) provide a precise interface between hard- ware (microprocessors) and software (high-level code). Formal models of instruc- tion sets are pivotal when verifying computer micro-architectures and compilers. There are also areas where it is appropriate to reason directly about low-level machine code, e.g. in verifying operating systems, embedded code and device drivers. Detailed architecture models have also been used in formalizing multi- processor memory models, see [15]. In the past, academic work has frequently examined the pedagogical DLX architecture, see [6]. When compared to commercial architectures, DLX is rela- tively uncomplicated { being a simplified version of the MIPS RISC architecture. Consequently, it is rarely cumbersome to work with the entire DLX instruction set. -
Mechanized Semantics for the Clight Subset of the C Language
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Mechanized semantics for the Clight subset of the C language Sandrine Blazy · Xavier Leroy the date of receipt and acceptance should be inserted later Abstract This article presents the formal semantics of a large subset of the C language called Clight. Clight includes pointer arithmetic, struct and union types, C loops and struc- tured switch statements. Clight is the source language of the CompCert verified compiler. The formal semantics of Clight is a big-step semantics equipped with traces of input/output events that observes both terminating and diverging executions. The formal semantics of Clight is mechanized using the Coq proof assistant. In addition to the semantics of Clight, this article describes its integration in the CompCert verified compiler and several ways by which the semantics was validated. Publication history The conference paper [6], centered on the formal verification of a C compiler front-end, briefly outlined the syntax and semantics of an earlier version of the Clight subset of C. Clight evolved significantly since then. In particular, the semantics now handle non-terminating executions and constructs input/output traces of executions, leading to significantly stronger properties of observational equivalences. Also, the present paper provides much more details on the design choices and formal semantics of Clight than [6]. 1 Introduction Formal semantics of programming languages – that is, the mathematical specification of legal programs and their behaviors – play an important role in several areas of computer science. For advanced programmers and compiler writers, formal semantics provide a more precise alternative to the informal English descriptions that usually pass as language stan- dards. -
Curriculum Vitae
Curriculum Vitæ Jacques-Henri Jourdan LMF, Bat 650 Université Paris Saclay 91405 Orsay Cedex France (+33)1.69.15.67.35 [email protected] http://jhjourdan.mketjh.fr Research experiences October 2017–... Full-time CNRS researcher. LMF (Formal Methods Laboratory), Université Paris Saclay. April 2016–September 2017 Postdoctoral position at Max Plank Institute for Software Systems, Sarrebruck (Germany). RustBelt project: study and formal proof in Coq of the type system of the Rust language by using the Iris concurrent separation logic [9, 12]. April 2012–March 2016 PhD of Computer Science of Paris VII Diderot University (France), advised by Xavier Leroy, in Gallium team, Inria Paris. Verasco: a Formally Verified C Static Ana- lyzer [15, 13, 16, 17, 21, 18, 20, 11]. 2016 thesis prize of GdR GPL (french research group on programming and software engi- neering). September 2011–March 2012 Internship in LMeASI, CEA Saclay (France), with Eric Goubault and Sylvie Putot. Inference of invariant inequalities for polynomial dynamical systems [19]. April–July 2011 Internship in Gallium team, Inria Rocquencourt (France), with François Pottier and Xavier Leroy. Implementation of a certified parser for Compcert, a formally verified C com- piler [23]. April–August 2010 Internship in Rise team, Microsoft Reaserch Redmond (USA), with Francesco Lo- gozzo. Design and implementation of abstract interpretation techniques in Spur, a powerfull Javascript engine. Performance improvements in Clousot, a static analyzer for .Net code, based on abstract interpretation. July–August 2009 Internship in ASAP team, INRIA Rennes (France), with Davide Frey and Anne-Marie Kermarrec. Design and implementation of Papeer, a P2P papers sharing system.