• Home
  • Search
  • Testing Multi-Threaded Applications Using Answer Set Programming
  • Cite Icon4
  • https://doi.org/10.1142/s021819401850033xCopy DOI Icon

Testing Multi-Threaded Applications Using Answer Set Programming

  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We introduce a technique to formally represent and specify race conditions in multithreaded applications. Answer set programming (ASP) is a logic-based knowledge representation paradigm to formally express belief acquired through reasoning in an application domain. The transparent and expressiveness representation of problems along with powerful non-monotonic reasoning power enable ASP to abstractly represent and solve some certain classes of NP hard problems in polynomial times. We use ASP to formally express race conditions and thus represent potential data races often occurred in multithreaded applications with shared memory models. We then use ASP to generate all possible test inputs and thread interleaving, i.e. scheduling, whose executions would result in deterministically exposing thread interleaving failures. We evaluated the proposed technique with some moderate sized Java programs, and our experimental results confirm that the proposed technique can practically expose common data races in multithreaded programs with low false positive rates. We conjecture that, in addition to generating threads scheduling whose execution order leads to the exposition of data races, ASP has several other applications in constraint-based software testing research and can be utilized to express and solve similar test case generation problems where constraints play a key role in determining the complexity of searches.

Similar Papers
  • Conference Article
  • Citations2

Efficient Development Methodology for Multithreaded Network Application

  • Jan 01, 2007
  • Nguyen Duc Chinh +2
  • Conference Article
  • Citations75

Accurate and efficient filtering for the Intel thread checker race detector

  • Oct 21, 2006
  • Paul Sack +4
  • Conference Article
  • Citations271

Automatically classifying benign and harmful data races using replay analysis

  • Jun 10, 2007
  • Satish Narayanasamy +4
  • Research Article
  • Citations46

Automatically classifying benign and harmful data races using replay analysis

  • Jun 10, 2007
  • ACM SIGPLAN Notices
  • Satish Narayanasamy +4
  • Conference Article
  • Citations2

Detecting Data Race in Network Applications using Static Analysis

  • Oct 01, 2019
  • Dongsheng Qi +2
  • Conference Article
  • Citations1

Pinpoint Data Races via Testing and Classification

  • Oct 01, 2019
  • Marc Hartung +2
  • Single Book
  • Citations20

Logic Programming and Nonmonotonic Reasoning

  • Jan 01, 2009
  • Esra Erdem +2
  • Conference Article

Recovery in multithreaded applications using execution monitoring and recovery engine (EMRE)

  • Oct 01, 2010
  • Rupesh Kumar
  • Conference Article

Dynamically detecting data races in multi-threaded object-oriented programs by tracing function entries and exits

  • Jul 01, 2010
  • Quan Sun +2
  • Conference Article

A scale-free model for random ASP programs

  • Jul 30, 2018
  • Data Science and Knowledge Engineering for Sensing Decision Support
  • Lian Wen +2
  • Conference Article
  • Citations9

SimpleLock: Fast and Accurate Hybrid Data Race Detector

  • Dec 01, 2013
  • Misun Yu +2
  • Book Chapter
  • Citations9

$$\mathsf {Harvey}$$ : A System for Random Testing in ASP

  • Jan 01, 2017
  • Alexander Greßler +2
  • Research Article
  • Citations14

SimpleLock+: Fast and Accurate Hybrid Data Race Detection

  • Nov 11, 2014
  • The Computer Journal
  • Misun Yu +1
  • Conference Article
  • Citations105

Detecting and surviving data races using complementary schedules

  • Oct 23, 2011
  • Kaushik Veeraraghavan +3
  • Conference Article
  • Citations423

Race directed random testing of concurrent programs

  • Jun 07, 2008
  • Koushik Sen
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.