Exact Runtime Analysis Using Automata-Based Symbolic Simulation

Authors:
Tobias Schüle;Klaus Schneider
Affiliations:
-;-
Venue:
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Year:
2003

Citing 0
Cited 4

Generating Formal Models for Real-Time Verification by Exact Low-Level Runtime Analysis of Synchronous Programs

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Abstraction of assembler programs for symbolic worst case execution time analysis

Proceedings of the 41st annual Design Automation Conference
Abstract Interpretation with Applications to Timing Validation

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Counter automata for parameterised timing analysis of box-based systems

FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

cIn this paper, we present a technique for determining tightbounds on the execution time of assembler programs. Thus,our method is independent of the design flow, but takes intoaccount the target architecture to obtain accurate estimates.The key idea is to compute the maximal number of executedinstructions by means of symbolic simulation. To this end,we utilize a slight extension of Presburger arithmetic thatcan be translated to finite automata. Finite automata are anefficient data structure for symbolically traversing the statespace of a program.