ATVA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
Message Sequence Charts (MSCs) and High-level Message Sequence Charts (HMSCs) are formalisms used to describe scenarios of message passing protocols. We propose using Allen’s log...
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
ATVA
2007
Springer
13 years 10 months ago
2007
Springer