Skip to Main content Skip to Navigation
Conference papers

On Partial Order Semantics for SAT/SMT-Based Symbolic Encodings of Weak Memory Concurrency

Abstract : Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in partial order semantics as a theoretical foundation for formal verification techniques. Among these, symbolic techniques have been shown to be particularly effective at finding concurrency-related bugs because they can leverage highly optimized decision procedures such as SAT/SMT solvers. This paper gives new fundamental results on partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency. In particular, we give the theoretical basis for a decision procedure that can handle a fragment of concurrent programs endowed with least fixed point operators. In addition, we show that a certain partial order semantics of relaxed sequential consistency is equivalent to the conjunction of three extensively studied weak memory axioms by Alglave et al. An important consequence of this equivalence is an asymptotically smaller symbolic encoding for bounded model checking which has only a quadratic number of partial order constraints compared to the state-of-the-art cubic-size encoding.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01767325
Contributor : Hal Ifip <>
Submitted on : Monday, April 16, 2018 - 10:18:38 AM
Last modification on : Monday, April 16, 2018 - 10:20:27 AM

File

978-3-319-19195-9_2_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Alex Horn, Daniel Kroening. On Partial Order Semantics for SAT/SMT-Based Symbolic Encodings of Weak Memory Concurrency. 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2015, Grenoble, France. pp.19-34, ⟨10.1007/978-3-319-19195-9_2⟩. ⟨hal-01767325⟩

Share

Metrics

Record views

85

Files downloads

303