24
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      PrideMM: A Solver for Relaxed Memory Models

      Preprint
      , , , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          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.

          Related collections

          Most cited references29

          • Record: found
          • Abstract: not found
          • Article: not found

          GRASP: a search algorithm for propositional satisfiability

            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            Event structures

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              The Java memory model

                Bookmark

                Author and article information

                Journal
                07 December 2018
                Article
                1901.00428
                70ff9f8d-aebd-4b63-80dd-041ff90ae3a9

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                cs.LO cs.PL

                Theoretical computer science,Programming languages
                Theoretical computer science, Programming languages

                Comments

                Comment on this article