Basic concepts and taxonomy of dependable and secure computing, IEEE Transactions on Dependable and Secure Computing, vol.1, issue.1, pp.11-33, 2004. ,
DOI : 10.1109/TDSC.2004.2
URL : http://www.cs.newcastle.ac.uk/publications/articles/papers/666.pdf
Two notions of sub-behaviour for session-based client/server systems, Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, PPDP '10, pp.155-164, 2010. ,
DOI : 10.1145/1836089.1836109
Sub-behaviour relations for session-based client/server systems, Mathematical Structures in Computer Science, vol.1381, issue.06, pp.1339-1381, 2015. ,
DOI : 10.1007/978-3-540-74407-8_15
A Game Interpretation of Retractable Contracts, In COORDINATION LNCS, vol.411, issue.2/3, 2016. ,
DOI : 10.1007/3-540-17906-2_31
URL : https://hal.archives-ouvertes.fr/hal-01631714
Compliance for reversible client/server interactions, BEAT, pp.35-42, 2014. ,
DOI : 10.4204/EPTCS.155.3
URL : http://arxiv.org/abs/1408.5981
Reversible client/server interactions, Formal Aspects of Computing, vol.84, issue.5, pp.697-722, 2016. ,
DOI : 10.1016/j.jlamp.2015.03.004
Retractable Contracts, PLACES 2015, pp.61-72, 2016. ,
DOI : 10.1007/978-3-642-15375-4_39
URL : https://hal.archives-ouvertes.fr/hal-01227693
Retractable and speculative contracts (TR) http://www.cs.unibo.it, 2017. ,
DOI : 10.1007/978-3-319-59746-1_7
Compliance and Subtyping in Timed Session Types, LNCS, vol.9039, pp.161-177, 2015. ,
DOI : 10.1007/978-3-319-19195-9_11
Modelling session types using contracts, Mathematical Structures in Computer Science, vol.6, issue.03, pp.510-560, 2016. ,
DOI : 10.1016/j.tcs.2010.05.002
URL : https://www.scss.tcd.ie/publications/tech-reports/reports.11/TCD-CS-2011-07.pdf
Using higher-order contracts to model session types, Logical Methods in Computer Science, vol.12, issue.2, p.2016 ,
DOI : 10.2168/LMCS-12(2:10)2016
URL : https://lmcs.episciences.org/1642/pdf
Structured Interactional Exceptions in Session Types, In CONCUR LNCS, vol.5201, pp.402-417, 2008. ,
DOI : 10.1007/978-3-540-85361-9_32
URL : http://www.eecs.qmul.ac.uk/~carbonem/exception/exceptionfull.pdf
Efficient optimistic parallel simulations using reverse computation, ACM Transactions on Modeling and Computer Simulation, vol.9, issue.3, pp.224-253, 1999. ,
DOI : 10.1145/347823.347828
URL : http://webster.cs.uga.edu/~maria/classes/CSCI8220/papers/reverse-execution.ps
A Formal Account of Contracts for Web Services, WS-FM, number 4184 in LNCS, pp.148-162, 2006. ,
DOI : 10.1007/11841197_10
URL : https://hal.archives-ouvertes.fr/hal-00152568
A theory of contracts for web services, ACM Trans. on Prog. Lang. and Sys, vol.3119, issue.5, pp.1-1961, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00434459
Graceful interruption of request-response service interactions, ICSOC, pp.590-600, 2011. ,
Reversible Communicating Systems, In CONCUR LNCS, vol.6, issue.4, pp.292-307, 2004. ,
DOI : 10.1007/BFb0012800
URL : https://hal.archives-ouvertes.fr/hal-00784051
Communicating transactions -(extended abstract), In CONCUR LNCS, vol.6269, pp.569-583, 2010. ,
Reversible Multiparty Sessions with Checkpoints, EXPRESS/SOS'16, pp.60-74, 2016. ,
DOI : 10.1007/978-3-319-40578-0_4
URL : http://arxiv.org/pdf/1608.03129
Recursive subtyping revealed, J. Funct. Program, vol.12, issue.6, pp.511-548, 2002. ,
Communicating Sequential Processes, 1985. ,
DOI : 10.1145/357980.358021
URL : http://www.cs.cmu.edu/afs/cs/user/crary/www/819-f09/Hoare78.pdf
Language primitives and type discipline for structured communication-based programming, ESOP, pp.22-138, 1998. ,
DOI : 10.1007/BFb0053567
URL : http://www.di.fc.ul.pt/~vv/papers/yoshida.vasconcelos_language-primitives-revisited.pdf
Multiparty asynchronous session types, POPL, pp.273-284, 2008. ,
DOI : 10.1145/1328438.1328472
Reversibility in the higher-order ?? -calculus, Theoretical Computer Science, vol.625, pp.25-84, 2016. ,
DOI : 10.1016/j.tcs.2016.02.019
URL : https://hal.archives-ouvertes.fr/hal-01081714
Causal-consistent reversibility, Bulletin of the EATCS, vol.114, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01089350
The Must Preorder Revisited, In CONCUR LNCS, vol.4703, pp.212-225, 2007. ,
DOI : 10.1007/978-3-540-74407-8_15
Contract-based discovery of Web services modulo simple orchestrators, Theoretical Computer Science, vol.411, issue.37, pp.3328-3347, 2010. ,
DOI : 10.1016/j.tcs.2010.05.002
URL : https://doi.org/10.1016/j.tcs.2010.05.002
Reversing algebraic process calculi, The Journal of Logic and Algebraic Programming, vol.73, issue.1-2, pp.70-96, 2007. ,
DOI : 10.1016/j.jlap.2006.11.002
URL : https://doi.org/10.1016/j.jlap.2006.11.002
Safe programmable speculative parallelism, PLDI, pp.50-61, 2010. ,
DOI : 10.1145/1809028.1806603
URL : http://research.microsoft.com/pubs/118795/pldi026-vaswani.pdf
Mitosis compiler: An infrastructure for speculative threading based on pre-computation slices, PLDI, pp.269-279, 2005. ,
Towards Reversible Sessions, PLACES, pp.17-24, 2014. ,
DOI : 10.1016/j.entcs.2007.02.056
URL : http://arxiv.org/abs/1406.3480
Reversible session-based pi-calculus, Journal of Logical and Algebraic Methods in Programming, vol.84, issue.5, pp.684-707, 2015. ,
DOI : 10.1016/j.jlamp.2015.03.004
URL : https://doi.org/10.1016/j.jlamp.2015.03.004
Satzilla: Portfolio-based algorithm selection for SAT, J. Artif. Intell. Res. (JAIR), vol.32, pp.565-606, 2008. ,
The quest for efficient boolean satisfiability solvers, CAV, pp.17-36, 2002. ,
DOI : 10.1007/3-540-45657-0_2