Title :
WSSMT: Towards the Automated Analysis of Security-Sensitive Services and Applications
Author :
Barletta, Michele ; Calvi, Alberto ; Ranise, Silvio ; Viganò, Luca ; Zanetti, Luca
Author_Institution :
Dipt. di Inf., Univ. di Verona, Verona, Italy
Abstract :
The security of service-oriented applications is crucial in several contexts such as e-commerce or e-governance. The design, implementation, and deployment of this kind of services are often so complex that serious vulnerabilities remain even after extensive application of traditional validation techniques, such as testing. Given the importance of security-sensitive service applications, the development of techniques for their automated validation is growing. In this paper, we illustrate our formal framework to the specification and validation of security-sensitive applications structured in two levels: the workflow level (dealing with the control of flow and the manipulation of data) and the policy level (describing trust relationships and access control). In our framework, verification problems are reduced to logical problems whose decidability can be shown under suitable assumptions, which permit the validation of practically relevant classes of services. As a by-product, it is possible to re-use state-of-the-art theorem-proving technology to mechanize the verification process. This is the idea underlying our prototype validation tool WSSMT, "Web-Service (validation by) Satisfiability Modulo Theories\´\´, which has been successfully used on two industrial case studies taken from the FP7 European project AVANTSSAR.
Keywords :
decidability; formal verification; security of data; theorem proving; FP7 European project AVANTSSAR; WSSMT; Web service satisfiability modulo theories; access control; automated analysis; automated validation; decidability; e-commerce; e-governance; formal framework; prototype validation tool; security-sensitive applications; security-sensitive service applications; security-sensitive services; service-oriented applications; theorem proving technology; trust relationships; validation techniques; verification problems; verification process; Access control; Cognition; Databases; Prototypes; Substrates; Syntactics;
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2010 12th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4244-9816-1
DOI :
10.1109/SYNASC.2010.74