2911 search results - page 430 / 583 » A Logic of Graph Constraints |
105
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
105
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
91
Voted
VLSID
2005
IEEE
16 years 1 months ago
2005
IEEE
Synchronous design methods have intrinsic performance overheads due to their use of the global clock and timing assumptions. In future manufacturing processes not only may it beco...
85
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
103
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...