SMT Solving for the Theory of Ordering Constraints

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Workshop on Languages and Compilers for Parallel Computing

• Publication date

  2015-09-09

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-319-29778-1_18
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Stateless model checking concurrent programs with maximal causality reduction

  2015cited by this paper
• GPredict: Generic Predictive Concurrency Analysis

  2015cited by this paper
• Answer Set Programming as SAT modulo Acyclicity

  2014cited by this paper
• SAT Modulo Monotonic Theories

  2014cited by this paper
• Sherlock: scalable deadlock detection for concurrent programs

  2014cited by this paper
• Maximal sound predictive race detection with control flow abstraction

  2014influential reference
• SAT Modulo Graphs: Acyclicity

  2014cited by this paper
• CLAP: recording local executions to reproduce concurrency failures

  2013cited by this paper
• Solving Difference Constraints over Modular Arithmetic

  2013cited by this paper
• Con2colic testing

  2013cited by this paper
• Predicting null-pointer dereferences in concurrent programs

  2012cited by this paper
• Sound predictive race detection in polynomial time

  2012cited by this paper
• Generating Data Race Witnesses by an SMT-Based Analysis

  2011cited by this paper
• On interference abstractions

  2011cited by this paper
• Persuasive prediction of concurrency access anomalies

  2011cited by this paper
• Trace-Based Symbolic Analysis for Atomicity Violations

  2010cited by this paper
• The OpenSMT Solver

  2010cited by this paper
• An interpolating decision procedure for transitive relations with uninterpreted functions

  2009cited by this paper
• An Interpolating Decision Procedure for Transitive Relations with Uninterpreted Functions

  2009cited by this paper
• FastTrack: efficient and precise dynamic race detection

  2009cited by this paper
• Offline symbolic analysis for multi-processor execution replay

  2009cited by this paper
• Z3: An Efficient SMT Solver

  2008cited by this paper
• A Decision Procedure for Bit-Vectors and Arrays

  2007cited by this paper
• The YICES SMT Solver

  2006cited by this paper
• Finite Instantiations for Integer Difference Logic

  2006cited by this paper
• Fast and Flexible Difference Constraint Propagation for DPLL(T)

  2006cited by this paper
• DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic

  2005influential reference
• DPLL( T): Fast Decision Procedures

  2004cited by this paper
• Eraser: a dynamic data race detector for multi-threaded programs

  1997cited by this paper
• Depth-First Search and Linear Graph Algorithms

  1972cited by this paper

• Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models

  2023influential citation
• Satisfiability modulo ordering consistency theory for multi-threaded program verification

  2021cites this paper
• Toward Domain-Specific Solvers for Distributed Consistency

  2019cites this paper