118 search results - page 11 / 24 » Verifying Correctness of Transactional Memories |
ICFP
2006
ACM
14 years 6 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
VMCAI
2009
Springer
14 years 1 months ago
2009
Springer
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
TACAS
2009
Springer
14 years 1 months ago
2009
Springer
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
TLDI
2009
ACM
14 years 3 months ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
SPAA
1998
ACM
13 years 11 months ago
1998
ACM
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...