2006
DOI: 10.1109/issre.2006.9
|View full text |Cite
|
Sign up to set email alerts
|

A State Exploration-Based Approach to Testing Java Monitors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2008
2008
2010
2010

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…If the nondeterminism is due to concurrency then we might be able to use methods such as deterministic testing [38,39] or reachability testing [40] in order to ensure that all relevant interleavings are tested. This can be generalised by making an assumption, called the complete testing assumption (see, for example, [41]), that it is sufficient to repeat a test k times for some prior k. Naturally, the value of k used may increase for longer test sequences and this may favour checking experiments that consist of many short sequences rather than a few long sequences.…”
Section: Definition 18mentioning
confidence: 99%
“…If the nondeterminism is due to concurrency then we might be able to use methods such as deterministic testing [38,39] or reachability testing [40] in order to ensure that all relevant interleavings are tested. This can be generalised by making an assumption, called the complete testing assumption (see, for example, [41]), that it is sufficient to repeat a test k times for some prior k. Naturally, the value of k used may increase for longer test sequences and this may favour checking experiments that consist of many short sequences rather than a few long sequences.…”
Section: Definition 18mentioning
confidence: 99%