A CHR-Based Solver for Weak Memory Behaviors

Abstract : With the wide expansion of multiprocessor architectures, the analysis and reasoning for programs under weak memory models has become an important concern. This work presents an original constraint solver for detecting program behaviors respecting a particular memory model. It is implemented in Prolog using CHR (Constraint Handling Rules). The CHR formalism provides a convenient generic solution for specifying memory models, that benefits from the existing optimized implementations of CHR and can be easily extended to new models. We briefly present the solver design, illustrate the encoding of memory model constraints in CHR and discuss the benefits and limitations of the proposal.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01318432
Contributor : Frédéric Loulergue <>
Submitted on : Thursday, May 19, 2016 - 3:43:34 PM
Last modification on : Wednesday, January 23, 2019 - 2:38:28 PM

Identifiers

  • HAL Id : hal-01318432, version 1

Citation

Blanchard Allan, Nikolai Kosmatov, Frédéric Loulergue. A CHR-Based Solver for Weak Memory Behaviors. 7th Workshop on Constraint Solvers in Testing, Verification, and Analysis (CSTVA), Jul 2016, Saarbrücken, Germany. ⟨hal-01318432⟩

Share

Metrics

Record views

268