Termination detection for active objects

Boer, Frank S. de; Grabe, Immo; Steffen, Martín

doi:10.1016/j.jlap.2012.03.009

Cited by 5 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We argue that our technique outperforms previous proposals [8,5,4,7] in precision or efficiency and it considers a more expressive language. Experiments suggest we achieve better precision than [8,7] because our pointsto analysis keeps a more fine-grained representation of objects and their dependencies than their contract-based approach.…”

Section: Related Work and Conclusionmentioning

confidence: 74%

See 1 more Smart Citation

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

Flores-Montoya

Albert

Genaim

2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. We present a novel deadlock analysis for concurrent objects based on the results inferred by a points-to analysis and a may-happenin-parallel (MHP) analysis. Similarly to other analysis, we build a dependency graph such that the absence of cycles in the graph ensures deadlock freeness. An MHP analysis provides an over-approximation of the pairs of program points that may be running in parallel. The crux of the method is that the analysis integrates the MHP information within the dependency graph in order to discard unfeasible cycles that otherwise would lead to false positives. We argue that our analysis is more precise and/or efficient than previous proposals for deadlock analysis of concurrent objects. As regards accuracy, we are able to handle cases that other analyses have pointed out as challenges. As regards efficiency, the complexity of our deadlock analysis is polynomial.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 74%

“…6. The language used in [5] is very restrictive (e.g., it does not have an object creation instruction, nor synchronizations using await, among other limitations). More recent work [4] improves the previous one, since the use of Petri nets specifies the temporal behavior of the methods.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

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

Flores-Montoya

Albert

Genaim

2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

show abstract

“…Actors form a well established model for distributed systems [YBS86,Ame89,Car93,SPH10], which is lately regarding attention due to its adoption in Erlang [AVW96], Scala [HO09] and active objects [SPH10,BGS12]. In our language, the distribution model is based on (possibly interacting) objects that are grouped into distributed nodes, called coboxes.…”

Section: Introductionmentioning

confidence: 99%

Quantified abstract configurations of distributed systems

Albert

Fernández

Puebla³

et al. 2015

Form. Asp. Comput.

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

“…Recent work on actor-based language focusses on deadlock analysis: In [18], a technique for the deadlock analysis has been introduced for a version of Featherweight Java which features asynchronous method invocations and a synchronization mechanism based on futures variables. The approach followed in [15] for detecting deadlock in an actor-like subset of Creol [7] is based on suitable over-approximations.…”

Section: Introductionmentioning

confidence: 99%

Decidability Problems for Actor Systems

Boer¹,

Jaghoori²,

Laneve³

et al. 2014

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a crucial feature: the dynamic creation of names in combination with fields gives rise to Turing completeness. On the other hand, restricting to stateless actors gives rise to systems for which properties such as termination are decidable. This decidability result still holds for actors with states when the number of actors is bounded and the state is read-only.

show abstract

Termination detection for active objects

Cited by 5 publications

References 9 publications

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

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

Quantified abstract configurations of distributed systems

Decidability Problems for Actor Systems

Contact Info

Product

Resources

About