Das et al. develop a method for analyzing the time complexity of concurrent, message-passing algorithms. Their method is based on adding timing information to datatypes. Specifically, they use a family of datatypes called session types; these constrain the structure of interactions that may take place over a channel of communication. In Das’s system, the timing properties of an algorithm can be verified by a typechecker: if the timing information in the session types is mismatched, the computer will report a type error. In their paper, Das et al. develop the theory for such a typechecker, but do not provide an implementation
Walbran, Joseph M.
"Using Temporal Session Types to Analyze Time Complexities of Concurrent Programs,"
Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal: Vol. 9:
1, Article 8.
Available at: https://digitalcommons.morris.umn.edu/horizons/vol9/iss1/8