Thomas Ball, Mayur Naik, Sriram Rajamani."From Symptom to Cause: Localizing Errors in Counterexample Traces". In Proceedings of ACM Symposium on Principles of Programming Languages (POPL '03), New Orleans, LA, January 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Generating Error Traces From Verification-Condition.. - Leino, Millstein, Saxe (2004) (1 citation) (Correct)
.... and tabular output, some tools offer graphical replay of error traces (see, e.g. 14] Recent work in model checking has considered the generation of multiple correct and erroneous execution traces, from which the checking tool heuristically arrives at possible sources of a manifested error [1, 12]. 7 Conclusions We have presented a method for instrumenting verification conditions with information that makes it easy to produce, from a theorem prover s output, execution traces leading to the errors discovered. Our method builds on ideas used to instrument verification conditions with ....
Thomas Ball, Mayur Naik, and Sriram Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Conference Record of the 30th Annual ACM Symposium on Principles of Programming Languages. ACM, 2003.
What Went Wrong: Explaining Counterexamples - Groce, Visser (2002) (18 citations) (Correct)
....to analyze in section 4. The various analyses currently applied are discussed in section 5. We then present a larger case study and experimental results in section 7, followed by conclusions and future work. 2 Related Work The most closely related work to ours is that of Ball, Naik, and Rajamani [1]. They nd successful paths to the control location at which an error is discovered in order to nd the cause of the error. Once a cause is discovered, they model check a restricted model in which the system is restricted from executing the causal transitions to discover if other causes for the ....
....negative and positive sets. The error cause localization algorithm used in SLAM is comparable to reporting cause(neg) although it is based on transitions de ned as pairs of projected control locations and computation of all(neg) is unnecessary as their analysis only uses one negative at a time [1]. 1 int got lock = 0; public static void lock ( f 2 do f Verify.assertTrue (LOCK = 0) 3 if (Verify.randomBool ( f LOCK = 1; 4 lock ( g 5 got lock ; 6 g 7 if (got lock = 0) f 8 unlock ( public static void unlock ( f 9 g Verify.assertTrue (LOCK = 1) 10 got lock ; LOCK = 0; ....
T. Ball, M. Naik, and S. Rajamani. From Symptom to Cause: Localizing Errors in Counterexample Traces. To appear in Principles of Programming Languages, 2003.
What Went Wrong: Explaining Counterexamples - Groce, Visser (2003) (18 citations) (Correct)
....analyses currently applied and their implementations are discussed in Section 5 and Section 6, respectively. We then present experimental results in Section 7, followed by conclusions and future work. 2 Related Work The most closely related work to ours is that of Ball, Naik, and Rajamani [1]. They nd successful paths to the control location at which an error is discovered in order to nd the cause of the error. Once a cause is discovered, they model check a restricted model in which the system is restricted from executing the causal transitions to discover if other causes for the ....
....denote sets that are potentially much smaller and denote precisely the common behavior that di erentiates the negative and positive sets. The error cause localization algorithm used in SLAM is comparable to reporting either cause(neg) or only(neg) as SLAM analyzes one error trace at a time [1]. 1 int got lock = 0; public static void lock ( f 2 do f Verify.assertTrue (LOCK = 0) 3 if (Verify.chooseBool ( f LOCK = 1; 4 lock ( g 5 got lock ; 6 g 7 if (got lock = 0) f 8 unlock ( public static void unlock ( f 9 g Verify.assertTrue (LOCK = 1) 10 got lock ; LOCK = 0; ....
[Article contains additional citation context not shown here]
T. Ball, M. Naik, and S. Rajamani. From Symptom to Cause: Localizing Errors in Counterexample Traces. In Principles of Programming Languages, 2003.
Localizing Errors in Counterexample with - Iteratively Witness Searching (Correct)
No context found.
Thomas Ball, Mayur Naik, Sriram Rajamani."From Symptom to Cause: Localizing Errors in Counterexample Traces". In Proceedings of ACM Symposium on Principles of Programming Languages (POPL '03), New Orleans, LA, January 2003.
Repair of Boolean Programs with an Application to C - Andreas Griesmayer Roderick (Correct)
No context found.
T. Ball, M. Naik, and S. K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In 30th Symposium on Principles of Programming Languages (POPL 2003.
Localizing Errors in Counterexample with - Iteratively Witness Searching (Correct)
No context found.
Thomas Ball, Mayur Naik, Sriram Rajamani."From Symptom to Cause: Localizing Errors in Counterexample Traces". In Proceedings of ACM Symposium on Principles of Programming Languages (POPL '03), New Orleans, LA, January 2003.
PSE: Explaining Program Failures via Postmortem.. - Manevich, Sridharan, .. (2004) (Correct)
No context found.
Thomas Ball, Mayur Naik, and Sriram Rajamani. From Symptom to Cause: Localizing Errors in Counterexample Traces. In Conference Record of the Thirtieth ACM Symposium on Principles of Programming Languages, 2003.
Correlation Exploitation in Error Ranking - Kremenek, Ashcraft, Yang, Engler (2004) (Correct)
No context found.
T. Ball, M. Naik, and S. K. Rajamani. From symptom to cause: localizing errors in counterexample traces. In POPL 2003.
Approximate Modeling for Debugging of Program Loops - Mayer, Stumptner (Correct)
No context found.
Thomas Ball, Mayur Naik, and Sriram K. Rajamani, `From symptom to cause: Localizing errors in counterexample traces', in POPL, (2003).
Towards a Model for Automated Fault Localization in - Vhdl Designs Exploring (Correct)
No context found.
T. Ball, M. Naik, and S.K. Rajamani, `From symptom to cause: localizing errors in counterexample traces', in Proceedings of the 30th ACM SIGPLAN-SIGACT symposium of programming languages (POPL), pp. 97--105. ACM Press, (2003).
Generation of All Counter-Examples for Push-Down Systems - Basu, Saha, Lin, Smolka (2003) (Correct)
No context found.
T. Ball, M. Naik, and S.K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Symposium on Principles of Programming Languages, 2003.
Fault Localization with Nearest Neighbor Queries - Renieris, Reiss (2003) (4 citations) (Correct)
No context found.
T. Ball, M. Naik, and S. K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Proceedings of the Symposium on Principles of Programming Languages, pages 97--105, Jan. 2003.
Error Explanation with Distance Metrics - Groce (2004) (2 citations) (Correct)
No context found.
T. Ball, M. Naik, and S. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Principles of Programming Languages, pages 97-105, 2003.
Model Checking One Million Lines of C Code - Hao Chen Drew (2004) (2 citations) (Correct)
No context found.
T. Ball, M. Naik, and S. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In POPL '03: Proceedings of the ACM SIGPLAN-SIGACT Conference on Principles of Programming Languages, 2003.
Making the Most of BMC Counterexamples - Groce, Kroening (2004) (1 citation) (Correct)
No context found.
T. Ball, M. Naik, and S. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Principles of Programming Languages, pages 97{ 105, 2003.
Understanding Counterexamples with explain - Alex Groce Daniel (2004) (1 citation) (Correct)
No context found.
T. Ball, M. Naik, and S. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Principles of Programming Languages, pages 97-105, 2003.
Efficient Computer-Aided Verification of Parallel and Distributed .. - Mäkelä (2003) (Correct)
No context found.
Thomas Ball, Mayur Naik, and Sriram K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Alex Aiken and Greg Morrisett, editors, Proceedings of the 30 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 97--105, New Orleans, LA, USA, January 2003. ACM Press, New York, NY, USA.
Efficient Computer-Aided Verification of Parallel and Distributed .. - Mäkelä (2003) (Correct)
No context found.
Thomas Ball, Mayur Naik, and Sriram K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Alex Aiken and Greg Morrisett, editors, Proceedings of the 30 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 97--105, New Orleans, LA, USA, January 2003. ACM Press, New York, NY, USA.
What Went Wrong: Explaining Counterexamples - Groce, Visser (2003) (18 citations) (Correct)
No context found.
T. Ball, M. Naik, and S. Rajamani. From Symptom to Cause: Localizing Errors in Counterexample Traces. To appear in Principles of Programming Languages, 2003.
Cmc: A Model Checker For Network Protocol Implementations - Musuvathi (2004) (Correct)
No context found.
Thomas Ball, Mayur Naik, and Sriram Rajamani. From symptom to cause: localizing errors in counterexample traces. In POPL03, pages 97--105, New Orleans, Louisiana, USA, January 2003.
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