International audienceStatic analyzers based on abstract interpretation are complex pieces of software implementing delicate algorithms. Even if static analysis techniques are well understood, their implementation on real languages is still error-prone. This paper presents a formal verification using the Coq proof assistant: a formalization of a value analysis (based on abstract interpretation), and a soundness proof of the value analysis. The formalization relies on generic interfaces. The mechanized proof is facilitated by a translation validation of a Bourdoncle fixpoint iterator. The work has been integrated into the CompCert verified C-compiler. Our verified analysis directly operates over an intermediate language of the compiler havin...
International audienceThis invited talk describes the logical foundations and the status of the ongo...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It ...
International audienceStatic analyzers based on abstract interpretation are complex pieces of softwa...
International audienceStatic analyzers based on abstract interpretation are complex pieces of softwa...
International audienceStatic analyzers based on abstract interpretation are complex pieces of softwa...
Abstract. Static analyzers based on abstract interpretation are complex pieces of software implement...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
International audienceThis paper reports on the design and soundness proof, using the Coq proof assi...
International audienceThis paper reports on the design and soundness proof, using the Coq proof assi...
Abstract. This paper presents the formal verification of a compiler front-end that translates a subs...
International audienceThis invited talk describes the logical foundations and the status of the ongo...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It ...
International audienceStatic analyzers based on abstract interpretation are complex pieces of softwa...
International audienceStatic analyzers based on abstract interpretation are complex pieces of softwa...
International audienceStatic analyzers based on abstract interpretation are complex pieces of softwa...
Abstract. Static analyzers based on abstract interpretation are complex pieces of software implement...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
National audienceA static analyzer aims at automatically deducing program properties by examining it...
International audienceThis paper reports on the design and soundness proof, using the Coq proof assi...
International audienceThis paper reports on the design and soundness proof, using the Coq proof assi...
Abstract. This paper presents the formal verification of a compiler front-end that translates a subs...
International audienceThis invited talk describes the logical foundations and the status of the ongo...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It ...