Searching for deadlocks while debugging Concurrent Haskell programs

DOI10.1145/1016850.1016858MaRDI QIDQ5178019zbMATHOpenAlexFDO

Authors Jan Christiansen, Frank Huch

Publication date 9 March 2015

Published in Proceedings of the ninth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1016850.1016858

zbMATH Keywords

debuggingdeadlockConcurrent Haskelldetecting deadlocks

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of operating systems (68N25)

Recommendations

• Resource-Oriented Deadlock Analysis
• Deadlock checking by data race detection
• Cheap remarks about concurrent programs
• Deadlock checking by data race detection
• Discovering and correcting a deadlock in a channel implementation

Cited in

(3)

• Program visualization for debugging deadlocks in multithreaded programs
• Cheap remarks about concurrent programs
• Deadlock checking by a behavioral effect system for lock handling

Describes a project that uses

Uses Software

• Haskell
• Freja
• Hat
• Hood

This page was built for publication: Searching for deadlocks while debugging Concurrent Haskell programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178019)