Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

paolini2017lipics (In proceedings)
Author(s) Luca Paolini, Mauro Piccolo and Luca Roversi
Title« A certified study of a reversible programming language »
InTYPES 2015 postproceedings
SeriesLIPIcs
Editor(s) Tarmo Uustalu
Volume69
Year2017
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
URLhttp://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04
Abstract
We advance in the study of the semantics of Janus, i.e. a C-like reversible programming language. Our study makes utterly explicit some backward and forward evaluation symmetries. We want to deepen mathematical knowledge about the foundations and design principles of reversible computing and programming languages. We formalize a big-step operational semantics and a denotational semantics of Janus. We show a full abstraction result between the operational and denotational semantics. Last, we certify our results by means of the proof assistant Matita.

Download the complete article: 2015types.pdf

BibTeX code

@inproceedings{paolini2017lipics,
  volume = {69},
  author = {Luca Paolini and Mauro Piccolo and Luca Roversi},
  series = {LIPIcs},
  booktitle = {{TYPES 2015} postproceedings},
  editor = {Tarmo Uustalu},
  url = {http://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04},
  abstract = {We advance in the study of the semantics of Janus, i.e.\ a C-like
              reversible programming language. Our study makes utterly explicit
              some backward and forward evaluation symmetries. We want to deepen
              mathematical knowledge about the foundations and design principles
              of reversible computing and programming languages. We formalize a
              big-step operational semantics and a denotational semantics of
              Janus. We show a full abstraction result between the operational
              and denotational semantics. Last, we certify our results by means
              of the proof assistant Matita.},
  tag = {{LIPIcs}},
  title = {A certified study of a reversible programming language},
  localfile = {http://www.di.unito.it/~paolini/papers/2015types.pdf},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  year = 2017,
}


 Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)

Valid HTML 4.01!