Sciweavers

227 search results - page 9 / 46
» Bounded Model Checking of Concurrent Programs
Sort
View
91
Voted
PLDI
2004
ACM
15 years 3 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
85
Voted
CAV
2003
Springer
160views Hardware» more  CAV 2003»
15 years 2 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
VMCAI
2009
Springer
15 years 4 months ago
An Abort-Aware Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
Kousha Etessami, Patrice Godefroid
ACSD
2008
IEEE
102views Hardware» more  ACSD 2008»
15 years 4 months ago
Performing causality analysis by bounded model checking
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...
Klaus Schneider, Jens Brandt
CADE
2002
Springer
15 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...