2002
DOI: 10.1145/568760.568866
View full text
|
Sign up to set email alerts
|
Share

Abstract: In this paper we propose a formal method for web applications verification. The verification process is carried out by checking that either the system always satisfies a model of the specifications or by producing a counter-example. We represent the system as a Kripke structure and model a web site as a graph. Model checking is reformulated as checking that each initial state satisfies the specifications. We adopt Computation Tree Logic (CTL) as language to define the properties to be verified.The proposed fo…

Expand abstract