default search action
HoonSang Jin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c17]HyoJung Han, HoonSang Jin, Fabio Somenzi:
Clause simplification through dominator analysis. DATE 2011: 143-148 - 2010
- [j4]HyoJung Han, Fabio Somenzi, HoonSang Jin:
Making Deduction More Effective in SAT Solvers. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 29(8): 1271-1284 (2010)
2000 – 2009
- 2009
- [c16]Hyondeuk Kim, Fabio Somenzi, HoonSang Jin:
Efficient Term-ITE Conversion for Satisfiability Modulo Theories. SAT 2009: 195-208 - 2008
- [c15]Hyondeuk Kim, HoonSang Jin, Kavita Ravi, Petr Spacek, John Pierce, Robert P. Kurshan, Fabio Somenzi:
Application of Formal Word-Level Analysis to Constrained Random Simulation. CAV 2008: 487-490 - 2007
- [j3]Hyondeuk Kim, HoonSang Jin, Fabio Somenzi:
Disequality Management in Integer Difference Logic via Finite Instantiations. J. Satisf. Boolean Model. Comput. 3(1-2): 47-66 (2007) - 2006
- [j2]Chao Wang, Bing Li, HoonSang Jin, Gary D. Hachtel, Fabio Somenzi:
Improving Ariadne's Bundle by Following Multiple Threads in Abstraction Refinement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(11): 2297-2316 (2006) - [c14]Sungpack Hong, Sungjoo Yoo, Sheayun Lee, Sangwoo Lee, Hye Jeong Nam, Bum-Seok Yoo, Jaehyung Hwang, Donghyun Song, Janghwan Kim, Jeongeun Kim, HoonSang Jin, Kyu-Myung Choi, Jeong-Taek Kong, Soo-Kwan Eo:
Creation and utilization of a virtual platform for embedded software optimization: : an industrial case study. CODES+ISSS 2006: 235-240 - [c13]HoonSang Jin, Fabio Somenzi:
Strong conflict analysis for propositional satisfiability. DATE 2006: 818-823 - [c12]Sungpack Hong, Sungjoo Yoo, HoonSang Jin, Kyu-Myung Choi, Jeong-Taek Kong, Soo-Kwan Eo:
Runtime distribution-aware dynamic voltage scaling. ICCAD 2006: 587-594 - 2005
- [c11]HoonSang Jin, Fabio Somenzi:
Prime clauses for fast enumeration of satisfying assignments to boolean circuits. DAC 2005: 750-753 - [c10]HoonSang Jin, HyoJung Han, Fabio Somenzi:
Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit. TACAS 2005: 287-300 - 2004
- [j1]HoonSang Jin, Kavita Ravi, Fabio Somenzi:
Fate and free will in error traces. Int. J. Softw. Tools Technol. Transf. 6(2): 102-116 (2004) - [c9]HoonSang Jin, Mohammad Awedh
, Fabio Somenzi:
CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking. CAV 2004: 519-522 - [c8]Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio Somenzi:
Refining the SAT decision ordering for bounded model checking. DAC 2004: 535-538 - [c7]HoonSang Jin, Fabio Somenzi:
CirCUs: A Hybrid Satisfiability Solver. SAT 2004 - [c6]HoonSang Jin, Fabio Somenzi:
CirCUs: A Hybrid Satisfiability Solver. SAT (Selected Papers 2004: 211-223 - [c5]HoonSang Jin, Fabio Somenzi:
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking. BMC@CAV 2004: 51-65 - 2003
- [c4]Chao Wang, Bing Li, HoonSang Jin, Gary D. Hachtel, Fabio Somenzi:
Improving Ariadneýs Bundle by Following Multiple Threads in Abstraction Refinement. ICCAD 2003: 408-415 - 2002
- [c3]HoonSang Jin, Andreas Kuehlmann, Fabio Somenzi:
Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis. TACAS 2002: 312-326 - [c2]HoonSang Jin, Kavita Ravi, Fabio Somenzi:
Fate and Free Will in Error Traces. TACAS 2002: 445-459
1990 – 1999
- 1999
- [c1]HoonSang Jin, Myung-Soo Jang, Jin-Suk Song, Jin-Yong Lee, Taek-Soo Kim, Jeong-Taek Kong:
Dynamic power estimation using the probabilistic contribution measure (PCM). ISLPED 1999: 279-281
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: