227 search results - page 31 / 46 » Bounded Model Checking of Concurrent Programs |
149
click to vote
SIGSOFT
2007
ACM
16 years 5 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...
254
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
137
click to vote
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
127
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
175
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...