This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE?03)
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
Mont Saint-Michel, France
June 24-June 26
ISBN: 0-7695-1923-7
ASCII Text
x 
 
Tobias Sch?, Klaus Schneider, "Exact Runtime Analysis Using Automata-Based Symbolic Simulation," Formal Methods and Models for Co-Design, ACM/IEEE International Conference on, pp. 153, First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE?03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/MEMCOD.2003.1210100,
author = {Tobias Sch? and Klaus Schneider},
title = {Exact Runtime Analysis Using Automata-Based Symbolic Simulation},
journal ={Formal Methods and Models for Co-Design, ACM/IEEE International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1923-7},
pages = {153},
doi = {http://doi.ieeecomputersociety.org/10.1109/MEMCOD.2003.1210100},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Formal Methods and Models for Co-Design, ACM/IEEE International Conference on
TI - Exact Runtime Analysis Using Automata-Based Symbolic Simulation
SN - 0-7695-1923-7
SP
EP
A1 - Tobias Sch?,
A1 - Klaus Schneider,
PY - 2003
KW - null
VL - 0
JA - Formal Methods and Models for Co-Design, ACM/IEEE International Conference on
ER -
 
Tobias Sch?, University of Kaiserslautern, Department of Computer Science, Reactive Systems Group
Klaus Schneider, University of Kaiserslautern, Department of Computer Science, Reactive Systems Group
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.
Citation:
Tobias Sch?, Klaus Schneider, "Exact Runtime Analysis Using Automata-Based Symbolic Simulation," memocode, pp.153, First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE?03), 2003
Usage of this product signifies your acceptance of the Terms of Use.