Article

Reasoning about Java's Reentrant Locks

Authors:

Christian Haack,

Marieke Huisman,

Clément HurlinAuthors Info & Claims

APLAS '08: Proceedings of the 6th Asian Symposium on Programming Languages and Systems

Pages 171 - 187

https://doi.org/10.1007/978-3-540-89330-1_13

Published: 09 December 2008 Publication History

Abstract

This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic. As usual, each lock is associated with a resource invariant, i.e., when acquiring the lock the resources are obtained by the thread holding the lock, and when releasing the lock, the resources are released. To accommodate for reentrancy, the notion of lockset is introduced: a multiset of locks held by a thread. Keeping track of the lockset enables the logic to ensure that resources are not re-acquired upon reentrancy, thus avoiding the introduction of new resources in the system. To be able to express flexible locking policies, we combine the verification logic with value-parameterized classes. Verified programs satisfy the following properties: data race freedom, absence of null-dereferencing and partial correctness. The verification technique is illustrated on several examples, including a challenging lock-coupling algorithm.

References

[1]

Á brahám, E., de Boer, F.S., de Roever, W.-P., Steffen, M.: Tool-supported proof system for multithreaded Java. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol. 2852, pp. 1-32. Springer, Heidelberg (2003)

[2]

Andrews, G.: Concurrent Programming: Principles and Practice. Benjamin/Cummings (1991)

[3]

Barnett, M., DeLine, R., Fähndrich, M., Leino, K.R.M., Schulte, W.: Verification of object-oriented programs with invariants. Journal of Object Technology 3(6) (2004)

[4]

Bornat, R., O'Hearn, P.W., Calcagno, C., Parkinson, M.: Permission accounting in separation logic. In: Principles of Programming Languages. ACM Press, New York (2005)

[5]

Boyapati, C., Lee, R., Rinard, M.: Ownership types for safe programming: Preventing data races and deadlocks. In: ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (2002)

[6]

Boyland, J.: Checking interference with fractional permissions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, Springer, Heidelberg (2003)

[7]

Clarke, D.G., Potter, J.M., Noble, J.: Ownership types for flexible alias protection. In: ACM Conference on Object-Oriented Programming Systems, Languages, and Applications. ACM SIGPLAN Notices, vol. 33(10). ACM Press, New York (1998)

[8]

de Boer, F.S.: A sound and complete shared-variable concurrency model for multithreaded Java programs. In: International Conference on Formal Methods for Open Object-based Distributed Systems (2007)

[9]

DeLine, R., Fähndrich, M.: Typestates for objects. In: European Conference on Object-Oriented Programming (2004)

[10]

Gotsman, A., Berdine, J., Cook, B., Rinetzky, N., Sagiv, M.: Local reasoning for storable locks and threads. In: Asian Programming Languages and Systems Symposium (2007)

[11]

Haack, C., Huisman, M., Hurlin, C.: Reasoning about Java's reentrant locks. Technical Report ICIS-R08014, Radboud University Nijmegen (2008)

[12]

Haack, C., Hurlin, C.: Separation logic contracts for a Java-like language with fork/join. In: Meseguer, J., Roşu, G. (eds.) AMAST 2008. LNCS, vol. 5140, pp. 199-215. Springer, Heidelberg (2008)

[13]

Hobor, A., Appel, A., Nardelli, F.: Oracle semantics for concurrent separation logic. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 353-367. Springer, Heidelberg (2008)

[14]

Ishtiaq, S., O'Hearn, P.W.: BI as an assertion language for mutable data structures. In: Principles of Programming Languages (2001)

[15]

Jacobs, B., Smans, J., Piessens, F., Schulte, W.: A statically verifiable programming model for concurrent object-oriented programs. In: International Conference on Formal Engineering Methods (2006)

[16]

Müller, P. (ed.): Modular Specification and Verification of Object-Oriented Programs. LNCS, vol. 2262, p. 195. Springer, Heidelberg (2002)

[17]

Naftalin, M., Wadler, P.: Java Generics. O'Reilly, Sebastopol (2006)

[18]

O'Hearn, P.W.: Resources, concurrency and local reasoning. Theoretical Computer Science 375(1-3), 271-307 (2007)

[19]

O'Hearn, P.W., Pym, D.J.: The logic of bunched implications. Bulletin of Symbolic Logic 5(2) (1999)

[20]

Parkinson, M.: Local Reasoning for Java. Ph.D thesis, University of Cambridge (2005)

[21]

Parkinson, M., Bierman, G.: Separation logic and abstraction. In: Principles of Programming Languages (2005)

[22]

Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Logic in Computer Science, Copenhagen, Denmark. IEEE Press, Los Alamitos (2002)

[23]

Wadler, P.: A taste of linear logic. In:Mathematical Foundations of Computer Science (1993)

Cited By

Rubbens RBos PHuisman M(2024)VeyMont: Choreography-Based Generation of Correct Concurrent Programs with Shared MemoryIntegrated Formal Methods10.1007/978-3-031-76554-4_12(217-236)Online publication date: 11-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-76554-4_12
Shahare VChabbi MHegde NAgrawal KShun J(2023)Protecting Locks Against Unbalanced Unlock()Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591091(199-211)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591091
Brookes SO'Hearn P(2016)Concurrent separation logicACM SIGLOG News10.1145/2984450.29844573:3(47-65)Online publication date: 8-Aug-2016
https://dl.acm.org/doi/10.1145/2984450.2984457
Show More Cited By

Reasoning about Java's Reentrant Locks
1. Theory of computation

Recommendations

Modular verification of synchronization with reentrant locks
MEMOCODE '10: Proceedings of the Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign

We present a modular approach for verification of synchronization behavior in concurrent programs that use reentrant locks. Our approach decouples the verification of the lock implementation from the verification of the threads that use the lock. This ...
Formal Reasoning about Concurrent Assembly Code with Reentrant Locks
TASE '09: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering

This paper focuses on the problem of reasoning about concurrent assembly code with reentrant locks. Our verification technique is based on concurrent separation logic (CSL). In CSL, locks are treated as non-reentrant locks and each lock is associated ...
Scalable reader-writer locks
SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers attempt to acquire the lock concurrently, even though they are all allowed ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

APLAS '08: Proceedings of the 6th Asian Symposium on Programming Languages and Systems

December 2008

341 pages

ISBN:9783540893295

Editor:
G. Ramalingam
Microsoft Research India, Bangalore, India 560080

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 09 December 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Rubbens RBos PHuisman M(2024)VeyMont: Choreography-Based Generation of Correct Concurrent Programs with Shared MemoryIntegrated Formal Methods10.1007/978-3-031-76554-4_12(217-236)Online publication date: 11-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-76554-4_12
Shahare VChabbi MHegde NAgrawal KShun J(2023)Protecting Locks Against Unbalanced Unlock()Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591091(199-211)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591091
Brookes SO'Hearn P(2016)Concurrent separation logicACM SIGLOG News10.1145/2984450.29844573:3(47-65)Online publication date: 8-Aug-2016
https://dl.acm.org/doi/10.1145/2984450.2984457
Balabonski TPottier FProtzenko J(2016)The Design and Formalization of Mezzo, a Permission-Based Programming LanguageACM Transactions on Programming Languages and Systems10.1145/283702238:4(1-94)Online publication date: 2-Aug-2016
https://dl.acm.org/doi/10.1145/2837022
Dodds MJagannathan SParkinson MSvendsen KBirkedal L(2016)Verifying Custom Synchronization Constructs Using Higher-Order Separation LogicACM Transactions on Programming Languages and Systems10.1145/281863838:2(1-72)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2818638
Amighi ABlom SDarabi SHuisman MMostowski WZaharieva-Stojanovski M(2014)Verification of Concurrent Systems with VerCorsAdvanced Lectures of the 14th International School on Formal Methods for Executable Software Models - Volume 848310.1007/978-3-319-07317-0_5(172-216)Online publication date: 16-Jun-2014
https://dl.acm.org/doi/10.1007/978-3-319-07317-0_5
Botinčan MDodds MJagannathan S(2013)Proof-Directed Parallelization Synthesis by Separation LogicACM Transactions on Programming Languages and Systems10.1145/2491522.249152535:2(1-60)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1145/2491522.2491525
Amighi ABlom SHuisman MZaharieva-Stojanovski MClaessen KSwamy N(2012)The VerCors projectProceedings of the sixth workshop on Programming languages meets program verification10.1145/2103776.2103785(71-82)Online publication date: 24-Jan-2012
https://dl.acm.org/doi/10.1145/2103776.2103785
Botincan MDodds MJagannathan SField JHicks M(2012)Resource-sensitive synchronization inference by abductionProceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2103656.2103694(309-322)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2103656.2103694
Botincan MDodds MJagannathan S(2012)Resource-sensitive synchronization inference by abductionACM SIGPLAN Notices10.1145/2103621.210369447:1(309-322)Online publication date: 25-Jan-2012
https://dl.acm.org/doi/10.1145/2103621.2103694
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents