Paper Info
Title
A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction
Abstract
This paper presents a functional model for timing analysis by abstract interpretation, used for estimation of worst-case execution times WCET in multicore architectures using a denotational semantics. The objective aims at surpassing the intrinsic computational complexity of timing analysis of multiple processing units sharing common resources. For this purpose, we propose a novel application of latency-rate <InlineEquation ID=\"IEq1\" <EquationSource Format=\"TEX\"$\\mathcal{LR}$</EquationSource> </InlineEquation> servers, phrased in terms of abstract interpretation, to achieve timing compositionality on requests to shared resources. The soundness of the approach is proven with respect to a calculational fixpoint semantics for multicores that is able to express all possible ways in which a shared resource can be accessed. Experimental results show that the loss in precision introduced by the <InlineEquation ID=\"IEq2\" <EquationSource Format=\"TEX\"$\\mathcal{LR}$</EquationSource> </InlineEquation> server model is about 10% on average and is fairly compensated by the gain in analysis time, which is above 99%. The system is implemented in Haskell, taking advantages of the declarative features of the language for a simpler and more robust specification of the underlying concepts.
Year
DOI
Venue
2013
10.1007/978-3-642-45284-0_4
PADL
Field
DocType
Citations 
Principle of compositionality,Programming language,Abstract interpretation,Computer science,Server,Denotational semantics,Theoretical computer science,Static timing analysis,Haskell,Soundness,Dependency graph
Conference
2
PageRank 
References 
Authors
0.36
10
4
Name
Order
Citations
PageRank
Vitor Rodrigues121.37
Benny Akesson253735.94
Simão Melo de Sousa3959.60
Mário Florido412214.44