A faster solver for general systems of equations
Science of Computer Programming
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
GENA - A Tool for Generating Prolog Analyzers from Specifications
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Theoretical Computer Science - Foundations of software science and computation structures
A Universal Top-Down Fixpoint Algorithm
A Universal Top-Down Fixpoint Algorithm
Computationally sound secrecy proofs by mechanized flow analysis
Proceedings of the 13th ACM conference on Computer and communications security
Region Analysis for Race Detection
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Elimination of ghost variables in program logics
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
A uniform and certified approach for two static analyses
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
On monadic parametricity of second-order functionals
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
How to combine widening and narrowing for non-monotonic systems of equations
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |
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 fx 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.