| Andreas Zeller. Isolating cause-e#ect chains from computer programs. In Proceedings of the tenth ACM SIGSOFT symposium on Foundations of software engineering, pages 1--10. ACM Press, 2002. |
.... Relationship to verify. Lencevicius work clearly demonstrates the advantage of having a flexible query language that can be used to specify the relationship that a programmer wishes to verify. 2.4. 3 HOWCOME and Delta Debugging HOWCOME is a cause e#ect gap detector written by Zeller [28]. It constitutes a part of the work on the Delta Debugging Project [27] The problem with most bugs inside programs is that the cause of an error may have happened long before the e#ect of an error is discovered. Zeller proposes to track the changes in the program s memory graph in the steps ....
Andreas Zeller. Isolating cause-e#ect chains from computer programs. In Proceedings of ACM SIGSOFT 10th International Symposium on the Foundations of Software Engineering (FSE-10), 2002.
.... for minimizing error trails that works by conducting a modi ed binary search between a failing run and a succeeding run of a program [16] Zeller has extended this notion to other approaches to automatic debugging, including modifying portions of a program s state to isolate causee ect chains [15] and discovering the minimal di erence in thread scheduling necessary to produce a concurrency based error [3] Our computation of transformations between positive and negative executions was inspired by this approach, particularly in that we look for minimal transformations. 3 De nitions The ....
A. Zeller. Isolating Cause-Eect Chains from Computer Programs. In ACM SIGSOFT 10th International Symposium on the Foundations of Software Engineering (FSE-10), 2002.
.... for minimizing error trails that works by conducting a modi ed binary search between a failing run and a succeeding run of a program [17] Zeller has extended this notion to other approaches to automatic debugging, including modifying portions of a program s state to isolate causee ect chains [16] and discovering the minimal di erence in thread scheduling necessary to produce a concurrency based error [3] Our computation of transformations between positive and negative executions was inspired by this approach, particularly in that we look for minimal transformations. 3 De nitions The ....
A. Zeller. Isolating Cause-Eect Chains from Computer Programs. In International Symposium on the Foundations of Software Engineering (FSE-10), 2002.
No context found.
Andreas Zeller. Isolating cause-e#ect chains from computer programs. In Proceedings of the tenth ACM SIGSOFT symposium on Foundations of software engineering, pages 1--10. ACM Press, 2002.
No context found.
A. Zeller. Isolating cause-e#ect chains from computer programs. In ACM SIGSOFT 10th International Symposium on the Foundations of Software Engineering (FSE-10), november 2002.
No context found.
A. Zeller. Isolating cause-eect chains from computer programs. In Foundations of Software Engineering, pages 1-10, 2002.
No context found.
Andreas Zeller. Isolating cause-e#ect chains from computer programs. In Proceedings of ACM SIGSOFT 10th International Symposium on the Foundations of Software Engineering, 2002.
No context found.
A. Zeller. Isolating cause-eect chains from computer programs. In Foundations of Software Engineering, pages 1-10, 2002.
No context found.
A. Zeller. Isolating Cause-E#ect Chains from Computer Programs. In ACM SIGSOFT 10th International Symposium on the Foundations of Software Engineering (FSE-10), 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC