Continuation Semantics for Asynchronous Concurrency

• Autorzy: Ciobanu G. , Todoran E. N.

Identyfikatory

DOI

10.3233/FI-2014-1020

• Języki publikacji: EN

Abstrakty

EN

The paper presents a method of reasoning about the behaviour of asynchronous programs in denotational models designed with metric spaces and continuation semantics for concurrency.

Słowa kluczowe

EN

metric semantics; continuations for concurrency; asynchronous communication

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2014
• Tom: Vol. 131, nr 3-4
• Strony: 373--388
• Opis fizyczny: Bibliogr. 23 poz.

Twórcy

autor

Ciobanu G.

• Institute of Computer Science, Romanian Academy, Iaşi, Romania

autor

Todoran E. N.

• Department of Computer Science, Technical University of Cluj-Napoca, Cluj-Napoca, Romania.

Bibliografia

• [1] America, P., Rutten, J.J.M.M.: Solving Reflexive Domain Equations in a Category of Complete Metric Spaces, Journal of Computer and System Sciences, 39(3), 1989, 343–375.
• [2] de Bakker, J.W., de Vink, E.P.: Control Flow Semantics, MIT Press, 1996.
• [3] Baeten, J.C.M., Weijland, W.P.: Process Algebra, Cambridge University Press, 1990.
• [4] de Bakker, J.W., Warmerdam, J.H.A.: Metric Pomset Semantics for a Concurrent Language with Recursion, vol. 469 of Lecture Notes in Computer Science, Springer, 1990, 21–49.
• [5] Banach, S.: Sur les Opérations dans les Ensembles Abstrait et leur Applications aux Équations Intégrales, Fundamenta Matematicae, 3, 1922, 133–181.
• [6] Bergstra, J.A., Klop, J.W.: Algebra of Communicating Processes with Abstraction, Theoretical Computer Science, 37(1), 1985, 77–121.
• [7] Bobrwow, D.G., Wegbreit, B.: A Model and Stack Implementation of Multiple Environments, Communications of the ACM, 16(10), 1973, 591–603.
• [8] de Boer, F.S., Kok, J.N., Palamidessi, C., Rutten, J.J.M.M.: A Paradigm for Asynchronous Communication and its Application to Concurrent Constraint Programming, in: Logic Programming Languages: Constraints, Functions and Objects (K.R. Apt, J.W. de Bakker, J.J.M.M. Rutten, Eds.), MIT Press, 1993, 82–114.
• [9] Brookes, S.: Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes, Proc. CONCUR’02, vol. 2421 of Lecture Notes in Computer Science, Springer, 2002, 466–482.
• [10] de Bruin, A., Bohm,W.: The Denotational Semantics of Dynamic Networks of Processes, ACM Transactions on Programming Languages and Systems, 7(4), 1985, 656–679.
• [11] Ciobanu, G., Todoran, E.N.: Continuation Semantics for Asynchronous Concurrency, Technical Report FML-10-02, Romanian Academy, 2010, available at http://iit.iit.tuiasi.ro/TR/reports/fml1002.pdf.
• [12] Ciobanu, G., Todoran, E.N.: Relating two Metric Semantics for Parallel Rewriting of Multisets, Proc. IEEE SYNASC’12, IEEE Computer Press, 2012, 273–281.
• [13] Danvy, O.: On Evaluation Contexts, Continuations and the Rest of the Computation, Proc. 4th ACM SIGPLAN Workshop on Continuations, 2004, 13–23.
• [14] Honda, K., Tokoro, M.: An Object Calculus for Asynchronous Communication, vol. 512 of Lecture Notes in Computer Science, Springer, 1991, 133–147.
• [15] Jech, T.: Set Theory, Springer, 2003.
• [16] Milner, R.: Communicating and Mobile Systems: the π Calculus, Cambridge University Press, 1999.
• [17] Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous π Calculus, Mathematical Structures in Computer Science, 13(5), 2003, 685–719.
• [18] Plotkin, G.: A Powerdomain Construction, SIAM Journal of Computing, 5(3), 1976, 452–487.
• [19] Rutten, J.J.M.M.: Semantic Correctness for a Parallel Object Oriented Language, SIAM Journal of Computing, 19(2), 1990, 341–383.
• [20] Saraswat, V.: Concurrent Constraint Programming, MIT Press, 1993.
• [21] Stratchey, C., Wadsworth, C.: Continuations: A Mathematical Semantics for Handling Full Jumps, Higher-Order and Symbolic Computation, 13, 2000, 135–152.
• [22] Todoran, E.N.: Metric Semantics for Synchronous and Asynchronous Communication: A Continuation-Based Approach, vol. 28 of Electronic Notes in Theoretical Computer Science, Elsevier, 2000, 119–146.
• [23] Todoran, E.N., Papaspyrou, N.: Continuations for Parallel Logic Programming, Proc. ACM PPDP’00, ACM Press, 2000, 257–267.