A general approach for expressing infeasibility in Implicit Path Enumeration Technique

Static timing analysis aims at computing a guaranteed upper bound to the Worst-Case Execution Time (WCET) of a program. It requires both an accurate modeling of the hardware, and a precise analysis of the program in order to reject infeasible executions (in particular, all infinite ones). For the ac...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2014 proceedings of the International Conference on Embedded Software (EMSOFT) : October 12-17, 2014, Jaypee Greens Golf and Spa Resort, New Delhi, India S. 1 - 9
1. Verfasser: Raymond, Pascal
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: ACM 01.10.2014
Schlagworte:
Avatars
Cognition
Concrete
Image edge detection
infeasible path
Integer linear programming
Linear programming
Radiation detectors
WCET
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Static timing analysis aims at computing a guaranteed upper bound to the Worst-Case Execution Time (WCET) of a program. It requires both an accurate modeling of the hardware, and a precise analysis of the program in order to reject infeasible executions (in particular, all infinite ones). For the actual computation of the worst-case execution, most of the existing tools and methods are based on the Implicit Path Enumeration Technique (IPET), which consist in encoding this search into a numerical optimization problem (Integer Linear Programming, ILP). An interest of this approach is that it naturally integrates the loop bounds. It also allows to implicitly prune infeasible paths, as far as they can be expressed using linear constraints. Several works on the subject are using this ability in order to enhance the WCET estimation: they identify specific property patterns (e.g., implications, exclusions) and propose ad hoc translation into numerical constraints. The goal of this paper is to go further than ad hoc reasoning by proposing a general method for translating infeasibility in terms of numerical constraints. It does not address the problem of finding infeasible paths, only the one of characterizing them as precisely as possible. Moreover the paper aims at exploring the limits of the method, and thus, it does not try to enhance the result using additional methods (e.g., graph transformation).
AbstractList Static timing analysis aims at computing a guaranteed upper bound to the Worst-Case Execution Time (WCET) of a program. It requires both an accurate modeling of the hardware, and a precise analysis of the program in order to reject infeasible executions (in particular, all infinite ones). For the actual computation of the worst-case execution, most of the existing tools and methods are based on the Implicit Path Enumeration Technique (IPET), which consist in encoding this search into a numerical optimization problem (Integer Linear Programming, ILP). An interest of this approach is that it naturally integrates the loop bounds. It also allows to implicitly prune infeasible paths, as far as they can be expressed using linear constraints. Several works on the subject are using this ability in order to enhance the WCET estimation: they identify specific property patterns (e.g., implications, exclusions) and propose ad hoc translation into numerical constraints. The goal of this paper is to go further than ad hoc reasoning by proposing a general method for translating infeasibility in terms of numerical constraints. It does not address the problem of finding infeasible paths, only the one of characterizing them as precisely as possible. Moreover the paper aims at exploring the limits of the method, and thus, it does not try to enhance the result using additional methods (e.g., graph transformation).
Author Raymond, Pascal
Author_xml – sequence: 1
  givenname: Pascal
  surname: Raymond
  fullname: Raymond, Pascal
  email: Pascal.Raymond@imag.fr
  organization: VERIMAG, Univ. Grenoble Alpes, Grenoble, France
BookMark eNotjEFLwzAYhiMo6ObOHrzkD3QmTZM0xzGmGwz0ML2OL82XNdKmtenA_XsL8_TwPvC8M3Ibu4iEPHG25LyQL7mSihVyeaW6IbPJMiGYzOU9WaT0zRiblDS6eCBfK3rCiAM0FPp-6KCqqe8Gir_9gCmFeKIheoQUbGjCeJkW3bV9E6ow0g8Ya7qJ53bqx9BFesCqjuHnjI_kzkOTcPHPOfl83RzW22z__rZbr_YZiDwfM20KRCsLo633vDK5A60YevBaGO0wR2W5M7y00oHTXjCsHJTgUXlvORdz8nz9DYh47IfQwnA5KlMqzpX4AzT0UtU
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1145/2656045.2656046
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
Accès UT - IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 1450330525
9781450330527
EndPage 9
ExternalDocumentID 6986116
Genre orig-research
GroupedDBID 6IE
6IL
ACM
ALMA_UNASSIGNED_HOLDINGS
APO
CBEJK
GUFHI
LHSKQ
RIE
RIL
ID FETCH-LOGICAL-a322t-794eeb5497bff1c92da760efaf7397de2e6b1d918b5dad7f30ecda8afe6ffb113
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000569732600008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 04:52:01 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a322t-794eeb5497bff1c92da760efaf7397de2e6b1d918b5dad7f30ecda8afe6ffb113
OpenAccessLink https://hal.science/hal-04680351
PageCount 9
ParticipantIDs ieee_primary_6986116
PublicationCentury 2000
PublicationDate 2014-Oct.
PublicationDateYYYYMMDD 2014-10-01
PublicationDate_xml – month: 10
  year: 2014
  text: 2014-Oct.
PublicationDecade 2010
PublicationTitle 2014 proceedings of the International Conference on Embedded Software (EMSOFT) : October 12-17, 2014, Jaypee Greens Golf and Spa Resort, New Delhi, India
PublicationTitleAbbrev EMSOFT
PublicationYear 2014
Publisher ACM
Publisher_xml – name: ACM
SSID ssj0001455974
Score 1.5996792
Snippet Static timing analysis aims at computing a guaranteed upper bound to the Worst-Case Execution Time (WCET) of a program. It requires both an accurate modeling...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Avatars
Cognition
Concrete
Image edge detection
infeasible path
Integer linear programming
Linear programming
Radiation detectors
WCET
Title A general approach for expressing infeasibility in Implicit Path Enumeration Technique
URI https://ieeexplore.ieee.org/document/6986116
WOSCitedRecordID wos000569732600008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED21FQNTgRbxLQ-MpI0T1x8jQq1AQlWHgrpVsX2uuqSopEj8exwnaYXEwpQ4Q6ycZfnd5b13APcyMbGRGEeohCpLNyzSPBERT41xiD6noEEo_CqmU7lYqFkLHvZaGEQM5DMclLfhX77dmF1ZKhtyJTmlvA1tIUSl1TrUU1jAxrV7jx8Nk9JXho0G1ZX_ap8STo9J93_znkD_IMMjs_0BcwotzM-g2_RhIPW27MH7I1lV7tGksQgnHosSP1VgueYrUnKuspoJ--1H5CUwydcFmXkISMZ5KcMMi0TmjatrH94m4_nTc1T3S4gyvy2LyAcaUfuET2jnqFGJzQSP0WVOeNRhMUGuqVVU6pHNrHBpjMZmMnPIndOUpufQyTc5XgCxhlv_yYnRqWZMc8UcKulfk3Cfr0l3Cb0yTMuPyhJjWUfo6u_H13DscQarOHA30Cm2O7yFI_NVrD-3d2EdfwDl-6F2
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNETKhh_24NHB2tXuu5ojAQiEg5ouJG1fSVchsFh4n9v1w2IiRdPW3dYs9c0_d7b930P4F4yHWqJYYBJnBSlGx4oweJARFpbRJdTUC8UHsajkZxOk3ENHrZaGET05DNsF7f-X75Z6nVRKuuIRApKxR7sdzlntFRr7Soq3KPjyr_HjTqscJbh3XZ5Fb8aqPjzo9f438zH0NoJ8ch4e8ScQA2zU2hsOjGQamM24f2RzEv_aLIxCScOjRI3lee5ZnNSsK7Sigv77UZk4Lnki5yMHQgkz1khxPTLRCYbX9cWvPWeJ0_9oOqYEKRuY-aBCzWicilfrKylOmEmjUWINrWxwx0GGQpFTUKl6prUxDYKUZtUphaFtYrS6Azq2TLDcyBGC-M-mWkVKc6VSLjFRLrXMOEyNmkvoFmEafZRmmLMqghd_v34Dg77k9fhbDgYvVzBkUMdvGTEXUM9X63xBg70V774XN36Nf0Bd_akvQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2014+proceedings+of+the+International+Conference+on+Embedded+Software+%28EMSOFT%29+%3A+October+12-17%2C+2014%2C+Jaypee+Greens+Golf+and+Spa+Resort%2C+New+Delhi%2C+India&rft.atitle=A+general+approach+for+expressing+infeasibility+in+Implicit+Path+Enumeration+Technique&rft.au=Raymond%2C+Pascal&rft.date=2014-10-01&rft.pub=ACM&rft.spage=1&rft.epage=9&rft_id=info:doi/10.1145%2F2656045.2656046&rft.externalDocID=6986116