Deadlock detection in recursive programs that admit dynamic resource creation is extremely complex and solutions either give imprecise answers or do not scale. We define an algorithm for detecting deadlocks of linear recursive programs of a basic model. The theory that underpins the algorithm is a generalization of the theory of permutations of names to so-called mutations, which transform tuples by introducing duplicates and fresh names. Our algorithm realizes the back-end of deadlock analyzers for object-oriented programming languages, once the association programs/basic-model-programs has been defined as front-end.

Deadlock Detection in Linear Recursive Programs / Elena Giachino;Cosimo Laneve. - STAMPA. - 8483:(2014), pp. 26-64. [10.1007/978-3-319-07317-0_2]

Deadlock Detection in Linear Recursive Programs

GIACHINO, ELENA;LANEVE, COSIMO
2014

Abstract

Deadlock detection in recursive programs that admit dynamic resource creation is extremely complex and solutions either give imprecise answers or do not scale. We define an algorithm for detecting deadlocks of linear recursive programs of a basic model. The theory that underpins the algorithm is a generalization of the theory of permutations of names to so-called mutations, which transform tuples by introducing duplicates and fresh names. Our algorithm realizes the back-end of deadlock analyzers for object-oriented programming languages, once the association programs/basic-model-programs has been defined as front-end.
2014
Formal Methods for Executable Software Models
26
64
Deadlock Detection in Linear Recursive Programs / Elena Giachino;Cosimo Laneve. - STAMPA. - 8483:(2014), pp. 26-64. [10.1007/978-3-319-07317-0_2]
Elena Giachino;Cosimo Laneve
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/413998
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? ND
social impact