116 search results - page 5 / 24 » Automatic Abstraction for Intervals Using Boolean Formulae |
108
click to vote
CAV
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
SAS
2007
Springer
15 years 3 months ago
2007
Springer
abstraction on real-valued programs David Monniaux Laboratoire d’informatique de l’´Ecole normale sup´erieure 45, rue d’Ulm, 75230 Paris cedex 5, France June 30, 2007 In t...
107
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
TACAS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Model checking suffers not only from the state-space explosion problem, but also from the environment modeling problem: how can one create an accurate enough model of the...
SEKE
2005
Springer
15 years 3 months ago
2005
Springer
The paper presents an approach to support run-time verification of software systems that combines two existing tools, Prospec and Java-MaC, into a single framework. Prospec can be...