Results 1 - 10 of 475

CakeML: A verified implementation of ML

by Ramana Kumar, Magnus Myreen, Michael Norrish, Scott Owens - In Principles of Programming Languages (POPL , 2014
"... We have developed and mechanically verified an ML system called CakeML, which supports a substantial subset of Standard ML. CakeML is implemented as an interactive read-eval-print loop (REPL) in x86-64 machine code. Our correctness theorem ensures that this REPL implementation prints only those resu ..."
Abstract - Cited by 14 (5 self) - Add to MetaCart
We have developed and mechanically verified an ML system called CakeML, which supports a substantial subset of Standard ML. CakeML is implemented as an interactive read-eval-print loop (REPL) in x86-64 machine code. Our correctness theorem ensures that this REPL implementation prints only those

A formally verified compiler backend

by Xavier Leroy , 2008
"... This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Su ..."
Abstract - Cited by 104 (14 self) - Add to MetaCart
This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness

ESP: Path-Sensitive Program Verification in Polynomial Time

by Manuvir Das, Sorin Lerner, Mark Seigle , 2002
"... In this paper, we present a new algorithm for partial program verification that runs in polynomial time and space. We are interested in checking that a program satisfies a given temporal safety property. Our insight is that by accurately modeling only those branches in a program for which the proper ..."
Abstract - Cited by 299 (4 self) - Add to MetaCart
” algorithm as part of a partial verification tool called ESP. We present the results of applying ESP to the problem of verifying the file I/O behavior of a version of the GNU C compiler (gcc, 140,000 LOC). We are able to prove that all of the 646 calls to fprintf in the source code of gcc are guaranteed

Construction of Verified Software Systems with Program-Checking: An Application To Compiler Back-Ends

by Thilo Gaul, Andreas Heberle, Wolf Zimmermann, Wolfgang Goerigk , 1999
"... This paper describes how program-checking can be used to significantly reduce the amount of verification work to establish the implementation correctness of software systems which may be partly generated by unverified construction tools. We show the practicability of our approach with an application ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
with an application to the construction of verified compiler back-ends. The basic idea of program-checking is to use an unverified algorithm whose results are checked by a verified component at run time. Run-Time Result Verification in our approach assures formal correctness of the software system and its

Customization: optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language

by Craig Chambers, David Ungar , 1989
"... Dynamically-typed object-oriented languages please programmers, but their lack of static type information penalizes performance. Our new implementation tech-niques extract static type information from declaration-free programs. Our system compiles several copies of a given procedure, each customized ..."
Abstract - Cited by 199 (18 self) - Add to MetaCart
Dynamically-typed object-oriented languages please programmers, but their lack of static type information penalizes performance. Our new implementation tech-niques extract static type information from declaration-free programs. Our system compiles several copies of a given procedure, each

Formal Verification of a Compiler Back-end

by Axel Dold, Vincent Vialard
"... Abstract. This paper reports on a non-trivial case-study carried out in the context on the German correct compiler construction project Verifix. The PVS system is here used as a vehicle to formally represent and verify a generic checker routine (run-time result verification) used in compiler back-en ..."
Abstract - Add to MetaCart
Abstract. This paper reports on a non-trivial case-study carried out in the context on the German correct compiler construction project Verifix. The PVS system is here used as a vehicle to formally represent and verify a generic checker routine (run-time result verification) used in compiler back-ends

ASM-Based Mechanized Verification of Compiler Back-Ends

by Axel Dold , Thilo S. Gaul , Vincent Vialard, Wolf Zimmermann
"... We describe an approach to mechanically prove the correctness of BURS specifications and show how such a tool can be connected with BURS based back-end generators [9]. The proofs are based on the operational semantics of both source and target system languages specified by means of Abstract Stat ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
We describe an approach to mechanically prove the correctness of BURS specifications and show how such a tool can be connected with BURS based back-end generators [9]. The proofs are based on the operational semantics of both source and target system languages specified by means of Abstract

An LLVM Backend for GHC

by David A. Terei, Manuel M. T. Chakravarty
"... In the presence of ever-changing computer architectures, highquality optimising compiler backends are moving targets that require specialist knowledge and sophisticated algorithms. In this paper, we explore a new backend for the Glasgow Haskell Compiler (GHC) that leverages the Low Level Virtual Mac ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
In the presence of ever-changing computer architectures, highquality optimising compiler backends are moving targets that require specialist knowledge and sophisticated algorithms. In this paper, we explore a new backend for the Glasgow Haskell Compiler (GHC) that leverages the Low Level Virtual

Typed Memory Management in a Calculus of Capabilities

by David Walker, Karl Crary, Greg Morrisett , 2000
"... Region-based memory management is an alternative to standard tracing garbage collection that makes potentially dangerous operations such as memory deallocation explicit but verifiably safe. In this article, we present a new compiler intermediate language, called the Capability Calculus, that supp ..."
Abstract - Cited by 208 (21 self) - Add to MetaCart
Region-based memory management is an alternative to standard tracing garbage collection that makes potentially dangerous operations such as memory deallocation explicit but verifiably safe. In this article, we present a new compiler intermediate language, called the Capability Calculus

Self-compilation and self-verification Ramana

by unknown authors
"... This dissertation presents two pieces of work, one building on the other, that advance the state of the art of formal verification. The focus, in both cases, is on proving end-to-end correctness for realistic implementations of computer software. The first piece is a verified compiler for a stateful ..."
Abstract - Add to MetaCart
of the CakeML REPL, in particular, the new technique of proof-grounded bootstrapping of a verified com-piler. The verified compiler is bootstrapped within the theorem prover used for its verification, and then packaged into a REPL. The result is an implementa-tion of the REPL in machine code, verified against
Results 1 - 10 of 475