IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Composite model-checking: verification with type-specific symbolic representations
ACM Transactions on Software Engineering and Methodology (TOSEM)
Communicating sequential processes
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Summarizing procedures in concurrent programs
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Model checking XML manipulating software
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Semantics Based Verification and Synthesis of BPEL4WS Abstract Processes
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Compatibility Verification for Web Service Choreography
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Efficient Verification of Sequential and Concurrent C Programs
Formal Methods in System Design
A model for abstract process specification, verification and composition
Proceedings of the 2nd international conference on Service oriented computing
WWW '05 Proceedings of the 14th international conference on World Wide Web
Modular verification of multithreaded programs
Theoretical Computer Science
Model-Checking Behavioral Specification of BPEL Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Analyzing interacting BPEL processes
BPM'06 Proceedings of the 4th international conference on Business Process Management
Semantics of BPEL4WS-Like fault and compensation handling
FM'05 Proceedings of the 2005 international conference on Formal Methods
Dynamic component substitutability analysis
FM'05 Proceedings of the 2005 international conference on Formal Methods
The ComFoRT reasoning framework
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
An abstract machine architecture for web service based business process management
BPM'05 Proceedings of the Third international conference on Business Process Management
| Hi-index | 0.00 |
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relations among the incoming and outgoing messages of individual BPEL web services. These pre- and post-conditions are accumulated and serve as a repository of summarizations of individual web services. We then compose the summaries of the invoked BPEL services to model external invocations, resulting in a scalable verification approach for web service compositions. Our technical contributions include (1) an efficient symbolic encoding for modeling the concurrency semantics of systems having both multi-threading and message passing, and (2) a scalable method for summarizing concurrent processes that interact with each other using synchronous message passing, along with a modular framework that utilizes these summaries for scalable verification.