![]() |
Volumn , Issue , 2009, Pages 27-36
|
Boundedness vs. Unboundedness of lock chains characterizing decidability of cfl-reachability for threads communicating via locks
|
Author keywords
[No Author keywords available]
|
Indexed keywords
BOUNDEDNESS;
CONCURRENT PROGRAM;
CORE PROBLEMS;
DEVICE DRIVER;
MUTEXES;
NESTEDNESS;
NEW RESULTS;
REACHABILITY;
RECURSIONS;
SCHEDULING CONSTRAINTS;
SYNCHRONIZATION PRIMITIVE;
USAGE PATTERNS;
COMMUNICATION CHANNELS (INFORMATION THEORY);
COMPUTER SCIENCE;
DATA FLOW ANALYSIS;
LOCKS (FASTENERS);
COMPUTABILITY AND DECIDABILITY;
|
EID: 70350600589
PISSN: 10436871
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/LICS.2009.45 Document Type: Conference Paper |
Times cited : (41)
|
References (14)
|