Dynamic Reverse Code Generation for Backward Execution | Zendy

Jooyong Lee | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Dynamic Reverse Code Generation for Backward Execution

Author(s) -

Jooyong Lee

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.12.028

Subject(s) - computer science , debugger , debugging , reverse engineering , programming language , symbolic execution , code (set theory) , backtracking , parallel computing , scalability , state (computer science) , source code , novelty , operating system , software , philosophy , theology , set (abstract data type)

The need for backward execution in debuggers has been raised a number of times. Backward execution helps a user naturally think backwards and, in turn, easily locate the cause of a bug. Backward execution has been implemented mostly by state-saving or checkpointing, which are inherently not scalable. In this paper, we present a method to generate reverse code, so that backtracking can be performed by executing reverse code. The novelty of our work is that we generate reverse code on-the-fly, while running a debugger, which makes it possible to apply the method even to debugging multi-threaded programs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research