Time analysis of actor programs

Autor: Ka I Pun, Cosimo Laneve, Guillermo Román-Díez, Michael Lienhardt
Přispěvatelé: Department of Computer Science and Engineering [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Foundations of Component-based Ubiquitous Systems (FOCUS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Dipartimento di Informatica - Scienza e Ingegneria [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)-Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), University of Oslo (UiO), Departamento de Ingeniería Electrónica [Madrid], Universidad Politécnica de Madrid (UPM), This work has been partially supported by Comunidad de Madrid as part of the program S2018/TCS-4339 (BLOQUES-CM) cofunded by EIE Funds of the European Union, by the Spanish MINECO project TIN2015-69175-C4-2-R and the SIRIUS Centre for Scalable Data Access, Laneve, Cosimo, Lienhardt, Michael, Pun, Ka I, Román-Díez, Guillermo
Rok vydání: 2019
Předmět:
Zdroj: Journal of Logical and Algebraic Methods in Programming
Journal of Logical and Algebraic Methods in Programming, 2019, 105, pp.1-27. ⟨10.1016/j.jlamp.2019.02.007⟩
Journal of Logical and Algebraic Methods in Programming, Elsevier, 2019, 105, pp.1-27. ⟨10.1016/j.jlamp.2019.02.007⟩
ISSN: 2352-2208
Popis: This paper proposes a technique for estimating the computational time of programs in an actor model, which is intended to serve as a compiler target of a wide variety of actor-based programming languages. We define a compositional translation function returning cost equations, which are fed to an automatic off-the-shelf solver for obtaining the time bounds. Our approach is based on a new notion of synchronization sets, which captures possible difficult synchronization patterns between actors and helps make the analysis efficient and precise. The approach is proven to correctly over-approximate the worst computational time of an actor model of concurrent programs. Our technique is complemented by a prototype analyzer that returns upper bound of costs for the actor model. (C) 2019 Elsevier Inc. All rights reserved.
Databáze: OpenAIRE