|
Published Articles >> Table of Contents >> Abstract
First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE’03)
p. 153
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
Tobias Schüle, University of Kaiserslautern, Department of Computer Science, Reactive Systems Group
Klaus Schneider, University of Kaiserslautern, Department of Computer Science, Reactive Systems Group
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MEMCOD.2003.1210100
Send link to a friend
| Abstract |
|
cIn this paper, we present a technique for determining tight
bounds on the execution time of assembler programs. Thus,
our method is independent of the design flow, but takes into
account the target architecture to obtain accurate estimates.
The key idea is to compute the maximal number of executed
instructions by means of symbolic simulation. To this end,
we utilize a slight extension of Presburger arithmetic that
can be translated to finite automata. Finite automata are an
efficient data structure for symbolically traversing the state
space of a program.
|
 Additional Information
|
Citation:
Tobias Schüle, Klaus Schneider,
"Exact Runtime Analysis Using Automata-Based Symbolic Simulation,"
memocode,
p. 153,
First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE’03),
2003
|
|
