Time complexity of concurrent programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Time complexity of concurrent programs


We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis (cost of statements, creations of objects, and concurrent operations), called behavioural types. Then, we define a translation function that takes behavioural types and makes the parallelism explicit into so-called cost equations , which are fed to an automatic off-the-shelf solver for obtaining the time complexity.
Fichier principal
Vignette du fichier
main.pdf (171.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01229068 , version 1 (16-11-2015)



Elena Giachino, Einar Broch Johnsen, Cosimo Laneve, Ka I Pun. Time complexity of concurrent programs: a technique based on behavioural types. FACS 2015, Oct 2015, Niterói, Rio de Janeiro, Brazil. ⟨hal-01229068⟩
125 View
291 Download



Gmail Facebook Twitter LinkedIn More