150 search results - page 13 / 30 » Symbolic Model Checking for Simply-Timed Systems |
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
IANDC
2011
13 years 2 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
DSN
2002
IEEE
14 years 11 days ago
2002
IEEE
This paper presents the experiences of using a symbolic model checker to check the safety properties of a servoloop control system. Symbolic model checking has been shown to be be...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...