Add to ORKGAbstract: The paper presents the proof of correctness of an experimental supercompiler HOSC dealing with higher-order functions.Note: Research direction:Programming, parallel computing, multimediaRussia
National audienceNous présentons les premiers résultats de la formalisation de propriétés du calcul ...
Abstract. This paper outlines a formal model of the Intel IA-64 architecture, and explains how this ...
AbstractPrimitives are basic means provided by a microkernel to implementors of operating system ser...
Abstract: The paper contributes the proof of termination of an experimental supercompiler ...
Abstract: The paper describes the internal structure of HOSC, an experimental supercompile...
Abstract: The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental...
piler for Martin-Löf ’s type-theory The paper describes the design and implementation of a certifyi...
Abstract: The paper describes the design and implementation of a certifying supercompiler ...
Part of the Computer Sciences Commons This is brought to you for free and open access by the Theses ...
The current growing interest in supercomputers will undoubtedly give rise to the question of how to ...
Abstract. The paper describes the design and implementation of a cer-tifying supercompiler TT Lite S...
We study a correctness property of programs in a subset of Fortran X3H5, a control-parallel extensio...
Theorem proving allows the formal verification of the correctness of very large systems. In order to...
The Completion Functions Approach was proposed in [HSG98] as a systematic way to decompose the proof...
International audienceWe consider a recent publication on higher-order process calculi and describe ...
National audienceNous présentons les premiers résultats de la formalisation de propriétés du calcul ...
Abstract. This paper outlines a formal model of the Intel IA-64 architecture, and explains how this ...
AbstractPrimitives are basic means provided by a microkernel to implementors of operating system ser...
Abstract: The paper contributes the proof of termination of an experimental supercompiler ...
Abstract: The paper describes the internal structure of HOSC, an experimental supercompile...
Abstract: The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental...
piler for Martin-Löf ’s type-theory The paper describes the design and implementation of a certifyi...
Abstract: The paper describes the design and implementation of a certifying supercompiler ...
Part of the Computer Sciences Commons This is brought to you for free and open access by the Theses ...
The current growing interest in supercomputers will undoubtedly give rise to the question of how to ...
Abstract. The paper describes the design and implementation of a cer-tifying supercompiler TT Lite S...
We study a correctness property of programs in a subset of Fortran X3H5, a control-parallel extensio...
Theorem proving allows the formal verification of the correctness of very large systems. In order to...
The Completion Functions Approach was proposed in [HSG98] as a systematic way to decompose the proof...
International audienceWe consider a recent publication on higher-order process calculi and describe ...
National audienceNous présentons les premiers résultats de la formalisation de propriétés du calcul ...
Abstract. This paper outlines a formal model of the Intel IA-64 architecture, and explains how this ...
AbstractPrimitives are basic means provided by a microkernel to implementors of operating system ser...