777 search results - page 71 / 156 » Model Checking with Formula-Dependent Abstract Models |
FMCAD
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
SPIN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
SPIN
2007
Springer
15 years 3 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
119
click to vote
ESAW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper surveys the state-of-the-art in developing multi-agent systems, and sets out to answer the questions: "what are the key current issues in developing multi...