57 search results - page 5 / 12 » Model Checking Recursive Programs with Exact Predicate Abstr... |
112
click to vote
ICALP
2000
Springer
15 years 6 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...
118
Voted
POPL
2010
ACM
15 years 12 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
232
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
125
Voted
POPL
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
121
click to vote
CAV
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...