N. Nethercote, and A. Mycroft. Electr. Notes Theor. Comput. Sci., (2003)http://dblp.uni-trier.de/db/journals/entcs/entcs89.html#NethercoteM03.
Abstract
Redux is a tool that generates dynamic dataflow graphs. It generates there graphs by tracing program's execution and recording every value-producing operation that takes place, building up a complete computational history of every value produced. For that execution, by considering the parts of the graph reachable from system call inputs, we can choose to see only the dataflow that affects the outside world. Redux works with program binaries, and thus is not restricted to programs written in any particular language.
We explain how Redux works, and show how dynamic dataflow graphs give the essence of program's computation. We show how Redux can be used for debugging and program slicing, and consider a range of other possible uses.
%0 Journal Article
%1 redux2003
%A Nethercote, Nicholas
%A Mycroft, Alan
%D 2003
%J Electr. Notes Theor. Comput. Sci.
%K DBA DPA binary dataflow mgr
%N 2
%T Redux: A Dynamic Dataflow Tracer
%U http://valgrind.org/docs/redux2003.ps
%V 89
%X Redux is a tool that generates dynamic dataflow graphs. It generates there graphs by tracing program's execution and recording every value-producing operation that takes place, building up a complete computational history of every value produced. For that execution, by considering the parts of the graph reachable from system call inputs, we can choose to see only the dataflow that affects the outside world. Redux works with program binaries, and thus is not restricted to programs written in any particular language.
We explain how Redux works, and show how dynamic dataflow graphs give the essence of program's computation. We show how Redux can be used for debugging and program slicing, and consider a range of other possible uses.
@article{redux2003,
abstract = {Redux is a tool that generates dynamic dataflow graphs. It generates there graphs by tracing program's execution and recording every value-producing operation that takes place, building up a complete computational history of every value produced. For that execution, by considering the parts of the graph reachable from system call inputs, we can choose to see only the dataflow that affects the outside world. Redux works with program binaries, and thus is not restricted to programs written in any particular language.
We explain how Redux works, and show how dynamic dataflow graphs give the essence of program's computation. We show how Redux can be used for debugging and program slicing, and consider a range of other possible uses.
},
added-at = {2009-07-09T08:53:02.000+0200},
author = {Nethercote, Nicholas and Mycroft, Alan},
biburl = {https://www.bibsonomy.org/bibtex/22229caaa92ff8f2b5c345a06ca31e556/gwpl},
date = {2004-07-28},
description = {dblp},
ee = {http://www.elsevier.com/gej-ng/31/29/23/141/48/show/Products/notes/index.htt#010},
interhash = {fd557ad58262b914715bbea26ccecb80},
intrahash = {2229caaa92ff8f2b5c345a06ca31e556},
journal = {Electr. Notes Theor. Comput. Sci.},
keywords = {DBA DPA binary dataflow mgr},
note = {http://dblp.uni-trier.de/db/journals/entcs/entcs89.html#NethercoteM03},
number = 2,
timestamp = {2009-07-09T08:53:02.000+0200},
title = {Redux: A Dynamic Dataflow Tracer},
url = {http://valgrind.org/docs/redux2003.ps},
volume = 89,
year = 2003
}