NDLI: Verifying atomicity via data independence

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

Runtime prevention of concurrency related type-state violations in multithreaded applications

Hybrid security analysis of web JavaScript code via dynamic partial evaluation

Covrig: a framework for the analysis of code, test, and coverage evolution in real software

ARC++: effective typestate and lifetime dependency analysis

Using test case reduction and prioritization to improve symbolic execution

CrashLocator: locating crashing faults based on crash stacks

Make it work, make it right, make it fast: building a platform-neutral whole-system dynamic binary analysis platform

Reducing GUI test suites via program slicing

Efficient mutation analysis by propagating and partitioning infected execution states

Feedback-driven dynamic invariant discovery

Legend: an agile DSL toolset for web acceptance testing

Reusing constraint proofs for scalable program analysis

Performance regression testing of concurrent classes

Virtual DOM coverage for effective testing of dynamic web applications

CoREBench: studying complexity of regression errors

A type system for format strings

FLOWER: optimal test suite reduction as a network maximum flow

Efficient predicated bug signature mining via hierarchical instrumentation

Automated testing for SQL injection vulnerabilities: an input mutation approach

SunCat: helping developers understand and predict performance problems in smartphone applications

Lightweight automated detection of unsafe information leakage via exceptions

Link: exploiting the web of data to generate test inputs

ProCrawl: mining test models from multi-user web applications

Effective test generation and adequacy assessment for JavaScript-based web applications

Verifying atomicity via data independence

DOM-based test adequacy criteria for web applications

Scalable detection of missed cross-function refactorings

Coverage and fault detection of the output-uniqueness test selection criteria

Semantic differential repair for input validation and sanitization

A variability-based testing approach for synthesizing video sequences

Integrated energy-directed test suite optimization

Empirically revisiting the test independence assumption

X-PERT: a web application testing tool for cross-browser inconsistency detection

Efficient statistical debugging via hierarchical instrumentation

Verification-aided regression testing

Cross-platform feature matching for web applications

Tailored source code transformations to synthesize computationally diverse program variants

Dodona: automated oracle data set selection

Automatic repair for multi-threaded programs with Deadlock/Livelock using maximum satisfiability

Robust test automation using contextual clues

Identifying optimal trade-offs between CPU time usage and temporal constraints using search

An empirical study of injected versus actual interface errors

Extending a search-based test generator with adaptive dynamic symbolic execution

Canalyze: a static bug-finding tool for C programs

MuCheck: an extensible tool for mutation testing of haskell programs

The major mutation framework: efficient and scalable mutation analysis for Java

Defects4J: a database of existing faults to enable controlled testing studies for Java programs

A format string checker for Java

Constructing coding duels in Pex4Fun and code hunt

Verifying atomicity via data independence

Content Provider	ACM Digital Library
Author	Sagiv, Mooly Bronson, Nathan Shacham, Ohad Vechev, Martin Yahav, Eran Gueta, Guy Golan Aiken, Alex
Abstract	We present a technique for automatically verifying atomicity of composed concurrent operations. The main observation behind our approach is that many composed concurrent operations which occur in practice are data-independent. That is, the control-flow of the composed operation does not depend on specific input values. While verifying data-independence is undecidable in the general case, we provide succint sufficient conditions that can be used to establish a composed operation as data-independent. We show that for the common case of concurrent maps, data-independence reduces the hard problem of verifying linearizability to a verification problem that can be solved efficiently with a bounded number of keys and values. We implemented our approach in a tool called VINE and evaluated it on all composed operations from 57 real-world applications (112 composed operations). We show that many composed operations (49 out of 112) are data-independent, and automatically verify 30 of them as linearizable and the rest 19 as having violations of linearizability that could be repaired and then subsequently automatically verified. Moreover, we show that the remaining 63 operations are not linearizable, thus indicating that data independence does not limit the expressiveness of writing realistic linearizable composed operations. .
Starting Page	26
Ending Page	36
Page Count	11
File Format	PDF
ISBN	9781450326452
DOI	10.1145/2610384.2610402
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-07-21
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Composed operations Concurrency Linearizability Verification Collections Data-independence
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

Testing atomicity of composed concurrent operations

Testing atomicity of composed concurrent operations

Verifying atomicity via data independence.

Specifying and checking semantic atomicity for multithreaded programs

Verifying linearizability with hindsight

Round-Up: Runtime Verification of Quasi Linearizability for Concurrent Data Structures

Static analysis of atomicity for programs with non-blocking synchronization

Modular verification of linearizability with non-fixed linearization points

Specifying and checking semantic atomicity for multithreaded programs (CARN, Vol. 39, Issue. 1)

Verifying atomicity via data independence

Similar Documents

Testing atomicity of composed concurrent operations

Testing atomicity of composed concurrent operations

Verifying atomicity via data independence.

Specifying and checking semantic atomicity for multithreaded programs

Verifying linearizability with hindsight

Round-Up: Runtime Verification of Quasi Linearizability for Concurrent Data Structures

Static analysis of atomicity for programs with non-blocking synchronization

Modular verification of linearizability with non-fixed linearization points

Specifying and checking semantic atomicity for multithreaded programs (CARN, Vol. 39, Issue. 1)

Verifying atomicity via data independence