Verification of scalable synchronous queue

Authors:
Jinjiang Lei;Zongyan Qiu
Affiliations:
LMAM and Department of Informatics, School of Math., Peking University, Beijing, China;LMAM and Department of Informatics, School of Math., Peking University, Beijing, China
Venue:
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Year:
2011

Citing 19
Cited 0

Tentative steps toward a development method for interfering programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Liveness Properties of Concurrent Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying properties of parallel programs: an axiomatic approach

Communications of the ACM
Modular verification of concurrent programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Variables as Resource in Hoare Logics

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Modular verification of a non-blocking stack

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resources, concurrency, and local reasoning

Theoretical Computer Science
A Scalable Lock-Free Stack Algorithm and its Verification

SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Expression Decomposition in a Rely/Guarantee Context

VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Proving that non-blocking algorithms don't block

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Scalable synchronous queues

Communications of the ACM - Security in the Browser
Variables as Resource in Separation Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
On the relationship between concurrent separation logic and assume-guarantee reasoning

ESOP'07 Proceedings of the 16th European conference on Programming
Concurrent abstract predicates

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Reasoning about optimistic concurrency using a program logic for history

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A separation logic for refining concurrent objects

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic in the Presence of Garbage Collection

LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
A marriage of rely/guarantee and separation logic

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lock-free algorithms are extremely hard to be built correct due to their fine-grained concurrency natures. Formal techniques for verifying them are crucial. We present a framework for verification of CAS-based lock-free algorithms, and prove a nontrivial lock-free algorithm Scalable Synchronous Queue that is practically adopted in Java 6. The strength of our approach lies on that it relieves the dependence on auxiliary variables/commands, thus is relatively easier to conduct and comprehend, comparing to existing works.