References

1. Martín Abadi & Leslie Lamport (1991): The existence of refinement mappings. TCS 82(2), pp. 253 – 284, doi:10.1016/0304-3975(91)90224-P.
2. Vincent Danos & Jean Krivine (2005): Transactions in RCCS. In: CONCUR 2005, LNCS 3653. Springer, pp. 398–412, doi:10.1007/11539452_31.
3. Vincent Danos, Jean Krivine & Fabien Tarissan (2007): Self-assembling Trees. ENTCS 175(1), pp. 19 – 32, doi:10.1016/j.entcs.2006.11.017.
4. Bruno Dutertre & Maria Sorea (2004): Timed Systems in SAL. Technical Report SRI-SDL-04-03. SRI International.
5. E. N. (Mootaz) Elnozahy, Lorenzo Alvisi, Yi-Min Wang & David B. Johnson (2002): A Survey of Rollback-recovery Protocols in Message-passing Systems. ACM Comput. Surv. 34(3), pp. 375–408, doi:10.1145/568522.568525.
6. Colin J. Fidge (1988): Timestamps in message-passing systems that preserve the partial ordering. In: Proc. of the 11th Australian Computer Science Conference (ACSC'88), pp. 56–66.
7. Rachid Guerraoui (2010): Foundations of Speculative Distributed Computing. In: Distributed Computing, LNCS 6343. Springer, pp. 204–205, doi:10.1007/978-3-642-15763-9_21.
8. M.V. Hermenegildo & K.J. Greene (1991): The &-Prolog system: Exploiting independent and-parallelism. New Generation Computing 9(3-4), pp. 233–256, doi:10.1007/BF03037164.
9. Ralf Hinze (2000): Deriving Backtracking Monad Transformers. In: ICFP '00. ACM, pp. 186–197, doi:10.1145/351240.351258.
10. Tony Hoare (2010): Compensable Transactions. In: Advanced Lectures on Software Engineering, LNCS 6029. Springer, pp. 21–40, doi:10.1007/978-3-642-13010-6_2.
11. D. Jefferson, B. Beckman, F. Wieland, L. Blume & M. Diloreto (1987): Time Warp Operating System. In: SOSP '87. ACM, pp. 77–93, doi:10.1145/41457.37508.
12. David R. Jefferson (1985): Virtual Time. ACM Trans. Program. Lang. Syst. 7(3), pp. 404–425, doi:10.1145/3916.3988.
13. Ivan Lanese, ClaudioAntares Mezzina, Alan Schmitt & Jean-Bernard Stefani (2011): Controlling Reversibility in Higher-Order Pi. In: CONCUR 2011, LNCS 6901. Springer, pp. 297–311, doi:10.1007/978-3-642-23217-6_20.
14. Ivan Lanese, ClaudioAntares Mezzina & Jean-Bernard Stefani (2010): Reversing Higher-Order Pi. In: CONCUR 2010, LNCS 6269. Springer, pp. 478–493, doi:10.1007/978-3-642-15375-4_33.
15. Mohsen Lesani & Jens Palsberg (2011): Communicating Memory Transactions. In: PPoPP. ACM, pp. 157–168, doi:10.1145/1941553.1941577.
16. Jing Li, Huibiao Zhu & Jifeng He (2008): Specifying and Verifying Web Transactions. In: FORTE 2008, LNCS 5048. Springer, pp. 149–168, doi:10.1007/978-3-540-68855-6_10.
17. Michael Lienhardt, Ivan Lanese, ClaudioAntares Mezzina & Jean-Bernard Stefani (2012): A Reversible Abstract Machine and Its Space Overhead. In: Formal Techniques for Distributed Systems, LNCS 7273. Springer, pp. 1–17, doi:10.1007/978-3-642-30793-5_1.
18. Friedemann Mattern (1988): Virtual Time and Global States of Distributed Systems. In: Parallel and Distributed Algorithms. North-Holland, pp. 215–226.
19. Leonardo de Moura (2004): SAL: Tutorial. Technical Report. SRI International.
20. Leonardo de Moura, Sam Owre & N. Shankar (2002): The SAL Language Manual. Technical Report. SRI International.
21. Iain Phillips & Irek Ulidowski (2007): Reversibility and Models for Concurrency. ENTCS 192(1), pp. 93 – 108, doi:10.1016/j.entcs.2007.08.018.
22. John H. Reppy (1999): Concurrent Programming in ML. Cambridge University Press.
23. Edsko de Vries, Vasileios Koutavas & Matthew Hennessy (2010): Communicating Transactions. In: CONCUR 2010, LNCS 6269. Springer, pp. 569–583, doi:10.1007/978-3-642-15375-4_39.
24. Lukasz Ziarek & Suresh Jagannathan (2010): Lightweight Checkpointing for Concurrent Ml. J. Funct. Program. 20(2), pp. 137–173, doi:10.1017/S0956796810000067.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org