A technique for detecting wait-notify deadlocks in Java

Veschetti, Adele (2018) A technique for detecting wait-notify deadlocks in Java. [Laurea magistrale], Università di Bologna, Corso di Studio in Matematica [LM-DM270]
Documenti full-text disponibili:
[img] Documento PDF (Thesis)
Disponibile con Licenza: Creative Commons: Attribuzione - Non commerciale - Non opere derivate 3.0 (CC BY-NC-ND 3.0)

Download (3MB)


Deadlock analysis of object-oriented programs that dynamically create threads and objects is complex, because these programs may have an infinite number of states. In this thesis, I analyze the correctness of wait - notify patterns (e.g. deadlock freedom) by using a newly introduced technique that consists in an analysis model that is a basic concurrent language with a formal semantic. I detect deadlocks by associating a Petri Net graph to each process of the input program. This model allows to check if a deadlock occur by analysing the reachability tree. The technique presented is a basic step of a more complex and complete project, since in my work I only consider programs with one object.

Tipologia del documento
Tesi di laurea (Laurea magistrale)
Autore della tesi
Veschetti, Adele
Relatore della tesi
Correlatore della tesi
Corso di studio
Curriculum A: Generale e applicativo
Ordinamento Cds
Parole chiave
concurrent object-oriented languages threads synchronization primitives deadlock Petri Nets formal analysis techniques coordination primitives
Data di discussione della Tesi
23 Marzo 2018

Altri metadati

Statistica sui download

Gestione del documento: Visualizza il documento