Language Strength Reduction

Authors:
Nicholas Kidd;Akash Lal;Thomas Reps
Affiliations:
University of Wisconsin, Madison, USA;University of Wisconsin, Madison, USA;University of Wisconsin, Madison, USA and GrammaTech, Inc., Ithaca, NY, USA
Venue:
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Year:
2008

Citing 12
Cited 7

Algebraic decision diagrams and their applications

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A generic approach to the static analysis of concurrent programs with procedures

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Associating synchronization constraints with data in an object-oriented language

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Weighted pushdown systems and their application to interprocedural dataflow analysis

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Towards a framework and a benchmark for testing tools for multi-threaded programs: Research Articles

Concurrency and Computation: Practice & Experience - Parallel and Distributed Systems: Testing and Debugging (PADTAD)
Fast and accurate static data-race detection for concurrent programs

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Instrumenting C programs with nested word monitors

Proceedings of the 14th international SPIN conference on Model checking software
Extended weighted pushdown systems

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Reasoning about threads communicating via locks

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Adding nesting structure to words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Verifying concurrent message-passing c programs with recursive calls

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

Finding Concurrency-Related Bugs Using Random Isolation

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks

Proceedings of the 16th International SPIN Workshop on Model Checking Software
Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
One stack to run them all: reducing concurrent analysis to sequential analysis under priority scheduling

SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Bounded context-switching and reentrant locking

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concerns methods to check for atomic-set serializability violations in concurrent Java programs. The straightforward way to encode a reentrant lock is to model it with a context-free language to track the number of successive lock acquisitions. We present a construction that replaces the context-free language that describes a reentrant lock by a regular language that describes a non-reentrant lock. We call this replacement language strength reduction. Language strength reduction produces an average speedup (geometric mean) of 3.4. Moreover, for 2 programs that previously exhausted available space, the tool is now able to run to completion.