NDLI: VYRD: verifYing concurrent programs by runtime refinement-violation detection

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

A serializability violation detector for shared-memory server programs

Jungloid mining: helping to navigate the API jungle

Essential language support for generic programming

Code placement for improving dynamic branch prediction accuracy

Pin: building customized program analysis tools with dynamic instrumentation

Shangri-La: achieving high performance from compiled network applications while enabling ease of programming

Threads cannot be implemented as a library

Programming by sketching for bit-streaming programs

The transactional manifesto: software engineering and non-blocking synchronization

Scalable statistical bug isolation

Checking type safety of foreign function calls

Semantic type qualifiers

Optimising aspectJ

Differential register allocation

TraceBack: first fault diagnosis by reconstruction of distributed control flow

Automatically partitioning packet processing applications for pipelined architectures

Mitosis compiler: an infrastructure for speculative threading based on pre-computation slices

PADS: a domain-specific language for processing ad hoc data

VYRD: verifYing concurrent programs by runtime refinement-violation detection

Permission-based ownership: encapsulating state in higher-order typed languages

Automatic pool allocation: improving performance by controlling data structure layout in the heap

Demystifying on-the-fly spill code

DART: directed automated random testing

Programming ad-hoc networks of mobile and resource-constrained devices

Composing security policies with polymer

Path slicing

Garbage collection without paging

Formal loop merging for signal transforms

VYRD: verifYing concurrent programs by runtime refinement-violation detection

Content Provider	ACM Digital Library
Author	Elmas, Tayfun Tasiran, Serdar Qadeer, Shaz
Abstract	We present a runtime technique for checking that a concurrently-accessed data structure implementation, such as a file system or the storage management module of a database, conforms to an executable specification that contains an atomic method per data structure operation. The specification can be provided separately or a non-concurrent, "atomized" interpretation of the implementation can serve as the specification. The technique consists of two phases. In the first phase, the implementation is instrumented in order to record information into a log during execution. In the second, a separate verification thread uses the logged information to drive an instance of the specification and to check whether the logged execution conforms to it. We paid special attention to the general applicability and scalability of the techniques and to minimizing their concurrency and performance impact. The result is a lightweight verification method that provides a significant improvement over testing for concurrent programs.We formalize conformance to a specification using the notion of refinement: Each trace of the implementation must be equivalent to some trace of the specification. Among the novel features of our work are two variations on the definition of refinement appropriate for runtime checking: I/O and "view" refinement. These definitions were motivated by our experience with two industrial-scale concurrent data structure implementations: the Boxwood project, a B-link tree data structure built on a novel storage infrastructure [10] and the Scan file system [9]. I/O and view refinement checking were implemented as a verification tool named VRYD (VerifYing concurrent programs by Runtime Refinement-violation Detection). VYRD was applied to the verification of Boxwood, Java class libraries, and, previously, to the Scan filesystem. It was able to detect previously unnoticed subtle concurrency bugs in Boxwood and the Scan file system, and the known bugs in the Java class libraries and manually constructed examples. Experimental results indicate that our techniques have modest computational cost.
Starting Page	27
Ending Page	37
Page Count	11
File Format	PDF
ISBN	1595930566
DOI	10.1145/1065010.1065015
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2005-06-12
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Runtime verification Refinement Concurrent data structures
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

VYRD:verifYing concurrent programs by runtime refinement-violation detection

VYRD: Verifying concurrent programs by runtime refinement-violation detection (2005)

Vyrd + : A Toolbox for Runtime Verification of Concurrent Software

Runtime refinement checking of concurrent data structures (2004)

Abstract Runtime Refinement Checking of Concurrent Data Structures

(a tool presentation paper) vyrd+: a toolbox for runtime verification of concurrent software.

Verifying Relational Properties of Functional Programs by First-Order Refinement

S.: Runtime refinement checking of concurrent data structures (2005)

Verifying programs which operate on data structures

VYRD: verifYing concurrent programs by runtime refinement-violation detection

Similar Documents

VYRD:verifYing concurrent programs by runtime refinement-violation detection

VYRD: Verifying concurrent programs by runtime refinement-violation detection (2005)

Vyrd + : A Toolbox for Runtime Verification of Concurrent Software

Runtime refinement checking of concurrent data structures (2004)

Abstract Runtime Refinement Checking of Concurrent Data Structures

(a tool presentation paper) vyrd+: a toolbox for runtime verification of concurrent software.

Verifying Relational Properties of Functional Programs by First-Order Refinement

S.: Runtime refinement checking of concurrent data structures (2005)

Verifying programs which operate on data structures

VYRD: verifYing concurrent programs by runtime refinement-violation detection