May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects

Flores-Montoya, Antonio; Albert, Elvira; Genaim, Samir

doi:10.1007/978-3-642-38592-6_19

Cited by 35 publications

(45 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work by Flores-Montoya et al [8] and the corresponding DECO prototype deserve a separate discussion. They perform deadlock analysis on (a subset of) core ABS with a point-to analysis technique that returns a dependency graph.…”

Section: Related Workmentioning

confidence: 98%

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

Section: Related Workmentioning

confidence: 98%

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

show abstract

“…We conclude by commenting that our notion of extended deadlock has been a source of inspiration for a paper [25] that, by exploiting static analysis instead of resorting to Petri nets, proposes a technique for detecting deadlocks in an actor-based language with futures.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

A Petri Net Based Modeling of Active Objects and Futures

Boer

Bravetti

Lee

et al. 2018

View full text Add to dashboard Cite

Abstract. We give two different notions of deadlock for systems based on active objects and futures. One is based on blocked objects and conforms with the classical definition of deadlock by Coffman, Jr. et al. The other one is an extended notion of deadlock based on blocked processes which is more general than the classical one. We introduce a technique to prove deadlock freedom of systems of active objects. To check deadlock freedom an abstract version of the program is translated into Petri nets. Extended deadlocks, and then also classical deadlock, can be detected via checking reachability of a distinct marking. Absence of deadlocks in the Petri net constitutes deadlock freedom of the concrete system.

show abstract

“…As regards (1), it should be noted that some settings should be discarded when generating all possible combinations of new and newcog instructions. As noted in [FMA13] by grouping objects in coboxes one can introduce deadlocks. Therefore, each candidate configuration should be checked for deadlock freeness.…”

Section: Overall Assessment Of Settingmentioning

confidence: 99%

Quantified abstract configurations of distributed systems

Albert

Fernández

Puebla³

et al. 2015

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract. When reasoning about distributed systems, it is essential to have information about the different kinds of nodes that compose the system, how many instances of each kind exist, and how nodes communicate with other nodes. In this paper we present a static-analysis-based approach which is able to provide information about the questions above. In order to cope with an unbounded number of nodes and an unbounded number of calls among them, the analysis performs an abstraction of the system producing a graph whose nodes may represent (infinitely) many concrete nodes and arcs represent any number of (infinitely) many calls among nodes. The crux of our approach is that the abstraction is enriched with upper bounds inferred by resource analysis that limit the number of concrete instances that the nodes and arcs represent and their resource consumption. The information available in our quantified abstract configurations allows us to define performance indicators which measure the quality of the system. In particular, we present several indicators that assess the level of distribution in the system, the amount of communication among distributed nodes that it requires, and how balanced the load of the distributed nodes that compose the system is. Our performance indicators are given as functions on the input data sizes, and they can be used to automate the comparison of different distributed settings and guide towards finding the optimal configuration.

show abstract

May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects

Cited by 35 publications

References 16 publications

Deadlock Analysis of Concurrent Objects: Theory and Practice

Deadlock Analysis of Concurrent Objects: Theory and Practice

A Petri Net Based Modeling of Active Objects and Futures

Quantified abstract configurations of distributed systems

Contact Info

Product

Resources

About