On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency

Conference item

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.

Authors: Horn, A; Kroening, D

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Springer
• Host title: Lecture Notes in Computer Science: FORTE 2015: Formal Techniques for Distributed Objects, Components, and Systems
• Journal: Lecture Notes in Computer Science: FORTE 2015: Formal Techniques for Distributed Objects, Components, and Systems
• Volume: 9039
• Pages: 19-34
• Publication date: 2015-01-01
• DOI: 10.1007/978-3-319-19195-9_2
• ISSN: 0302-9743 and 1611-3349
• ISBN: 9783319191942
• Keywords: cs.LO; SBTMR