Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
IMPACT: an architectural framework for multiple-instruction-issue processors
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Migrating a CISC computer family onto RISC via object code translation
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Communications of the ACM
Decompilation: the enumeration of types and grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Timing insensitive binary-to-binary translation
Timing insensitive binary-to-binary translation
Timing analysis in binary-to-binary translation
Timing analysis in binary-to-binary translation
Characterizations of Reducible Flow Graphs
Journal of the ACM (JACM)
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
A program data flow analysis procedure
Communications of the ACM
Communications of the ACM
Hi-index | 0.00 |
This paper presents a formal method to provide the 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.