An annotation assistant for interactive debugging of programs with common synchronization idioms

Authors:
Tayfun Elmas;Ali Sezgin;Serdar Tasiran;Shaz Qadeer
Affiliations:
Koç University, İstanbul, Turkey;Koç University, İstanbul, Turkey;Koç University, İstanbul, Turkey;Microsoft Research, Redmond, WA
Venue:
Proceedings of the 7th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
Year:
2009

Citing 12
Cited 2

Simple, fast, and practical non-blocking and blocking concurrent queue algorithms

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Reduction: a method of proving properties of parallel programs

Communications of the ACM
Object race detection

OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
C++ Network Programming: Resolving Complexity Using Ace and Patterns (C++ in-Depth Series)

C++ Network Programming: Resolving Complexity Using Ace and Patterns (C++ in-Depth Series)
Types for atomicity

Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Modular verification of multithreaded programs

Theoretical Computer Science
Boxwood: abstractions as the foundation for storage infrastructure

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
A Fair Fast Scalable Rea,der-Writer Lock

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
A calculus of atomic actions

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects

QED: a proof system based on reduction and abstraction for the static verification of concurrent software

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
Simplifying linearizability proofs with reduction and abstraction

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores an approach to improving the practical usability of static verification tools for debugging synchronization idioms. Synchronization idioms such as mutual exclusion and readers/writer locks are widely-used to ensure atomicity of critical regions. We present an annotation assistant that automatically generates program annotations. These annotations express noninterference between program statements, ensured by the synchronization idioms, and are used to identify atomic code regions. This allows the programmer to debug the use of the idioms in the program. We start by formalizing several well-known idioms by providing an abstract semantics for each idiom. For programs that use these idioms, we require the programmer to provide a few predicates linking the idiom with its realization in terms of program variables. From these, we automatically generate a proof script that is mechanically checked. These scripts include steps such as automatically generating assertions and annotating program actions with them, introducing auxiliary variables and invariants. We have successfully shown the applicability of this approach to several concurrent programs from the literature.