Add to ORKGIn this paper we present a novel lightweight approach to validate compilers for synchronous languages. Instead of verifying a compiler for all input programs or providing a fixed suite of regression tests, we extend the compiler to generate a test-suite with high behavioral coverage and geared towards discovery of faults for every compiled artifact. We have implemented and evaluated our approach using a compiler from Lustre to C
AbstractWe report in this paper on the formal verification of a simple compiler for the C-like progr...
Three approaches to the problem of testing synchronous data-flow programs written in LUSTRE are pres...
AbstractThe paper presents approaches to the validation of optimizing compilers. The emphasis is on ...
In this paper we present a novel lightweight approach to validate compilers for synchronous language...
International audienceThe aim of this presentation is to demonstrate a scalable, modular, refinable ...
International audienceSynchronous data-flow languages are used as design approaches in developing em...
International audienceTranslation validation was introduced in the 90's by Pnueli et al. as a techni...
Synchronous data-flow languages have been used successfully for design and implementation of embedde...
Synchronous languages first appeared during the 80’s, in order to provide a mathematical model for s...
The specification, implementation, verification and validation of reactive software by means of the ...
International audienceFormal verification of software or hardware systems — be it by model checking,...
Though there has been remarkable progress on formally verified compilers in recent years, most of th...
International audienceGiven the complexity and sophistication of code generation and optimization al...
International audienceThe correct compilation of block diagram languages like Lustre, Scade, and a d...
International audienceTranslation validation was introduced as a technique to for-mally verify the c...
AbstractWe report in this paper on the formal verification of a simple compiler for the C-like progr...
Three approaches to the problem of testing synchronous data-flow programs written in LUSTRE are pres...
AbstractThe paper presents approaches to the validation of optimizing compilers. The emphasis is on ...
In this paper we present a novel lightweight approach to validate compilers for synchronous language...
International audienceThe aim of this presentation is to demonstrate a scalable, modular, refinable ...
International audienceSynchronous data-flow languages are used as design approaches in developing em...
International audienceTranslation validation was introduced in the 90's by Pnueli et al. as a techni...
Synchronous data-flow languages have been used successfully for design and implementation of embedde...
Synchronous languages first appeared during the 80’s, in order to provide a mathematical model for s...
The specification, implementation, verification and validation of reactive software by means of the ...
International audienceFormal verification of software or hardware systems — be it by model checking,...
Though there has been remarkable progress on formally verified compilers in recent years, most of th...
International audienceGiven the complexity and sophistication of code generation and optimization al...
International audienceThe correct compilation of block diagram languages like Lustre, Scade, and a d...
International audienceTranslation validation was introduced as a technique to for-mally verify the c...
AbstractWe report in this paper on the formal verification of a simple compiler for the C-like progr...
Three approaches to the problem of testing synchronous data-flow programs written in LUSTRE are pres...
AbstractThe paper presents approaches to the validation of optimizing compilers. The emphasis is on ...