The Experts below are selected from a list of 102675 Experts worldwide ranked by ideXlab platform
Milena Milenkovic - One of the best experts on this subject based on the ideXlab platform.
-
real time unobtrusive Program Execution trace compression using branch predictor events
Compilers Architecture and Synthesis for Embedded Systems, 2010Co-Authors: Vladimir Uzelac, Aleksandar Milenkovic, Martin Burtscher, Milena MilenkovicAbstract:Unobtrusive capturing of Program Execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited Program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing Program Execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. This approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
-
CASES - Real-time unobtrusive Program Execution trace compression using branch predictor events
Proceedings of the 2010 international conference on Compilers architectures and synthesis for embedded systems - CASES '10, 2010Co-Authors: Vladimir Uzelac, Aleksandar Milenkovic, Martin Burtscher, Milena MilenkovicAbstract:Unobtrusive capturing of Program Execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited Program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing Program Execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. This approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
-
real time unobtrusive and efficient Program Execution tracing with stream caches and last stream predictors
International Conference on Computer Design, 2009Co-Authors: Vladimir Uzelac, Milena Milenkovic, Aleksandar Milenkovic, Martin BurtscherAbstract:This paper introduces a new hardware mechanism for capturing and compressing Program Execution traces unobtrusively in real-time. The proposed mechanism is based on two structures called stream cache and last stream predictor. We explore the effectiveness of a trace module based on these structures and analyze the design space. We show that our trace module, with less than 600 bytes of state, achieves a trace-port bandwidth of 0.15 bits/instruction/processor, which is over six times better than state-of-the-art commercial designs.
Vladimir Uzelac - One of the best experts on this subject based on the ideXlab platform.
-
real time unobtrusive Program Execution trace compression using branch predictor events
Compilers Architecture and Synthesis for Embedded Systems, 2010Co-Authors: Vladimir Uzelac, Aleksandar Milenkovic, Martin Burtscher, Milena MilenkovicAbstract:Unobtrusive capturing of Program Execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited Program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing Program Execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. This approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
-
CASES - Real-time unobtrusive Program Execution trace compression using branch predictor events
Proceedings of the 2010 international conference on Compilers architectures and synthesis for embedded systems - CASES '10, 2010Co-Authors: Vladimir Uzelac, Aleksandar Milenkovic, Martin Burtscher, Milena MilenkovicAbstract:Unobtrusive capturing of Program Execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited Program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing Program Execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. This approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
-
real time unobtrusive and efficient Program Execution tracing with stream caches and last stream predictors
International Conference on Computer Design, 2009Co-Authors: Vladimir Uzelac, Milena Milenkovic, Aleksandar Milenkovic, Martin BurtscherAbstract:This paper introduces a new hardware mechanism for capturing and compressing Program Execution traces unobtrusively in real-time. The proposed mechanism is based on two structures called stream cache and last stream predictor. We explore the effectiveness of a trace module based on these structures and analyze the design space. We show that our trace module, with less than 600 bytes of state, achieves a trace-port bandwidth of 0.15 bits/instruction/processor, which is over six times better than state-of-the-art commercial designs.
Martin Burtscher - One of the best experts on this subject based on the ideXlab platform.
-
real time unobtrusive Program Execution trace compression using branch predictor events
Compilers Architecture and Synthesis for Embedded Systems, 2010Co-Authors: Vladimir Uzelac, Aleksandar Milenkovic, Martin Burtscher, Milena MilenkovicAbstract:Unobtrusive capturing of Program Execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited Program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing Program Execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. This approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
-
CASES - Real-time unobtrusive Program Execution trace compression using branch predictor events
Proceedings of the 2010 international conference on Compilers architectures and synthesis for embedded systems - CASES '10, 2010Co-Authors: Vladimir Uzelac, Aleksandar Milenkovic, Martin Burtscher, Milena MilenkovicAbstract:Unobtrusive capturing of Program Execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited Program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing Program Execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. This approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
-
real time unobtrusive and efficient Program Execution tracing with stream caches and last stream predictors
International Conference on Computer Design, 2009Co-Authors: Vladimir Uzelac, Milena Milenkovic, Aleksandar Milenkovic, Martin BurtscherAbstract:This paper introduces a new hardware mechanism for capturing and compressing Program Execution traces unobtrusively in real-time. The proposed mechanism is based on two structures called stream cache and last stream predictor. We explore the effectiveness of a trace module based on these structures and analyze the design space. We show that our trace module, with less than 600 bytes of state, achieves a trace-port bandwidth of 0.15 bits/instruction/processor, which is over six times better than state-of-the-art commercial designs.
John C. S. Lui - One of the best experts on this subject based on the ideXlab platform.
-
Exploiting non-uniform Program Execution time to evade record/replay forensic analysis
Computers & Security, 2020Co-Authors: Mingshen Sun, John C. S. LuiAbstract:Abstract Record/replay system is an essential and widely used module in forensic analysis, as it can help forensic analysts to reconstruct Programs’ behaviors. However, the security implication of record/replay systems (i.e., whether record/replay systems can faithfully reproduce all behaviors of a Program) has not been thoroughly studied. This paper is the first work which investigates and explores the security limitations of record/replay systems from the perspective of software forensics. In particular, we reveal a type of vulnerability in record/replay systems caused by non-uniform Program Execution time. A Program can exploit this vulnerability to prevent its malicious behavior from being replayed. We conduct a series of experiments on three platforms (i.e., web browser, mobile operating system and virtualized sandbox) to illustrate the wide footprints of the vulnerability. Finally, we discuss possible methods to mitigate the vulnerability. The goal of this work is to study the inherent security limitations of record/replay systems, discover the vulnerability and explore potential mitigation methods, from which forensic analysts can be informed and cautious when applying record/replay systems to software forensics.
-
exploiting non uniform Program Execution time to evade record replay forensic analysis
Computers & Security, 2020Co-Authors: Mingshen Sun, John C. S. LuiAbstract:Abstract Record/replay system is an essential and widely used module in forensic analysis, as it can help forensic analysts to reconstruct Programs’ behaviors. However, the security implication of record/replay systems (i.e., whether record/replay systems can faithfully reproduce all behaviors of a Program) has not been thoroughly studied. This paper is the first work which investigates and explores the security limitations of record/replay systems from the perspective of software forensics. In particular, we reveal a type of vulnerability in record/replay systems caused by non-uniform Program Execution time. A Program can exploit this vulnerability to prevent its malicious behavior from being replayed. We conduct a series of experiments on three platforms (i.e., web browser, mobile operating system and virtualized sandbox) to illustrate the wide footprints of the vulnerability. Finally, we discuss possible methods to mitigate the vulnerability. The goal of this work is to study the inherent security limitations of record/replay systems, discover the vulnerability and explore potential mitigation methods, from which forensic analysts can be informed and cautious when applying record/replay systems to software forensics.
Aleksandar Milenkovic - One of the best experts on this subject based on the ideXlab platform.
-
real time unobtrusive Program Execution trace compression using branch predictor events
Compilers Architecture and Synthesis for Embedded Systems, 2010Co-Authors: Vladimir Uzelac, Aleksandar Milenkovic, Martin Burtscher, Milena MilenkovicAbstract:Unobtrusive capturing of Program Execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited Program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing Program Execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. This approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
-
CASES - Real-time unobtrusive Program Execution trace compression using branch predictor events
Proceedings of the 2010 international conference on Compilers architectures and synthesis for embedded systems - CASES '10, 2010Co-Authors: Vladimir Uzelac, Aleksandar Milenkovic, Martin Burtscher, Milena MilenkovicAbstract:Unobtrusive capturing of Program Execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited Program segments is often cost-prohibitive, requiring wide trace ports and large on-chip trace buffers. This paper introduces a new cost-effective technique for capturing and compressing Program Execution traces in real time. It uses branch predictor-like structures in the trace module to losslessly compress the traces. This approach results in high compression ratios because it only has to transmit misprediction events to the software debugger. Coupled with an effective variable encoding scheme, our technique requires merely 0.036 bits/instruction of trace port bandwidth (a 28-fold improvement over the commercial state-of-the-art) at a cost of roughly 5,200 logic gates.
-
real time unobtrusive and efficient Program Execution tracing with stream caches and last stream predictors
International Conference on Computer Design, 2009Co-Authors: Vladimir Uzelac, Milena Milenkovic, Aleksandar Milenkovic, Martin BurtscherAbstract:This paper introduces a new hardware mechanism for capturing and compressing Program Execution traces unobtrusively in real-time. The proposed mechanism is based on two structures called stream cache and last stream predictor. We explore the effectiveness of a trace module based on these structures and analyze the design space. We show that our trace module, with less than 600 bytes of state, achieves a trace-port bandwidth of 0.15 bits/instruction/processor, which is over six times better than state-of-the-art commercial designs.
