Satisfiability solvers are static analysers

This paper shows that several propositional satisfiability algorithms compute approximations of fixed points using lattice-based abstractions. The Boolean Constraint Propagation algorithm (bcp) is a greatest fixed point computation over a lattice of partial assignments. The original algorithm of Dav...

Popoln opis

Bibliografske podrobnosti
Main Authors: D'Silva, V, Haller, L, Kroening, D
Drugi avtorji: Miné, A
Format: Conference item
Izdano: Springer 2012

Podobne knjige/članki