Synergistic debug-repair of heap manipulations

Verma, Sahil; Roy, Subhajit

doi:10.1145/3106237.3106263

Cited by 23 publications

(18 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They include popular algorithms like insert, append, delete, copy for linked-lists. Some of these programs are taken from the benchmark used in [50] that are annotated accordingly. Note that our programs are tail-recursive while these in [50] use while loops.…”

Section: Discussionmentioning

confidence: 99%

“…Some of these programs are taken from the benchmark used in [50] that are annotated accordingly. Note that our programs are tail-recursive while these in [50] use while loops. To demonstrate the effectiveness of our method, we compared our tool with a state-of-the-art repair tool [28].…”

Section: Discussionmentioning

confidence: 99%

“…Besides, as discussed in the Introduction (Sect. 1), the semi-automated approach [50] requires a user to specify program states at various points to repair this motivating example while our automated approach only requires a pair of pre-and postcondition of the input program. [25,26].…”

Section: Motivationmentioning

confidence: 99%

“…However, these tactics are insufficient to repair non-trivial bugs in heap-manipulating programs. In another study, Verma and Roy [50] enable users to express their expected program's graphical states at different program points in a debug-and-repair process. Their synergistic method is effective in fixing various bug patterns of heap-manipulating programs, but not fully automated.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Automated Repair of Heap-Manipulating Programs Using Deductive Synthesis

Nguyen

Sergey

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We propose a novel method to automatically repairing buggy heap-manipulating programs using constraint solving and deductive synthesis. Given an input program C and its formal specification in the form of a Hoare triple: {P} C {Q}, we use a separation-logic-based verifier to verify if program C is correct w.r.t. its specifications. If program C is found buggy, we then repair it in the following steps. First, we rely on the verification results to collect a list of suspicious statements of the buggy program. For each suspicious statement, we temporarily replace it with a template patch representing the desired statements. The template patch is also formally specified using a pair of unknown pre-and postcondition. Next, we use the verifier to analyze the temporarily patched program to collect constraints related to the pre-and postcondition of the template patch. Then, these constraints are solved by our constraint solving technique to discover the suitable specifications of the template patch. Subsequently, these specifications can be used to synthesize program statements of the template patch, consequently creating a candidate program. Finally, if the candidate program is validated, it is returned as the repaired program. We demonstrate the effectiveness of our approach by evaluating our implementation and a state-of-the-art approach on a benchmark of 231 buggy programs. The experimental results show that our tool successfully repairs 223 buggy programs and considerably outperforms the compared tool.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Automated Repair of Heap-Manipulating Programs Using Deductive Synthesis

Nguyen

Sergey

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Repair tools for semantic errors using symbolic techniques (like [32,47]) implicitly assume that the program has no syntax errors and use (symbolic) executions of the program to fix semantic errors (given a formal specification of correctness). Of course, we can use our tool in the following iterative mode to fix both syntactic and semantic errors: given a formal specification of correctness, one can feed the (potentially) repaired program from Cyclops to a program verifier to check if the fix satisfies the specification; if not, Cyclops is requested for different fix (from the space of all possible fixes).…”

Section: Parser Synthesismentioning

confidence: 99%

Parse Condition: Symbolic Encoding of LL(1) Parsing

Singal

Agarwal²,

Jhunjhunwala³

et al.

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

In this work, we propose the notion of a Parse Condition—a logical condition that is satisfiable if and only if a given string w can be successfully parsed using a grammar G. Further, we propose an algorithm for building an SMT encoding of such parse conditions for LL(1) grammars and demonstrate its utility by building two applications over it: automated repair of syntax errors in Tiger programs and automated parser synthesis to automatically synthesize LL(1) parsers from examples. We implement our ideas into a tool, Cyclops, that is able to successfully repair 80% of our benchmarks (675 buggy Tiger programs), clocking an average of 30 seconds per repair and synthesize parsers for interesting languages from examples. Like verification conditions (encoding a program in logic) have found widespread applications in program analysis, we believe that Parse Conditions can serve as a foundation for interesting applications in syntax analysis.

show abstract

Automatic Program Repair Using Formal Verification and Expression Templates

Nguyen

Chin

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Synergistic debug-repair of heap manipulations

Cited by 23 publications

References 27 publications

Automated Repair of Heap-Manipulating Programs Using Deductive Synthesis

Automated Repair of Heap-Manipulating Programs Using Deductive Synthesis

Parse Condition: Symbolic Encoding of LL(1) Parsing

Automatic Program Repair Using Formal Verification and Expression Templates

Contact Info

Product

Resources

About