作者: Nicholas Kidd , Akash Lal , Thomas Reps
DOI: 10.1007/978-3-540-69166-2_19
关键词: Language primitive 、 Record locking 、 Programming language 、 Data control language 、 Low-level programming language 、 High-level programming language 、 Programming language implementation 、 Context-sensitive language 、 Specification language 、 Computer science
摘要: This paper concerns methods to check for atomic-set serializability violations in concurrent Java programs. The straightforward way encode a reentrant lock is model it with context-free language track the number of successive acquisitions. We present construction that replaces describes by regular non-reentrant lock. call this replacement strength reduction. Language reduction produces an average speedup (geometric mean) 3.4. Moreover, 2 programs previously exhausted available space, tool now able run completion.