PrideMM: Second Order Model Checking for Memory Consistency Models

Cooksey, Simon; Harris, Sarah; Batty, Mark; Grigore, Radu; Janota, Mikoláš

doi:10.1007/978-3-030-54997-8_31

Cited by 4 publications

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. • qfm: it is a QBF solver [8] with counterexample guided refinement (based on sat-solver cadical [3] or minisat [12]), it allows us to deal with general QBF formulas in QCIR format.…”

Section: Resultsmentioning

confidence: 99%

“…It is natural to use QBF quantifiers to deal with propositional quantifiers of QCTL. Of course, QBF-solvers are not as efficient as SAT-solvers, but still much progress has been made and QBFsolvers have already been considered for model-checking, as in [11,8]. Here we propose several reductions depending on the way of dealing with nested temporal modalities, and we compare them with a prototype we implemented (connected to different solvers: Z3 [10], qfm [8], cqesto [15] and qfun [26]).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

QCTL model-checking with QBF solvers

Hossain

Laroussinie

2020

Preprint

View full text Add to dashboard Cite

Quantified CTL (QCTL) extends the temporal logic CTL with quantifications over atomic propositions. This extension is known to be very expressive: QCTL allows us to express complex properties over Kripke structures (it is as expressive as MSO). Several semantics exist for the quantifications: here, we work with the structure semantics, where the extra propositions label the Kripke structure (and not its execution tree), and the model-checking problem is known to be PSPACE-complete in this framework. We propose a new model-checking algorithm for QCTL based on a reduction to QBF. We consider several reduction strategies and we compare them with a prototype (based on several QBF solvers) on different examples.

show abstract

“…. • qfm: it is a QBF solver [8] with counterexample guided refinement (based on sat-solver cadical [3] or minisat [12]), it allows us to deal with general QBF formulas in QCIR format.…”

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

QCTL model-checking with QBF solvers

Hossain

Laroussinie

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…For future work, we plan to identify more applications. In particular, checking memory consistency models (Cooksey et al 2019) could be an interesting direction. Also, we intend to develop SOQBF solvers for potential practical applications.…”

Section: Discussionmentioning

confidence: 99%

Second-Order Quantified Boolean Logic

Jiang

2023

AAAI

View full text Add to dashboard Cite

Second-order quantified Boolean formulas (SOQBFs) generalize quantified Boolean formulas (QBFs) by admitting second-order quantifiers on function variables in addition to first-order quantifiers on atomic variables. Recent endeavors establish that the complexity of SOQBF satisfiability corresponds to the exponential-time hierarchy (EXPH), similar to that of QBF satisfiability corresponding to the polynomial-time hierarchy (PH). This fact reveals the succinct expression power of SOQBFs in encoding decision problems not efficiently doable by QBFs. In this paper, we investigate the second-order quantified Boolean logic with the following main results: First, we present a procedure of quantifier elimination converting SOQBFs to QBFs and a game interpretation of SOQBF semantics. Second, we devise a sound and complete refutation-proof system for SOQBF. Third, we develop an algorithm for countermodel extraction from a refutation proof. Finally, we show potential applications of SOQBFs in system design and multi-agent planning. With these advances, we anticipate practical tools for development.

show abstract

“…Other work in relaxed memory has shown that tooling is especially useful to researchers, architects, and language specifiers, enabling them to build intuitions experimentally [Alglave et al 2014;Batty et al 2011;Cooksey et al 2019;Paviotti et al 2020]. Unfortunately, it is not obvious that tools can be built for all thin-air-free models: the calculation of Pichon-Pharabod and Sewell [2016] does not have a termination proof for an arbitrary input; the enormous state space for the operational models of and Chakraborty and Vafeiadis [2019] is daunting for a tool builder-and as yet no tool exists for automatically evaluating these models.…”

Section: Related Workmentioning

confidence: 99%

The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency

Jeffrey¹,

Riely

Batty

et al. 2022

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

Program logics and semantics tell a pleasant story about sequential composition: when executing (S1;S2), we first execute S1 then S2. To improve performance, however, processors execute instructions out of order, and compilers reorder programs even more dramatically. By design, single-threaded systems cannot observe these reorderings; however, multiple-threaded systems can, making the story considerably less pleasant. A formal attempt to understand the resulting mess is known as a “relaxed memory model.” Prior models either fail to address sequential composition directly, or overly restrict processors and compilers, or permit nonsense thin-air behaviors which are unobservable in practice. To support sequential composition while targeting modern hardware, we enrich the standard event-based approach with preconditions and families of predicate transformers. When calculating the meaning of (S1; S2), the predicate transformer applied to the precondition of an event e from S2 is chosen based on the set of events in S1 upon which e depends. We apply this approach to two existing memory models.

show abstract

PrideMM: Second Order Model Checking for Memory Consistency Models

Cited by 4 publications

References 31 publications

QCTL model-checking with QBF solvers

QCTL model-checking with QBF solvers

Second-Order Quantified Boolean Logic

The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency

Contact Info

Product

Resources

About