By Topic

Semantic model checking security requirements for web services

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
L. Boaro ; Università Politecnica delle Marche, I-60131 Ancona, Italy ; E. Glorio ; F. Pagliarecci ; L. Spalazzi

Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It has been used as basic tool in several scenarios as service selection, service validation, and service composition. Furthermore, it has been widely applied to problems of security verification. The importance of semantics is widely recognized, as well. Indeed, there exists several solutions to the problem of providing semantics to web services, most of them relies on some form of Description Logic. This paper presents an integration of model checking and semantic reasoning technologies in an efficient way. This can be considered the first step towards the usage of semantic model checking in problems of security verification. The approach relies on a representation of services at the process level that is based on semantically annotated state transition systems (ASTS) and a representation of specifications that is based on a semantically annotated version of the computation tree logic (AnCTL). The proposed approach permit to perform an efficient and yet useful, semantic reasoning at process-level about web services. Indeed, this paper proves thatmodel checking for ASTS and AnCTLis sound and complete and it can be accomplished in polynomial time.

Published in:

High Performance Computing and Simulation (HPCS), 2010 International Conference on

Date of Conference:

June 28 2010-July 2 2010