• Home
  • Search
  • Pattern-Based Verification for Multithreaded Programs
  • Cite Icon19
  • https://doi.org/10.1145/2629644Copy DOI Icon

Pattern-Based Verification for Multithreaded Programs

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

Pattern-based verification checks the correctness of program executions that follow a given pattern , a regular expression over the alphabet of program transitions of the form w 1 * … w n * . For multithreaded programs, the alphabet of the pattern is given by the reads and writes to the shared storage. We study the complexity of pattern-based verification for multithreaded programs with shared counters and finite variables. While unrestricted verification is undecidable for abstracted multithreaded programs with recursive procedures and PSPACE-complete for abstracted multithreaded while-programs (even without counters), we show that pattern-based verification is NP-complete for both classes, even in the presence of counters. We then conduct a multiparameter analysis to study the complexity of the problem on its three natural parameters (number of threads+counters+variables, maximal size of a thread, size of the pattern) and on two parameters related to thread structure (maximal number of procedures per thread and longest simple path of procedure calls). We present an algorithm that for a fixed number of threads, counters, variables, and pattern size solves the verification problem in st O ( lsp + ⌈ log ( pr +1) ⌉) time, where st is the maximal size of a thread, pr is the maximal number of procedures per thread, and lsp is the longest simple path of procedure calls.

Similar Papers
  • Conference Article
  • Citations18

Complexity of pattern-based verification for multithreaded programs

  • Jan 26, 2011
  • Javier Esparza +1
  • Research Article
  • Citations23

Complexity of pattern-based verification for multithreaded programs

  • Jan 26, 2011
  • ACM SIGPLAN Notices
  • Javier Esparza +1
  • Conference Article
  • Citations1

Reachability in Multithreaded Programs Is Polynomial in the Number of Threads

  • Dec 01, 2019
  • Alexander Malkis
  • Conference Article
  • Citations5

Algorithms for Access Localization to Objects of Scalable Concurrent Pools Based on Diffracting Trees in Multicore Computer Systems

  • Oct 01, 2018
  • Alexandr D Anenkov +2
  • Conference Article
  • Citations7

Perf-Sat: Runtime Detection of Performance Saturation for GPGPU Applications

  • Sep 01, 2014
  • Mihir Awatramani +2
  • Conference Article
  • Citations96

Summarizing procedures in concurrent programs

  • Jan 01, 2004
  • Shaz Qadeer +2
  • Research Article
  • Citations23

Summarizing procedures in concurrent programs

  • Jan 01, 2004
  • ACM SIGPLAN Notices
  • Shaz Qadeer +2
  • Conference Article
  • Citations109

Thread reinforcer: Dynamically determining number of threads via OS level monitoring

  • Nov 01, 2011
  • Kishore Kumar Pusukuri +2
  • Conference Article
  • Citations20

Variable and thread bounding for systematic testing of multithreaded programs

  • Jul 15, 2013
  • Sandeep Bindal +2
  • Book Chapter
  • Citations8

Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction

  • Jan 01, 2009
  • Lin Gao +3
  • Conference Article
  • Citations9

Extended Regular Expressions: Succinctness and Decidability.

  • Jan 01, 2011
  • HAL (Le Centre pour la Communication Scientifique Directe)
  • Dominik D Freydenberger
  • Research Article
  • Citations2

Model checking race-freeness

  • Dec 20, 2008
  • ACM SIGARCH Computer Architecture News
  • Parosh Aziz Abdulla +2
  • Research Article
  • Citations1

Performance improvement of developed program by using multi-thread technique

  • Jan 01, 2015
  • DOAJ (DOAJ: Directory of Open Access Journals)
  • Surasak Jabal +1
  • Conference Article
  • Citations2

Reachability in Binary Multithreaded Programs Is Polynomial

  • Jun 01, 2017
  • Alexander Malkis +1
  • Conference Article
  • Citations2

Parallel Multithreaded Medical Images Filtering

  • Dec 01, 2021
  • Veska Gancheva
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.