Advertisement

VerChor: A Framework for Verifying Choreographies

  • Matthias Güdemann
  • Pascal Poizat
  • Gwen Salaün
  • Alexandre Dumont
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7793)

Abstract

Nowadays, modern applications are often constructed by reusing and assembling distributed and collaborating entities, e.g., software components, Web services, or Software as a Service in cloud computing environments. In order to facilitate the integration of independently developed components (i.e., peers) that may reside in different organizations, it is necessary to provide a global contract to which the peers participating in a service composition should adhere. Such a contract is called choreography, and specifies interactions among a set of services from a global point of view.

Keywords

Service Composition Service Selection Equivalence Check Cloud Computing Environment Global Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Basu, S., Bultan, T., Ouederni, M.: Deciding Choreography Realizability. In: Proc. of POPL 2012 (2012)Google Scholar
  2. 2.
    Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 372–387. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Foster, H., Uchitel, S., Magee, J., Kramer, J.: LTSA-WS: A Tool for Model-based Verification of Web Service Compositions and Choreography. In: Proc. of ICSE 2006 (2006)Google Scholar
  4. 4.
    Güdemann, M., Salaün, G., Ouederni, M.: Counterexample Guided Synthesis of Monitors for Realizability Enforcement. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 238–253. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Poizat, P., Salaün, G.: Checking the Realizability of BPMN 2.0 Choreographies. In: Proc. of SAC 2012 (2012)Google Scholar
  6. 6.
    Salaün, G., Bultan, T., Roohi, N.: Realizability of Choreographies Using Process Algebra Encodings. IEEE T. Services Computing 5(3) (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Matthias Güdemann
    • 1
  • Pascal Poizat
    • 2
  • Gwen Salaün
    • 1
  • Alexandre Dumont
    • 1
  1. 1.Inria, Grenoble INPFrance
  2. 2.LIP6 UMR 7606 CNRSUniversité Paris OuestNanterreFrance

Personalised recommendations