Using global data flow analysis on bytecode to aid worst case execution time analysis for real-time Java programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Using global data flow analysis on bytecode to aid worst case execution time analysis for real-time Java programs

Full text

Pdf (311 KB)

Source

ACM International Conference Proceeding Series; Vol. 343 archive
Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems table of contents

Santa Clara, California

SESSION: Application analysis table of contents

Pages 97-105

Year of Publication: 2008

ISBN:978-1-60558-337-2

Authors

James J. Hunt	aicas GmbH, Karlsruhe, Germany
Isabel Tonin	aicas GmbH, Karlsruhe, Germany
Fridtjof B. Siebert	aicas GmbH, Karlsruhe, Germany

Sponsors

ACM : Assoc. for Computing Machinery
: Sun Microsystems, Inc.

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 27, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1434790.1434806 What is a DOI?

ABSTRACT

Though real-time Java offers significant advantages over other programming languages for safe programming, the analysis of worst case execution of real-time Java programs is considerably more difficult. The extra complexity can be addressed using a minimal set of parameterized annotations and data flow analysis to provide a standard worst case execution time analysis tool with the additional information necessary to determine the worst case execution time analysis of real-time Java programms. This methodology has the advantage over existing methods in that it is equally applicable to general purpose library code as to application specific implementation code.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Bound-t tool homepage. URL: http://www.bound-t.com/.
	2	W. Ahrendt, T. Baar, B. Beckert, R. Bubel, M. Giese, R. Hähnle, W. Menzel, W. Mostowski, A. Roth, S. Schlager, and P. H. Schmitt. The KeY tool. Software and System Modeling, 4:32--54, 2005.
	3	G. Bernat. Javelin webpage. URL: http://www-users.cs.york.ac.uk/~bernat/javelin/index.html, Mar. 2000.
	4	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.
	5	A. Colin. Heptane webpage. URL: http://www.irisa.fr/solidor/work/heptane-demo/heptane.html, Feb. 2001.
	6	Antoine Colin , Isabelle Puaut, A Modular & Retargetable Framework for Tree-Based WCET Analysis, Proceedings of the 13th Euromicro Conference on Real-Time Systems, p.37, June 13-15, 2001
	7	C. Ferdinand and R. Heckmann. ait: worst case execution time prediction by static program analysis. In R. Jacquart, editor, IFIP Congress Topical Sessions, pages 377--384. Kluwer, 2004.
	8	A. Hergenhan , W. Rosenstiel, Static timing analysis of embedded software on advanced processor architectures, Proceedings of the conference on Design, automation and test in Europe, p.552-559, March 27-30, 2000, Paris, France [doi>10.1145/343647.343846]
	9	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.
	10	James J. Hunt , Fridtjof B. Siebert , Peter H. Schmitt , Isabel Tonin, Provably correct loops bounds for realtime Java programs, Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems, October 11-13, 2006, Paris, France [doi>10.1145/1167999.1168026]
	11	R. Kirner. calc_wcet_167 webpage. URL: http://www.vmars.tuwien.ac.at/~raimund/calc_wcet/, Oct. 2001.
	12	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.
	13	G. T. Levens, E. Poll, C. Clifton, Y. Cheon, C. Ruby, D. Cok, and J. Kiniry. JML reference manual. http://www.jmlspec.org/, 2004.
	14	Y.-T. S. Li. Cinderella 3.0 home page. URL: http://www.ee.princeton.edu/~yauli/cinderella-3.0/, Oct. 1996.
	15	P. Puschner , Ch. Koza, Calculating the maximum, execution time of real-time programs, Real-Time Systems, v.1 n.2, p.159-176, Sep. 1989 [doi>10.1007/BF00571421]
	16	Martin Schoeberl , Rasmus Pedersen, WCET analysis for a Java processor, Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems, October 11-13, 2006, Paris, France [doi>10.1145/1167999.1168033]
	17	F. Siebert. Hard Real-time Garbage Collection in Modern Object Oriented Programming Languages. aicas Books, 2002.
	18	Fridtjof Siebert, Proving the absence of RTSJ related runtime errors through data flow analysis, Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems, October 11-13, 2006, Paris, France [doi>10.1145/1167999.1168025]