74 search results - page 9 / 15 » Program verification using templates over predicate abstract... |
85
Voted
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
CAV
2010
Springer
15 years 2 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
106
Voted
CADE
2002
Springer
15 years 12 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 ...
AMAST
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Vx86 is the first static analyzer for sequential Intel x86 assembler code using automated deductive verification. It proves the correctness of assembler code against func...
ESOP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...