Weak-memory local reasoning
Program logics are formal logics designed to facilitate specification and correctness reasoning for software programs. Separation logic, a recent program logic for C-like programs, has found great success in automated verification due in large part to its embodiment of the principle of local reasoni...
Main Author: | Wehrman, Ian Anthony |
---|---|
Format: | Others |
Language: | en_US |
Published: |
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/2152/19475 |
Similar Items
-
A Machine-Checked, Type-Safe Model of Java Concurrency : Language, Virtual Machine, Memory Model, and Verified Compiler
Published: (2012) -
Proving Opacity of Transactional Memory with Early Release
by: Siek Konrad, et al.
Published: (2015-12-01) -
Architecting software concurrency
by: Dumitru Ciorba, et al.
Published: (2011-06-01) -
Performance Optimizations for Software Transactional Memory
Published: (2013) -
Formal framework for modelling and verifying globally asynchronous locally synchronous systems
by: Jebali, Fatma
Published: (2016)