Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Action versus State based Logics for Transition Systems
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Efficient On-the-Fly Model Checking for CTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Formal Modelling and Verification of an Asynchronous Extension of SOAP
ECOWS '06 Proceedings of the European Conference on Web Services
ACTLW - An action-based computation tree logic with unless operator
Information Sciences: an International Journal
Formal verification of an automotive scenario in service-oriented computing
Proceedings of the 30th international conference on Software engineering
MDD4SOA: Model-Driven Service Orchestration
EDOC '08 Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference
CMC-UMC: a framework for the verification of abstract service-oriented properties
Proceedings of the 2009 ACM symposium on Applied Computing
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
A model checking approach for verifying COWS specifications
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Hi-index | 0.00 |
In this chapter we present (some of) the design principles which have inspired the development of the CMC/UMC verification framework. The first of these is the need of an abstraction mechanism which allows to observe a model in terms of an abstract L2TS, therefore hiding all the unnecessary underlying details of the concrete computational model, while revealing only the details which might be important to understand the system behavior. The second of these is the need a Service-Oriented Logic (SocL) which is an event and state based, branching-time, efficiently verifiable, parametric temporal logic, for the formal encoding of service-oriented properties. The third principle is the usefulness of an on-the-fly, bounded model-checking approach for an efficient, interactive analysis of service-oriented systems which starts from the early stages of the incremental system design.