1224 search results - page 80 / 245 » Theory decision by decomposition |
106
click to vote
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
107
Voted
CICLING
2008
Springer
15 years 2 months ago
2008
Springer
In the project we describe, we have taken a basic core of about 5000 synsets in WordNet that are the most frequently used, and we have categorized these into sixteen broad categori...
104
Voted
FMCAD
2006
Springer
15 years 4 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
110
click to vote
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
101
Voted
GRC
2005
IEEE
15 years 6 months ago
2005
IEEE
— Decision rules generated from reducts can fully describe a data set. We introduce a new method of evaluating rules by taking advantage of rough sets theory. We consider rules g...