Parametric and Sliced Causality

Chen, Feng; Roşu, Grigore

doi:10.1007/978-3-540-73368-3_27

Cited by 41 publications

(36 citation statements)

References 23 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both analyses use test amplification in the sense that they examine a single execution but are capable of detecting atomicity violations occurring in other possible interleavings. A different instance of test amplification appears in [7], which proposes a relaxation of the classical happenbefore causality partial order [16,22] to admit a greater number of compatible interleavings. This relaxation amplifies the partial order to a larger space of possible executions, thus opening subsequent analyses to detect property violations in more interleavings.…”

Section: Related Workmentioning

confidence: 99%

Verifying GPU kernels by test amplification

Leung

Gupta

Agarwal

et al. 2012

Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

We present a novel technique for verifying properties of data parallel GPU programs via test amplification. The key insight behind our work is that we can use the technique of static information flow to amplify the result of a single test execution over the set of all inputs and interleavings that affect the property being verified. We empirically demonstrate the effectiveness of test amplification for verifying race-freedom and determinism over a large number of standard GPU kernels, by showing that the result of verifying a single dynamic execution can be amplified over the massive space of possible data inputs and thread interleavings.

show abstract

Section: Related Workmentioning

confidence: 99%

Verifying GPU kernels by test amplification

Leung

Gupta

Agarwal

et al. 2012

Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

show abstract

“…We have mentioned in Section 1 some of the static methods [3,4], runtime monitoring [5,1,6,7,8], and runtime prediction [9,2,10,11,12,13] for detecting atomicity violations. Lu et al [1] used access interleaving invariants to capture patterns of test runs and then monitor production runs for detecting three-access atomicity violations.…”

Section: Related Workmentioning

confidence: 99%

“…In contrast, runtime prediction aims at detecting atomicity violations in all feasible interleavings of events of the given trace. In other words, even if no violation exists in that trace, but an alternative interleaving is erroneous, a predictive method [9,2,10,11,12,13] may be able to catch it without actually re-running the test.…”

Section: Introductionmentioning

confidence: 99%

“…Although there have been several predictive methods in the literature, they either suffer from imprecision as a result of conservative modeling (or no modeling at all) of the program data flow and consequently many false negatives [9,2,10], or suffer from a very limited coverage of interleavings due to trace-based under-approximations [11,12,13]. Previous efforts [4,2,10], for instance, focus on the control paths and model only locks provided that they obey the nested locking discipline.…”

Section: Introductionmentioning

confidence: 99%

“…Methods using happens-before causalities [11,12] often guarantee no bogus errors, but tend to miss many real ones. Fig.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Trace-Based Symbolic Analysis for Atomicity Violations

Wang¹,

Limaye

Ganai³

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trace and the program source code to construct a symbolic predictive model, which captures a large set of alternative interleavings of the events of the given trace. We use precise symbolic reasoning with a satisfiability modulo theory (SMT) solver to check the feasible interleavings for atomicity violations. Our algorithm differs from the existing methods in that all reported atomicity violations can appear in the actual program execution; and at the same time the feasible interleavings analyzed by our model are significantly more than other predictive models that guarantee the absence of false alarms.

show abstract

Structural testing for message‐passing concurrent programs: an extended test model

Souza

Zaluska

2012

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYDeveloping high-quality, error-free message-passing concurrent programs is not trivial. Although a number of different primitives with associated semantics are available to assist such development, they often increase the complexity of the testing process. In this paper, we extend our previous test model for messagepassing programs and present new structural testing criteria, taking into account additional features used in this paradigm, such as collective communication, non-blocking sends, distinct semantics for non-blocking receives, and persistent operations. Our new model also recognizes that sender primitives cannot always be matched with every receive primitive. This improvement allows us to remove statically a significant number of infeasible synchronization edges that would otherwise have to be analyzed later by the tester. In this paper, the test model is presented using the Message-Passing Interface standard; however, our new model has been designed to be flexible, and it can be configured to support a range of different messagepassing environments or languages. We have carried out case studies showing the applicability of the new test model to represent message-passing programs and also to reveal errors, mainly those errors related to inter-process communication. In addition to increasing the number of features supported by the test model, we have also reduced the overall cost of testing significantly. Our case studies suggest that the number of synchronization edges can be reduced by up to 93%, mainly by eliminating infeasible edges between unmatchable communication primitives. The main contribution of the paper is to present a more flexible test model that provides improved coverage for message-passing programs and at the same time reduces the cost of testing significantly.

show abstract

Parametric and Sliced Causality

Cited by 41 publications

References 23 publications

Verifying GPU kernels by test amplification

Verifying GPU kernels by test amplification

Trace-Based Symbolic Analysis for Atomicity Violations

Structural testing for message‐passing concurrent programs: an extended test model

Contact Info

Product

Resources

About