A CHR-Based Solver for Weak Memory Behaviors - Modelisation Systemes Langages Access content directly
Conference Papers Year : 2016

A CHR-Based Solver for Weak Memory Behaviors


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.
Fichier principal
Vignette du fichier
paper-04.pdf (305.41 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-01318432 , version 1 (24-02-2023)


  • HAL Id : hal-01318432 , version 1


Allan Blanchard, 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⟩
270 View
10 Download


Gmail Mastodon Facebook X LinkedIn More