References

  1. Gérard Boudol (2009): A Deadlock-Free Semantics for Shared Memory Concurrency. In: Martin Leucker & Carroll Morgan: Proceedings of the International Colloquium on Theoretical Aspects of Computing, LNCS 5684. Springer, pp. 140–154, doi:10.1007/978-3-642-03466-4_9.
  2. Chandrasekhar Boyapati, Robert Lee & Martin Rinard (2002): Ownership Types for Safe Programming: Preventing Data Races and Deadlocks. In: Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. ACM Press, New York, NY, USA, pp. 211–230, doi:10.1145/582419.582440.
  3. John Boyland (2003): Checking Interference with Fractional Permissions. In: Radhia Cousot: Static Analysis: Proceedings of the 10th International Symposium, LNCS 2694. Springer, pp. 55–72, doi:10.1007/3-540-44898-5_4.
  4. Edward G. Coffman, Jr., Michael J. Elphick & Arie Shoshani (1971): System Deadlocks. ACM Comput. Surv. 3(2), pp. 67–78, doi:10.1145/356586.356588.
  5. Cormac Flanagan & Mart\'ın Abadi (1999): Object Types Against Races. In: Jos C. M. Baeten & Sjouke Mauw: International Conference on Concurrency Theory, LNCS 1664. Springer, pp. 288–303, doi:10.1007/3-540-48320-9_21.
  6. Cormac Flanagan & Mart\'ın Abadi (1999): Types for Safe Locking. In: Programming Language and Systems: Proceedings of the European Symposium on Programming, LNCS 1576. Springer, pp. 91–108, doi:10.1007/3-540-49099-X_7.
  7. Prodromos Gerakios, Nikolaos Papaspyrou & Konstantinos Sagonas (2010): Race-free and Memory-safe Multithreading: Design and Implementation in Cyclone. In: Proceedings of the ACM SIGPLAN International Workshop on Types in Languages Design and Implementation. ACM Press, New York, NY, USA, pp. 15–26, doi:10.1145/1708016.1708020.
  8. Prodromos Gerakios, Nikolaos Papaspyrou & Konstantinos Sagonas (2010): A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering. Technical Report. National Technical University of Athens. Available at http://softlab.ntua.gr/~pgerakios/papers/reglock_deadlock_techrep10.pdf.
  9. Prodromos Gerakios, Nikolaos Papaspyrou & Konstantinos Sagonas (2011): A Type and Effect System for Deadlock Avoidance in Low-level Languages. In: Proceedings of the ACM SIGPLAN International Workshop on Types in Languages Design and Implementation. ACM Press, New York, NY, USA, pp. 15–28, doi:10.1145/1929553.1929558.
  10. Naoki Kobayashi (2006): A New Type System for Deadlock-Free Processes. In: C. Baier & H. Hermanns: International Conference on Concurrency Theory, LNCS 4137. Springer, pp. 233–247, doi:10.1007/11817949_16.
  11. Leslie Lamport (1979): A New Approach to Proving the Correctness of Multiprocess Programs. ACM Transactions on Programming Languages and Systems 1(1), pp. 84–97, doi:10.1145/357062.357068.
  12. Kohei Suenaga (2008): Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References. In: G. Ramalingam: Asian Symposium on Programming Languages and Systems, LNCS 5356. Springer, pp. 155–170, doi:10.1007/978-3-540-89330-1_12.
  13. Vasco Vasconcelos, Francisco Martin & Tiago Cogumbreiro (2010): Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language. In: Alastair R. Beresford & Simon Gay: Proceedings of the Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, EPTCS 17, pp. 95–109, doi:10.4204/EPTCS.17.8.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org