912 search results - page 66 / 183 » Abstract Saturation-Based Inference |
150
Voted
CAV
2008
Springer
15 years 4 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...
100
click to vote
ESOP
2008
Springer
15 years 4 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 8 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 ...
132
Voted
RECOMB
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
122
Voted
CADE
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...