9 search results - page 2 / 2 » Over-Approximating Boolean Programs with Unbounded Thread Cr... |
CAV
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We consider the verification of parameterized Boolean proabstractions of shared-memory concurrent programs with an unbounded number of threads. We propose that such prog...
SEFM
2009
IEEE
13 years 11 months ago
2009
IEEE
—In this paper we present ¼heckmate, a generic static analyzer of Java multithreaded programs based on the interpretation theory. It supports all the most relevant features of J...
CAV
2010
Springer
13 years 8 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
ISCA
2007
IEEE
13 years 11 months ago
2007
IEEE
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...