PrideMM: A Solver for Relaxed Memory Models

12/08/2018
by   Simon Cooksey, et al.
0

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 ∃SO. 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.

READ FULL TEXT
research
10/28/2011

Modelling Constraint Solver Architecture Design as a Constraint Problem

Designing component-based constraint solvers is a complex problem. Some ...
research
04/30/2018

Benchmarking the Capabilities and Limitations of SAT Solvers in Defeating Obfuscation Schemes

In this paper, we investigate the strength of six different SAT solvers ...
research
07/18/2017

On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory

This is the first paper to propose a pure event structures model of rela...
research
04/21/2010

Modelling Immunological Memory

Accurate immunological models offer the possibility of performing highth...
research
06/11/2019

Polymorphic Relaxed Noninterference

Information-flow security typing statically preserves confidentiality by...
research
07/27/2023

EnSolver: Uncertainty-Aware CAPTCHA Solver Using Deep Ensembles

The popularity of text-based CAPTCHA as a security mechanism to protect ...
research
06/08/2020

RBF Solver for Quaternions Interpolation

In this paper we adapt the RBF Solver to work with quaternions by taking...

Please sign up or login with your details

Forgot password? Click here to reset