1997
DOI: 10.1016/s0950-5849(96)01141-x
|View full text |Cite
|
Sign up to set email alerts
|

Adequate testing of hypertext applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2002
2002
2012
2012

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…It is easy to prove (1) by applying Lemma 3. The proof of statement (2) is similar to the proof of a theorem in (Jin, Zhu and Hall, 1997). Details are omitted for the sake of space.…”
Section: Definition 18 (Reduction Of Test Criterion)mentioning
confidence: 99%
“…It is easy to prove (1) by applying Lemma 3. The proof of statement (2) is similar to the proof of a theorem in (Jin, Zhu and Hall, 1997). Details are omitted for the sake of space.…”
Section: Definition 18 (Reduction Of Test Criterion)mentioning
confidence: 99%
“…Currently, three agents are implemented for node coverage, link coverage and linear independent path coverage criteria, respectively. Details of these test criteria for hypertext applications can be found in (Jin, Zhu & Hall, 1997 An ontology of software testing is developed and codified in XML for the communications between agents. The following section gives details of the ontology and its uses in the prototype system.…”
Section: Wpi (Web Page Information)mentioning
confidence: 99%