Sciweavers

26 search results - page 3 / 6
» Symbolic pruning of concurrent program executions
Sort
View
CAV
2009
Springer
184views Hardware» more  CAV 2009»
14 years 8 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta
EUROSYS
2010
ACM
14 years 4 months ago
Execution Synthesis: A Technique for Automated Software Debugging
Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn int...
Cristian Zamfir, George Candea
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
14 years 2 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
ASPLOS
2010
ACM
14 years 2 months ago
ConMem: detecting severe concurrency bugs through an effect-oriented approach
Multicore technology is making concurrent programs increasingly pervasive. Unfortunately, it is difficult to deliver reliable concurrent programs, because of the huge and non-det...
Wei Zhang, Chong Sun, Shan Lu
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...