12th International Workshop on Worst-Case Execution Time Analysis

References (124)

1. ARM920T Technical Reference Manual, 1 edition, 2001.
2. C. Berg. PLRU Cache Domino Effects. In 6th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2006.
3. J. Eisinger, I. Polian, B. Becker, A. Metzner, S. Thesing, and R. Wilhelm. Automatic identification of timing anomalies for cycle-accurate worst-case execution time analysis. In Design and Diagnostics of Electronic Circuits and systems, 2006 IEEE, pages 13-18, 2006.
4. G. Gebhard. Timing Anomalies Reloaded. In 10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010), volume 15, pages 1-10, 2010.
5. T. Lundqvist. A WCET analysis method for pipelined microprocessors with cache memories. PhD thesis, Chalmers University of Technology, 2002.
6. T. Lundqvist and P. Stenstrom. Timing Anomalies in Dynamically Scheduled Micropro- cessors. In IEEE Real-Time Systems Symposium, pages 12-21, 1999.
7. J. Reineke and D. Grund. Sensitivity of Cache Replacement Policies. Technical Report 36, March 2008. ISSN: 1860-9821, http://www.avacs.org/.
8. W C E T ' 1 2
9. COIN-OR Linear Programming: http://www.coin-or.org/Clp.
10. AbsInt Angewandte Informatik GmbH. AbsInt Advanced Analyzer for PowerPC MPC7448 (Simple Memory Model): User Documentation.
11. Claire Burguière and Christine Rochange. On the complexity of modeling dynamic branch predictors when computing worst-case execution time. In Proceedings of the ERCIM/DE- COS Workshop On Dependable Embedded Systems, August 2007.
12. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 238-252, New York, NY, USA, 1977. ACM Press.
13. Christoph Cullmann. Cache persistence analysis: a novel approach theory and practice. In Jan Vitek and Bjorn De Sutter, editors, LCTES, pages 121-130. ACM, 2011.
14. Stephen A. Edwards and Edward A. Lee. The case for the precision timed (PRET) machine. In DAC, pages 264-265. IEEE, 2007.
15. Jakob Engblom. Processor Pipelines and Static Worst-Case Execution Time Analysis. PhD thesis, Dept. of Information Technology, Uppsala University, 2002.
16. Andreas Ermedahl and Jan Gustafsson. Deriving annotations for tight calculation of exe- cution time. In Euro-Par, pages 1298-1307, 1997.
17. C. Ferdinand, R. Heckmann, M. Langenbach, F. Martin, M. Schmidt, H. Theiling, S. The- sing, and R. Wilhelm. Reliable and precise WCET determination for a real-life processor. In International Conference on Embedded Software, volume 2211 of LNCS, pages 469-485, 2001.
18. Christian Ferdinand and Reinhard Wilhelm. Efficient and precise cache behavior prediction for real-time systems. Real-Time Sys., 17(2-3):131-181, 1999.
19. Freescale Semiconductor. MPC7450 RISC Microprocessor Family Reference Manual.
20. Daniel Grund, Jan Reineke, and Gernot Gebhard. Branch target buffers: WCET analysis framework and timing predictability. Journal of Systems Architecture, 57(6):625-637, 2011.
21. Jan Gustafsson, Adam Betts, Andreas Ermedahl, and Björn Lisper. The Mälardalen WCET benchmarks -past, present and future. pages 137-147, Brussels, Belgium, July 2010. OCG.
22. C. Healy, M. Sjödin, V. Rustagi, D. Whalley, and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Real-Time Sys., pages 129-156, 2000.
23. Reinhold Heckmann, Marc Langenbach, Stephan Thesing, and Reinhard Wilhelm. The influence of processor architecture on the design and the results of WCET tools. Proceedings of the IEEE, 91(7):1038-1054, 2003.
24. Benedikt Huber, Wolfgang Puffitsch, and Martin Schoeberl. Worst-case execution time analysis-driven object cache design. Concurrency and Computation: Practice and Experi- ence, 24(8):753-771, 2012.
25. Yau-Tsun Steven Li and Sharad Malik. Performance analysis of embedded software using implicit path enumeration. In Proceedings of the 32nd ACM/IEEE Design Automation Conference, pages 456-461, 1995.
26. Jan Reineke, Björn Wachter, Stephan Thesing, Reinhard Wilhelm, Ilia Polian, Jochen Eisinger, and Bernd Becker. A definition and classification of timing anomalies. In Pro- ceedings of 6th International Workshop on Worst-Case Execution Time (WCET) Analysis, July 2006.
27. Martin Schoeberl. A java processor architecture for embedded real-time systems. Journal of Systems Architecture, 54(1-2):265 -286, 2008.
28. Ingmar Stein and Florian Martin. Analysis of path exclusion at the machine code level. In Proceedings of the 7th Intl. Workshop on Worst-Case Execution-Time Analysis, 2007.
29. W C E T ' 1 2
30. References AbsInt Angewandte Informatik GmbH. aiT Worst-Case Execution Time Analyzer. http: //www.absint.com/ait/.
31. Bowen Alpern, Mark N. Wegman, and F. Kenneth Zadeck. Detecting equality of variables in programs. In Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '88, pages 1-11. ACM, 1988.
32. David L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, pages 197-212, London, UK, 1990. Springer-Verlag.
33. Christian Ferdinand. Cache Behavior Prediction for Real-Time Systems. PhD thesis, Saar- land University, 1997.
34. Andrea Flexeder. Interprocedural Analysis of Low-Level Code. PhD thesis, Technische Universität München, 2011.
35. Somnath Ghosh, Margaret Martonosi, and Sharad Malik. Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Trans. Program. Lang. Syst., 21(4):703-746, July 1999.
36. Dominik Grewe. Static Congruence Analysis on Binaries. Bachelor's thesis, Saarland University, 2008.
37. Jan Gustafsson, Adam Betts, Andreas Ermedahl, and Björn Lisper. The Mälardalen WCET Benchmarks -Past, Present and Future. In Proceedings of the 10th International Workshop on Worst-Case Execution Time Analysis, July 2010.
38. Sebastian Hahn and Daniel Grund. Relational Cache Analysis for Static Timing Analysis. In Proceedings of the 24th Euromicro Conference on Real-Time Systems, Los Alamitos, CA, USA, July 2012. IEEE.
39. Yau-Tsun Steven Li, Sharad Malik, and Andrew Wolfe. Efficient microarchitecture model- ing and path analysis for real-time software. In Proceedings of the 16th IEEE Real-Time Systems Symposium, RTSS '95, page 298, Washington, DC, USA, 1995. IEEE Computer Society.
40. Yau-Tsun Steven Li, Sharad Malik, and Andrew Wolfe. Cache modeling for real-time soft- ware: beyond direct mapped instruction caches. In Proceedings of the 17th IEEE Real-Time Systems Symposium, RTSS '96, page 254, Washington, DC, USA, 1996. IEEE Computer Society. Thomas Lundqvist and Per Stenström. A method to improve the estimated worst-case performance of data caching. In Proceedings of the Sixth International Conference on Real- Time Computing Systems and Applications, RTCSA '99, page 255, Washington, DC, USA, 1999. IEEE Computer Society.
41. Antoine Miné. A new numerical abstract domain based on difference-bound matrices. In PADO '01: Proceedings of the Second Symposium on Programs as Data Objects, pages 155-172, London, UK, 2001. Springer-Verlag.
42. Xavier Vera and Jingling Xue. Let's study whole-program cache behaviour analytically. In Proceedings of International Symposium on High-Performance Computer Architecture (HPCA '02), pages 175-186, 2002.
43. Simon Wegener. Improving Static Analysis of Loops. Master's thesis, Saarland University, 2011. W C E T ' 1 2
44. Sudipta Chattopadhyay, C.-L. Kee, Abhik Roychoudhury, Timon Kelter, Peter Marwedel, and Heiko Falk. A unified WCET analysis framework for multi-core platforms. In 18th IEEE Real-time and Embedded Technology and Applications Symposium (RTAS'12), Beijing, China, April 2012.
45. 2 Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4 th ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, January 1977.
46. Andreas Ermedahl, Jan Gustafsson, and Björn Lisper. Deriving WCET bounds by ab- stract execution. In Chris Healy, editor, Proc. 11 th International Workshop on Worst-Case Execution Time Analysis (WCET'2011), Porto, Portugal, July 2011.
47. Jan Gustafsson. Analyzing Execution-Time of Object-Oriented Programs Using Abstract Interpretation. PhD thesis, Dept. of Information Technology, Uppsala University, Sweden, May 2000.
48. Jan Gustafsson and Andreas Ermedahl. Merging techniques for faster derivation of WCET flow information using abstract execution. In Raimund Kirner, editor, Proc. 8 th Interna- tional Workshop on Worst-Case Execution Time Analysis (WCET'2008), Prague, Czech Republic, July 2008.
49. Jan Gustafsson, Andreas Ermedahl, Christer Sandberg, and Björn Lisper. Automatic derivation of loop bounds and infeasible paths for WCET analysis using abstract execution. In Proc. 27 th IEEE Real-Time Systems Symposium (RTSS'06), pages 57-66, Rio de Janeiro, Brazil, December 2006. IEEE Computer Society.
50. Andreas Gustavsson, Andreas Ermedahl, Björn Lisper, and Paul Pettersson. Towards WCET analysis of multicore architectures using UPPAAL. In Björn Lisper, editor, Proc. 10 th International Workshop on Worst-Case Execution Time Analysis (WCET'2010), pages 103-113, Brussels, Belgium, July 2010. OCG.
51. Andreas Gustavsson, Jan Gustafsson, and Björn Lisper. Toward static timing analysis of parallel systems -technical report. Technical Report 2796, Dept. of Computer Science and Engineering, Mälardalen University, April 2012. URL: http://www.mrtc.mdh.se/index.php?choice=publications&id=2796.
52. Mingsong Lv, Nan Guan, Wang Yi, and Ge Yu. Combining abstract interpretation with model checking for timing analysis of multicore software. In Scott Brandt, editor, Proc. 31 th IEEE Real-Time Systems Symposium (RTSS'10), pages 339-349, San Diego, CA, December 2010. IEEE.
53. Flemming Nielson, Hanne Ries Nielson, and Chris Hankin. Principles of Program Analysis, 2 nd edition. Springer, 2005. ISBN 3-540-65410-0.
54. Christine Rochange, Armelle Bonenfant, Pascal Sainrat, Mike Gerdes, Julian Wolf, Theo Ungerer, Zlatko Petrov, and Frantisek Mikulu. WCET analysis of a parallel 3D multigrid solver executed on the MERASA multi-core. In Björn Lisper, editor, Proc. 10 th Inter- national Workshop on Worst-Case Execution Time Analysis (WCET'2010), pages 90-100, Brussels, Belgium, July 2010. OCG.
55. Jun Yan and Wei Zhang. WCET analysis for multi-core processors with shared L2 instruc- tion caches. In Proc. 14 th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'08), pages 80-89, June 2008.
56. W C E T ' 1 2
57. David R. Butenhof. Programming with POSIX Threads. Addison-Wesley, 1997.
58. Sudipta Chattopadhyay, C.-L. Kee, Abhik Roychoudhury, Timon Kelter, Peter Marwedel, and Heiko Falk. A unified WCET analysis framework for multi-core platforms. In References
59. R. Bellman. Introduction to Matrix Analysis. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics, 2nd edition, 1997.
60. J. Blieberger. Data-Flow Frameworks for Worst-Case Execution Time Analysis. Real-Time Systems, 22(3):183-227, 2002.
61. P. Buchholz and P. Kemper. Efficient Computation and Representation of Large Reachab- ility Sets for Composed Automata. Discrete Event Dyn. Systems, 12(3):265-286, 2002.
62. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
63. M. Davio. Kronecker Products and Shuffle Algebra. IEEE Trans. Computers, 30(2):116- 125, 1981.
64. A. Graham. Kronecker Products and Matrix Calculus with Applications. Ellis Horwood Ltd., New York, 1981.
65. J. Gustafsson, A. Betts, A. Ermedahl, and B. Lisper. The Mälardalen WCET Benchmarks: Past, Present And Future. In Proc. 10th International Workshop on Worst-Case Execution Time Analysis, pages 136-146, 2010.
66. A. Gustavsson, A. Ermedahl, B. Lisper, and P. Pettersson. Towards WCET Analysis of Multicore Architectures Using UPPAAL. In Proc. 10th International Workshop on Worst- Case Execution Time Analysis, pages 101-112, 2010.
67. P. Henderson and J. H. Morris, Jr. A Lazy Evaluator. In 3rd ACM Symposium on Principles of Programming Languages, POPL '76, pages 95-103, January 1976.
68. W. Kuich and A. Salomaa. Semirings, Automata, Languages. Springer, 1986.
69. G. Küster. On the Hurwitz Product of Formal Power Series and Automata. Theor. Comput. Sci., 83(2):261-273, 1991.
70. R. Mittermayr and J. Blieberger. Shared Memory Concurrent System Verification using Kronecker Algebra. Technical Report 183/1-155, Automation Systems Group, TU Vienna, http://arxiv.org/abs/1109.5522, Sept. 2011.
71. B. Plateau. On the Stochastic Structure of Parallelism and Synchronization Models for Distributed Algorithms. In ACM SIGMETRICS, volume 13, pages 147-154, 1985.
72. V. C. Sreedhar, G. R. Gao, and Y.-F. Lee. A New Framework for Elimination-Based Data Flow Analysis Using DJ Graphs. ACM Trans. Program. Lang. Syst., 20(2):388-435, 1998.
73. R. E. Tarjan. A Unified Approach to Path Problems. J. ACM, 28(3):577-593, 1981. References
74. APEX Working Group. Draft 3 of Supplement 1 to ARINC Specification 653: Avionics Application Software Standard Interface. 2003.
75. Julien Delange and Laurent Lec. POK, an ARINC653-compliant operating system released under the BSD license. 13th Real-Time Linux Workshop, 10 2011.
76. F.J. Cazorla et al. PROARTIS: Probabilistically analysable real-time systems. ACM Trans- actions on Embedded Computing Systems, to appear.
77. Freescale. PowerPC 750 Microprocessor, 2012. https://www-01.ibm.com/chips/ techlib/ techlib.nsf/products/PowerPC_750_Microprocessor.
78. Charles E. Leiserson, Harald Prokop, and Keith H. Randall. Using de Bruijn Sequences to Index a 1 in a Computer Word, 1998.
79. Isaac Liu, Jan Reineke, and Edward A. Lee. A PRET Architecture Supporting Concurrent Programs with Composable Timing Properties. In 44th Asilomar Conference on Signals, Systems, and Computers, pages 2111-2115, November 2010.
80. W C E T ' 1 2
81. Ingo Molnar. Goals, Design and Implementation of the new ultra-scalable O(1) scheduler, Jan. 2002. Available on-line at http://casper.berkeley.edu/, visited on April 2012.
82. F. Mueller. Compiler support for software-based cache partitioning. In ACM SIGPLAN Workshop on Languages, Compilers and Tools for Real-Time Systems, 1995.
83. Peter Puschner, Raimund Kirner, and Robert G. Pettit. Towards composable timing for real-time software. In Proc. 1st International Workshop on Software Technologies for Future Dependable Distributed Systems, Mar. 2009.
84. Peter Puschner and Martin Schoeberl. On Composable System Timing, Task Timing, and WCET Analysis. In Proc. of the 8th Int. Workshop on WCET Analysis, 2008. Rapita Systems Ltd. Rapitime, 2012. http://www.rapitasystems.com/rapitime.
85. J. Reineke et al. A definition and classification of timing anomalies. In WCET, 2006. Gang Yao, Giorgio C. Buttazzo, and Marko Bertogna. Feasibility analysis under fixed priority scheduling with limited preemptions. Real-Time Systems, 47(3):198-223, 2011. References
86. ISO/IEC 8652:1995(E)/TC1(2000)/AMD1(2007): Information Technology -Program- ming Languages -Ada.
87. Karl Johan Åström and Tore Hägglund. Advanced PID Control. ISA -The Instrumentation, Systems, and Automation Society, Research Triangle Park, NC 27709, 2005. Matteo Bordin and Tullio Vardanega. Automated model-based generation of Ravenscar- compliant source code. In Proc. 17th Euromicro Conference on Real-Time System, ECRTS '05, pages 59-67, Washington, DC, USA, 2005. IEEE Computer Society.
88. Alan Burns, Brian Dobbing, and Tullio Vardanega. Guide for the use of the Ada Ravenscar profile in high integrity systems. Ada Letters, XXIV:1-74, June 2004.
89. Juan A. de la Puente, José F. Ruiz, and Juan Zamorano. An open Ravenscar real-time kernel for GNAT. In Hubert B. Keller and Erhard Plödereder, editors, Reliable Software Technologies -Ada-Europe 2000, number 1845 in LNCS, pages 5-15. Springer-Verlag, 2000. Juan A. de la Puente, Juan Zamorano, Alejandro Alonso, and Daniel Brosnan. A real-time computer control platform for an experimental satellite. In Jornadas de Tiempo Real - JTR-2012, 2012. Available at http://www.ctr.unican.es/jtr12/programme.html. European Cooperation for Space Standardization. ECSS-E-ST-40C Space engineering - Software, March 2009. Available from ESA. European Cooperation for Space Standardization. ECSS-Q-ST-80C Space Product Assur- ance -Software Product Assurance, March 2009. Available from ESA. Gaisler Research. LEON3 Product Sheet, 2008.
90. Enrico Mezzetti, Adam Betts, José Ruiz, and Tullio Vardanega. Cache-aware development of high-integrity systems. In Jorge Real and Tullio Vardanega, editors, Reliable Software Technologiey --Ada-Europe 2010, volume 6106 of Lecture Notes in Computer Science, pages 139-152. Springer Berlin / Heidelberg, 2010. Marco Panunzio and Tullio Vardanega. A component model for on-board software applica- tions. In 36th Euromicro Conference on Software Engineering and Advanced Applications, SEAA 2010, pages 57-64, 2010.
91. José Pulido, Juan A. de la Puente, Matteo Bordin, Tullio Vardanega, and Jérôme Hugues. Ada 2005 code patterns for metamodel-based code generation. Ada Letters, XXVII(2):53- 58, August 2007. Proceedings of the 13th International Ada Real-Time Workshop (IR- TAW13). Rapita Systems Ltd. RVS Reference Guide, 2011. Version 3.0.
92. José F. Ruiz. GNAT Pro for on-board mission-critical space applications. In Tullio Vard- anega and Andy Wellings, editors, Reliable Software Technologies -Ada-Europe 2005, volume 3555 of LNCS. Springer-Verlag, 2005. SPARC International, Upper Saddle River, NJ, USA. The SPARC architecture manual: Version 8, 1992.
93. Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller, Isabelle Puaut, Peter Puschner, Jan Staschulat, and Per Stenström. The worst-case execution-time problem-overview of methods and survey of tools. ACM Trans. Embed. Comput. Syst., 7(3):1-53, 2008.
94. Elvira Albert, Puri Arenas, Samir Genaim, and Germán Puebla. Closed-form upper bounds in static cost analysis. J. Autom. Reason., 46(2):161-203, February 2011.
95. Ernst Althaus, Sebastian Altmeyer, and Rouven Naujoks. Precise and efficient parametric path analysis. In LCTES '11: Proceedings of the ACM SIGPLAN/SIGBED 2011 conference on Languages, compilers, and tools for embedded systems, pages 141-150, New York, NY, USA, April 2011. ACM.
96. Sebastian Altmeyer. Parametric WCET analysis, parameter framework and parametric path analysis. Master's thesis, Universität des Saarlandes, 2006.
97. Stefan Bygde, Andreas Ermedahl, and Björn Lisper. An efficient algorithm for parametric wcet calculation. Journal of Systems Architecture -Embedded Systems Design, 57(6):614- 624, 2011.
98. W C E T ' 1 2
99. Susanna Byhlin, Andreas Ermedahl, Jan Gustafsson, and Björn Lisper. Applying static WCET analysis to automotive communication software. In ECRTS, pages 249-258. IEEE Computer Society, 2005.
100. Roderick Chapman. Worst-case timing analysis via finding longest paths in spark ada basic- path graphs. Technical Report Technical Report YCS-94-246, Department of Computer Science, University of York, October 1994.
101. Joel Coffman, Christopher Healy, Frank Mueller, and David Whalley. Generalizing para- metric timing analysis. In Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems, LCTES '07, pages 152-154, New York, NY, USA, 2007. ACM.
102. Antoine Colin and Guillem Bernat. Scope-tree: A program representation for symbolic worst-case execution time analysis. In Proceedings of the 14th Euromicro Conference on Real-Time Systems, ECRTS '02, pages 50-, Washington, DC, USA, 2002. IEEE Computer Society.
103. S.V. Gheorghita, S. Stuijk, T. Basten, and H. Corporaal. Automatic scenario detection for improved WCET estimation. In Design Automation Conference, 2005. Proceedings. 42nd, pages 101 -104, june 2005.
104. Jan Gustafsson, Andreas Ermedahl, Christer Sandberg, and Bjorn Lisper. Automatic derivation of loop bounds and infeasible paths for wcet analysis using abstract execution. In Proceedings of the 27th IEEE International Real-Time Systems Symposium, RTSS '06, pages 57-66, Washington, DC, USA, 2006. IEEE Computer Society. Paul Havlak. Nesting of reducible and irreducible loops. ACM Trans. Program. Lang. Syst., 19(4):557-567, July 1997.
105. Benedikt Huber, Wolfgang Puffitsch, and Peter Puschner. Towards an open timing analysis platform. In 11th International Workshop on Worst-Case Execution Time Analysis, July 2011. Yau-Tsun Steven Li and Sharad Malik. Performance analysis of embedded software using implicit path enumeration. In Proceedings of the 32nd annual ACM/IEEE Design Automa- tion Conference, DAC '95, pages 456-461, New York, NY, USA, 1995. ACM. Björn Lisper. Fully automatic, parametric worst-case execution time analysis. In Jan Gustafsson, editor, WCET, volume MDH-MRTC-116/2003-1-SE, pages 99-102. Depart- ment of Computer Science and Engineering, Mälardalen University, Box 883, 721 23 Västerås, Sweden, 2003.
106. Sibin Mohan, Frank Mueller, Michael Root, William Hawkins, Christopher Healy, David Whalley, and Emilio Vivancos. Parametric timing analysis and its application to dynamic voltage scaling. ACM Trans. Embed. Comput. Syst., 10(2):25:1-25:34, January 2011.
107. Peter P. Puschner and Anton V. Schedl. Computing maximum task execution times -a graph-based approach. Real-Time Systems, 13(1):67-91, 1997. Robert Endre Tarjan. A unified approach to path problems. J. ACM, 28(3):577-593, July 1981. Emilio Vivancos, Christopher A. Healy, Frank Mueller, and David B. Whalley. Parametric timing analysis. In LCTES/OM, pages 88-93. ACM, 2001.
108. Florian Zuleger, Sumit Gulwani, Moritz Sinn, and Helmut Veith. Bound analysis of imper- ative programs with the size-change abstraction. In Proceedings of the 18th international conference on Static analysis, SAS'11, pages 280-297, Berlin, Heidelberg, 2011. Springer- Verlag. References
109. E. Althaus S. Altmeyer and R. Naujoks. Precise and efficient parametric path analysis. SIGPLAN Not., 46(5):141-150.
110. S. Altmeyer, C. Humbert, B. Lisper, and R. Wilhelm. Parametric timing analysis for complex architectures. In Proceedings of the 2008 14 th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'08), pages 367- 376, August 2008.
111. G. Bernat and A. Burns. An approach to symbolic worst-case execution time analysis. In Proceedings of the 25 th Workshop on Real-Time Programming, Palma, Spain, June 2000.
112. D.C. Burger and T.M. Austin. The simplescalar tool set, version 2.0. Technical Report CS-TR-1997-1342, University of Wisconsin, Madison, 1997.
113. S. Bygde, A. Ermedahl, and B. Lisper. An Efficient Algorithm for Parametric WCET Calculation. In Patrick Kellenberger, editor, The 15 th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2009, pages 13-21. IEEE Computer Society, August 2009.
114. J. Coffman, C. Healy, F. Müeller, and D. Whalley. Generalizing parametric timing analysis. ACM SIGPLAN Notices, 42(7):152-154, 2007.
115. J.R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection (Complex Adaptive Systems). A Bradford Book, 1 edition, December 1992.
116. B. Lisper. Fully Automatic, Parametric Worst-Case Execution Time Analysis. In Proceed- ings of the 3 rd International Workshop on Worst-Case Execution Time (WCET) Analysis, pages 77-80, Porto, July 2003.
117. Mälardalen WCET Research Group. WCET project/benchmarks. http://www.mrtc.mdh. se/projects/wcet/benchmarks.html, April 2012.
118. S. Mohan, F. Müeller, W. Hawkins, M. Root, C.A. Healy, and D.B. Whalley. Parascale: Exploiting parametric timing analysis for real-time schedulers and dynamic voltage scal- ing. In 26 th IEEE International Real-Time Systems Symposium (RTSS'05), pages 233-242, 2005.
119. M. Schmidt and H. Lipson. Distilling free-form natural laws from experimental data. Sci- ence, 324(5923):81-85, 3 April 2009.
120. D.P. Searson. GPTIPS: Genetic Programming & Symbolic Regression for MATLAB. http://sites.google.com/site/gptips4matlab/, April 2012.
121. D.P. Searson, D.E. Leahy, and M.J. Willis. GPTIPS : An Open Source Genetic Program- ming Toolbox For Multigene Symbolic Regression. In Proceedings of the International Mul- ticonference of Engineers and Computer Scientists 2010 (IMECS 2010), volume 1, pages 77-80, Hong Kong, 17-19 March 2010.
122. R.A. van Engelen, K.A. Gallivan, and B. Walsh. Parametric timing estimation with Newton- Gregory formulae: Research Articles. Concurrency and Computation: Practice and Exper- ience, 18(11):1435-1463, September 2006.
123. E. Vivancos, C. Healy, F. Müeller, and D. Whalley. Parametric timing analysis. SIGPLAN Not., 36(8):88-93, 2001.
124. R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, F. Müeller, I. Puaut, P. Puschner, J. Staschulat, and P. Stenström. The Worst-Case Execution-Time Problem-Overview of Methods and Survey of Tools. ACM Transations on Embedded Computing Systems, 7(3):1-53, 2008. W C E T ' 1 2