139
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
114
Voted
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...
100
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
134
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
105
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...