1096 search results - page 89 / 220 » Abstract Canonical Inference |
POPL
2010
ACM
15 years 7 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
We present an Abstract Interpretation-based framework for automatically analyzing programs containing digital filters. Our framework allows refining existing analyses so that the...
107
click to vote
CAV
2008
Springer
14 years 12 months ago
2008
Springer
Termination of a heap-manipulating program generally depends on preconditions that express heap assumptions (i.e., assertions describing reachability, aliasing, separation and shar...
ESOP
2008
Springer
14 years 11 months ago
2008
Springer
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
ATVA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...