NDLI: Directed synthesis of failing concurrent executions

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

Directed synthesis of failing concurrent executions

Content Provider	ACM Digital Library
Author	Tripp, Omer Samak, Malavika Ramanathan, Murali Krishna
Abstract	Detecting concurrency-induced bugs in multithreaded libraries can be challenging due to the intricacies associated with their manifestation. This includes invocation of multiple methods, synthesis of inputs to the methods to reach the failing location, and crafting of thread interleavings that cause the erroneous behavior. Neither fuzzing-based testing techniques nor over-approximate static analyses are well positioned to detect such subtle defects while retaining high accuracy alongside satisfactory coverage. In this paper, we propose a directed, iterative and scalable testing engine that combines the strengths of static and dynamic analysis to help synthesize concurrent executions to expose complex concurrency-induced bugs. Our engine accepts as input the library, its client (either sequential or concurrent) and a specification of correctness. Then, it iteratively refines the client to generate an execution that can break the input specification. Each step of the iterative process includes statically identifying sub-goals towards the goal of failing the specification, generating a plan toward meeting these goals, and merging of the paths traversed dynamically with the plan computed statically via constraint solving to generate a new client. The engine reports full reproduction scenarios, guaranteed to be true, for the bugs it finds. We have created a prototype of our approach named MINION. We validated MINION by applying it to well-tested concurrent classes from popular Java libraries, including the latest versions of openjdk and google-guava. We were able to detect 31 real crashes across 10 classes in a total of 23 minutes, including previously unknown bugs. Comparison with three other tools reveals that combined, they report only 9 of the 31 crashes (and no other crashes beyond MINION). This is because several of these bugs manifest under deeply nested path conditions (observed maximum of 11), deep nesting of method invocations (observed maximum of 6) and multiple refinement iterations to generate the crash-inducing client. .
Starting Page	430
Ending Page	446
Page Count	17
File Format	PDF
ISBN	9781450344449
DOI	10.1145/2983990.2984040
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-10-19
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Concurrency Dynamic analysis Client synthesis
Content Type	Text
Resource Type	Article

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

Directed synthesis of failing concurrent executions

Race directed random testing of concurrent programs

Profile directed systematic testing of concurrent programs

Symbolic pruning of concurrent program executions

Profile directed systematic testing of concurrent programs

The RoadRunner Dynamic Analysis Framework for Concurrent Programs

Race directed scheduling of concurrent programs

Concurrent evaluation of a directed acylic graph

Semantics of concurrent protocols

Directed synthesis of failing concurrent executions

Similar Documents

Directed synthesis of failing concurrent executions

Race directed random testing of concurrent programs

Profile directed systematic testing of concurrent programs

Symbolic pruning of concurrent program executions

Profile directed systematic testing of concurrent programs

The RoadRunner Dynamic Analysis Framework for Concurrent Programs

Race directed scheduling of concurrent programs

Concurrent evaluation of a directed acylic graph

Semantics of concurrent protocols

Directed synthesis of failing concurrent executions