113 search results - page 12 / 23 » Semantic Reduction of Thread Interleavings in Concurrent Pro... |
CSFW
1998
IEEE
15 years 1 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
ASPLOS
2011
ACM
14 years 1 months ago
2011
ACM
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
101
click to vote
PPOPP
2011
ACM
14 years 14 days ago
2011
ACM
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
SPIN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
POPL
2004
ACM
15 years 3 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...