Lightweight computation tree tracing for lazy functional languages

Faddegon, Maarten; Chitil, Olaf

doi:10.1145/2908080.2908104

Cited by 4 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…BLeak [37] automatically debugs the memory leak problem which increases garbage collection frequency and overhead, further degrading responsiveness. Faddegon et al [17] presented a computation tree generaration method that requires only a simple tracing library, for debugging any Haskell programs. CLARITY [32] applies static analysis to identify redundant traversal bugs, which cause serious performance problems, e.g., system hanging.…”

Section: Related Workmentioning

confidence: 99%

HangFix

Dai²,

et al. 2020

Proceedings of the 11th ACM Symposium on Cloud Computing

View full text Add to dashboard Cite

Software hang bugs are notoriously difficult to debug, which often cause serious service outages in cloud systems. In this paper, we present HangFix, a software hang bug fixing framework which can automatically fix a hang bug that is triggered and detected in production cloud environments. Hang-Fix first leverages stack trace analysis to localize the hang function and then performs root cause pattern matching to classify hang bugs into different types based on likely root causes. Next, HangFix generates effective code patches based on the identified root cause patterns. We have implemented a prototype of HangFix and evaluated the system on 42 real-world software hang bugs in 10 commonly used cloud server applications. Our results show that HangFix can successfully fix 40 out of 42 hang bugs in seconds. CCS CONCEPTS • Computer systems organization → Reliability; Availability; Cloud computing; • Software and its engineering → Software performance; Software testing and debugging.

show abstract

Section: Related Workmentioning

confidence: 99%

HangFix

Dai²,

et al. 2020

Proceedings of the 11th ACM Symposium on Cloud Computing

View full text Add to dashboard Cite

show abstract

“…Subsequently Faddegon and Chitil (2016) discovered that cost centre stacks are not needed, but that the very same sequence of events that Hood generates already contains su cient information to connect the nodes of computation statements to a tree. The central insight is that events come in pairs, an Enter event is later followed by an event describing the weak-head normal form of a value.…”

Section: Hood and Hoedmentioning

confidence: 99%

A Lightweight Hat

Chitil

Faddegon

Runciman

2016

Proceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages

Self Cite

View full text Add to dashboard Cite

Existing methods for generating a detailed trace of a computation of a lazy functional program are complex. These complications limit the use of tracing in practice. However, such a detailed trace is desirable for understanding and debugging a lazy functional program. Here we present a lightweight method that instruments a program to generate such a trace, namely the augmented redex trail introduced by the Haskell tracer Hat. The new method is a major step towards an omniscient debugger for real-world Haskell programs. CCS CONCEPTS• Theory of computation → Operational semantics; • Software and its engineering → Functionality;

show abstract