research-article

Open access

Discovering and correcting a deadlock in a channel implementation

Author:

Gavin LoweAuthors Info & Claims

Formal Aspects of Computing, Volume 31, Issue 4

Pages 411 - 419

https://doi.org/10.1007/s00165-019-00487-y

Published: 01 August 2019 Publication History

Abstract

We investigate the cause of a deadlock in the implementation of a channel in a message-passing concurrency API. We model the channel implementation using the process algebra CSP, and then use the model checker FDR to find the cause of the deadlock. The bug is rather subtle, and arguably infeasible to spot by hand. We then propose a straightforward fix to the bug, and use CSP and FDR to verify this fix.

References

References

[1]

Antonino P, Gibson-Robinson T, Roscoe AW (2016) Efficient deadlock-freedom checking using local analysis and SAT solving. In: Proceedings of IFM, vol 9681, pp 345–360. LNCS

[2]

Antonino P, Gibson-Robinson T, Roscoe AW (2016) Tighter reachability criteria for deadlock freedom analysis. In: Proceedings of FM, vol 9995. LNCS

[3]

Antonino P, Gibson-Robinson T, Roscoe AW (2017) The automatic detection of token structures and invariants using SAT checking. In: Proceedings of TACAS, vol 10206, pp 249–265. LNCS

[4]

Brookes SD and Roscoe AW Deadlock analysis in networks of communicating processes Distrib Comput 1991 4 209-230

Digital Library

[5]

Gibson-Robinson T, Armstrong P, Boulgakov A, Roscoe AW (2014) FDR3—a modern refinement checker for CSP. In: Proceedings of Tools and algorithms for the construction and analysis of systems (TACAS), vol 8413. LNCS

[6]

Lawrence J (2005) Practical applications of CSP and FDR to software design. In: Communicating sequential processes: the first 25 years. Lecture notes in computer science, vol 3525, pp 151–174. Springer, Berlin

[7]

Lowe G (1996) Breaking and fixing the Needham–Schroeder public-key protocol using FDR. In: Proceedings of TACAS. Lecture notes in computer science, vol 1055, pp 147–166. Springer, Berlin. Also in Software—Concepts and Tools (1996) 17:93–102

[8]

Lowe G (2011) Implementing generalised alt—a case study in validated design using CSP. In: Communicating process architectures, pp 1–34

[9]

Lowe G (2018) View abstraction for systems with component identities. In: Proceedings of the international symposium on formal methods (FM 2018), vol 10951, pp 502–522. Springer, Berlin

[10]

Lowe G (2019) Parameterised verification of systems with component identities, using view abstraction. Submitted for publication

[11]

JMR Martin (1996) The design and construction of deadlock-free concurrent systems. Ph.D. thesis, University of Buckingham

[12]

Mota A and Sampaio A Model-checking CSP-Z: strategy, tool support and industrial application Science of computer programming 2001 40 1 59-96

Digital Library

[13]

Oracle AtomicBoolean (Java SE9 & JDK 9). https://docs.oracle.com/javase/9/docs/api/java/util/concurrent/atomic/AtomicBoolean.html. Accessed 11 Jul 2019

[14]

Oracle AtomicReference (Java SE9 & JDK 9). https://docs.oracle.com/javase/9/docs/api/java/util/concurrent/atomic/AtomicReference.html. Accessed 11 Jul 2019

[15]

Oracle LockSupport (Java SE9 & JDK 9). https://docs.oracle.com/javase/9/docs/api/java/util/concurrent/locks/LockSupport.html. Accessed 11 Jul 2019

[16]

Roscoe AW and Dathi N The pursuit of deadlock freedom Inf Comput 1987 75 3 289-327

Digital Library

[17]

Roscoe AW and Hopkins D SVA, a tool for analysing shared-variable programs Proceedings of AVoCS 2007 2007 177-183

[18]

Roscoe AW Understanding concurrent systems 2010 Berlin Springer

[19]

Sufrin B (2008) Communicating scala objects. In: Proceedings of communicating process architectures (CPA)

[20]

Welch P, Martin J (2000) A CSP model for Java multithreading. In: Proceedings of the IEEE international symposium on software engineering for parallel and distributed systems, pp 114–122

Cited By

Pedersen JChalmers K(2023)Toward Verifying Cooperatively Scheduled Runtimes Using CSPFormal Aspects of Computing10.1145/360594235:4(1-45)Online publication date: 21-Nov-2023
https://dl.acm.org/doi/10.1145/3605942
Lowe G(2022)Parameterized verification of systems with component identities, using view abstractionInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-022-00648-024:2(287-324)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s10009-022-00648-0

Index Terms

Discovering and correcting a deadlock in a channel implementation

Index terms have been assigned to the content through auto-classification.

Recommendations

A CSP Model for Java Multithreading
PDSE '00: Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems

Java threads are synchronized through primitives based upon monitor concepts developed in the early 1970s. The semantics of Java's primitives have only been presented in natural language -- this paper remedies this with a simple and formal CSP model. In ...
Counter Abstraction in the CSP/FDR setting

In this paper we consider an adaptation of counter abstraction for the CSP/FDR setting. The technique allows us to transform a concurrent system with an unbounded number of agents into a finite-state abstraction. The systems to which the method can be ...
A new concurrency model for Scala based on a declarative dataflow core
SCALA '13: Proceedings of the 4th Workshop on Scala

Declarative dataflow values are single assignment variables such that all operations needing their values wait automatically until the values are available. Adding threads and declarative dataflow values to a functional language gives declarative ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 31, Issue 4

Aug 2019

44 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© The Author(s) 2019.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 August 2019

Accepted: 26 June 2019

Received: 31 August 2018

Published in FAC Volume 31, Issue 4

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
36
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)7

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pedersen JChalmers K(2023)Toward Verifying Cooperatively Scheduled Runtimes Using CSPFormal Aspects of Computing10.1145/360594235:4(1-45)Online publication date: 21-Nov-2023
https://dl.acm.org/doi/10.1145/3605942
Lowe G(2022)Parameterized verification of systems with component identities, using view abstractionInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-022-00648-024:2(287-324)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s10009-022-00648-0

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents