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 MATT: Multi Agents Testing Tool Based Nets within Nets

2016 ◽  
Vol 40 (2) ◽  
pp. 165-184 ◽  
Author(s):  
Sara Kerraoui ◽  
Moussa Saker
Keyword(s):  
Test Cases ◽  
Multi Agent Systems ◽  
Development Activity ◽  
Agent Systems ◽  
Model Based ◽  
Model Based Testing ◽  
Testing Tool ◽  
Multi Agent ◽  
Testing Techniques

Testing is a software development activity, devoted to evaluating product quality and improving it by identifying defects and problems. Concerning multi agent systems, testing is a challenging task, which asks for new testing techniques dealing with their specific nature. The techniques need to be effective and adequate to evaluate agent’s autonomous behaviors and build confidence in them. The "Model Based Testing" (MBT) is a technique particularly interested among all existing solutions of tests. This latter is based on a system model, which produces abstract test cases. To run these last ones against systems under test,the abstract test cases have to be transformed to concrete ones. As part of this effort, we propose a model based testing approach for multi agent systems based on such a model called Reference net, where a tool, which aims to providing a uniform and automated approach is developed. The feasibility and the advantage of the proposed approach are shown through a short case study.

scholarly journals Concurrency testing using symbolic path finder

2018 ◽  
Vol 7 (2.6) ◽  
pp. 275
Author(s):  
Bidush Kumar Sahoo ◽  
Mitrabinda Ray
Keyword(s):  
Symbolic Execution ◽  
Concurrent Programs ◽  
Test Case ◽  
Test Cases ◽  
Concurrent Program ◽  
Activity Complex ◽  
Race Condition ◽  
Concurrent Testing ◽  
Concurrency Testing ◽  
The Given

Concurrent programs have specific features such as italic communication, synchronization and nondeterministic behavior that make the testing activity complex. The objective is to find various types of concurrent defects. In this paper, we have used a model checking tool called Symbolic Path Finder (SPF) which is the upgradation of Java Path Finder (JPF) for concurrent testing. SPF is used for generating the test cases to check concurrent defects such as deadlock, race condition etc. SPF generates symbolic execution tree of the given code which is used as an input for test case generation. The execution is done for finding the test cases in concurrent program where number of threads is operating together with the concurrent defects. The test cases show the type of concurrent defects in the respective line number of the source code.  

scholarly journals Using Fuzzy Logic in Test Case Prioritization for Regression Testing Programs with Assertions

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Ali M. Alakeel
Keyword(s):  
Fuzzy Logic ◽  
Regression Testing ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Software Developers ◽  
Novel Approach ◽  
History Of ◽  
Supporting Tool

Program assertions have been recognized as a supporting tool during software development, testing, and maintenance. Therefore, software developers place assertions within their code in positions that are considered to be error prone or that have the potential to lead to a software crash or failure. Similar to any other software, programs with assertions must be maintained. Depending on the type of modification applied to the modified program, assertions also might have to undergo some modifications. New assertions may also be introduced in the new version of the program, while some assertions can be kept the same. This paper presents a novel approach for test case prioritization during regression testing of programs that have assertions using fuzzy logic. The main objective of this approach is to prioritize the test cases according to their estimated potential in violating a given program assertion. To develop the proposed approach, we utilize fuzzy logic techniques to estimate the effectiveness of a given test case in violating an assertion based on the history of the test cases in previous testing operations. We have conducted a case study in which the proposed approach is applied to various programs, and the results are promising compared to untreated and randomly ordered test cases.

AUTOMATIC GENERATION OF TEST CASES FROM ACTIVITY DIAGRAMS FOR UML BASED TESTING (UBT)

2015 ◽  
Vol 77 (13) ◽  
Author(s):  
Oluwatolani Oluwagbemi ◽  
Hishammuddin Asmuni
Keyword(s):  
Automatic Generation ◽  
Test Cases ◽  
System Testing ◽  
Activity Diagrams ◽  
Model File ◽  
Transition Criteria

Activity diagrams are one of UML behavioural models suitable for system testing because it has the capacity to effectively describe the behaviours of systems under development. In this paper, a technique is proposed that generates test cases from activity diagrams by constructing an activity flow tree (AFT) which stores all the information extracted from the model file of the diagram through the help of a parser. Then, we applied an algorithm to generate test cases from the constructed tree. Test cases were generated based on the elements of activity diagrams such as activity sequences, associated descriptions and conditions. The proposed technique generated accurate test cases that completely tallied with the modeled requirements in the diagram. We utilized all-paths, basic pair paths, conditions, branches and transition criteria for generating test cases using ATM withdrawal operation software as a case study.

scholarly journals Towards an Automated Model-Based Test Generation Approach from Controlled Natural Language Specifications Written in Arabic

2021 ◽  
Author(s):  
Moez Krichen ◽  
Seifeddine Mechti
Keyword(s):  
Natural Language ◽  
Test Generation ◽  
Arabic Language ◽  
Test Cases ◽  
New Model ◽  
Controlled Natural Language ◽  
Model Based ◽  
Case Grammar ◽  
Model Based Testing ◽  
Testing Approach

<div>We propose a new model-based testing approach which takes as input a set of requirements described in Arabic Controlled Natural Language (CNL) which is a subset of the Arabic language generated by a specific grammar. The semantics of the considered requirements is defined using the Case Grammar Theory (CTG). The requirements are translated into Transition Relations which serve as an input for test cases generation tools.</div>

scholarly journals Towards an Automated Model-Based Test Generation Approach from Controlled Natural Language Specifications Written in Arabic

2021 ◽  
Author(s):  
Moez Krichen ◽  
Seifeddine Mechti
Keyword(s):  
Natural Language ◽  
Test Generation ◽  
Arabic Language ◽  
Test Cases ◽  
New Model ◽  
Controlled Natural Language ◽  
Model Based ◽  
Case Grammar ◽  
Model Based Testing ◽  
Testing Approach

<div>We propose a new model-based testing approach which takes as input a set of requirements described in Arabic Controlled Natural Language (CNL) which is a subset of the Arabic language generated by a specific grammar. The semantics of the considered requirements is defined using the Case Grammar Theory (CTG). The requirements are translated into Transition Relations which serve as an input for test cases generation tools.</div>

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