114 search results - page 9 / 23 » Model-Checking Systems with Unbounded Variables without Abst... |
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
CEC
2008
IEEE
14 years 3 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...
POPL
2002
ACM
14 years 9 months ago
2002
ACM
e Abstraction for Software Verification Cormac Flanagan Shaz Qadeer Compaq Systems Research Center 130 Lytton Ave, Palo Alto, CA 94301 Software verification is an important and di...
CAV
2007
Springer
14 years 25 days ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
ICSE
2000
IEEE-ACM
14 years 12 days ago
2000
IEEE-ACM
This paper describes an experiment to use the Spin model checking system to support automated verification of time partitioning in the Honeywell DEOS real-time scheduling kernel. ...