### Abstract

The top-down solver (TD) is a local and generic fixpoint algorithm used for abstract interpretation. Being local means it only evaluates equations required for the computation of the value of some initially queried unknown, while being generic means that it is applicable for arbitrary equation systems where right-hand sides are considered as black-box functions. To avoid unnecessary evaluations of right-hand sides, the TD collects stable unknowns that need not be re-evaluated. This optimization requires the additional tracking of dependencies between unknowns and a non-local destabilization mechanism to assure the re-evaluation of previously stable unknowns that were affected by a changed value. Due to the recursive evaluation strategy and the non-local destabilization mechanism of the TD, its correctness is non-obvious. To provide a formal proof of its partial correctness, we employ the insight that the TD can be considered an optimized version of a considerably simpler recursive fixpoint algorithm. Following this insight, we first prove the partial correctness of the simpler recursive fixpoint algorithm, the plain TD. Then, we transfer the statement of partial correctness to the TD by establishing the equivalence of both algorithms concerning both their termination behavior and their computed result.

### License

BSD License

### Topics

- Computer science/Algorithms

### Session Top_Down_Solver

- Basics
- TD_plain
- TD_equiv
- Example

## Cite

×

Top_Down_Solver-AFP

    @article{Top_Down_Solver-AFP,
      author  = {Yannick Stade and Sarah Tilscher and Helmut Seidl},
      title   = {Partial Correctness of the Top-Down Solver},
      journal = {Archive of Formal Proofs},
      month   = {May},
      year    = {2024},
      note    = {\url{https://isa-afp.org/entries/Top_Down_Solver.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest