Sciweavers

337 search results - page 10 / 68
» Predicate abstraction for software verification
Sort
View
SPIN
2004
Springer
15 years 5 months ago
Model-Driven Software Verification
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...
Gerard J. Holzmann, Rajeev Joshi
FSTTCS
2010
Springer
14 years 10 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
103
Voted
POPL
2010
ACM
15 years 9 months ago
Dependent Types from Counterexamples
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...
Tachio Terauchi
SIGSOFT
1996
ACM
15 years 4 months ago
Abstracting Dependencies between Software Configuration Items
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
Carl A. Gunter
105
Voted
CADE
2007
Springer
16 years 22 days ago
Inferring Invariants by Symbolic Execution
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
Benjamin Weiß, Peter H. Schmitt