The algorithm described in the paper is outlined as follows (just for my curiosity):
"The algorithm starts with a generic XPath locator that returns
all nodes (‘//*’) and then it iteratively refines the locator until only the element of interest is selected. In such iterative refinement, ROBULA+ applies seven refinement transformations, according to a set of heuristic XPath specialization steps."
The algorithm seems to be a specialized heuristics for XPath generation.
"The algorithm starts with a generic XPath locator that returns all nodes (‘//*’) and then it iteratively refines the locator until only the element of interest is selected. In such iterative refinement, ROBULA+ applies seven refinement transformations, according to a set of heuristic XPath specialization steps."
The algorithm seems to be a specialized heuristics for XPath generation.