KISS: keep it simple and sequential

By Shaz Qadeer, Dinghao Wu. ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2004

323 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/f1dd1d357397e8329f33ca2212dbc46d97bdb5dd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Hardware and Architecture

Citations in the corpus

Iterative context bounding for systematic testing of multithreaded programs (2007, methodology): “Context-bounding: The notion of context-bounding was introduced by Qadeer and Wu [21] as a method for static analysis of concurrent programs by using static analysis techniques de veloped for sequential programs.”
Thorough static analysis of device drivers (2006, methodology): “A new tool Kiss [42] has been developed on top of SDV to ﬁnd some classes of concurrency errors.”
Software and the Concurrency Revolution (2005, methodology): “One promising technique from Microsoft Research called KISS (Keep it Strictly Sequential) 4 transforms a threaded program into a sequential program whose execution behavior includes all possible interleaves of the original threads that involve no more than two context switches.”
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics (2008, unknown): “Specifically, how many threads, how many variables, and how many accesses are usually involved in a real world concurrency bug’s manifestation? Similar questions are also encountered in software verification and model checking [13, 28, 34] for concurrent programs.”
Effective static race detection for Java (2006, background): “Introduction A multi-threaded program contains a race if two threads can access the same memory location without ordering constraints enforced between them and at least one access is a write.”
RELAY: static race detection on millions of lines of code (2007, methodology): “Finally, heavyweig ht techniques such as model checking [16, 24] have been applied to fin d and prove the absence of races.”
Race directed random testing of concurrent programs (2008, background): “Static verification [4, 16, 28, 40, 8] and model checking [17, 29, 25, 27, 52, 31] or path-sensitive search of the state space is an alternative approach to finding bugs in concurrent programs.”
Context-Bounded Model Checking of Concurrent Software (2005, methodology): “KISS is unable to explore more than two context switches for a concurrent program with two threads and cannot handle an unbounded number of threads.”