A heuristic approach to path selection problem in concurrent program testing

2003 ◽  
Author(s):  
Su-Yu Hsu ◽  
Chyan-Goei Chung
Keyword(s):  
Path Selection ◽  
Heuristic Approach ◽  
Selection Problem ◽  
Concurrent Program ◽  
Program Testing

MODEL-BASED TESTING OF CONCURRENT PROGRAMS WITH PREDICATE SEQUENCING CONSTRAINTS

2006 ◽  
Vol 16 (05) ◽  
pp. 727-746 ◽  
Author(s):  
PENG WU ◽  
HUIMIN LIN
Keyword(s):  
Dynamic Test ◽  
Concurrent Programs ◽  
Test Cases ◽  
Data Dependency ◽  
Data Dependencies ◽  
Concurrent Program ◽  
Program Testing ◽  
Model Based Testing ◽  
Symbolic Test

A predicate sequencing constraint logic (PSCL) is proposed to represent test purpose for concurrent program testing. The logic is capable of expressing not only sequencing relationships among input and output events, but also data dependencies between event parameters. A PSCL-based symbolic test generation method is developed to automatically derive symbolic test cases that incorporate given data dependency constraints as verdict conditions. The method works in a syntactic way without referring to concrete program states and the derived test cases allow dynamic test data selection according to the response from the software under test. The advantage of the approach is demonstrated with a case study.

scholarly journals Reliable Path Selection Problem in Uncertain Traffic Network after Natural Disaster

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Jing Wang ◽  
Jianming Zhu ◽  
Haoxiong Yang
Keyword(s):  
Natural Disaster ◽  
Large Scale ◽  
Path Selection ◽  
Selection Model ◽  
Selection Problem ◽  
Traffic Network ◽  
Traffic Networks ◽  
Connection Probability ◽  
Reliable Path

After natural disaster, especially for large-scale disasters and affected areas, vast relief materials are often needed. In the meantime, the traffic networks are always of uncertainty because of the disaster. In this paper, we assume that the edges in the network are either connected or blocked, and the connection probability of each edge is known. In order to ensure the arrival of these supplies at the affected areas, it is important to select a reliable path. A reliable path selection model is formulated, and two algorithms for solving this model are presented. Then, adjustable reliable path selection model is proposed when the edge of the selected reliable path is broken. And the corresponding algorithms are shown to be efficient both theoretically and numerically.

Sign in / Sign up

Export Citation Format

Share Document