Sink web pages of web application Doru Anastasiu Popescu 1 , Zoltan Szabo 2 1 Faculty of Mathematics and Computer Sciences University of Pite@ti, ROMANIA E5mail: dopopan@yahoo.com 2 High School “Petru Maior”, Reghin, ROMANIA E5mail: szabozoliposta@yahoo.com Abstract In this paper we define a new notion: sink web page for web application. We define a partial order relation between the web pages of a web application, for this. With the help of this relation, we construct a directed graph associated to a web application. In general, web applications contain many web pages. Their verification and testing is usually performed by using different verification mechanisms. Because many of the components of a web application are in the partial order relation, it follows that the time for verification and testing is considerably reduced if we verify only the sink web pages. Keywords: Verification, Relation, Web Application, Graph, HTML, Java Introduction The starting point in writing this paper is represented by the fact that many web applications use their static web pages' code, as well as the codes of other web pages. It is obvious that in testing and verifying ([6.1], [6.4] and [6.5]) such an application (which can have a large number of static web pages, of different complexity) it is useful to find a way of reducing the number of static web pages to be tested and verified. In this sense, we can consider that for two web pages p and q in which p's code is included in q's code, it is enough to verify only q's code. In section 2 of this paper, we will present a relation between the web pages of the web application, together with an example, after which we will continue with the construction of a directed graph (section 3) associated to this relation and a method (section 4) which determines the web pages needed to be tested in order to verify the correctness of the web application. The relation defined in section 2 is different from that of [6.2]. In [6.2] relation is a relation of equivalence, and this article is a reflexive relationship, transitive but not symmetric. With this relation the number of web pages to be verified and tested shrinks greatly. For web sites tested with program developed based on these notions, number of web pages checked and tested decreased by 60 percent. In section 5, I described a Java programme, created by me, which uses the concepts from the previous sections. A relation among the web pages of a web application Let P={p 1 , p 2 ,…, p n } be the set of web pages in an web application and T be a set of unimportant tags. Below, we define the relation R on the set P. Definition We say that p R q, when p and q are from P, if: