Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kullo Raiend

dblp:10/1199 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing
black-box testing
0.112007
Synthesis of test purpose directed reactive planning tester for nondeterministic systems · ASE 2007
Software testing
model-based testing
0.112007
Synthesis of test purpose directed reactive planning tester for nondeterministic systems · ASE 2007
Software testing › test execution › runtime testing
online testing
0.112007
Synthesis of test purpose directed reactive planning tester for nondeterministic systems · ASE 2007

Methods — techniques the papers use, named apart from their topics

trap-based test purpose · 0.1reactive planning · 0.1EFSM · 0.1
YearPublicationVenuePosition
2007 Synthesis of test purpose directed reactive planning tester for nondeterministic systems
abstract
We describe a model-based construction of an online tester for black-box testing of the implementation under test(IUT). The external behaviour of the IUT is modelled as an output observable nondeterministic EFSM with the assumption that all transition paths are feasible. A test purpose is attributed to the IUT model by a set of Boolean variables called traps that are used to measure the progress of the test run. These variables are associated with the transitions of the IUT model. The situation where all traps have been reached means that the test purpose has been achieved. We present a way to construct a tester that at runtime selects a suboptimal test path from trap to trap by finding the shortest path to the next unvisited trap. The principles of reactive planning are implemented in the form of the decision rules of selecting the shortest paths at runtime. The decision rules are constructed in advance from the IUT model and the test purpose. Preliminary experimental results confirm that this method clearly out performs random choice and is better than the anti-ant algorithm in terms of resultant test sequence length to achieve the test purpose
Jüri Vain, Kullo Raiend, Andres Kull, Juhan P. Ernits
ASE2