Analysis of Deadlocks in Object Groups

Object groups are collections of objects that perform collective work. We study a calculus with object groups and develop a technique for the deadlock analysis of such systems based on abstract descriptions of method's behaviours.

[1]  Cosimo Laneve,et al.  The Must Preorder Revisited , 2007, CONCUR.

[2]  Denis Caromel,et al.  Toward a method of object-oriented concurrent programming , 1993, CACM.

[3]  Akinori Yonezawa,et al.  Object-oriented concurrent programming ABCL/1 , 1986, OOPLSA '86.

[4]  Denis Caromel,et al.  Asynchronous and deterministic objects , 2004, POPL.

[5]  W. Marsden.  I and J , 2012 .

[6]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[7]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[8]  Flemming Nielson,et al.  Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.

[9]  Marco Bernardo,et al.  Formal Methods for Mobile Computing, 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-Moby 2005, Bertinoro, Italy, April 26-30, 2005, Advanced Lectures , 2005, SFM.

[10]  Naoki Kobayashi,et al.  Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts , 2007, ESOP.

[11]  Akinori Yonezawa,et al.  Debugging Concurrent Systems Based on Object Groups , 1988, ECOOP.

[12]  Stein Gjessing,et al.  ECOOP ’88 European Conference on Object-Oriented Programming , 1988, Lecture Notes in Computer Science.

[13]  Kohei Suenaga.  Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References , 2008, APLAS.

[14]  Sagar Chaki,et al.  Types as models: model checking message-passing programs , 2002, POPL '02.

[15]  Einar Broch Johnsen,et al.  An Asynchronous Communication Model for Distributed Concurrent Objects , 2004, SEFM.

[16]  Rachid Guerraoui,et al.  Programming with object groups in CORBA , 2000, IEEE Concurr..

[17]  Oscar Nierstrasz,et al.  Active objects in hybrid , 1987, OOPSLA '87.

[18]  Marco Pistore,et al.  History-Dependent Automata: An Introduction , 2005, SFM.

[19]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[20]  Philip Wadler,et al.  Featherweight Java: a minimal core calculus for Java and GJ , 1999, OOPSLA '99.

[21]  Frank S. de Boer,et al.  A Complete Guide to the Future , 2007, ESOP.

[22]  Arnd Poetzsch-Heffter,et al.  JCoBox: Generalizing Active Objects to Concurrent Components , 2010, ECOOP.

[23]  Theo D'Hondt.  ECOOP 2010 - Object-Oriented Programming, 24th European Conference, Maribor, Slovenia, June 21-25, 2010. Proceedings , 2010, ECOOP.

[24]  Martin C. Rinard,et al.  ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), November 2002 Ownership Types for Safe Programming: Preventing Data Races and Deadlocks , 2022 .

[25]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[26]  Martín Abadi,et al.  Types for safe locking: Static race detection for Java , 2006, TOPL.

[27]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[28]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[29]  Francisco Martins,et al.  Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language , 2009, PLACES.

[30]  Einar Broch Johnsen,et al.  An Asynchronous Communication Model for Distributed Concurrent Objects , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..

[31]  Naoki Kobayashi,et al.  A New Type System for Deadlock-Free Processes , 2006, CONCUR.