Automatic Verification and Synthesis for Weak Memory Models
AssigneeInternational Business Machines Corporation
InventorsMichael Kuperstein, Martin Vechev, Eran Yahav
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsMichael Kuperstein, Martin Vechev, Eran Yahav
Estimating the term…
Techniques are provided for automatic verification and inference of memory fences in concurrent programs that can bound the store buffers that are used to model relaxed memory models. A method is provided for determining whether a program employing a relaxed memory model satisfies a safety specification. An abstract memory model is obtained of the relaxed memory model. The abstract memory model represents concrete program states of the program as a finite number of abstract states. The safety specification is evaluated for the program on the abstract memory model having the finite number of abstract states. Fence positions at one or more locations can be determined to ensure that the safety specification is satisfied.
A method for determining whether a program satisfies a safety specification, wherein said program employs a relaxed memory model, said method comprising:
A system for determining whether a program satisfies a safety specification, wherein said program employs a relaxed memory model, said system comprising:
An article of manufacture for determining whether a program satisfies a safety specification, wherein said program employs a relaxed memory model, said article of manufacture comprising a tangible machine readable recordable medium containing one or more programs which when executed implement the steps of:
Dependencies are inferred from the claim text.