Model checking
Process algebra and non-interference
Journal of Computer Security
Communication and Concurrency
Modal µ-Calculus, Model Checking and Gauß Elimination
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Information flow security in dynamic contexts
Journal of Computer Security
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Framework for Model Checking Web Service Compositions Based on BPEL4WS
ICEBE '07 Proceedings of the IEEE International Conference on e-Business Engineering
CONCUR '07 Proceedings of the 18th international conference on Concurrency Theory
A Foundational Theory of Contracts for Multi-party Service Composition
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Contract Compliance and Choreography Conformance in the Presence of Message Queues
Web Services and Formal Methods
A theory of contracts for Web services
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Theory of Adaptable Contract-Based Service Composition
SYNASC '08 Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Model-checking Web Services Orchestrations using BP-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling and Model Checking Web Services
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-Checking Behavioral Specification of BPEL Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
A formal account of contracts for web services
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
In this paper we present a logic-based technique for verifying both security and correctness properties of multilevel service compositions. We define modal μ -calculus formulae interpreted over service configurations. Our formulae characterize those compositions which satisfy a non-interference property and are compliant, i.e., are both deadlock and livelock free. Moreover, we use filters as prescriptions of behavior (coercions to prevent service misbehavior) and we devise a model checking algorithm for adaptive service compositions which automatically synthesizes an adapting filter.