NDLI: To be precise: regression aware debugging

Please wait, while we are loading the content...

A compiler for throughput optimization of graph algorithms on GPUs

Semantics-based program verifiers for all languages

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations

Extensible access control with authorization contracts

Purposes, concepts, misfits, and a redesign of git

Accelerating program analyses by cross-program training

Directed synthesis of failing concurrent executions

Automatic enforcement of expressive security policies using enclaves

Semantic subtyping for imperative object-oriented languages

Efficient and thread-safe objects for dynamically-typed languages

Computing repair alternatives for malformed programs using constraint attribute grammars

A practical framework for type inference error explanation

Finding compiler bugs via live code mutation

Automatic parallelization of pure method calls via conditional future synthesis

Hoare-style specifications as correctness conditions for non-linearizable concurrent objects

Speeding up machine-code synthesis

Gentrification gone too far? affordable 2nd-class values for fun and (co-)effect

Apex: automatic programming assignment error explanation

An improved algorithm for slicing machine code

Maximal causality reduction for TSO and PSO

Chain: tasks and channels for reliable intermittent programs

Parsing with first-class derivatives

Hybrid STM/HTM for nested transactions on OpenJDK

Probabilistic model for code with decision trees

Dynamically diagnosing type errors in unsafe code

Finding resume and restart errors in Android applications

Portable inter-workgroup barrier synchronisation for GPUs

An operational semantics for C/C++11 concurrency

Automated reasoning for web page layout

Incremental forest: a DSL for efficiently managing filestores

Asserting reliable convergence for configuration management scripts

Call graphs for languages with parametric polymorphism

Precise and maximal race detection from incomplete traces

GEMs: shared-memory parallel programming for Node.js

The missing link: explaining ELF static linking, semantically

Makalu: fast recoverable allocation of non-volatile memory

Ringer: web automation by demonstration

First-class effect reflection for effect-guided programming

Low-overhead and fully automated statistical debugging with abstraction refinement

Parallel incremental whole-program optimizations for Scala.js

Modeling and analysis of remote memory access programming

FIDEX: filtering spreadsheet data using examples

LaCasa: lightweight affinity and object capabilities in Scala

Dependent partitioning

Type inference for static compilation of JavaScript

Stateless model checking with data-race preemption points

OrcO: a concurrency-first approach to objects

Type soundness for dependent object types (DOT)

Prioritized garbage collection: explicit GC support for software caches

Scalable verification of border gateway protocol configurations with an SMT solver

Java and scala's type systems are unsound: the existential crisis of null pointers

To be precise: regression aware debugging

To be precise: regression aware debugging

Content Provider	ACM Digital Library
Author	Pandey, Awanish Roy, Subhajit Bavishi, Rohan
Abstract	Bounded model checking based debugging solutions search for mutations of program expressions that produce the expected output for a currently failing test. However, the current localization tools are not regression aware: they do not use information from the passing tests in their localization formula. On the other hand, the current repair tools attempt to guarantee regression freedom: when provided with a set of passing tests, they guarantee that none of these tests can break due to the suggested repair patch, thereby constructing a large repair formula. In this paper, we propose regression awareness as a means to improve the quality of localization and to scale repair. To enable regression awareness, we summarize the proof of correctness of each passing test by computing Craig Interpolants over a symbolic encoding of the passing execution, and use these summaries as additional soft constraints while synthesizing altered executions corresponding to failing tests. Intuitively, these additional constraints act as roadblocks, thereby discouraging executions that may damage the proof of a passing test. We use a partial MAXSAT solver to relax the proofs in a systematic way, and use a ranking function that penalizes mutations that damage the existing proofs. We have implemented our algorithms into a tool, TINTIN, that enables regression aware localization and repair. For localizations, our strategy is effective in extracting a superior ranking of suspicious locations: on a set of 52 different versions across 12 different programs spanning three benchmark suites, TINTIN achieves a saving of developer effort by almost 45% (in terms of the locations that must be examined by a developer to reach the ground-truth repair) in the worst case and 27% in the average case over existing techniques. For automated repairs, on our set of benchmarks, TINTIN achieves a 2.3X speedup over existing techniques without sacrificing much on the ranking of the repair patches: the ground-truth repair appears as the topmost suggestion in more than 70% of our benchmarks. .
Starting Page	897
Ending Page	915
Page Count	19
File Format	PDF
ISBN	9781450344449
DOI	10.1145/2983990.2984014
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-10-19
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Fault localization Interpolation Automated repair Debugging
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in