118 search results - page 12 / 24 » Word-Level Sequential Memory Abstraction for Model Checking |
TASE
2007
IEEE
15 years 3 months ago
2007
IEEE
Software has been under scrutiny by the verification community from various angles in the recent past. There are two major algorithmic approaches to ensure the correctness of and...
ILC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists. The properties we consider n...
ATVA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
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...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most o...