1018 search results - page 63 / 204 » Abstraction and Refinement in Model Checking |
ICTAC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
SPIN
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
ADVIS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In many practical business process modelling scenarios using Petri nets, the resultant model does not have a single input place and a single output place. In particular, ...
AAMAS
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. This paper gives an overview of our recent work on an approach to verifying multi-agent programs. We automatically translate multi-agent systems programmed in the logic-b...
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...