3 search results - page 1 / 1 » Inferring Congruence Equations Using SAT |
CAV
2008
Springer
13 years 6 months ago
2008
Springer
This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of 2. The technique is an amalgam of SAT-solving, wh...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
POPL
1994
ACM
13 years 9 months ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...