798 search results - page 9 / 160 » Proving More Properties with Bounded Model Checking |
IFM
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
DAGSTUHL
2006
13 years 9 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
ISVLSI
2007
IEEE
14 years 1 months ago
2007
IEEE
Formal verification has become an important step in circuit and system design. A prominent technique is Bounded Model Checking (BMC) which is widely used in industry. In BMC it i...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
FORTE
2010
13 years 9 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...