A framework for deadlock detection in core ABS
TL;DR: In this paper, a front-end inference algorithm that extracts abstract behavioral descriptions of methods, called contracts, which retain resource dependency information is integrated with a number of possible different back-ends that analyze contracts and derive deadlock information.
read more
Abstract: 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 behavioral descriptions of methods, called contracts, which retain resource dependency information. This component is integrated with a number of possible different back-ends that analyze contracts and derive deadlock information. As a proof-of-concept, we discuss two such back-ends: (1) an evaluator that computes a fixpoint semantics and (2) an evaluator using abstract model checking.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Uniform Modeling of Railway Operations
Eduard Kamburjan,Reiner Hähnle +1 more
- 14 Nov 2016
TL;DR: A comprehensive model of railway operations written in the abstract behavioral specification (ABS) language, based on specifications taken from the rulebooks of Deutsche Bahn AG, that allows to use static and dynamic analysis within one and the same formalism.
20
Declarative Elasticity in ABS
Stijn de Gouw,Jacopo Mauro,Behrooz Nobakht,Gianluigi Zavattaro +3 more
- 05 Sep 2016
TL;DR: This paper shows how deployment can be added as a first-class citizen in the object-oriented modeling language ABS, allowing for the specification of incremental modifications, thus supporting the declarative modeling of elastic applications.
Actors may synchronize, safely!
Elena Giachino,Ludovic Henrio,Cosimo Laneve,Vincenzo Mastandrea +3 more
- 05 Sep 2016
TL;DR: This work provides a type-system and a solver inferring the type of a program so that deadlocks can be identified statically and can automatically verify the absence of deadlocks in actor programs with wait-by-necessity synchronizations.
16
Multiactive objects and their applications
Ludovic Henrio,Justine Rochas +1 more
TL;DR: In this article, the authors present a complete framework around the multi-active object programming model and present it through ProActive, the Java library that offers multiactive objects, and through MultiASP, the programming language that allows the formalisation of their developments.
From Modelling to Systematic Deployment of Distributed Active Objects
Ludovic Henrio,Justine Rochas +1 more
- 06 Jun 2016
TL;DR: In this paper, the authors reconcile two active object-based languages, ABS and ProActive, that respectively target the aforementioned goals, and compile ABS programs into ProActive to benefit from the strengths of both languages, while requiring no modification on the source code.
References
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
6.9K
•Book
A calculus of communicating systems
Robin Milner
- 01 Jan 1980
TL;DR: A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
5.3K
A calculus of mobile processes, II
TL;DR: The a-calculus is presented, a calculus of communicating systems in which one can naturally express processes which have changing structure, including the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctions.
3.4K
Model checking programs
Willem Visser,Klaus Havelund,Guillaume Brat,Seungjoon Park +3 more
- 11 Sep 2000
TL;DR: A verification and testing environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing, and uses state compression to handle big states and partial order and symmetry reduction, slicing, abstraction, and runtime analysis techniques to reduce the state space.
•Book
Advanced Combinatorics: The Art of Finite and Infinite Expansions
Louis Comtet,J. W. Nienhuys +1 more
- 01 Jan 1974
TL;DR: A vocabulary of combinatorial analysis can be found in this paper, where the authors define definitions of partitions of an integer [n]- 22 Generating Functions of p(n) and P(n, m)- 23 Conditional Partitions- 24 Ferrers Diagrams- 25 Special Identities 'Formal' and 'Combinatorial' Proofs- 26 Partitions with Forbidden Summands Denumerants- Supplement and Exercises- III Identities and Expansions- III Identity and Expansion of a Product of Sums Abel Identity- 31
1.4K