Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks

Authors:
Vineet Kahlon
Affiliations:
-
Venue:
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Year:
2009

Citing 0
Cited 14

Featherweight X10: a core calculus for async-finish parallelism

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
From multi to single stack automata

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Complexity of pattern-based verification for multithreaded programs

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Scalable and precise program analysis at NEC

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Reasoning about threads with bounded lock chains

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Analysis of recursively parallel programs

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universal causality graphs: a precise happens-before model for detecting bugs in concurrent programs

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Language-Theoretic abstraction refinement

FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Reachability under contextual locking

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Lock removal for concurrent trace programs

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Efficient may happen in parallel analysis for async-finish parallelism

SAS'12 Proceedings of the 19th international conference on Static Analysis
Analysis of Recursively Parallel Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Contextual merged processes

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Safety verification of asynchronous pushdown systems with shaped stacks

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Model Checking is an automatic verification technique for state-transition systems that are finite-state or that have finite-state abstractions. In the early 1980's in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we ...