A study of two Languages for Active Objects with Futures

Klapez, Martin (2013) A study of two Languages for Active Objects with Futures. [Laurea magistrale], Università di Bologna, Corso di Studio in Informatica [LM-DM270]
Documenti full-text disponibili:
Documento PDF
Download (468kB) | Anteprima


In computer systems, specifically in multithread, parallel and distributed systems, a deadlock is both a very subtle problem - because difficult to pre- vent during the system coding - and a very dangerous one: a deadlocked system is easily completely stuck, with consequences ranging from simple annoyances to life-threatening circumstances, being also in between the not negligible scenario of economical losses. Then, how to avoid this problem? A lot of possible solutions has been studied, proposed and implemented. In this thesis we focus on detection of deadlocks with a static program analysis technique, i.e. an analysis per- formed without actually executing the program. To begin, we briefly present the static Deadlock Analysis Model devel- oped for coreABS−− in chapter 1, then we proceed by detailing the Class- based coreABS−− language in chapter 2. Then, in Chapter 3 we lay the foundation for further discussions by ana- lyzing the differences between coreABS−− and ASP, an untyped Object-based calculi, so as to show how it can be possible to extend the Deadlock Analysis to Object-based languages in general. In this regard, we explicit some hypotheses in chapter 4 first by present- ing a possible, unproven type system for ASP, modeled after the Deadlock Analysis Model developed for coreABS−−. Then, we conclude our discussion by presenting a simpler hypothesis, which may allow to circumvent the difficulties that arises from the definition of the ”ad-hoc” type system discussed in the aforegoing chapter.

Tipologia del documento
Tesi di laurea (Laurea magistrale)
Autore della tesi
Klapez, Martin
Relatore della tesi
Correlatore della tesi
Corso di studio
Curriculum A: Scienze informatiche
Ordinamento Cds
Parole chiave
Deadlock Analysis, Distributed Systems, Concurrent Systems, Formal Languages
Data di discussione della Tesi
17 Luglio 2013

Altri metadati

Statistica sui download

Gestione del documento: Visualizza il documento