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...
Main Authors: | D'Silva, V, Haller, L, Kroening, D |
---|---|
Drugi avtorji: | Miné, A |
Format: | Conference item |
Izdano: |
Springer
2012
|
Podobne knjige/članki
-
Satisfiability Solvers are Static Analysers
od: D'Silva, V, et al.
Izdano: (2012) -
Optimization of Boolean satisfiability solver by caching intermediate results
od: S. Vartanov, et al.
Izdano: (2018-10-01) -
A framework for Satisfiability Modulo Theories.
od: Kroening, D, et al.
Izdano: (2009) -
Bit‐level evaluation of piccolo block cipher by satisfiability problem solver
od: Shion Utsumi, et al.
Izdano: (2023-07-01) -
Verifying the structure and behavior in UML/OCL models using satisfiability solvers
od: Nils Przigoda, et al.
Izdano: (2016-11-01)