Sarah Harris’s research while affiliated with University of Kent and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (2)


Fig. 2. LB+ctrl, an axiomatic execution of it, and an axiom that forbids it.
Fig. 4. Comparison of PrideMM's performance in contrast to Herd7 [3].
PrideMM: Second Order Model Checking for Memory Consistency Models
  • Chapter
  • Full-text available

August 2020

·

72 Reads

·

3 Citations

Lecture Notes in Computer Science

Simon Cooksey

·

Sarah Harris

·

Mark Batty

·

[...]

·

We present PrideMM, an efficient model checker for second-order logic enabled by recent breakthroughs in quantified satisfiability solvers. We argue that second-order logic sits at a sweet spot: constrained enough to enable practical solving, yet expressive enough to cover an important class of problems not amenable to (non-quantified) satisfiability solvers. To the best of our knowledge PrideMM is the first automated model checker for second-order logic formulae.

Download

Figure 5: Comparison between Herd and PrideMM on the store buffer problem.
PrideMM: A Solver for Relaxed Memory Models

December 2018

·

49 Reads

Relaxed memory models are notoriously delicate. To ease their study, several ad hoc simulators have been developed for axiomatic memory models. We show how axiomatic memory models can be simulated using a solver for \existsSO. Further, we show how memory models based on event structures can be simulated using a solver for MSO. Finally, we present a solver for SO, built on top of QBF solvers.