Language Strength Reduction.
Gespeichert in:
| Titel: | Language Strength Reduction. |
|---|---|
| Autoren: | Kidd, Nicholas, Lal, Akash, Reps, Thomas |
| Quelle: | Static Analysis (9783540691631); 2008, p283-298, 16p |
| Abstract: | 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Static Analysis (9783540691631) is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Datenbank: | Complementary Index |
Schreiben Sie den ersten Kommentar!