A Constructive Approach to Compiler Correctness
نویسندگان
چکیده
منابع مشابه
A Constructive Approach towards Correctness of Synthesis |
| This paper is dedicated to correct synthesis. By correct synthesis we mean, that there is a mathematical proof telling us, that the output circuit description fulllls the input circuit description. There are several ways to achieve correct synthesis. In this paper, we present a novel approach which integrates conventional synthesis algorithms thus guaranteeing the same quality of designs. Our...
متن کاملA Constructive Approach to Correctness, Exemplified by a Generator for Certified Java Card Applets
We present a constructive approach to correctness and exemplify it by describing a generator for certified Java Card applets that we are building. A proof of full functional correctness is generated, along with the code, from the specification; the proof can be independently checked by a simple proof checker, so that the larger and more complex generator needs not be trusted. We argue that such...
متن کاملCompiler Support for Correctness Proofs
The development of correct software is an important task which should not be carried out with the help of tools following diierent approaches. We propose that full support for correctness proofs should be integrated into the compiler. We outline in this paper how a compiler for a functional language can be extended to support the development of correct software. Speciications, functional progra...
متن کاملType Refinements for Compiler Correctness
Type refinements, introduced by Freeman and Pfenning and explored by Davies and Dunfield, unify the ontological and epistemic views of typing. Types tell us what programming language constructs exist, whereas refinements express properties of the values of a type. Here we show that refinements are very useful in compiler correctness proofs, wherein it often arises that two expressions that are ...
متن کاملCompiler Correctness for Concurrent Languages
The goal of my thesis is to extend current methods for compiler derivation and veri cation to languages which exhibit true concurrency. The work has proceeded through the following steps. A process calculus, called CLAM, was de ned, based on the -calculus and modelling true concurrency. CLAM was used to de ne the semantics of a simple concurrent functional language, called Urlang, which was ins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1980
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v9i118.6536