Sciweavers

113 search results - page 11 / 23
» Semantic Reduction of Thread Interleavings in Concurrent Pro...
Sort
View
SIGSOFT
2009
ACM
15 years 10 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
STTT
2010
97views more  STTT 2010»
14 years 8 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...
LOGCOM
2007
126views more  LOGCOM 2007»
14 years 9 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
ESOP
2010
Springer
15 years 7 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
IPPS
2003
IEEE
15 years 2 months ago
Using Incorrect Speculation to Prefetch Data in a Concurrent Multithreaded Processor
Concurrent multithreaded architectures exploit both instruction-level and thread-level parallelism through a combination of branch prediction and thread-level control speculation. ...
Ying Chen, Resit Sendag, David J. Lilja