{"id":102,"date":"2013-06-19T09:48:38","date_gmt":"2013-06-19T08:48:38","guid":{"rendered":"http:\/\/sites.google.com\/feeds\/content\/site\/tcsunica\/2653535736840822411"},"modified":"2013-11-22T15:35:40","modified_gmt":"2013-11-22T14:35:40","slug":"phd-course-reversible-computing","status":"publish","type":"post","link":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/2013\/06\/19\/phd-course-reversible-computing\/","title":{"rendered":"PhD course: Reversible Computing"},"content":{"rendered":"
Upcoming PhD course
<\/font><\/div>

<\/div>
Reversible Computing<\/b>
<\/div>

<\/div>
July 15-19, 2013
<\/font>\r\n<\/div>\r\n
Dipartimento di Matematica e Informatica - Via Ospedale 72, Cagliari<\/font>
<\/div>
Ivan Lanese<\/font><\/b>
<\/div><\/div>
Universit\u00e0 di Bologna & INRIA FOCUS Team<\/font><\/span>
<\/div>

Abstract.<\/b> Reversible computing emerges spontaneously in many areas, such as\u00a0\r\nquantum computing or biological modeling. Also, reversible computing\r\n
allows for recoverability: when an error occurs reversibility allows\r\none to go back to a past state and try again. Reversibility is well\u00a0\r\nunderstood in a sequential setting: to reverse a computation one has\u00a0\r\nto recursively undo the last step. This is not possible in a\r\nconcurrent scenario, since it may not be clear which the last performed action is.

We will study reversibility for concurrent interacting systems. In particular, we consider causal consistent reversibility, where only actions which have produced no consequences can be undone. We consider uncontrolled forms of reversibility first. However, uncontrolled\u00a0\r\nreversibility is not suitable for programming safe applications, since\u00a0\r\nbackward steps should be triggered only when an error state is\r\nreached. To this end we define a rollback operator allowing the\u00a0\r\nprogrammer to control when backward steps are performed. We also show\r\nthat specifying alternatives is useful to avoid looping behaviors. We\u00a0\r\nmake our intuitions formal using reversible process calculi.\u00a0 Finally, we discuss applications of our theory to transactions and to\r\ndebugging.<\/font><\/span>

The\r\n\r\n official presentation of the course will be on July 15 (Monday) in \r\nAula C, at 10:00. The schedule of the course will be \r\nfixed during this \r\nmeeting.<\/span>

Course schedule.<\/b>
<\/span><\/font>