@inproceedings{mod-17,
  author    = {Franck Cassez and
               Pablo Gonz{\'{a}}lez de Aledo and
               Peter Gj{\o}l Jensen},
  title     = {{WUPPAAL:} Computation of Worst-Case Execution-Time for Binary Programs
               with {UPPAAL}},
  booktitle = {Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand
               Larsen on the Occasion of His 60th Birthday},
  pages     = {560--577},
  year      = {2017},
  series    = {Lecture Notes in Computer Science},
  volume    = {10460},
  publisher = {Springer},  url       = {https://doi.org/10.1007/978-3-319-63121-9_28},
  doi       = {10.1007/978-3-319-63121-9_28},
  timestamp = {Tue, 22 Aug 2017 08:17:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/birthday/CassezAJ17},
  bibsource = {dblp computer science bibliography, http://dblp.org},

  urlpaper = {papers/kim-fest-17.pdf},
  abstract = {We address the problem of computing the worst-case execu- tion-time (WCET) of binary programs using a real-time model-checker. 
  In our previous work, we introduced a fully automated and modular methodology to build a model (network of timed automata) that combined a binary 
  program and the hardware to run the program on. 
  Computing the WCET amounts to finding the longest path time-wise in this model, which can be done using a real-time model checker like Uppaal. 
  In this work, we generalise the previous approach and we define a generic framework to support arbitrary binary language and hardware.
We have implemented our new approach in an extended version of Uppaal, called Wuppaal. 
Experimental results using some standard benchmarks suite for WCET computation (from Malardalen University) 
show that our technique is practical and promising.}
}

{"_id":"p26KqR9fLMDacaaBi","bibbaseid":"cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017","author_short":["Cassez, F.","de Aledo, P. G.","Jensen, P. G."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]},{"firstnames":["Pablo","González"],"propositions":["de"],"lastnames":["Aledo"],"suffixes":[]},{"firstnames":["Peter","Gjøl"],"propositions":[],"lastnames":["Jensen"],"suffixes":[]}],"title":"WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL","booktitle":"Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday","pages":"560–577","year":"2017","series":"Lecture Notes in Computer Science","volume":"10460","publisher":"Springer","url":"https://doi.org/10.1007/978-3-319-63121-9_28","doi":"10.1007/978-3-319-63121-9_28","timestamp":"Tue, 22 Aug 2017 08:17:15 +0200","biburl":"http://dblp.uni-trier.de/rec/bib/conf/birthday/CassezAJ17","bibsource":"dblp computer science bibliography, http://dblp.org","urlpaper":"papers/kim-fest-17.pdf","abstract":"We address the problem of computing the worst-case execu- tion-time (WCET) of binary programs using a real-time model-checker. In our previous work, we introduced a fully automated and modular methodology to build a model (network of timed automata) that combined a binary program and the hardware to run the program on. Computing the WCET amounts to finding the longest path time-wise in this model, which can be done using a real-time model checker like Uppaal. In this work, we generalise the previous approach and we define a generic framework to support arbitrary binary language and hardware. We have implemented our new approach in an extended version of Uppaal, called Wuppaal. Experimental results using some standard benchmarks suite for WCET computation (from Malardalen University) show that our technique is practical and promising.","bibtex":"@inproceedings{mod-17,\n author = {Franck Cassez and\n Pablo Gonz{\\'{a}}lez de Aledo and\n Peter Gj{\\o}l Jensen},\n title = {{WUPPAAL:} Computation of Worst-Case Execution-Time for Binary Programs\n with {UPPAAL}},\n booktitle = {Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand\n Larsen on the Occasion of His 60th Birthday},\n pages = {560--577},\n year = {2017},\n series = {Lecture Notes in Computer Science},\n volume = {10460},\n publisher = {Springer}, url = {https://doi.org/10.1007/978-3-319-63121-9_28},\n doi = {10.1007/978-3-319-63121-9_28},\n timestamp = {Tue, 22 Aug 2017 08:17:15 +0200},\n biburl = {http://dblp.uni-trier.de/rec/bib/conf/birthday/CassezAJ17},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n\n urlpaper = {papers/kim-fest-17.pdf},\n abstract = {We address the problem of computing the worst-case execu- tion-time (WCET) of binary programs using a real-time model-checker. \n In our previous work, we introduced a fully automated and modular methodology to build a model (network of timed automata) that combined a binary \n program and the hardware to run the program on. \n Computing the WCET amounts to finding the longest path time-wise in this model, which can be done using a real-time model checker like Uppaal. \n In this work, we generalise the previous approach and we define a generic framework to support arbitrary binary language and hardware.\nWe have implemented our new approach in an extended version of Uppaal, called Wuppaal. \nExperimental results using some standard benchmarks suite for WCET computation (from Malardalen University) \nshow that our technique is practical and promising.}\n}\n\n\n\n","author_short":["Cassez, F.","de Aledo, P. G.","Jensen, P. G."],"key":"mod-17","id":"mod-17","bibbaseid":"cassez-dealedo-jensen-wuppaalcomputationofworstcaseexecutiontimeforbinaryprogramswithuppaal-2017","role":"author","urls":{"Paper":"http://science.mq.edu.au/~fcassez/bib/papers/kim-fest-17.pdf"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F"],"keywords":[],"search_terms":["wuppaal","computation","worst","case","execution","time","binary","programs","uppaal","cassez","de aledo","jensen"],"title":"WUPPAAL: Computation of Worst-Case Execution-Time for Binary Programs with UPPAAL","year":2017,"downloads":1}