NDLI: KISS: keep it simple and sequential

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

Race checking by context inference

Scalable lock-free dynamic memory allocation

Min-cut program decomposition for thread-level speculation

Cost effective dynamic program slicing

Cloning-based context-sensitive pointer alias analysis using binary decision diagrams

Fast searches for effective optimization phase sequences

The set constraint/CFL reachability connection in practice

Region inference for an object-oriented language

A generalized algorithm for graph-coloring register allocation

Social processes and proofs of theorems and programs, revisited

KISS: keep it simple and sequential

Kill-safe synchronization abstractions

A cost-driven compilation framework for speculative parallelization of sequential programs

Dynamic path-based software watermarking

Symbolic pointer analysis revisited

Inducing heuristics to decide whether to schedule

Parametric regular path queries

Array regrouping and structure splitting using whole-program reference affinity

Balancing register allocation across threads for a multithreaded network processor

Verifying safety properties using separation and heterogeneous abstractions

Vectorization for SIMD architectures with alignment constraints

Parametric analysis for adaptive computation offloading

Jedd: a BDD-based relational extension of Java

The liberty structural specification language: a high-level modeling language for component reuse

Precise and efficient static array bound checking for large embedded C programs

Prefetch injection based on hardware monitoring and object metadata

KISS: keep it simple and sequential

Content Provider	ACM Digital Library
Author	Qadeer, Shaz Wu, Dinghao
Abstract	The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent programs, such as model checking, explore all possible thread interleavings. Since the number of thread interleavings increases exponentially with the number of threads, such analyses have high computational complexity. In this paper, we present a novel analysis technique for concurrent programs that avoids this exponential complexity. Our analysis transforms a concurrent program into a sequential program that simulates the execution of a large subset of the behaviors of the concurrent program. The sequential program is then analyzed by a tool that only needs to understand the semantics of sequential execution. Our technique never reports false errors but may miss errors. We have implemented the technique in KISS, an automated checker for multithreaded C programs, and obtained promising initial results by using KISS to detect race conditions in Windows device drivers.
Starting Page	14
Ending Page	24
Page Count	11
File Format	PDF
ISBN	1581138075
DOI	10.1145/996841.996845
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2004-06-09
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Race detection Concurrent software Model checking Assertion checking Program analysis
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

KISS:keep it simple and sequential

Kiss: keep it simple and sequential (2004).

Precise race detection and efficient model checking using locksets (2006).

KISS — Keep It Simple Stupid

Data Race Detection for Interrupt-Driven Programs via Bounded Model Checking

Using Runtime Analysis to Guide Model Checking of Java Programs (2000)

Program analysis to support concurrent programming in declarative languages.

Race Checking by Context Inference (2004)

Keep it Simple and Safe (KISS): A successful strategy in emergency

KISS: keep it simple and sequential

Similar Documents

KISS:keep it simple and sequential

Kiss: keep it simple and sequential (2004).

Precise race detection and efficient model checking using locksets (2006).

KISS — Keep It Simple Stupid

Data Race Detection for Interrupt-Driven Programs via Bounded Model Checking

Using Runtime Analysis to Guide Model Checking of Java Programs (2000)

Program analysis to support concurrent programming in declarative languages.

Race Checking by Context Inference (2004)

Keep it Simple and Safe (KISS): A successful strategy in emergency

KISS: keep it simple and sequential