Abstract
Data-intensive Web applications have been expanding rapidly, it is necessary to assure their correctness. In this paper, we propose an approach to the verification of Data-intensive Web applications. The design of a Web application is described in WebML, and then transformed into the Kripke structure. Computation Tree Logic (CTL) is employed to define the properties to be verified and model checker NuSMV is introduced to perform verification against the Kripke structure. In addition, an example is given to demonstrate the approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
