scholarly journals Towards Reliable Concurrent Software

2018 ◽  
pp. 129-146 ◽  
Author(s):  
Marieke Huisman ◽  
Sebastiaan J. C. Joosten
Keyword(s):  
Concurrent Software

BDD-based safety-analysis of concurrent software with pointer data structures using graph automorphism symmetry reduction

2004 ◽  
Vol 30 (6) ◽  
pp. 403-417 ◽  
Author(s):  
Farn Wang ◽  
K. Schmidt ◽  
Fang Yu ◽  
Geng-Dian Huang ◽  
Bow-Yaw Wang
Keyword(s):  
Data Structures ◽  
Safety Analysis ◽  
Symmetry Reduction ◽  
Concurrent Software ◽  
Graph Automorphism

scholarly journals Dynamic Reductions for Model Checking Concurrent Software

2017 ◽  
pp. 246-265 ◽  
Author(s):  
Henning Günther ◽  
Alfons Laarman ◽  
Ana Sokolova ◽  
Georg Weissenbacher
Keyword(s):  
Model Checking ◽  
Concurrent Software

Concurrent Software Simulation (CSS)

1994 ◽  
pp. 109-113
Author(s):  
Ernst G. Ulrich ◽  
Vishwani D. Agrawal ◽  
Jack H. Arabian
Keyword(s):  
Concurrent Software ◽  
Software Simulation

REACHABILITY TESTING: AN APPROACH TO TESTING CONCURRENT SOFTWARE

1995 ◽  
Vol 05 (04) ◽  
pp. 493-510 ◽  
Author(s):  
GWAN-HWAN HWANG ◽  
KUO-CHUNG TAI ◽  
TING-LU HUANG
Keyword(s):  
Empirical Studies ◽  
Concurrent Programs ◽  
Concurrent Software ◽  
Sequential Programs ◽  
Concurrent Program ◽  
Testing Approach ◽  
Reachability Testing ◽  
Deterministic Behavior

Concurrent programs are more difficult to test than sequential programs because of non-deterministic behavior. An execution of a concurrent program non-deterministically exercises a sequence of synchronization events called a synchronization sequence (or SYN-sequence). Non-deterministic testing of a concurrent program P is to execute P with a given input many times in order to exercise distinct SYN-sequences. In this paper, we present a new testing approach called reachability testing. If every execution of P with input X terminates, reachability testing of P with input X derives and executes all possible SYN-sequences of P with input X. We show how to perform reachability testing of concurrent programs using read and write operations. Also, we present results of empirical studies comparing reachability and non-deterministic testing. Our results indicate that reachability testing has advantages over non-deterministic testing.

Sign in / Sign up

Export Citation Format

Share Document