315 search results - page 16 / 63 » Reasoning about Assignments in Recursive Data Structures |
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
We present a unified occlusion model for object instance detection under arbitrary viewpoint. Whereas previous approaches primarily modeled local coherency of occlusions or attem...
TACAS
2007
Springer
15 years 5 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
100
click to vote
KDD
2008
ACM
16 years 2 days ago
2008
ACM
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
128
click to vote
SIGSOFT
2006
ACM
15 years 5 months ago
2006
ACM
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
106
click to vote
CSL
2010
Springer
15 years 24 days ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...