861 search results - page 23 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
137
click to vote
SIGCOMM
2010
ACM
15 years 2 months ago
2010
ACM
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
128
click to vote
LOPSTR
2009
Springer
15 years 9 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
141
click to vote
ENTCS
2006
15 years 2 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
124
click to vote
IUI
2004
ACM
15 years 8 months ago
2004
ACM
Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applicatio...
121
click to vote
PLDI
2011
ACM
14 years 5 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...