Automated Validation of Security-Sensitive Web Services Specified in BPEL and RBAC

Calvi, Alberto; Ranise, Silvio; Viganò, Luca

doi:10.1109/synasc.2010.75

Cited by 5 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A method to integrate a Satisfiability Modulo Theories (SMT) solver into Petri net–based business process verification is sketched in the work of Monakova et al However, this method is limited to acyclic processes since its termination cannot be guaranteed. Another approach using an SMT solver is presented in the works of Barletta et al and Calvi et al, where processes are modeled in terms of vector addition systems, which then can be verified with respect to reachability. Again, to ensure decidability, only acyclic processes are considered.…”

Section: State Of the Artmentioning

confidence: 99%

Static analysis and process model transformation for an advanced business process to Petri net mapping

2017

View full text Add to dashboard Cite

SummaryVerification of business processes typically relies on Petri net-based process models. While they allow for natural modeling and analysis of aspects such as parallelism and message exchange, such a process model is seldom complete and precise. This is mainly because the available techniques for deriving a Petri net model from the original model neglect process data in favor of feasible verification. In this paper, we present an approach for deriving more precise process models by leveraging a process-to-Petri-net compiler, which takes as input a business process and generates as output a Petri net model for the process. This can be subsequently used for verification. However, in contrast to a conventional compiler, our compiler's objective is not to create the most efficient code but rather to produce a most precise but still effectively verifiable Petri net-based process model.

show abstract

Section: State Of the Artmentioning

confidence: 99%

Static analysis and process model transformation for an advanced business process to Petri net mapping

2017

View full text Add to dashboard Cite

show abstract

“…We plan to perform a more extensive experimental analysis as part of future work. We have already started doing this in [18], by extending WSSMT with the capability of using BPEL files for the WF level and the RBAC-WS-BPEL proposed in [43] for the PM level. This is done by generalizing the encoding for Petri nets and RBAC discussed in Sect.…”

Section: Pragmatics Of Reasoning Modulo Theoriesmentioning

confidence: 99%

“…The details about how this is done depend on the application domain and are beyond the scope of the paper. The interested reader is pointed, e.g., to [18] for a discussion of the combination of services specified by BPEL and a variant of RBAC tailored to BPEL. In the rest of this section, we assume that T SOA has been derived from the component background theories T 1 SOA , .…”

Section: An Application To Composition Of Servicesmentioning

confidence: 99%

A declarative two-level framework to specify and verify workflow and authorization policies in service-oriented architectures

Barletta

Ranise

Viganò

2010

SOCA

Self Cite

View full text Add to dashboard Cite

The specification of distributed service-oriented applications spans several levels of abstraction, e.g., the protocol for exchanging messages, the set of interface functionalities, the types of the manipulated data, the workflow, the access policy, etc. Many (even executable) specification languages are available to describe each level in separation. However, these levels may interact in subtle ways (for example, the control flow may depend on the values of some data variables) so that a precise abstraction of the application amounts to more than the sum of its per level components. This problem is even more acute in the design phase when automated analysis techniques may greatly help the difficult task of building "correct" applications faced by designers. To alleviate this kind of problems, this paper introduces a framework for the formal specification and automated analysis of distributed service-oriented applications in two levels: one for the workflow and one for the authorization policies. The former allows one to precisely describe the control and data parts of an application with their mutual dependencies. The latter focuses on the specification of the criteria for granting or denying third-party applications the possibility to access shared resources or to execute certain interface functionalities. These levels can be seen as abstractions of one or of several levels of specification mentioned above. The novelty of our proposal is the possibility to unambiguously specify the-often subtle-interplay between the workflow and policy levels uniformly in the same framework. Additionally, our framework allows us to define and investigate verification problems for service-oriented applications (such as executability and invariant checking) and give sufficient conditions for their decidability. These results are non-trivial because their scope of applicability goes well beyond the case of finite state spaces allowing for applications manipulating variables ranging over infinite domains. As proof of concept, we show the suitability and flexibility of our approach on two quite different examples inspired by industrial case studies.

show abstract

“…The modification of BPEL2oWFN that we did was simple since the tool is capable of computing a Petri net specifying the control-flow of the (composed) service and there is a well-known connection between Petri nets and Vector Addition Systems (VASs), which can be seen as a particular class of guarded assignment systems for the WF level. The details of this relationship are omitted here for lack of space but can be found in, e.g., [23], [24]. The reader may wonder why we took this indirect way to obtain a first abstract specification of DCS: the answer is that the (composed) service was big and thus was very difficult to write from scratch.…”

Section: B Digital Contract Signingmentioning

confidence: 99%

“…Along the same lines, we have added Separation of Duties constraints (e.g., the user signing the contract should not be the same as the one checking the validity of the signature on the contract) and Bound of Duties constraints (e.g., the users signing the contract should be same that have agreed on the conditions of the contract) authorization constraints. Again, further details can be found in [24].…”

Section: B Digital Contract Signingmentioning

confidence: 99%

WSSMT: Towards the Automated Analysis of Security-Sensitive Services and Applications

Barletta

Calvi

Ranise³

et al. 2010

2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Self Cite

View full text Add to dashboard Cite

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-ofthe-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.

show abstract

Automated Validation of Security-Sensitive Web Services Specified in BPEL and RBAC

Cited by 5 publications

References 14 publications

Static analysis and process model transformation for an advanced business process to Petri net mapping

Static analysis and process model transformation for an advanced business process to Petri net mapping

A declarative two-level framework to specify and verify workflow and authorization policies in service-oriented architectures

WSSMT: Towards the Automated Analysis of Security-Sensitive Services and Applications

Contact Info

Product

Resources

About