101 search results - page 2 / 21 » Zap: Automated Theorem Proving for Software Analysis |
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
SPC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
CADE
2002
Springer
14 years 5 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...