Sciweavers

4 search results - page 1 / 1
» Fast congruence closure and extensions
Sort
View
IANDC
2007
74views more  IANDC 2007»
13 years 11 months ago
Fast congruence closure and extensions
Robert Nieuwenhuis, Albert Oliveras
CAV
2004
Springer
108views Hardware» more  CAV 2004»
14 years 4 months ago
DPLL( T): Fast Decision Procedures
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more s...
Harald Ganzinger, George Hagen, Robert Nieuwenhuis...
POPL
2010
ACM
14 years 8 months ago
Structuring the verification of heap-manipulating programs
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...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
14 years 4 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner