2000
DOI: 10.1007/3-540-40911-4_20
|View full text |Cite
|
Sign up to set email alerts
|

An Approach to Symbolic Test Generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
68
0
1

Year Published

2003
2003
2009
2009

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 75 publications
(69 citation statements)
references
References 15 publications
0
68
0
1
Order By: Relevance
“…We adapt the symbolic transition systems of [13], using shared variables for communication instead of input/output actions. -Q is a finite set of locations q i , i ≥ 0 -q 0 ∈ Q is the initial location -V is a set of variables -T is a set of transitions of the form q, g, S, q , where…”
Section: Combining Methods Automata and Scheduling Policiesmentioning
confidence: 99%
“…We adapt the symbolic transition systems of [13], using shared variables for communication instead of input/output actions. -Q is a finite set of locations q i , i ≥ 0 -q 0 ∈ Q is the initial location -V is a set of variables -T is a set of transitions of the form q, g, S, q , where…”
Section: Combining Methods Automata and Scheduling Policiesmentioning
confidence: 99%
“…More recently, we have explored symbolic test generation techniques for IOSTS specifications [29]. The objective is to avoid the state space explosion problem induced by the enumeration of values of variables and communication parameters.…”
Section: Automatic Test Generationmentioning
confidence: 99%
“…This problem is solved by the model of Symbolic Transition Systems (see e.g. [15,6]), which we introduce in this section.…”
Section: The Symbolic Frameworkmentioning
confidence: 99%
“…A closely related approach is described in [15], that uses a variant of a symbolic transition system and a weaker relation, e.g. they do not deal with quiescence.…”
Section: Conclusion and Related Workmentioning
confidence: 99%