Journal Article10.1134/S0361768809060024
Multithreaded testing of program interfaces
TL;DR: The Sapsan method makes it possible to verify one of the frequently used requirements to such programs, namely, the interface serializability requirement, which consists in that the result of parallel execution of the interface methods in several threads is equivalent to a certain sequential execution of these methods in the same state.
read more
Abstract: In the paper, the new method Sapsan is described. It is designed for functional testing of parallel programs representing program interface the methods (procedures) of which can be invoked from several threads simultaneously. The Sapsan method makes it possible to verify one of the frequently used requirements to such programs, namely, the interface serializability requirement, which consists in that the result of parallel execution of the interface methods in several threads is equivalent to a certain sequential execution of these methods in the same state. In essence, this requirement is formalization of the widely used thread-safety term.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
Eraser: a dynamic data race detector for multithreaded programs
TL;DR: A new tool, called Eraser, is described, for dynamically detecting data races in lock-based multithreaded programs, which uses binary rewriting techniques to monitor every shared-monory reference and verify that consistent locking behavior is observed.
Model checking programs
Willem Visser,Klaus Havelund,Guillaume Brat,Seungjoon Park +3 more
- 11 Sep 2000
TL;DR: A verification and testing environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing, and uses state compression to handle big states and partial order and symmetry reduction, slicing, abstraction, and runtime analysis techniques to reduce the state space.
Partial-Order Methods for the Verification of Concurrent Systems
Patrice Godefroid
- 01 Jan 1996
TL;DR: In this paper, partial orders are used to tackle state explosion in concurrent systems and semantics, including persistent sets, sleep sets and sleep sets, and verification of safety properties of model checking.
623
•Dissertation
Systematic testing of multithreaded Java programs
Derek L. Bruening
- 01 Jan 1999
TL;DR: A testing algorithm called ExitBlock is designed, proved correct, and implemented that systematically and deterministically finds program errors resulting from unintended timing dependencies, and its ability to detect errors in actual programs is demonstrated.
73
The UniTesK Approach to Designing Test Suites
TL;DR: Principles of the UniTesK test development technology based on the use of formal models of target software are presented and this technology obtained rich experience in testing and verification of complex commercial software.
33
Related Papers (5)
Cheer-Sun David Yang,Lori Pollock +1 more
- 01 Jan 1999
John Mellor-Crummey,Thomas J. LeBlanc +1 more
- 01 Jan 1989