Verifying a local generic solver in Coq

Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

14 Zitate (Scopus)

Abstract

Fixpoint engines are the core components of program analysis tools and compilers. If these tools are to be trusted, special attention should be paid also to the correctness of such solvers. In this paper we consider the local generic fixpoint solver RLD which can be applied to constraint systems x ⊇ fx, x ∈ V, over some lattice D where the right-hand sides f x are given as arbitrary functions implemented in some specification language. The verification of this algorithm is challenging, because it uses higher-order functions and relies on side effects to track variable dependences as they are encountered dynamically during fixpoint iterations. Here, we present a correctness proof of this algorithm which has been formalized by means of the interactive proof assistant Coq.

OriginalspracheEnglisch
TitelStatic Analysis - 17th International Symposium, SAS 2010, Proceedings
Seiten340-355
Seitenumfang16
DOIs
PublikationsstatusVeröffentlicht - 2010
Veranstaltung17th International Static Analysis Symposium, SAS 2010 - Perpignan, Frankreich
Dauer: 14 Sept. 201016 Sept. 2010

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band6337 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz17th International Static Analysis Symposium, SAS 2010
Land/GebietFrankreich
OrtPerpignan
Zeitraum14/09/1016/09/10

Fingerprint

Untersuchen Sie die Forschungsthemen von „Verifying a local generic solver in Coq“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren