Time complexity of concurrent programs

TL;DR

This paper introduces a method for automatically computing the time complexity of concurrent object-oriented programs by translating behavioral types into cost equations solved by existing tools.

Contribution

It proposes a novel approach that uses behavioral types and cost equations to analyze the time complexity of concurrent programs automatically.

Findings

Effective translation of behavioral types into cost equations.

Automated analysis of time complexity using existing solvers.

Applicable to concurrent object-oriented programs.

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.