Deadlock freedom through object ownership

Kerfoot, Eric; McKeever, Steve; Torshizi, Faraz

doi:10.1145/1562154.1562157

Cited by 7 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We plan to extend our analysis in order to consider finer-grained thread dependencies instead of just object dependencies. [25] offers a design pattern methodology for CoJava to obtain deadlock-free programs. CoJava, a Java dialect where data-races and data-based deadlocks are avoided by the type system, prevents threads from sharing mutable data.…”

Section: Related Workmentioning

confidence: 99%

A framework for deadlock detection in core ABS

2015

View full text Add to dashboard Cite

We present a framework for statically detecting deadlocks in a concurrent object-oriented language with asynchronous method calls and cooperative scheduling of method activations. Since this language features recursion and dynamic resource creation, deadlock detection is extremely complex and state-of-the-art solutions either give imprecise answers or do not scale.In order to augment precision and scalability we propose a modular framework that allows several techniques to be combined. The basic component of the framework is a front-end inference algorithm that extracts abstract behavioural descriptions of methods, called contracts, which retain resource dependency information. This component is integrated with a number of possible different back-ends that analyse contracts and derive deadlock information. As a proof-of-concept, we discuss two such back-ends: (i) an evaluator that computes a fixpoint semantics and (ii) an evaluator using abstract model checking.

show abstract

Section: Related Workmentioning

confidence: 99%

A framework for deadlock detection in core ABS

2015

View full text Add to dashboard Cite

show abstract

“…We plan to extend our analysis in order to consider finer-grained thread dependencies instead of just object dependencies. [16] offers a design pattern methodology for CoJava to obtain deadlock-free programs. CoJava, a Java dialect where data-races and data-based deadlocks are avoided by the type system, prevents threads from sharing mutable data.…”

Section: Related Workmentioning

confidence: 99%

Deadlock Analysis of Concurrent Objects: Theory and Practice

Giachino¹,

Grazia²,

Laneve³

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a framework for statically detecting deadlocks in a concurrent object language with asynchronous invocations and operations for getting values and releasing the control. Our approach is based on the integration of two static analysis techniques: (i) an inference algorithm to extract abstract descriptions of methods in the form of behavioral types, called contracts, and (ii) an evaluator that computes a fixpoint semantics returning a finite state model of contracts. A potential deadlock is detected when a circular dependency is found in some state of the model. We discuss the theory and the prototype implementation of our framework. Our tool is validated on an industrial case study based on the Fredhopper Access Server (FAS) developed by SDL Fredhoppper. In particular we verify one of the core concurrent components of FAS to be deadlock-free.

show abstract

“…Using a model similar to SCOOP, Kerfoot et al [11] use types to ensure deadlock freedom for active objects [14]. Ownership types impose a hierarchy on active objects, but the variety of ownership-structures that are permitted are limited.…”

Section: Related Workmentioning

confidence: 99%

“…Other work in this area such as deadlock freedom for active objects in Java [11] provides less versatile structures (trees vs. orders). Techniques of similar power [3], however, are not grounded in an underlying language that is designed to make concurrent programming easier.…”

Section: Introductionmentioning

confidence: 99%

A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model

West

Nanz

Meyer

2010

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races and deadlocks still persist for programmers since available detection and prevention tools are unsound or have otherwise not been well adopted. In an alternative approach, programming models that exclude certain classes of errors by design can address concurrency problems at a language level. In this paper we review SCOOP, an existing race-free programming model for concurrent object-oriented programming, and extend it with a scheme for deadlock prevention based on locking orders. The scheme facilitates modular reasoning about deadlocks by associating annotations with the interfaces of routines. We prove deadlock-freedom of well-formed programs using a rigorous formalization of the locking semantics of the programming model. The scheme has been implemented and we demonstrate its usefulness by applying it to the example of a simple web server.

show abstract

Deadlock freedom through object ownership

Cited by 7 publications

References 24 publications

A framework for deadlock detection in core ABS

A framework for deadlock detection in core ABS

Deadlock Analysis of Concurrent Objects: Theory and Practice

A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model

Contact Info

Product

Resources

About