• Publications
  • Influence
Optimal stateless model checking under the release-acquire semantics
TLDR
We present a framework for the efficient application of stateless model checking (SMC) to concurrent programs running under the Release-Acquire fragment of the C/C++11 memory model. Expand
  • 23
  • 7
  • PDF
A Load-Buffer Semantics for Total Store Ordering
TLDR
We address the problem of verifying safety properties of concurrent programs running over the Total Store Order (TSO) memory model. Expand
  • 8
  • 3
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO
TLDR
We present a method for automatic fence insertion in concurrent programs running under weak memory models that provides a novel notion of correctness, called persistence, that compares the behavior of the program under the weak memory semantics with that under the classical interleaving SC semantics. Expand
  • 26
  • 1
  • PDF
Context-Bounded Analysis for POWER
TLDR
We propose an under-approximate reachability analysis algorithm for programs running under the POWER memory model, in the spirit of the work on context-bounded analysis intitiated by Qadeer et al. in 2011 for the TSO memory model. Expand
  • 18
  • 1
  • PDF
The Benefits of Duality in Verifying Concurrent Programs under TSO
TLDR
We address the problem of verifying safety properties of concurrent programs running over the TSO memory model. Expand
  • 15
  • 1
  • PDF
Precise and Sound Automatic Fence Insertion Procedure under PSO
TLDR
We give a sound and complete procedure for fence insertion for concurrent finite-state programs running under the PSO memory model. Expand
  • 16
  • 1
  • PDF
Optimal stateless model checking for reads-from equivalence under sequential consistency
TLDR
We present the first SMC algorithm for SC that is both optimal and efficient in practice, meaning that it spends polynomial time per equivalence class on all programs that we have tried. Expand
  • 7
  • 1
  • PDF
Rule-Based Attribute-Oriented Induction for Knowledge Discovery
TLDR
This paper introduces a rule-based Attribute-Oriented (AO) Induction method on rule- based concept hierarchies that can be constructed from generalization rules. Expand
  • 2
An Efficient Algorithm for Discovering Maximum Length Frequent Itemsets
TLDR
This paper addresses a frequent itemset discovery problem that is important in many data mining applications. Expand
  • 2
Replacing Store Buffers by Load Buffers in TSO
TLDR
We consider the weak memory model of Total Store Ordering (TSO), an unbounded buffer is inserted between each process and the shared memory. Expand
  • 1