A systematic representation of path constraints for implicit path enumeration technique

Tai Hyo Kim, Ho Jung Bang, Sungdeok Cha

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Accuracy of implicit path enumeration technique (IPET), which statically estimates the worst-case execution time of a program using integer linear programming, relies on flow information captured as flow facts. Unfortunately, flow facts are inadequate for capturing complex and often subtle path constraints such as causalities. Manual annotation often introduces many disjunctions, and performance of IPET computation suffers significantly. This paper proposes a technique of encoding a subset of path constraints into flow facts. The technique has advantages over conventional approaches: (1) translation process is fully automated and (2) efficient IPET computation is possible because generated flow facts are compact in that they contain at most one disjunction. To demonstrate the effectiveness of our technique, a software tool was implemented to automatically generate flow facts for the subset of path constraints and case study has been conducted using public benchmark suites, GNU openSSH codes, and Korea multi-purpose satellite (KOMPSAT-1) software.

Original languageEnglish
Pages (from-to)39-61
Number of pages23
JournalSoftware Testing Verification and Reliability
Volume20
Issue number1
DOIs
Publication statusPublished - 2010 Mar 1

Fingerprint

Linear programming
Satellites

Keywords

  • Implicit path enumeration technique
  • Infeasible paths
  • Real-time systems
  • Static analysis
  • WCET
  • Worst-case execution time

ASJC Scopus subject areas

  • Software
  • Media Technology

Cite this

A systematic representation of path constraints for implicit path enumeration technique. / Kim, Tai Hyo; Bang, Ho Jung; Cha, Sungdeok.

In: Software Testing Verification and Reliability, Vol. 20, No. 1, 01.03.2010, p. 39-61.

Research output: Contribution to journalArticle

@article{109f27a4728e4c09804e16a19ae2e344,
title = "A systematic representation of path constraints for implicit path enumeration technique",
abstract = "Accuracy of implicit path enumeration technique (IPET), which statically estimates the worst-case execution time of a program using integer linear programming, relies on flow information captured as flow facts. Unfortunately, flow facts are inadequate for capturing complex and often subtle path constraints such as causalities. Manual annotation often introduces many disjunctions, and performance of IPET computation suffers significantly. This paper proposes a technique of encoding a subset of path constraints into flow facts. The technique has advantages over conventional approaches: (1) translation process is fully automated and (2) efficient IPET computation is possible because generated flow facts are compact in that they contain at most one disjunction. To demonstrate the effectiveness of our technique, a software tool was implemented to automatically generate flow facts for the subset of path constraints and case study has been conducted using public benchmark suites, GNU openSSH codes, and Korea multi-purpose satellite (KOMPSAT-1) software.",
keywords = "Implicit path enumeration technique, Infeasible paths, Real-time systems, Static analysis, WCET, Worst-case execution time",
author = "Kim, {Tai Hyo} and Bang, {Ho Jung} and Sungdeok Cha",
year = "2010",
month = "3",
day = "1",
doi = "10.1002/stvr.406",
language = "English",
volume = "20",
pages = "39--61",
journal = "Software Testing Verification and Reliability",
issn = "0960-0833",
publisher = "John Wiley and Sons Ltd",
number = "1",

}

TY - JOUR

T1 - A systematic representation of path constraints for implicit path enumeration technique

AU - Kim, Tai Hyo

AU - Bang, Ho Jung

AU - Cha, Sungdeok

PY - 2010/3/1

Y1 - 2010/3/1

N2 - Accuracy of implicit path enumeration technique (IPET), which statically estimates the worst-case execution time of a program using integer linear programming, relies on flow information captured as flow facts. Unfortunately, flow facts are inadequate for capturing complex and often subtle path constraints such as causalities. Manual annotation often introduces many disjunctions, and performance of IPET computation suffers significantly. This paper proposes a technique of encoding a subset of path constraints into flow facts. The technique has advantages over conventional approaches: (1) translation process is fully automated and (2) efficient IPET computation is possible because generated flow facts are compact in that they contain at most one disjunction. To demonstrate the effectiveness of our technique, a software tool was implemented to automatically generate flow facts for the subset of path constraints and case study has been conducted using public benchmark suites, GNU openSSH codes, and Korea multi-purpose satellite (KOMPSAT-1) software.

AB - Accuracy of implicit path enumeration technique (IPET), which statically estimates the worst-case execution time of a program using integer linear programming, relies on flow information captured as flow facts. Unfortunately, flow facts are inadequate for capturing complex and often subtle path constraints such as causalities. Manual annotation often introduces many disjunctions, and performance of IPET computation suffers significantly. This paper proposes a technique of encoding a subset of path constraints into flow facts. The technique has advantages over conventional approaches: (1) translation process is fully automated and (2) efficient IPET computation is possible because generated flow facts are compact in that they contain at most one disjunction. To demonstrate the effectiveness of our technique, a software tool was implemented to automatically generate flow facts for the subset of path constraints and case study has been conducted using public benchmark suites, GNU openSSH codes, and Korea multi-purpose satellite (KOMPSAT-1) software.

KW - Implicit path enumeration technique

KW - Infeasible paths

KW - Real-time systems

KW - Static analysis

KW - WCET

KW - Worst-case execution time

UR - http://www.scopus.com/inward/record.url?scp=77449086518&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77449086518&partnerID=8YFLogxK

U2 - 10.1002/stvr.406

DO - 10.1002/stvr.406

M3 - Article

VL - 20

SP - 39

EP - 61

JO - Software Testing Verification and Reliability

JF - Software Testing Verification and Reliability

SN - 0960-0833

IS - 1

ER -