AbstractThis paper describes the Signature Compiler, which can compile an LF signature to a custom proof checker in either C++ or Java, specialized for that signature. Empirical results are reported showing substantial improvements in proof-checking time over existing LF checkers on benchmarks
Guaranteeing correctness of compilation is a major precondition for correct software. Code generatio...
In this paper we overview the design and implementation of a language extension to C++ for abstracti...
AbstractCompilers that have been formally verified in theorem provers are often not directly usable ...
AbstractThis paper describes the Signature Compiler, which can compile an LF signature to a custom p...
This paper presents a logical framework derived from the Edinburgh Logical Framework (LF) [5] that c...
hB&Krrod tea g-obEa B^«'" This report describes a framework for representing and valid...
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on ...
This paper serves as an introduction to the LF and summarizes the main points made in [1]. It is org...
We present the design philosophy of a proof checker based on a notion of foundational proof certific...
International audienceCFS is the first practical code-based signature scheme. In the present paper, ...
AbstractIn this paper we develop the language theory underpinning the logical framework PLF. This la...
International audienceIn this paper we develop the language theory underpinning the logical framewor...
The Edinburgh Logical Framework LF was introduced both as a general theory of logics and as a metala...
A method for efficiently generating signatures for detecting library functions in executable files i...
Correct software requires compilers to work correctly. Especially code generation can be an error pr...
Guaranteeing correctness of compilation is a major precondition for correct software. Code generatio...
In this paper we overview the design and implementation of a language extension to C++ for abstracti...
AbstractCompilers that have been formally verified in theorem provers are often not directly usable ...
AbstractThis paper describes the Signature Compiler, which can compile an LF signature to a custom p...
This paper presents a logical framework derived from the Edinburgh Logical Framework (LF) [5] that c...
hB&Krrod tea g-obEa B^«'" This report describes a framework for representing and valid...
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on ...
This paper serves as an introduction to the LF and summarizes the main points made in [1]. It is org...
We present the design philosophy of a proof checker based on a notion of foundational proof certific...
International audienceCFS is the first practical code-based signature scheme. In the present paper, ...
AbstractIn this paper we develop the language theory underpinning the logical framework PLF. This la...
International audienceIn this paper we develop the language theory underpinning the logical framewor...
The Edinburgh Logical Framework LF was introduced both as a general theory of logics and as a metala...
A method for efficiently generating signatures for detecting library functions in executable files i...
Correct software requires compilers to work correctly. Especially code generation can be an error pr...
Guaranteeing correctness of compilation is a major precondition for correct software. Code generatio...
In this paper we overview the design and implementation of a language extension to C++ for abstracti...
AbstractCompilers that have been formally verified in theorem provers are often not directly usable ...
DOI
Add to ORKG