12981 search results - page 43 / 2597 » Model Checking and Abstraction |
90
Voted
DALT
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bd...
90
Voted
KBSE
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
CAV
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...
121
click to vote
CADE
2012
Springer
13 years 3 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
116
Voted
ICTAC
2005
Springer
15 years 6 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...