Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Inkyu Kim

dblp:25/6919 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 33% Embedded and real-time systems · 33% Parallel and multicore computing · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
binary translation
0.012000
A Formal Method for Providing Temporal Equivalence in Binary-to-Binary Translation of Real-Time Applications · RTSS 2000
Parallel and multicore computing
synchronization
0.012000
A Formal Method for Providing Temporal Equivalence in Binary-to-Binary Translation of Real-Time Applications · RTSS 2000
Embedded and real-time systems
timing constraints
0.012000
A Formal Method for Providing Temporal Equivalence in Binary-to-Binary Translation of Real-Time Applications · RTSS 2000

Methods — techniques the papers use, named apart from their topics

interval-based analysis · 0.0formal methods · 0.0
YearPublicationVenuePosition
2000 A Formal Method for Providing Temporal Equivalence in Binary-to-Binary Translation of Real-Time Applications
abstract
Presents a formal method to provide temporal equivalence in binary-to-binary translation of real-time applications. We first define three different levels of temporal equivalence, i.e. timing equivalence, invariance and divergence. We then find necessary and sufficient conditions for these three levels of temporal equivalence. We take an interval-based approach to test these conditions. If the generated target program is executable with timing equivalence or invariance, it has to be enforced to do so by inserting synchronization. Synchronization methods that enforce the temporal equivalence are also presented.
Inkyu Kim, Zary Segall
RTSS1