2000 character limit reached
Coffman deadlocks in SCOOP
Published 26 Sep 2014 in cs.PL | (1409.7514v3)
Abstract: In this paper we address the deadlock detection problem in the context of SCOOP - an OO-programming model for concurrency, recently formalized in Maude. We present the integration of a deadlock detection mechanism on top of the aforementioned formalization and analyze how an abstract semantics of SCOOP based on a notion of "may alias expressions" can contribute to improving the deadlock detection procedure.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.