Distributed reachability testing of concurrent programs

2010 ◽  
Vol 22 (18) ◽  
pp. 2445-2466 ◽  
Author(s):  
Richard H. Carver ◽  
Yu Lei
Keyword(s):  
Concurrent Programs ◽  
Reachability Testing

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.

Reachability testing of concurrent programs

2006 ◽  
Vol 32 (6) ◽  
pp. 382-403 ◽  
Author(s):  
Y. Lei ◽  
R.H. Carver
Keyword(s):  
Concurrent Programs ◽  
Reachability Testing

Empirical evaluation of a new composite approach to the coverage criteria and reachability testing of concurrent programs

2015 ◽  
Vol 25 (3) ◽  
pp. 310-332 ◽  
Author(s):  
S. R. S. Souza ◽  
P. S. L. Souza ◽  
M. A. S. Brito ◽  
A. S. Simao ◽  
E. J. Zaluska
Keyword(s):  
Empirical Evaluation ◽  
Concurrent Programs ◽  
Coverage Criteria ◽  
Composite Approach ◽  
Reachability Testing

Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs

2021 ◽  
Vol 178 (3) ◽  
pp. 229-266
Author(s):  
Ivan Lanese ◽  
Adrián Palacios ◽  
Germán Vidal
Keyword(s):  
Programming Language ◽  
Message Passing ◽  
Concurrent Programming ◽  
Concurrent Systems ◽  
Concurrent Programs ◽  
Unified Framework ◽  
Innovative Technique ◽  
Dual Notion

Causal-consistent reversible debugging is an innovative technique for debugging concurrent systems. It allows one to go back in the execution focusing on the actions that most likely caused a visible misbehavior. When such an action is selected, the debugger undoes it, including all and only its consequences. This operation is called a causal-consistent rollback. In this way, the user can avoid being distracted by the actions of other, unrelated processes. In this work, we introduce its dual notion: causal-consistent replay. We allow the user to record an execution of a running program and, in contrast to traditional replay debuggers, to reproduce a visible misbehavior inside the debugger including all and only its causes. Furthermore, we present a unified framework that combines both causal-consistent replay and causal-consistent rollback. Although most of the ideas that we present are rather general, we focus on a popular functional and concurrent programming language based on message passing: Erlang.

scholarly journals Mechanized verification of fine-grained concurrent programs

2015 ◽  
Vol 50 (6) ◽  
pp. 77-87 ◽  
Author(s):  
Ilya Sergey ◽  
Aleksandar Nanevski ◽  
Anindya Banerjee
Keyword(s):  
Concurrent Programs ◽  
Fine Grained ◽  
Mechanized Verification
Sign in / Sign up

Export Citation Format

Share Document