Formal reasoning about lazy-STM programs

Authors:
Yong Li;Yu Zhang;Yi-Yun Chen;Ming Fu
Affiliations:
School of Computer Science and Technology, University of Science and Technology of China, Hefei, China and Software Security Laboratory, Suzhou Institute for Advanced Study, University of Science ...;School of Computer Science and Technology, University of Science and Technology of China, Hefei, China and Software Security Laboratory, Suzhou Institute for Advanced Study, University of Science ...;School of Computer Science and Technology, University of Science and Technology of China, Hefei, China and Software Security Laboratory, Suzhou Institute for Advanced Study, University of Science ...;School of Computer Science and Technology, University of Science and Technology of China, Hefei, China and Software Security Laboratory, Suzhou Institute for Advanced Study, University of Science ...
Venue:
Journal of Computer Science and Technology
Year:
2010

Citing 24
Cited 1

Tentative steps toward a development method for interfering programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Transactional memory: architectural support for lock-free data structures

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
A syntactic approach to type soundness

Information and Computation
Software transactional memory

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Software transactional memory for dynamic-sized data structures

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Language support for lightweight transactions

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Transactional Memory Coherence and Consistency

Proceedings of the 31st annual international symposium on Computer architecture
Verification of safety properties for concurrent assembly code

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Permission accounting in separation logic

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unbounded Transactional Memory

HPCA '05 Proceedings of the 11th International Symposium on High-Performance Computer Architecture
Modular verification of concurrent assembly code with dynamic thread creation and termination

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
McRT-STM: a high performance software transactional memory system for a multi-core runtime

Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Hybrid transactional memory

Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Modular verification of assembly code with stack-based control abstractions

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Resources, concurrency, and local reasoning

Theoretical Computer Science
Subtleties of Transactional Memory Atomicity Semantics

IEEE Computer Architecture Letters
High-level small-step operational semantics for transactions

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic performance tuning of word-based software transactional memory

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Certifying concurrent programs using transactional memory

Journal of Computer Science and Technology
On the Verification of Strong Atomicity in Programs Using STM

SSIRI '09 Proceedings of the 2009 Third IEEE International Conference on Secure Software Integration and Reliability Improvement
A Grainless Semantics for Parallel Programs with Shared Mutable Data

Electronic Notes in Theoretical Computer Science (ENTCS)
Formal reasoning about lazy-STM programs

Journal of Computer Science and Technology
Transactional locking II

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Formal reasoning about lazy-STM programs

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transactional memory (TM) is an easy-using parallel programming model that avoids common problems associated with conventional locking techniques. Several researchers have proposed a large amount of alternative hardware and software TM implementations. However, few ones focus on formal reasoning about these TM programs. In this paper, we propose a framework at assembly level for reasoning about lazy software transactional memory (STM) programs. First, we give a software TM implementation based on lightweight locks. These locks are also one part of the shared memory. Then we define the semantics of the model operationally, and the lightweight locks in transaction are non-blocking, avoiding deadlocks among transactions. Finally we design a logic -- a combination of permission accounting in separation logic and concurrent separation logic -- to verify various properties of concurrent programs based on this machine model. The whole framework is formalized using a proof-carrying-code (PCC) framework.