391 research outputs found
ReFixar: Multi-version Reasoning for Automated Repair of Regression Errors
Software programs evolve naturally as part of the ever-changing customer needs and fast-paced market. Software evolution, however, often introduces regression bugs, which un-duly break previously working functionalities of the software. To repair regression bugs, one needs to know when and where a bug emerged from, e.g., the bug-inducing code changes, to narrow down the search space. Unfortunately, existing state-of-the-art automated program repair (APR) techniques have not yet fully exploited this information, rendering them less efficient and effective to navigate through a potentially large search space containing many plausible but incorrect solutions. In this work, we revisit APR on repairing regression errors in Java programs. We empirically show that existing state-of-the-art APR techniques do not perform well on regression bugs due to their algorithm design and lack of knowledge on bug inducing changes. We subsequently present ReFixar, a novel repair technique that leverages software evolution history to generate high quality patches for Java regression bugs. The key novelty that empowers ReFixar to more efficiently and effectively traverse the search space is two-fold: (1) A systematic way for multi-version reasoning to capture how a software evolves through its history, and (2) A novel search algorithm over a set of generic repair templates, derived from the principle of incorrectness logic and informed by both past bug fixes and their bug-inducing code changes; this enables ReFixar to achieve a balance of both genericity and specificity, i.e., generic common fix patterns of bugs and their specific contexts. We compare ReFixar against the state-of-the-art APR techniques on a data set of 51 real regression bugs from 28 large real-world programs. Experiments show that ReFixar significantly outperforms the best baseline by a large margin, i.e., ReFixar can fix correctly 24 bugs while the best baseline can only correctly fix 9 bugs
Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation
Symbolic execution is a well established method for test input generation.
Despite of having achieved tremendous success over numerical domains, existing
symbolic execution techniques for heap-based programs are limited due to the
lack of a succinct and precise description for symbolic values over unbounded
heaps. In this work, we present a new symbolic execution method for heap-based
programs based on separation logic. The essence of our proposal is
context-sensitive lazy initialization, a novel approach for efficient test
input generation. Our approach differs from existing approaches in two ways.
Firstly, our approach is based on separation logic, which allows us to
precisely capture preconditions of heap-based programs so that we avoid
generating invalid test inputs. Secondly, we generate only fully initialized
test inputs, which are more useful in practice compared to those partially
initialized test inputs generated by the state-of-the-art tools. We have
implemented our approach as a tool, called Java StarFinder, and evaluated it on
a set of programs with complex heap inputs. The results show that our approach
significantly reduces the number of invalid test inputs and improves the test
coverage
Compositional Satisfiability Solving in Separation Logic
We introduce a novel decision procedure to the satisfiability problem in array separation logic combined with general inductively defined predicates and arithmetic. Our proposal differentiates itself from existing works by solving satisfiability through compositional reasoning. First, following Fermatâs method of infinite descent, it infers for every inductive definition a âbaseâ that precisely characterises the satisfiability. It then utilises the base to derive such a base for any formula where these inductive predicates reside in. Especially, we identify an expressive decidable fragment for the compositionality. We have implemented the proposal in a tool and evaluated it over challenging problems. The experimental results show that the compositional satisfiability solving is efficient and our tool is effective and efficient when compared with existing solvers
Synthesis of biodegradable and antimicrobial nanocomposite film reinforced for coffee and agri-food product preservation.
The antimicrobial activity of silver nanoparticles is widely known. However, their application to biodegradable polymeric materials is still limited. In this work, we report a strategy involving the green synthesis of nanocomposite films based on a natural biodegradable matrix. Nanometer-sized silver nanoparticles (C-AgNPs) were synthesized with the aid of ultrasound waves between the silver nitrate solution and the nanocurcumin solution. The green synthesized C-AgNPs were found to have particle sizes in the range of 5â25 nm and demonstrated good antimicrobial activity against Clostridium perfringens, Staphylococcus aureus, Bacillus subtilis, Macrophoma theicola, and Aspergillus flavus. Owing to their physicalâchemical and mechanical properties and the excellent antimicrobial activities, the obtained AgNPs were used together with chitosan, cassava starch, and poly(vinyl alcohol) (PVA) to make nanocomposite films, which are suitable for the packaging requirements of various key agricultural and food products such as coffee beans, bamboo straws, and fruits. The nanocomposite films lost up to 85% of their weight after being buried in the soil for 120 days. This indicates that the films made with natural biodegradable materials are environmentally friendly
A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic
Singapore National Research Foundatio
A Decision Procedure for String Logic with Quadratic Equations, Regular Expressions and Length Constraints
Finding real bugs in big programs with incorrectness logic
Incorrectness Logic (IL) has recently been advanced as a logical theory for compositionally proving the presence of bugsâdual to Hoare Logic, which is used to compositionally prove their absence. Though IL was motivated in large part by the aim of providing a logical foundation for bug-catching program analyses, it has remained an open question: is IL useful only retrospectively (to explain existing analyses), or can it actually be useful in developing new analyses which can catch real bugs in big programs? In this work, we develop Pulse-X, a new, automatic program analysis for catching memory errors, based on ISL, a recent synthesis of IL and separation logic. Using Pulse-X, we have found 15 new real bugs in OpenSSL, which we have reported to OpenSSL maintainers and have since been fixed. In order not to be overwhelmed with potential but false error reports, we develop a compositional bug-reporting criterion based on a distinction between latent and manifest errors, which references the under-approximate ISL abstractions computed by Pulse-X, and we investigate the fix rate resulting from application of this criterion. Finally, to probe the potential practicality of our bug-finding method, we conduct a comparison to Infer, a widely used analyzer which has proven useful in industrial engineering practice
On the Complexity of Pointer Arithmetic in Separation Logic
We investigate the complexity consequences of adding pointer arithmetic to separation logic. Specifically, we study an extension of the points-to fragment of symbolic-heap separation logic with sets of simple âdifference constraintsâ of the form where x and y are pointer variables and k is an integer offset. This extension can be considered a practically minimal language for separation logic with pointer arithmetic. Most significantly, we find that, even for this minimal language, polynomial-time decidability is already impossible: satisfiability becomes -complete, while quantifier-free entailment becomes -complete and quantified entailment becomes -complete (where is the second class in the polynomial-time hierarchy). However, the language does satisfy the small model property, meaning that any satisfiable formula has a model, and any invalid entailment has a countermodel, of polynomial size, whereas this property fails when richer forms of arithmetical constraints are permitted
- âŠ