Automatic detection and repair of errors in data structures

DemskyBrian,; RinardMartin,

doi:10.1145/949343.949314

Cited by 38 publications

(22 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Demsky and Rinard [39] propose an approach to fix runtime data structure errors according to the constraint on the data structure. Mani et al [40] use the hidden constraints in a transformation program to fix input model faults.…”

Section: Related Workmentioning

confidence: 99%

Range Fixes: Interactive Error Resolution for Software Configuration

Xiong

Zhang

Hubaux

et al. 2015

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

To prevent ill-formed configurations, highly configurable software often allows defining constraints over the available options. As these constraints can be complex, fixing a configuration that violates one or more constraints can be challenging. Although several fix-generation approaches exist, their applicability is limited because (1) they typically generate only one fix or a very long fix list, difficult for the user to identify the desirable fix; and (2) they do not fully support non-Boolean constraints, which contain arithmetic, inequality, and string operators. This paper proposes a novel concept, range fix, for software configuration. A range fix specifies the options to change and the ranges of values for these options. We also design an algorithm that automatically generates range fixes for a violated constraint. We have evaluated our approach with three different strategies for handling constraint interactions, on data from nine open source projects over two configuration platforms. The evaluation shows that our notion of range fix leads to mostly simple yet complete sets of fixes, and our algorithm is able to generate fixes within one second for configuration systems with a few thousands options and constraints.

show abstract

Section: Related Workmentioning

confidence: 99%

Range Fixes: Interactive Error Resolution for Software Configuration

Xiong

Zhang

Hubaux

et al. 2015

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…Most of the recent techniques to avoid or mitigate the effects of field failures address specific problems, such as repairing inconsistencies in data structures [4], [5], [26], avoiding infinite loops [7], fixing configuration issues [6], fixing invalid HTML code generated by PHP applications [27], and making applications more robust to malicious inputs [28] and malicious attacks in general [8]. Our technique does not target specific faults and instead is intended as a general-purpose solution to avoid failures at runtime.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, more recent techniques attempt to avoid or mask failures without incurring the significant costs of producing fully redundant code. Among them, some address specific problems such as inconsistencies in data structures [4], [5], configuration incompatibilities [6], infinite loops [7], security violations [8], and non-deterministic failures [9], [10], while others are more general but require developers to manually write appropriate patches to address application-specific problems [11], [12].…”

Section: Introductionmentioning

confidence: 99%

Automatic recovery from runtime failures

Carzaniga

Gorla

Mattavelli

et al. 2013

2013 35th International Conference on Software Engineering (ICSE)

View full text Add to dashboard Cite

We present a technique to make applications resilient to failures. This technique is intended to maintain a faulty application functional in the field while the developers work on permanent and radical fixes. We target field failures in applications built on reusable components. In particular, the technique exploits the intrinsic redundancy of those components by identifying workarounds consisting of alternative uses of the faulty components that avoid the failure. The technique is currently implemented for Java applications but makes little or no assumptions about the nature of the application, and works without interrupting the execution flow of the application and without restarting its components. We demonstrate and evaluate this technique on four mid-size applications and two popular libraries of reusable components affected by real and seeded faults. In these cases the technique is effective, maintaining the application fully functional with between 19% and 48% of the failure-causing faults, depending on the application. The experiments also show that the technique incurs an acceptable runtime overhead in all cases.

show abstract

“…For this reason, we try, whenever possible, to present the condition in the form of Horn clause constraints. As demonstrated (in another context) by Demsky and Rinard [15], this particular form can be used to deduce, automatically or (for better performance) semi-automatically, specific rules for correcting the input so that it matches a formal constraint. Such rules can be used by the CASE tool to generate useful warnings and advice to the programmer.…”

Section: Micro Patterns Vs Design Patternsmentioning

confidence: 99%

Micro patterns in Java code

Gil

Maman

2005

Proceedings of the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications

View full text Add to dashboard Cite

Micro patterns are similar to design patterns, except that micro patterns stand at a lower, closer to the implementation, level of abstraction. Micro patterns are also unique in that they are mechanically recognizable, since each such pattern can be expressed as a formal condition on the structure of a class. This paper presents a catalog of 27 micro-patterns defined on JAVA classes and interfaces. The catalog captures a wide spectrum of common programming practices, including a particular and (intentionally restricted) use of inheritance, immutability, data management and wrapping, restricted creation, and emulation of procedural-, modular-, and even functional-programming paradigms with object oriented constructs. Together, the patterns present a set of prototypes after which a large portion of all JAVA classes and interfaces are modeled. We provide empirical indication that this portion is as high as 75% .A statistical analysis of occurrences of micro patterns in a large software corpus, spanning some 70,000 JAVA classes drawn from a rich set of application domains, shows, with high confidence level that the use of these patterns is not random. These results indicate consciousness and discernible design decisions, which are sustained in the software evolution. With high confidence level, we can also show that the use of these patterns is tied to the specification, or the purpose, that the software realizes.The traceability, abundance and the statistical significance of micro pattern occurrence raise the hope of using the classification of software into these patterns for a more founded appreciation of its design and code quality.

show abstract

Automatic detection and repair of errors in data structures

Cited by 38 publications

References 25 publications

Range Fixes: Interactive Error Resolution for Software Configuration

Range Fixes: Interactive Error Resolution for Software Configuration

Automatic recovery from runtime failures

Micro patterns in Java code

Contact Info

Product

Resources

About