var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=http%3A%2F%2Fwww.sti.uniurb.it%2Fnirvana%2Ffile%2Fpapers%2Fbiblio.bib&groupby=type&authorFirst=1&fullnames=1&commas=false&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=http%3A%2F%2Fwww.sti.uniurb.it%2Fnirvana%2Ffile%2Fpapers%2Fbiblio.bib&groupby=type&authorFirst=1&fullnames=1&commas=false&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=http%3A%2F%2Fwww.sti.uniurb.it%2Fnirvana%2Ffile%2Fpapers%2Fbiblio.bib&groupby=type&authorFirst=1&fullnames=1&commas=false&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n article\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n L. Bocchi, I. Lanese, C. A. Mezzina, & S. Yuen.\n\n\n \n \n \n \n \n revTPL: The Reversible Temporal Process Language.\n \n \n \n \n\n\n \n\n\n\n Logical Methods in Computer Science, 20(1:11): 1-35. January 2024.\n \n\n\n\n
\n\n\n\n \n \n \"revTPL:Paper\n  \n \n \n \"revTPL: paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{BLMY24,\n  author       = {L. Bocchi and\n                  I. Lanese and\n                  C. A. Mezzina and\n                  S. Yuen},\n  title        = {revTPL: The Reversible Temporal Process Language},\n  journal      = {Logical Methods in Computer Science},\n  volume       = {20(1:11)},\n  year         = {2024},\n  month        = {January},\n  url          = {https://doi.org/10.46298/lmcs-20(1:11)2024},\n  doi          = {10.46298/LMCS-20(1:11)2024},\n  pages\t       = {1-35},\n  url_Paper    = {./BLMY24.pdf}\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n A. Marin, S. Rossi, & D. Olliaro.\n\n\n \n \n \n \n \n A Product-Form Network for Systems with Job Stealing Policies.\n \n \n \n \n\n\n \n\n\n\n SIGMETRICS Performance Evaluation Review, 50(4): 2-4. March 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n \n \"A paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{MRO23,\n  author       = {A. Marin and\n                  S. Rossi and\n                  D. Olliaro},\n  title        = {A Product-Form Network for Systems with Job Stealing Policies},\n  journal      = {{SIGMETRICS} Performance Evaluation Review},\n  volume       = {50},\n  number       = {4},\n  pages        = {2-4},\n  year         = {2023},\n  month = {March},\n  url          = {https://doi.org/10.1145/3595244.3595246},\n  doi          = {10.1145/3595244.3595246},\n  url_Paper    = {./MRO23.pdf},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n I. Malakhov, A. Marin, & S. Rossi.\n\n\n \n \n \n \n \n Analysis of the Confirmation Time in Proof-of-Work Blockchains.\n \n \n \n \n\n\n \n\n\n\n Future Generation Computer Systems, 147: 275-291. October 2023.\n \n\n\n\n
\n\n\n\n \n \n \"AnalysisPaper\n  \n \n \n \"Analysis paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{MMR23,\n  author       = {I. Malakhov and\n                  A. Marin and\n                  S. Rossi},\n  title        = {Analysis of the Confirmation Time in Proof-of-Work Blockchains},\n  journal      = {Future Generation Computer Systems},\n  volume       = {147},\n  pages        = {275-291},\n  year         = {2023},\n  month = {October},\n\n  url          = {https://doi.org/10.1016/j.future.2023.04.016},\n  doi          = {10.1016/J.FUTURE.2023.04.016},\n  url_Paper    = {./MMR23.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n M. Bernardo, & C. A. Mezzina.\n\n\n \n \n \n \n \n Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach.\n \n \n \n \n\n\n \n\n\n\n Logical Methods in Computer Science, 19(2:6): 1-27. April 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Bridging paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{BM23,\n  author       = {M. Bernardo and\n                  C. A. Mezzina},\n  title        = {Bridging Causal Reversibility and Time Reversibility: {A} Stochastic\n                  Process Algebraic Approach},\n  journal      = {Logical Methods in Computer Science},\n  volume       = {19(2:6)},\n  month        = {April},\n  year         = {2023},\n  doi          = {10.46298/lmcs-19(2:6)2023},\n  url_Paper    = {./BM23.pdf},\n  pages \t   = {1-27},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n inproceedings\n \n \n (11)\n \n \n
\n
\n \n \n
\n \n\n \n \n D. Smuseva, I. Malakhov, A. Marin, & S. Rossi.\n\n\n \n \n \n \n \n Crisis of Trust: Analyzing the Verifier's Dilemma in Ethereum's Proof-of-Stake Blockchain.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 6th IEEE Int. Conf. on Blockchain (Blockchain 2023), pages 332-339, Heinan (China), December 2023. IEEE-CS Press\n \n\n\n\n
\n\n\n\n \n \n \"Crisis paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{SMMR23,\n  author       = {D. Smuseva and I. Malakhov and A. Marin and S. Rossi\n                },\n  title        = {Crisis of Trust: Analyzing the Verifier's Dilemma in Ethereum's\nProof-of-Stake Blockchain},\n  booktitle    = {Proc. of the 6th IEEE Int. Conf. on Blockchain (Blockchain 2023)},\n  pages        = {332-339},\n  month        = {December},\n  year        = {2023},\n   url_Paper    = {./SMMR23.pdf},\naddress = {Heinan (China)},\n  publisher    = {IEEE-CS Press},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n L. Benetollo, M. Bugliesi, S. Crafa, S. Rossi, & A. Spanò.\n\n\n \n \n \n \n \n ALGOMOVE - A Move Embedding for Algorand.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 6th IEEE Int. Conf. on Blockchain (Blockchain 2023), pages 62-67, Heinan (China), December 2023. IEEE-CS Press\n \n\n\n\n
\n\n\n\n \n \n \"ALGOMOVE paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{BBCR23,\n  author       = {L. Benetollo and M. Bugliesi and S. Crafa and S. Rossi and A. Span\\`{o}},\n  title        = {ALGOMOVE - A Move Embedding for Algorand},\n  booktitle    = {Proc. of the 6th IEEE Int. Conf. on Blockchain (Blockchain 2023)},\n  pages        = {62-67},\n  month        = {December},\n  year        = {2023},\n   url_Paper    = {./BBCR23.pdf},\naddress = {Heinan (China)},\n  publisher    = {IEEE-CS Press},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n M. Bernardo, & A. Esposito.\n\n\n \n \n \n \n \n On the Weak Continuation of Reverse Bisimilarity vs. Forward Bisimilarity.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 24th Italian Conf. on Theoretical Computer Science (ICTCS 2023), volume 3587, pages 44-58, Palermo (Italy), September 2023. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"On paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{BE23,\n  author       = {M. Bernardo and\n\t\tA. Esposito\n                },\n  title        = {On the Weak Continuation of Reverse Bisimilarity vs. Forward Bisimilarity},\n  booktitle    = {Proc. of the 24th Italian Conf. on Theoretical Computer Science (ICTCS 2023)},\n  pages        = {44-58},\n  year         = {2023},\n  month        = {September},\n   url_Paper    = {./BE23a.pdf},\naddress = {Palermo (Italy)},\n  publisher    = {CEUR-WS.org},\n  volume       = {3587},\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n M. Bernardo, & A. Esposito.\n\n\n \n \n \n \n \n Modal Logic Characterizations of Forward, Reverse, and Forward-Reverse Bisimilarities.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 14th Int. Symp. on Games, Automata, Logics, and Formal Verification (GandALF 2023), volume EPTCS 390, pages 67-81, Udine (Italy), September 2023. Open Publishing Association\n \n\n\n\n
\n\n\n\n \n \n \"Modal paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{BE23,\n  author       = {M. Bernardo and\n\t\tA. Esposito\n                },\n  title        = {Modal Logic Characterizations of Forward, Reverse, and Forward-Reverse\n                  Bisimilarities},\n  booktitle    = {Proc. of the 14th Int. Symp. on Games, Automata,\n                  Logics, and Formal Verification (GandALF 2023)},\n  pages        = {67-81},\n  year         = {2023},\n  month        = {September},\ndoi = {10.4204/EPTCS.390.5},\n   url_Paper    = {./BE23.pdf},\naddress = {Udine (Italy)},\n  publisher    = {Open Publishing Association},\n  volume        = {EPTCS 390}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n M. Bernardo, I. Lanese, A. Marin, C. A. Mezzina, S. Rossi, & C. Sacerdoti Coen.\n\n\n \n \n \n \n \n Causal Reversibility Implies Time Reversibility.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 20th Int. Conf. on Quantitative Evaluation of Systems (QEST 2023), volume LNCS 14287, pages 270–287, Antwerp (Belgium), September 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Causal paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{qest23,\n  author       = {M. Bernardo and\n\t\tI. Lanese and A. Marin and  \n\t\tC. A. Mezzina and S. Rossi and C. Sacerdoti Coen\n                },\n  title        = {Causal Reversibility Implies Time Reversibility},\n  booktitle    = {Proc. of the 20th Int. Conf. on  Quantitative Evaluation of Systems (QEST 2023)},\n  pages        = {270--287},\n  year         = {2023},\n  month        = {September},\ndoi = {10.1007/978-3-031-43835-6\\_19},\n   url_Paper    = {./qest2023.pdf},\naddress = {Antwerp (Belgium)},\n  publisher    = {Springer},\n  volume        = {LNCS 14287}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n M. Bernardo, & C. A. Mezzina.\n\n\n \n \n \n \n \n Causal Reversibility for Timed Process Calculi with Lazy/Eager Durationless Actions and Time Additivity.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 21th Int. Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS 2023), volume LNCS 14138, pages 15–32, Antwerp (Belgium), September 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Causal paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{MB23a,\n  author       = {M. Bernardo and \n\t\tC. A. Mezzina \n                },\n  title        = {Causal Reversibility for Timed Process Calculi\nwith Lazy/Eager Durationless Actions\nand Time Additivity},\n  booktitle    = {Proc. of the 21th Int. Conf. on  Formal Modeling and Analysis of Timed Systems (FORMATS 2023)},\n  pages        = {15--32},\n  year         = {2023},\n  doi          = {10.1007/978-3-031-42626-1\\_2},\n  month        = {September},\n   url_Paper    = {./BM23a.pdf},\naddress = {Antwerp (Belgium)},\n  publisher    = {Springer},\n  volume        = {LNCS 14138},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n C. A. Mezzina, F. Tiezzi, & N. Yoshida.\n\n\n \n \n \n \n \n Rollback Recovery in Session-Based Programming.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 25th Int. Conf. on Coordination Models and Languages (COORDINATION 2023), volume LNCS 13908, pages 195–213, Lisbon (Portugal), June 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Rollback paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{MTY23,\n  author       = {C. A. Mezzina and\n                  F. Tiezzi and\n                  N. Yoshida},\n  title        = {Rollback Recovery in Session-Based Programming},\n  booktitle    = {Proc. of the 25th Int. Conf. on  Coordination Models and Languages (COORDINATION 2023)},\n  pages        = {195--213},\n  year         = {2023},\n  doi          = {10.1007/978-3-031-35361-1\\_11},\n  month        = {June},\n   url_Paper    = {./MTY23.pdf},\naddress = {Lisbon (Portugal)},\n  publisher    = {Springer},\n  volume        = {LNCS 13908},\n\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n H. C. Melgratti, C. A. Mezzina, & G. M. Pinna.\n\n\n \n \n \n \n \n Relating Reversible Petri Nets and Reversible Event Structures, Categorically.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 43rd Int. Conf. on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2023), volume LNCS 13910, pages 206–223, Lisbon (Portugal), June 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Relating paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{MMP23,\n  author       = {H. C. Melgratti and\n                  C. A. Mezzina and\n                  G. M. Pinna},\n  title        = {Relating Reversible Petri Nets and Reversible Event Structures, Categorically},\n  booktitle    = {Proc. of the  43rd Int. Conf. on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2023)},\n  pages        = {206--223},\n  year         = {2023},\n  doi          = {10.1007/978-3-031-35355-0\\_13},\n\tmonth        = {June},\n   url_Paper    = {./MMP23.pdf},\naddress = {Lisbon (Portugal)},\n  publisher    = {Springer},\n  volume        = {LNCS 13910},\n\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n A. Esposito, A. Aldini, & M. Bernardo.\n\n\n \n \n \n \n \n Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 43rd Int. Conf. on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2023), volume LNCS 13910, pages 57–74, Lisbon (Portugal), June 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Branching paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{EAB23,\n  author       = {A. Esposito and\n                  A. Aldini and\n                  M. Bernardo},\n  title        = {Branching Bisimulation Semantics Enables Noninterference Analysis\n                  of Reversible Systems},\n    booktitle    = {Proc. of the  43rd Int. Conf. on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2023)},\n  pages        = {57--74},\n  year         = {2023},\n  doi          = {10.1007/978-3-031-35355-0\\_5},\n \tmonth        = {June},\n   url_Paper    = {./EAB23.pdf},\naddress = {Lisbon (Portugal)},\n  publisher    = {Springer},\n  volume        = {LNCS 13910},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n M. Bernardo, & S. Rossi.\n\n\n \n \n \n \n \n Reverse Bisimilarity vs. Forward Bisimilarity.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 26th Int. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2023), volume LNCS 13992, pages 265-284, Paris (France), April 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Reverse paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{BR23,\n  author       = {M. Bernardo and\n                  S. Rossi},\n  title        = {Reverse Bisimilarity vs. Forward Bisimilarity},\n  booktitle    = {Proc. of the 26th Int. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2023)},\n  publisher    = {Springer},\n  volume        = {LNCS 13992},\n  url_Paper    = {./BR23.pdf},\n  pages        = {265-284},\n  year\t       = {2023},\n  month        = {April},\naddress = {Paris (France)},\n  doi          = {10.1007/978-3-031-30829-1\\_13}\n}\n\n \n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n L. Bocchi, I. Lanese, C. A. Mezzina, & S. Yuen.\n\n\n \n \n \n \n \n The Reversible Temporal Process Language.\n \n \n \n \n\n\n \n\n\n\n In Proc. of the 42nd Int. Conf. on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2022), volume LNCS 13273, pages 31-49, Lucca (Italy), June 2022. Springer\n \n\n\n\n
\n\n\n\n \n \n \"The paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 16 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{BLMY22,\n  author       = {L. Bocchi and\n                  I. Lanese and C. A. Mezzina and S. Yuen},\n  title        = {The Reversible Temporal Process Language},\n  booktitle    = {Proc. of the 42nd Int. Conf. on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2022)},\n  publisher    = {Springer},\n  volume        = {LNCS 13273},\n  url_Paper    = {./BM23.pdf},\n  pages        = {31-49},\n  year\t       = {2022},\n  month        = {June},\n  url_Paper    = {./BLMY22.pdf},\naddress = {Lucca (Italy)},\n  doi          = {10.1007/978-3-031-08679-3\\_3}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);