Sung Deok Cha

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hojung Bang

> Home > Persons > Sung Deok Cha

Publications

2010
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/stvr/KimBC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/stvr/KimBC10
Tai Hyo Kim, Hojung Bang, Sung Deok Cha:
A systematic representation of path constraints for implicit path enumeration technique. Softw. Test. Verification Reliab. 20(1): 39-61 (2010)
2009
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/LeeBKC09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/LeeBKC09
Jong-In Lee, Hojung Bang, Tai Hyo Kim, Sung Deok Cha:
Visualization and Formalization of User Constraints for Tight Estimation of Worst-Case Execution Time. IEICE Trans. Inf. Syst. 92-D(1): 24-31 (2009)
2007
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/isorc/BangKC07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isorc/BangKC07
Hojung Bang, Tai Hyo Kim, Sung Deok Cha:
An Iterative Refinement Framework for Tighter Worst-Case Execution Time Calculation. ISORC 2007: 365-372
2006
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/apsec/JeeJBCYPK06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/apsec/JeeJBCYPK06
Eunkyoung Jee, Seungjae Jeon, Hojung Bang, Sung Deok Cha, Junbeom Yoo, Gee-Yong Park, Kee-Choon Kwon:
Testing of Timer Function Blocks in FBD. APSEC 2006: 243-250

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.