References

  1. Martin Berger, Kohei Honda & Nobuko Yoshida (2008): Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes. In: Luca Aceto: ICALP'08, LNCS 5126. Springer-Verlag, Berlin Germany, pp. 99–111, doi:10.1007/978-3-540-70583-3_9.
  2. Laura Bocchi, Kohei Honda, Emilio Tuosto & Nobuko Yoshida (2010): A theory of design-by-contract for distributed multiparty interactions. In: CONCUR'10: Proceedings of the 21st International Conference on Concurrency Theory, Lecture Notes in Computer Science. Springer - Verlag, pp. 162–176, doi:10.1007/978-3-642-15375-4_12.
  3. L. Caires & L. Cardelli (2001): A spatial logic for concurrency (part I). In: Theoretical Aspects of Computer Software. Springer, pp. 1–37, doi:10.1007/3-540-45500-0_1.
  4. M. Carbone, K. Honda & N. Yoshida (2007): A Calculus of Global Interaction based on Session Types. In: 2nd Workshop on Developments in Computational Models (DCM), ENTCS, pp. 127–151, doi:10.1016/j.entcs.2006.12.041.
  5. M. Carbone, K. Honda & N. Yoshida (2007): Structured communication-centred programming for web services. In: 16th European Symposium on Programming (ESOP), LNCS 4421. Springer, Berlin Heidelberg, Braga, Portugal, pp. 2–17, doi:10.1007/978-3-540-71316-6_2.
  6. M. Carbone, K. Honda, N. Yoshida, R. Milner, G. Brown & S. Ross-Talbot (2009): A Theoretical Basis of Communication-Centred Concurrent Programming. Web Services Choreography Working Group mailing list, WS-CDL working report.
  7. Luca Cardelli & Andrew D. Gordon (2000): Anytime, Anywhere: Modal Logics for Mobile Ambients. In: POPL, pp. 365–377, doi:10.1145/325694.325742.
  8. Witold Charatonik & Jean-Marc Talbot (2001): The Decidability of Model Checking Mobile Ambients. In: Laurent Fribourg: CSL, Lecture Notes in Computer Science 2142. Springer, pp. 339–354, doi:10.1007/3-540-44802-0_24.
  9. E.A. Emerson (1991): Temporal and modal logic. In: Handbook of theoretical computer science (vol. B). MIT Press, pp. 1072.
  10. M. Hennessy & R. Milner (1980): On Observing Nondeterminism and Concurrency. In: Proceedings of the 7th Colloquium on Automata, Languages and Programming. Springer-Verlag London, UK, pp. 299–309, doi:10.1007/3-540-10003-2_79.
  11. K. Honda, V.T. Vasconcelos & M. Kubo (1998): Language Primitives and Type Discipline for Structured Communication-Based Programming. In: 7th European Symposium on Programming (ESOP): Programming Languages and Systems. Springer-Verlag London, UK, pp. 122–138, doi:10.1007/BFb0053567.
  12. N. Kavantzas, D. Burdett, G. Ritzinger, T. Fletcher, Y. Lafon & C. Barreto (2004): Web services choreography description language version 1.0. W3C Working Draft 17, pp. 10–20041217.
  13. Hugo A. López, Carlos Olarte & Jorge A. Pérez (2010): Towards a Unified Framework for Declarative Structured Communications. In: Programming Language Approaches to Concurrency and Communication-cEntric Software (PLACES'2009), EPTCS 17, pp. 1–15, doi:10.4204/EPTCS.17.1.
  14. Robin Milner (1999): Communicating and Mobile systems. The Pi Calculus. Cambridge University Press.
  15. Carlo Montangero & Laura Semini (2006): A Logical View of Choreography. In: COORDINATION, pp. 179–193, doi:10.1007/11767954_12.
  16. G. D. Plotkin (1981): A Structural Approach to Operational Semantics. Technical Report. University of Aarhus.
  17. Emil L. Post (1944): Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society 50, pp. 284–316.
  18. JC Reynolds (2002): Separation logic: a logic for shared mutable data structures. Logic in Computer Science, 2002. Proceedings. 17th Annual IEEE Symposium on, pp. 55–74. Available at http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029817.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org