Provably correct loops bounds for realtime Java programs

ACM International Conference Proceeding Series

Volumn 177, Issue , 2006, Pages 162-169

  Hunt, James J ^a   Siebert, Fridtjof B ^a   Schmitt, Peter H ^b   Tonin, Isabel ^b  

^a Aicas GmbH   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Data flow; Deductive verification; Formal analysis; Realtime Java; Worst case execution time; Worst case memory usage

Indexed keywords

DATA FLOW ANALYSIS; JAVA PROGRAMMING LANGUAGE; PROBLEM SOLVING; VERIFICATION;

DEDUCTIVE VERIFICATION; FORMAL ANALYSIS; REAL TIME JAVA; WORST CASE EXECUTION TIME; WORST CASE MEMORY USAGE;

REAL TIME SYSTEMS;

EID: 34547290417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1167999.1168026     Document Type: Conference Paper

References (31)

1. Absint ait page. URL: http://www.absint.com/ait/.
2. Bound-t tool homepage. URL: http://www.bound-t.com/.
3. W. Ahrendt, T. Baar, B. Beckert, R. Bubel, M. Giese, R.. Hahnle, W. Menzel, W. Mostowski, A. Roth, S. Schlager, and P. H. Schmitt. The KeY tool. Software and System Modeling, 4:32-54, 2005.
4. B. Beckert. A dynamic logic for the formal verification of Java Card programs. In I. Attali and T. Jensen, editors, Java on Smart Cards: Programming and Security. Revised Papers, Java Card 2000, International Workshop, Cannes, France, volume 2041, pages 6-24. Springer-Verlag, 2001.
5. M. Berkelaar. lp_solve (mixed integer linear program solver) ftp site. ftp://ftp.es.ale.tue.nl/pub/lp.solve. Reported to have solved models with up to 30,000 variables and 50,000 constraints. A Java version is available at http://www.cs.sunysb.edu/~algorith/implement/lpsolve/implement.shtml.
6. G. Bernat. Javelin webpage. URL: http://www-users.cs.york.ac.uk/~bernat/ javelin/index.html, Mar. 2000.
7. G. Bernat, A. Burns, and A. Wellings. Portable worst case execution time analysis using java byte code. In Proc. 12th EUROMICRO conference on Real-time Systems, June 2000.
8. G. Bollela. Real-Time Specification for Java. Addison-Wesley, 2001.
9. T. Clark and J. Warmer, editors. Object Modeling with the OCL. The Rationale behind the Object Constraint Language, volume 2263 of LNCS. Springer, 2002.
10. A. Colin. Heptane webpage. URL: http://www.irisa.fr/solidor/work/heptane- demo/ heptane.html, Feb. 2001.
11. A. Colin and I. Puaut. A modular and retargetable framework for tree-based wcet analysis. In Proceedings of the 13th Euromicro Conference, on Real-Time Systems, pages 37-44, Delft, Netherlands, June 2001.
12. C. Ferdinand, R. Heckmann, M. Langenbach, F. Martin, M. Schmidt, H. Theiling, S. Thesing, and R. Wilhelm. Reliable and Precise WCET Determination for a Real-Life Processor. In Embedded Software Workshop, Lake Tahoe, USA, October 2001. (C) Springer Verlag, see http://www.springer.de/comp/lncs/ index.html.
13. T. Gedell and R. Hähnle. Automating verification of loops by parallelization. submitted, 2006.
14. J. Gustafsson, A. Ermedahl, and B. Lisper. Algorithms for infeasible path calculation. In Sixth International Workshop on Worst-Case Execution Time Analysis, (WCET'2006), Dresden, Germany, July 2006.
15. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
16. A. Hergenhan and W. Rosenstiel. Static timing analysis of embedded software on modern processor architectures. In Proceedings of the Date 2000 Conference, pages 552-559, Paris, France, Mar. 2000.
17. A. Hergenhan, A. Siebenborn, and W. Rosenstiel. Studies on different modeling aspects for tight calculations of worst case execution time. In WIP-Proceedings of the 21th IEEE Real-Time Systems Symposium, Orlando FL, USA, Nov. 2000.
18. Hija, high-integrity Java, www.hija.info, 2004-2006.
19. M. Hind. Pointer analysis: Haven't we solved this problem yet? In 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'01), Snowbird, UT, June 2001.
20. C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10):576-580, 1969.
21. R. Kirner, calc_wcet_167 webpage. URL: http: //www.vmars.tuwien.ac.at/ ~raimund/calc_wcet/, Oct. 2001.
22. R. Kirner. The programming language wcetc. Research Report 2/2002, Technische Universität Wien, Institut für Technische Informatik, Treitlstr. 1-3/182-1, 1040 Vienna, Austria, 2002.
23. G. T. Leavens, E. Poll, C. Clifton, Y. Cheon, C. Ruby, D. Cok, and J. Kiniry. JML Reference Manual, Nov. 2004. Draft revision 1.98.
24. G. T. Levens, E. Poll, C. Clifton, Y. Cheon, C. Ruby, D. Cok, and J. Kiniry. JML reference manual. http://www.jmlspec.org/, 2004.
25. Y.-T. S. Li. Cinderella 3.0 home page. URL: http: //www.ee.princeton.edu/ ~yauli/cinderella-3.0/, Oct. 1996.
26. B. Meyer. Applying "Design by Contract". IEEE Computer, 25(10):40-51, 1992.
27. A. Milanova, A. Rountev, and B. G. Ryder. Parameterized object sensitivity for points-to and side-effect analyses for Java. In ISSTA '02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis, pages 1-11, New York, NY, USA, 2002. ACM Press.
28. Conference Record of the Twenty-first Annual ACM Symposium on Principles of Programming Languages, ACM SIGPLAN Notices. ACM Press, Jan. 1994.
29. P. Puschner and C. Koza. Calculating the maximum execution time of real-time programs. Journal of Real-Time Systems, 1(2):159-176, May 1989.
30. M. Tofte. A brief introduction to Regions. pages 186-195, 1998.
31. M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, Feb. 1997. An earlier version of this was presented at [28].