@article{DBLP:journals/corr/abs-1006-1951,
  author    = {Franck Cassez},
  title     = {Timed Games for Computing Worst-Case Execution-Times},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1006.1951},
  year      = {2010},
  url       = {http://arxiv.org/abs/1006.1951},
  timestamp = {Mon, 05 Dec 2011 18:04:54 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1006-1951},
  bibsource = {dblp computer science bibliography, http://dblp.org},
    keywords = {wcet, timed automata},

  abstract= {In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution.}
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% 2009
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

{"_id":"jMeoDRvp2RdWTDhae","bibbaseid":"cassez-timedgamesforcomputingworstcaseexecutiontimes-2010","author_short":["Cassez, F."],"bibdata":{"bibtype":"article","type":"E - Reports","author":[{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]}],"title":"Timed Games for Computing Worst-Case Execution-Times","journal":"CoRR","volume":"abs/1006.1951","year":"2010","url":"http://arxiv.org/abs/1006.1951","timestamp":"Mon, 05 Dec 2011 18:04:54 +0100","biburl":"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1006-1951","bibsource":"dblp computer science bibliography, http://dblp.org","keywords":"wcet, timed automata","abstract":"In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution.","bibtex":"@article{DBLP:journals/corr/abs-1006-1951,\n author = {Franck Cassez},\n title = {Timed Games for Computing Worst-Case Execution-Times},\n journal = {CoRR},\n Type = {E - Reports},\n volume = {abs/1006.1951},\n year = {2010},\n url = {http://arxiv.org/abs/1006.1951},\n timestamp = {Mon, 05 Dec 2011 18:04:54 +0100},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1006-1951},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n keywords = {wcet, timed automata},\n\n abstract= {In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute the WCET as the optimal time to reach a winning state in this game. We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA. We also show that this framework can easily be extended to take into account dynamic changes in the speed of the processor during program execution.}\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%%% 2009\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n","author_short":["Cassez, F."],"key":"DBLP:journals/corr/abs-1006-1951","id":"DBLP:journals/corr/abs-1006-1951","bibbaseid":"cassez-timedgamesforcomputingworstcaseexecutiontimes-2010","role":"author","urls":{"Paper":"http://arxiv.org/abs/1006.1951"},"keyword":["wcet","timed automata"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["qbqYFWskmoonRB43F","8742EsvjQfyP2fYBW"],"keywords":["wcet","timed automata"],"search_terms":["timed","games","computing","worst","case","execution","times","cassez"],"title":"Timed Games for Computing Worst-Case Execution-Times","year":2010}