55 search results - page 5 / 11 » Hardness for Explicit State Software Model Checking Benchmar... |
CEC
2008
IEEE
14 years 2 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...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
SPIN
2009
Springer
14 years 2 months ago
2009
Springer
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
ATVA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real t...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...