The Omega Library interface guide
The Omega Library interface guide
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Logic based modeling and analysis of workflows
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Declarative workflows that support easy modification and dynamic browsing
WACC '99 Proceedings of the international joint conference on Work activities coordination and collaboration
ACM Transactions on Programming Languages and Systems (TOPLAS)
Action Language: a specification language for model checking reactive systems
Proceedings of the 22nd international conference on Software engineering
Verification of workflow task structures: A petri-net-based approach
Information Systems
Symbolic Model Checking
Dynamic and adaptive composition of e-services
Information Systems - The 12th international conference on advanced information systems engineering (CAiSE 00)
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Verification of Vortex Workflows
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verification of Business Processes for a Correspondence Handling Center Using CCS
EUROVAV '99 Collected papers from the 5th European Symposium on Validation and Verification of Knowledge Based Systems - Theory, Tools and Practice
Peer-to-Peer Traced Execution of Composite Services
TES '01 Proceedings of the Second International Workshop on Technologies for E-Services
Beyond Discrete E-Services: Composing Session-Oriented Services in Telecommunications
TES '01 Proceedings of the Second International Workshop on Technologies for E-Services
Constraint-Based Verification of Client-Server Protocols
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Automatic Verification of Parameterized Cache Coherence Protocols
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Model Checking Guided Abstraction and Analysis
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Current Solutions for Web Service Composition
IEEE Internet Computing
Semantic matchmaking of web services using model checking
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Design and Analysis of the Composed Telecom Services
Service-Oriented Computing - ICSOC 2007 Workshops
StPowla: SOA, Policies and Workflows
Service-Oriented Computing - ICSOC 2007 Workshops
Finite-state verification of the ebXML protocol
Electronic Commerce Research and Applications
Service matchmaking revisited: An approach based on model checking
Web Semantics: Science, Services and Agents on the World Wide Web
Contract-based web service composition framework with correctness guarantees
ISAS'05 Proceedings of the Second international conference on Service Availability
Automated analysis of infinite state workflows with access control policies
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Multi-Level Modeling of Web Service Compositions with Transactional Properties
Journal of Database Management
| Hi-index | 0.00 |
We study the verification problem for e-service (and workflow) specifications, aiming at efficient techniques for guiding the construction of composite e-services to guarantee desired properties (e.g., deadlock avoidance, bounds on resource usage, response times). Based on e-service frameworks such as AZTEC and e-FLow, decision flow language Vortex, we introduce a very simple e-service model for our investigation of verification issues. We first show how three different model checking techniques are applied when the number of processes is limited to a predetermined number. We then introduce pid quantified constraint, a new symbolic representation that can encode infinite many system states, to verify systems with unbounded and dynamic process instantiations. We think that it is a versatile technique and more suitable for verification of e-service specifications. If this is combined with other techniques such as abstraction and widening, it is possible to solve a large category of interesting verification problems for e-services.