L. de Alfaro. Model checking the World Wide Web. In Conference on Computer Aided Verification (CAV), pages 337--349, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Modal Perspective on Path Constraints - Alechina, Demri, de Rijke (2003) (4 citations) (Correct)
....is often represented as an edge labeled graph. In particular, the World Wide Web can be modeled as a graph where the vertices are uniquely identi ed by URLs and the labels are hypertext links between them [1] richer structures able to deal with the frame structure of the pages can be found in [5]. An important special class of graphs are deterministic graphs. A graph is called deterministic if for every node u and label a there is at most one node v such that u v holds. In the case of the web (unlike the case of most object oriented databases) it is reasonable to expect a graph to be ....
.... that it is correct when non deterministic L structures are considered (see the proof of Theorem 11) Hence, modulo the presence of #, PDL can be viewed as a fragment of CPDL with nominals [20] or as a fragment of the hybrid calculus [43] Furthermore, the constructive calculus introduced in [5] also contains nominals (i.e. proposition letters interpreted by singletons) as well as a form of recursion. We don t need the full expressive power of the calculus, however: we are interested in path queries, and regular expressions from PDL are sucient to express standard path constraints. ....
L. de Alfaro. Model checking the world wide web. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Veri cation, pages 337-349. volume 2102 of Lecture Notes in Computer Science, Springer-Verlag, 2001.
A Modal Perspective on Path Constraints - Alechina, Demri, de Rijke (2003) (4 citations) (Correct)
....is often represented as an edge labeled graph. In particular, the World Wide Web can be modeled as a graph where the vertices are uniquely identified by URLs and the labels are hypertext links between them [1] richer structures able to deal with the frame structure of the pages can be found in [5]. An important special class of graphs are deterministic graphs. A graph is called deterministic if for every node u and label a there is at most one node v such that u v holds. In the case of the web (unlike the case of most object oriented databases) it is reasonable to expect a graph to be ....
.... it is correct when non deterministic L structures are considered (see the proof of Theorem 11) Hence, modulo the presence of #, PDL can be viewed as a fragment of CPDL with nominals [20] or as a fragment of the hybrid calculus [43] Furthermore, the constructive calculus introduced in [5] also contains nominals (i.e. proposition letters interpreted by singletons) as well as a form of recursion. We don t need the full expressive power of the calculus, however: we are interested in path queries, and regular expressions from PDL are sufficient to express standard path ....
L. de Alfaro. Model checking the world wide web. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Verification, pages 337--349. volume 2102 of Lecture Notes in Computer Science, Springer-Verlag, 2001.
VeriWeb: Automatically Testing Dynamic Web Sites - Michael Benedikt Juliana (2002) (4 citations) (Correct)
No context found.
L. de Alfaro. Model checking the World Wide Web. In Conference on Computer Aided Verification (CAV), pages 337--349, 2001.
A Logical Framework for Analyzing Properties of Multimedia Web.. - Szegö (Correct)
No context found.
Luca de Alfaro, Model Checking the World Wide Web, Lecture Notes in Computer Science, Volume 2102, pp. 337-350, 2001.
XML Query Evaluation via CTL Model Checking - Afanasiev (2004) (Correct)
No context found.
L. De Alfaro. Model checking the world wide web. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Verification, pages 337--349. Springer, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC