Abstract
A static analyzer aims at automatically deducing program pr operties by examining its source code. Proving the correctness of an analyzer is ba sed on semantic properties, and becomes difficult to ensure when complex analysis technique s are involved. We propose to adapt the general theory of static analysis by abstract interpret ation to the framework of constructive logic. Implementing this formalism into the Coq proof assis tant then allows for automatic extraction of certified analyzers. We focus here on a simple i mperative language and present the computation of fixpoints by widening/narrowing and synt ax-directed iteration techniques. MOTS-CLES :Analyse statique, interpretation abstraite, calcul de poi nt fixe, logique constructive, assistant de preuve
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
