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. © 2008 Springer-Verlag.
CITATION STYLE
Kidd, N., Lal, A., & Reps, T. (2008). Language strength reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5079 LNCS, pp. 283–298). https://doi.org/10.1007/978-3-540-69166-2_19
Mendeley helps you to discover research relevant for your work.