Automated analysis of dynamic web services
For a web application test-engineer, it would be convenient to have a map,
in form of a graph, describing the functional topology of the application.
In that way, it would be possible to analyse the possible paths which can
be navigated to discover redundancies and circularities for example. A web
spider tool can automate the construction of such a graph. The spider can
request a document from the application, find all references to other
documents in it, and explore them recursively until all the references have
been analysed. However, web services often produce dynamic responses which
means that the content cannot be distinctly represented by its reference,
i.e., the responses must be classified in a way that matches the users
perception. The main problem is to find suitable criteria for this
classification. This study describes how to make such a tool and it surveys
ideas for how to create a classifying identifier for dynamic responses. The
implemented spider was used to make experiments on selected web services,
different models for web node identification. The result is a proposal of
criteria for classification of dynamic responses, coming from web
These criteria are implemented in algorithms which use the parse structure and
the set of internal references as the dominant terms of identification.
Masters Thesis in Computer Science
The report is available at: http://www.hig.se/~jbt/astec
Place: Information technology, Uppsala University
Time: 15.15-16.00 (+ discussions)
Room 1113 is in building 1, floor 1, room 13
(in the southern part of the building).
Help on how to find ASTEC Seminars.
There will be an extended period for discussions after the seminar.
Speakers are encouraged to give an short (5 min) introduction to the subject at the begining of the talk.
Listeners are excused if they have to leave after 16.00.
Everyone is welcome !
Updated 07-Mar-2002 14:18 by Roland Grönroos
e-mail: info -at- astec.uu.se