A New Approach to Determine Number of Loop Iterations for WCET Analysis

Estimation of program execution time is of great importance for development of real time systems. One of the major ingredients affecting the execution time of a program code is the number of loop iterations. In this paper a new approach to determine the number of loop iterations is presented. This i...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Parsa, Saeed, Sakhaei-nia, Mehdi
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Binary trees Decision making Flow graphs Java Lips loop bound Radiation detectors static analysis symbolic analysis WCET analysis
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	765
container_issue
container_start_page	760
container_title
container_volume
creator	Parsa, Saeed Sakhaei-nia, Mehdi
description	Estimation of program execution time is of great importance for development of real time systems. One of the major ingredients affecting the execution time of a program code is the number of loop iterations. In this paper a new approach to determine the number of loop iterations is presented. This is achieved by building symbolic expressions to represent iteration conditions and state change of the loop counters across each of loop iteration path. These expressions are then evaluated to determine the number of the loop iterations. The result of analysis on the Mälardalen benchmark suite reveals the accuracy of the proposed approach.
doi_str_mv	10.1109/ITNG.2011.134
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5945332</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5945332</ieee_id><sourcerecordid>5945332</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-88b87acb641f306c731e160ef906109176d88ca077345c485a76d61fdd7854a53</originalsourceid><addsrcrecordid>eNotj09LhEAchiciKDaPnbrMF9Dm5_w_im2uIHYROi6jztDA6ohjxH77pDo9vM_hhQehJyAZANEvdddWWU4AMqDsBiVaKiKF5owKSW9_NwjIFWO55PcoidH3JBdSCCXJA6oK3NpvXCzLGszwibeAX-1m18nPFrdfU29XHBxuQlhwvXuz-TBH7MKKP8pjh4vZXK7Rx0d058wl2uSfB9S9HbvylDbvVV0WTeo12VKleiXN0AsGjhIxSAoWBLFOE7HHgBSjUoMhUlLGB6a42Y0AN45ScWY4PaDnv1tvrT0vq5_Mej1zzTilOf0BwstKkA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A New Approach to Determine Number of Loop Iterations for WCET Analysis</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Parsa, Saeed ; Sakhaei-nia, Mehdi</creator><creatorcontrib>Parsa, Saeed ; Sakhaei-nia, Mehdi</creatorcontrib><description>Estimation of program execution time is of great importance for development of real time systems. One of the major ingredients affecting the execution time of a program code is the number of loop iterations. In this paper a new approach to determine the number of loop iterations is presented. This is achieved by building symbolic expressions to represent iteration conditions and state change of the loop counters across each of loop iteration path. These expressions are then evaluated to determine the number of the loop iterations. The result of analysis on the Mälardalen benchmark suite reveals the accuracy of the proposed approach.</description><identifier>ISBN: 9781612844275</identifier><identifier>ISBN: 1612844278</identifier><identifier>EISBN: 9780769543673</identifier><identifier>EISBN: 0769543677</identifier><identifier>DOI: 10.1109/ITNG.2011.134</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Binary trees ; Decision making ; Flow graphs ; Java ; Lips ; loop bound ; Radiation detectors ; static analysis ; symbolic analysis ; WCET analysis</subject><ispartof>2011 Eighth International Conference on Information Technology: New Generations, 2011, p.760-765</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5945332$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5945332$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Parsa, Saeed</creatorcontrib><creatorcontrib>Sakhaei-nia, Mehdi</creatorcontrib><title>A New Approach to Determine Number of Loop Iterations for WCET Analysis</title><title>2011 Eighth International Conference on Information Technology: New Generations</title><addtitle>itng</addtitle><description>Estimation of program execution time is of great importance for development of real time systems. One of the major ingredients affecting the execution time of a program code is the number of loop iterations. In this paper a new approach to determine the number of loop iterations is presented. This is achieved by building symbolic expressions to represent iteration conditions and state change of the loop counters across each of loop iteration path. These expressions are then evaluated to determine the number of the loop iterations. The result of analysis on the Mälardalen benchmark suite reveals the accuracy of the proposed approach.</description><subject>Algorithm design and analysis</subject><subject>Binary trees</subject><subject>Decision making</subject><subject>Flow graphs</subject><subject>Java</subject><subject>Lips</subject><subject>loop bound</subject><subject>Radiation detectors</subject><subject>static analysis</subject><subject>symbolic analysis</subject><subject>WCET analysis</subject><isbn>9781612844275</isbn><isbn>1612844278</isbn><isbn>9780769543673</isbn><isbn>0769543677</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj09LhEAchiciKDaPnbrMF9Dm5_w_im2uIHYROi6jztDA6ohjxH77pDo9vM_hhQehJyAZANEvdddWWU4AMqDsBiVaKiKF5owKSW9_NwjIFWO55PcoidH3JBdSCCXJA6oK3NpvXCzLGszwibeAX-1m18nPFrdfU29XHBxuQlhwvXuz-TBH7MKKP8pjh4vZXK7Rx0d058wl2uSfB9S9HbvylDbvVV0WTeo12VKleiXN0AsGjhIxSAoWBLFOE7HHgBSjUoMhUlLGB6a42Y0AN45ScWY4PaDnv1tvrT0vq5_Mej1zzTilOf0BwstKkA</recordid><startdate>201104</startdate><enddate>201104</enddate><creator>Parsa, Saeed</creator><creator>Sakhaei-nia, Mehdi</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201104</creationdate><title>A New Approach to Determine Number of Loop Iterations for WCET Analysis</title><author>Parsa, Saeed ; Sakhaei-nia, Mehdi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-88b87acb641f306c731e160ef906109176d88ca077345c485a76d61fdd7854a53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithm design and analysis</topic><topic>Binary trees</topic><topic>Decision making</topic><topic>Flow graphs</topic><topic>Java</topic><topic>Lips</topic><topic>loop bound</topic><topic>Radiation detectors</topic><topic>static analysis</topic><topic>symbolic analysis</topic><topic>WCET analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Parsa, Saeed</creatorcontrib><creatorcontrib>Sakhaei-nia, Mehdi</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Parsa, Saeed</au><au>Sakhaei-nia, Mehdi</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A New Approach to Determine Number of Loop Iterations for WCET Analysis</atitle><btitle>2011 Eighth International Conference on Information Technology: New Generations</btitle><stitle>itng</stitle><date>2011-04</date><risdate>2011</risdate><spage>760</spage><epage>765</epage><pages>760-765</pages><isbn>9781612844275</isbn><isbn>1612844278</isbn><eisbn>9780769543673</eisbn><eisbn>0769543677</eisbn><abstract>Estimation of program execution time is of great importance for development of real time systems. One of the major ingredients affecting the execution time of a program code is the number of loop iterations. In this paper a new approach to determine the number of loop iterations is presented. This is achieved by building symbolic expressions to represent iteration conditions and state change of the loop counters across each of loop iteration path. These expressions are then evaluated to determine the number of the loop iterations. The result of analysis on the Mälardalen benchmark suite reveals the accuracy of the proposed approach.</abstract><pub>IEEE</pub><doi>10.1109/ITNG.2011.134</doi><tpages>6</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 9781612844275
ispartof	2011 Eighth International Conference on Information Technology: New Generations, 2011, p.760-765
issn
language	eng
recordid	cdi_ieee_primary_5945332
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Algorithm design and analysis Binary trees Decision making Flow graphs Java Lips loop bound Radiation detectors static analysis symbolic analysis WCET analysis
title	A New Approach to Determine Number of Loop Iterations for WCET Analysis
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T18%3A25%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20New%20Approach%20to%20Determine%20Number%20of%20Loop%20Iterations%20for%20WCET%20Analysis&rft.btitle=2011%20Eighth%20International%20Conference%20on%20Information%20Technology:%20New%20Generations&rft.au=Parsa,%20Saeed&rft.date=2011-04&rft.spage=760&rft.epage=765&rft.pages=760-765&rft.isbn=9781612844275&rft.isbn_list=1612844278&rft_id=info:doi/10.1109/ITNG.2011.134&rft_dat=%3Cieee_6IE%3E5945332%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769543673&rft.eisbn_list=0769543677&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5945332&rfr_iscdi=true