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.
Time complexity of concurrent programs – A technique based on behavioural types / Giachino, Elena; Johnsen, Einar Broch; Laneve, Cosimo; Pun, Ka I.. - STAMPA. - 9539:(2016), pp. 199-216. (Intervento presentato al convegno Formal Aspects of Component Software - 12th International Conference, FACS 2015 tenutosi a Niterói, Brazil nel October 14-16, 2015) [10.1007/978-3-319-28934-2_11].
Time complexity of concurrent programs – A technique based on behavioural types
Giachino, Elena;Laneve, Cosimo;
2016
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
