Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LICS
/
Paper
Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks.
Vineet Kahlon
Venue
A*
LICS
Year
2009
Proceedings
LICS
DBLP record
conf/lics/Kahlon09 ↗
Browse the full
LICS paper archive
.