2005
DOI: 10.1016/j.infsof.2004.08.004
|View full text |Cite
|
Sign up to set email alerts
|

An address mapping approach for test data generation of dynamic linked structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0
1

Year Published

2007
2007
2015
2015

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 19 publications
0
6
0
1
Order By: Relevance
“…Although some research has been proposed some EFSM-based testing techniques, automated test case generation on an EFSM suffers from a number of problems. [38,39] all-uses -Expanding EFSM to FSM --Bourhfir [45] du-path UIO Symbolic evaluation Random -Ural [42] [60] all-transition -Heuristics Search Symbolic Execution structural program testing [14][15][16][17][18], However, the case of EFSM is more complexity than structural program since a transition in an EFSM may be triggered by three types of enabling conditions: the input event, the current state and a boolean expression involving the context variables [19], and multi-transitions or self-loops may be exist between two states or single state, respectively. This feature also results in a somehow different between EFSM-based and traditional structure-based test case generation.…”
Section: Efsm-based Test Case Generationmentioning
confidence: 99%
“…Although some research has been proposed some EFSM-based testing techniques, automated test case generation on an EFSM suffers from a number of problems. [38,39] all-uses -Expanding EFSM to FSM --Bourhfir [45] du-path UIO Symbolic evaluation Random -Ural [42] [60] all-transition -Heuristics Search Symbolic Execution structural program testing [14][15][16][17][18], However, the case of EFSM is more complexity than structural program since a transition in an EFSM may be triggered by three types of enabling conditions: the input event, the current state and a boolean expression involving the context variables [19], and multi-transitions or self-loops may be exist between two states or single state, respectively. This feature also results in a somehow different between EFSM-based and traditional structure-based test case generation.…”
Section: Efsm-based Test Case Generationmentioning
confidence: 99%
“…Williams et al [5], Sai-ngern et al [21] and Sen [7] address the problem of generating test data for C functions with dynamic structures by using symbolic execution and constraint solving techniques. In their approaches, constraints on input values, representing preconditions, force pointing relationships in generated tests.…”
Section: Related Workmentioning
confidence: 99%
“…As a drawback, this approach cannot detect unsatisfiability of selected paths. More recently, Visvanathan and Gupta in [28], Marre et al in [29] and Sai-ngern et al [30] addressed the problem of generating test data for C functions with pointers as input parameters by using symbolic execution and constraint solving techniques. In their approaches, pointer relationships are handled with constraints on input values and aliasing problems occur only within input data structures.…”
Section: Related Workmentioning
confidence: 99%