scholarly journals Fast and Generalized Polynomial Time Memory Consistency Verification

2006 ◽  
pp. 503-516 ◽  
Author(s):  
Amitabha Roy ◽  
Stephan Zeisset ◽  
Charles J. Fleckenstein ◽  
John C. Huang
Keyword(s):  
Polynomial Time ◽  
Memory Consistency ◽  
Generalized Polynomial ◽  
Consistency Verification

Fast complete memory consistency verification

2009 ◽  
Author(s):  
Yunji Chen ◽  
Yi Lv ◽  
Weiwu Hu ◽  
Tianshi Chen ◽  
Haihua Shen ◽  
...  
Keyword(s):  
Memory Consistency ◽  
Consistency Verification

Program Regularization in Memory Consistency Verification

2012 ◽  
Vol 23 (11) ◽  
pp. 2163-2174 ◽  
Author(s):  
Yunji Chen ◽  
Lei Li ◽  
Tianshi Chen ◽  
Ling Li ◽  
Lei Wang ◽  
...  
Keyword(s):  
Memory Consistency ◽  
Consistency Verification

Linear Time Memory Consistency Verification

2012 ◽  
Vol 61 (4) ◽  
pp. 502-516 ◽  
Author(s):  
Weiwu Hu ◽  
Yunji Chen ◽  
Tianshi Chen ◽  
Cheng Qian ◽  
Lei Li
Keyword(s):  
Linear Time ◽  
Memory Consistency ◽  
Consistency Verification

Generalized Polynomial-Time Reducibilities, Degrees and NP-Completeness

1984 ◽  
Vol 7 (1) ◽  
pp. 77-81
Author(s):  
Uwe Schöning
Keyword(s):  
Polynomial Time ◽  
Infinite Hierarchy ◽  
Np Completeness ◽  
Generalized Polynomial ◽  
Turing Reducibility

An infinite hierarchy of polynomial-time reducibilities is introduced which generalizes the notion of polynomial-time Turing reducibility and strong nondeterministic polynomial-time Turing reducibility.

scholarly journals The reads-from equivalence for the TSO and PSO memory models

2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-30
Author(s):  
Truc Lam Bui ◽  
Krishnendu Chatterjee ◽  
Tushar Gautam ◽  
Andreas Pavlogiannis ◽  
Viktor Toman
Keyword(s):  
Model Checking ◽  
Polynomial Time ◽  
Memory Models ◽  
Experimental Results ◽  
Concurrent Programs ◽  
Algorithmic Problem ◽  
Sequential Consistency ◽  
Process Communication ◽  
Consistency Verification ◽  
Inter Process Communication

The verification of concurrent programs remains an open challenge due to the non-determinism in inter-process communication. One recurring algorithmic problem in this challenge is the consistency verification of concurrent executions. In particular, consistency verification under a reads-from map allows to compute the reads-from (RF) equivalence between concurrent traces, with direct applications to areas such as Stateless Model Checking (SMC). Importantly, the RF equivalence was recently shown to be coarser than the standard Mazurkiewicz equivalence, leading to impressive scalability improvements for SMC under SC (sequential consistency). However, for the relaxed memory models of TSO and PSO (total/partial store order), the algorithmic problem of deciding the RF equivalence, as well as its impact on SMC, has been elusive. In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as n k +1 for TSO and as n k +1 · min( n k 2 , 2 k · d ) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal , in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.

Memory Consistency Verification of Chip Multi-Processor

2010 ◽  
Vol 21 (4) ◽  
pp. 863-874 ◽  
Author(s):  
Peng-Yu WANG ◽  
Yun-Ji CHEN ◽  
Hai-Hua SHEN ◽  
Tian-Shi CHEN ◽  
Heng ZHANG
Keyword(s):  
Memory Consistency ◽  
Consistency Verification

The 2-closure of a 32-transitive group in polynomial time

2018 ◽  
Vol 60 (2) ◽  
pp. 360-375
Author(s):  
A. V. Vasil'ev ◽  
D. V. Churikov
Keyword(s):  
Polynomial Time ◽  
Transitive Group
Sign in / Sign up

Export Citation Format

Share Document