default search action
Roberto Zunino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j20]Massimo Bartoletti, Lorenzo Benetollo, Michele Bugliesi, Silvia Crafa, Giacomo Dal Sasso, Roberto Pettinau, Andrea Pinna, Mattia Piras, Sabina Rossi, Stefano Salis, Alvise Spanò, Viacheslav Tkachenko, Roberto Tonelli, Roberto Zunino:
Smart contract languages: A comparative analysis. Future Gener. Comput. Syst. 164: 107563 (2025) - 2024
- [c46]Dario Maddaloni, Riccardo Marchesin, Roberto Zunino:
How To Save Fees in Bitcoin Smart Contracts: a Simple Optimistic Off-chain Protocol. DLT 2024 - [c45]Massimo Bartoletti, Riccardo Marchesin, Roberto Zunino
:
Secure compilation of rich smart contracts on poor UTXO blockchains. EuroS&P 2024: 235-267 - [i20]Dario Maddaloni, Riccardo Marchesin, Roberto Zunino
How To Save Fees in Bitcoin Smart Contracts: a Simple Optimistic Off-chain Protocol. CoRR abs/2403.09880 (2024) - [i19]Massimo Bartoletti, Lorenzo Benetollo, Michele Bugliesi, Silvia Crafa, Giacomo Dal Sasso, Roberto Pettinau, Andrea Pinna, Mattia Piras, Sabina Rossi, Stefano Salis, Alvise Spanò, Viacheslav Tkachenko, Roberto Tonelli, Roberto Zunino
Smart Contract Languages: a comparative analysis. CoRR abs/2404.04129 (2024) - [i18]Massimo Bartoletti, Riccardo Marchesin, Roberto Zunino
Scalable UTXO Smart Contracts via Fine-Grained Distributed State. CoRR abs/2406.07700 (2024) - 2023
- [j19]Massimo Bartoletti, Maurizio Murgia
Sound approximate and asymptotic probabilistic bisimulations for PCTL. Log. Methods Comput. Sci. 19(1) (2023) - [i17]Massimo Bartoletti, Roberto Zunino:
A theoretical basis for Blockchain Extractable Value. CoRR abs/2302.02154 (2023) - [i16]Massimo Bartoletti, Riccardo Marchesin, Roberto Zunino
Secure compilation of rich smart contracts on poor UTXO blockchains. CoRR abs/2305.09545 (2023) - [i15]Massimo Bartoletti, Riccardo Marchesin, Roberto Zunino
DeFi composability as MEV non-interference. CoRR abs/2309.10781 (2023) - 2022
- [j18]Massimo Bartoletti, Stefano Lande, Maurizio Murgia
Verifying liquidity of recursive Bitcoin contracts. Log. Methods Comput. Sci. 18(1) (2022) - [c44]Massimo Bartoletti, Maurizio Murgia
A Sound Up-to-n, δ Bisimilarity for PCTL. COORDINATION 2022: 35-52 - 2021
- [c43]Massimo Bartoletti, Stefano Lande, Roberto Zunino
Computationally sound Bitcoin tokens. CSF 2021: 1-15 - [c42]Massimo Bartoletti, Andrea Bracciali, Cristian Lepore
A Formal Model of Algorand Smart Contracts. Financial Cryptography (1) 2021: 93-114 - [i14]Massimo Bartoletti, Maurizio Murgia, Roberto Zunino:
A Sound Up-to-$n$, $δ$ Bisimilarity for PCTL. CoRR abs/2111.03117 (2021) - 2020
- [c41]Massimo Bartoletti, Maurizio Murgia
Renegotiation and Recursion in Bitcoin Contracts. COORDINATION 2020: 261-278 - [c40]Marco Girardi, Roberto Zunino, Marco Benini:
A General Syntax for Nonrecursive Higher Inductive Types. ICTCS 2020: 223-229 - [c39]Massimo Bartoletti, Stefano Lande, Roberto Zunino
Bitcoin Covenants Unchained. ISoLA (3) 2020: 25-42 - [i13]Massimo Bartoletti, Maurizio Murgia, Roberto Zunino:
Renegotiation and recursion in Bitcoin contracts. CoRR abs/2003.00296 (2020) - [i12]Massimo Bartoletti, Stefano Lande, Roberto Zunino:
Bitcoin covenants unchained. CoRR abs/2006.03918 (2020) - [i11]Massimo Bartoletti, Andrea Bracciali, Cristian Lepore, Alceste Scalas, Roberto Zunino:
A formal model of Algorand smart contracts. CoRR abs/2009.12140 (2020) - [i10]Massimo Bartoletti, Stefano Lande, Roberto Zunino:
Computationally sound Bitcoin tokens. CoRR abs/2010.01347 (2020) - [i9]Massimo Bartoletti, Stefano Lande, Maurizio Murgia, Roberto Zunino:
Verification of recursive Bitcoin contracts. CoRR abs/2011.14165 (2020)
2010 – 2019
- 2019
- [j17]Massimo Bartoletti, Roberto Zunino
Formal Models of Bitcoin Contracts: A Survey. Frontiers Blockchain 2: 8 (2019) - [j16]Vo Hong Thanh, Roberto Zunino
Efficient formulation of the rejection-based algorithm for biochemical reactions with delays. Int. J. Bioinform. Res. Appl. 15(2): 159-173 (2019) - [c38]Massimo Bartoletti, Roberto Zunino
Verifying Liquidity of Bitcoin Contracts. POST 2019: 222-247 - [c37]Nicola Atzei, Massimo Bartoletti, Stefano Lande
Developing secure bitcoin contracts with BitML. ESEC/SIGSOFT FSE 2019: 1124-1128 - [e1]Pierpaolo Degano, Roberto Zunino:
Proceedings of the Third Italian Conference on Cyber Security, Pisa, Italy, February 13-15, 2019. CEUR Workshop Proceedings 2315, CEUR-WS.org 2019 [contents] - [i8]Nicola Atzei, Massimo Bartoletti, Stefano Lande, Nobuko Yoshida, Roberto Zunino:
Developing secure Bitcoin contracts with BitML. CoRR abs/1905.07639 (2019) - 2018
- [c36]Massimo Bartoletti, Roberto Zunino
BitML: A Calculus for Bitcoin Smart Contracts. CCS 2018: 83-100 - [c35]Nicola Atzei, Massimo Bartoletti, Stefano Lande, Roberto Zunino
A Formal Model of Bitcoin Transactions. Financial Cryptography 2018: 541-560 - [c34]Massimo Bartoletti, Tiziana Cimoli
Fun with Bitcoin Smart Contracts. ISoLA (4) 2018: 432-449 - [c33]Nicola Atzei
SoK: Unraveling Bitcoin Smart Contracts. POST 2018: 217-242 - [i7]Massimo Bartoletti, Roberto Zunino:
BitML: a calculus for Bitcoin smart contracts. IACR Cryptol. ePrint Arch. 2018: 122 (2018) - [i6]Nicola Atzei, Massimo Bartoletti, Tiziana Cimoli, Stefano Lande, Roberto Zunino:
SoK: unraveling Bitcoin smart contracts. IACR Cryptol. ePrint Arch. 2018: 192 (2018) - [i5]Massimo Bartoletti, Tiziana Cimoli, Roberto Zunino:
Fun with Bitcoin smart contracts. IACR Cryptol. ePrint Arch. 2018: 398 (2018) - [i4]Massimo Bartoletti, Roberto Zunino:
Verifying liquidity of Bitcoin contracts. IACR Cryptol. ePrint Arch. 2018: 1125 (2018) - 2017
- [j15]Massimo Bartoletti
Verifiable abstractions for contract-oriented systems. J. Log. Algebraic Methods Program. 86(1): 159-207 (2017) - [j14]Vo Hong Thanh
Efficient Constant-Time Complexity Algorithm for Stochastic Simulation of Large Reaction Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 14(3): 657-667 (2017) - [c32]Massimo Bartoletti, Roberto Zunino
Constant-Deposit Multiparty Lotteries on Bitcoin. Financial Cryptography Workshops 2017: 231-247 - [i3]Nicola Atzei, Massimo Bartoletti, Stefano Lande, Roberto Zunino:
A formal model of Bitcoin transactions. IACR Cryptol. ePrint Arch. 2017: 1124 (2017) - 2016
- [j13]Massimo Bartoletti
Honesty by Typing. Log. Methods Comput. Sci. 12(4) (2016) - [j12]Massimo Bartoletti, Tiziana Cimoli
Contracts as games on event structures. J. Log. Algebraic Methods Program. 85(3): 399-424 (2016) - [i2]Massimo Bartoletti, Roberto Zunino:
Constant-deposit multiparty lotteries on Bitcoin. IACR Cryptol. ePrint Arch. 2016: 955 (2016) - 2015
- [j11]Massimo Bartoletti
Model checking usage policies. Math. Struct. Comput. Sci. 25(3): 710-763 (2015) - [j10]Massimo Bartoletti
Choreographies in the wild. Sci. Comput. Program. 109: 36-60 (2015) - [j9]Massimo Bartoletti
Vicious circles in contracts and in logic. Sci. Comput. Program. 109: 61-95 (2015) - [c31]Massimo Bartoletti
Compliance in Behavioural Contracts: A Brief Survey. Programming Languages with Applications to Biology and Security 2015: 103-121 - [c30]Massimo Bartoletti
Debits and Credits in Petri Nets and Linear Logic. Logic, Rewriting, and Concurrency 2015: 135-159 - [c29]Roberto Zunino
ℓ: An Imperative DSL to Stochastically Simulate Biological Systems. Programming Languages with Applications to Biology and Security 2015: 354-374 - [c28]Massimo Bartoletti, Tiziana Cimoli, G. Michele Pinna, Roberto Zunino
Models of Circular Causality. ICDCIT 2015: 1-20 - [c27]Massimo Bartoletti
On the Decidability of Honesty and of Its Variants. WS-FM 2015: 143-166 - 2014
- [j8]Massimo Bartoletti
Circular Causality in Event Structures. Fundam. Informaticae 134(3-4): 219-259 (2014) - [j7]Vo Hong Thanh, Roberto Zunino
Adaptive tree-based search for stochastic simulation algorithm. Int. J. Comput. Biol. Drug Des. 7(4): 341-357 (2014) - [c26]Massimo Bartoletti
A Semantic Deconstruction of Session Types. CONCUR 2014: 402-418 - [c25]Massimo Bartoletti
Modelling and Verifying Contract-Oriented Systems in Maude. WRLA 2014: 130-146 - 2013
- [c24]Massimo Bartoletti
Honesty by Typing. FMOODS/FORTE 2013: 305-320 - [c23]Massimo Bartoletti
A Theory of Agreements and Protection. POST 2013: 186-205 - [c22]Vo Hong Thanh, Roberto Zunino:
Splitting for rare event simulation in biochemical systems. SimuTools 2013: 109-118 - [c21]Massimo Bartoletti, Tiziana Cimoli, Paolo Di Giamberardino, Roberto Zunino
Contract agreements via logic. ICE 2013: 5-19 - 2012
- [j6]Massimo Bartoletti
Contract-Oriented Computing in CO2. Sci. Ann. Comput. Sci. 22(1): 5-60 (2012) - [j5]Roberto Zunino
On computation and synchronization costs in spatial distributed simulation. J. Simulation 6(3): 193-204 (2012) - [c20]Massimo Bartoletti
On the Realizability of Contracts in Dishonest Systems. COORDINATION 2012: 245-260 - [c19]Vo Hong Thanh, Roberto Zunino
Tree-based search for stochastic simulation algorithm. SAC 2012: 1415-1416 - [c18]Corrado Priami, Paola Quaglia
An imperative language of self-modifying graphs for biological systems. SAC 2012: 1903-1909 - [c17]Durica Nikolic, Corrado Priami, Roberto Zunino
A Rule-Based and Imperative Language for Biochemical Modeling and Simulation. SEFM 2012: 16-32 - [c16]Massimo Bartoletti, Tiziana Cimoli
An event-based model for contracts. PLACES 2012: 13-20 - [i1]Massimo Bartoletti, Emilio Tuosto, Roberto Zunino:
On the realizability of contracts in dishonest systems. CoRR abs/1201.6188 (2012) - 2011
- [c15]Roberto Zunino
Trading Computation Time for Synchronization Time in Spatial Distributed Simulation. PADS 2011: 1-8 - [c14]Massimo Bartoletti, Emilio Tuosto
Contracts in distributed systems. ICE 2011: 130-147 - [p2]Massimo Bartoletti
Call-by-Contract for Service Discovery, Orchestration and Recovery. Results of the SENSORIA Project 2011: 232-261 - [p1]Massimo Bartoletti
Tools and Verification. Results of the SENSORIA Project 2011: 408-427 - 2010
- [c13]Massimo Bartoletti
A Calculus of Contracting Processes. LICS 2010: 332-341 - [c12]Massimo Bartoletti
Static Enforcement of Service Deadlines. SEFM 2010: 320-324 - [c11]Massimo Bartoletti, Roberto Zunino
Primitives for Contract-based Synchronization. ICE 2010: 67-82
2000 – 2009
- 2009
- [j4]Massimo Bartoletti, Gabriele Costa, Pierpaolo Degano, Fabio Martinelli, Roberto Zunino
Securing Java with Local Policies. J. Object Technol. 8(4): 5-32 (2009) - [j3]Massimo Bartoletti
Local policies for resource usage analysis. ACM Trans. Program. Lang. Syst. 31(6): 23:1-23:43 (2009) - [c10]Massimo Bartoletti
nu-Types for Effects and Freshness Analysis. ICTAC 2009: 80-95 - [c9]Massimo Bartoletti, Roberto Zunino:
A Logic for Contracts. ICTCS 2009: 34-37 - [c8]Massimo Bartoletti
Jalapa: Securing Java with Local Policies: Tool Demonstration. BYTECODE@ETAPS 2009: 145-151 - 2008
- [j2]Massimo Bartoletti
Semantics-Based Design for Secure Web Services. IEEE Trans. Software Eng. 34(1): 33-49 (2008) - [c7]Massimo Bartoletti
Model Checking Usage Policies. TGC 2008: 19-35 - [c6]Massimo Bartoletti
Hard Life with Weak Binders. EXPRESS 2008: 49-72 - 2007
- [c5]Massimo Bartoletti, Pierpaolo Degano, Gian-Luigi Ferrari
Secure Service Orchestration. FOSAD 2007: 24-74 - [c4]Massimo Bartoletti, Pierpaolo Degano, Gian-Luigi Ferrari
Types and Effects for Resource Usage Analysis. FoSSaCS 2007: 32-47 - 2006
- [b1]Roberto Zunino:
Models for Cryptographic Protocol Analysis. University of Pisa, Italy, 2006 - [c3]Roberto Zunino
Handling exp, × (and Timestamps) in Protocol Analysis. FoSSaCS 2006: 413-427 - 2005
- [j1]Roberto Zunino
Weakening the perfect encryption assumption in Dolev-Yao adversaries. Theor. Comput. Sci. 340(1): 154-178 (2005) - 2004
- [c2]Roberto Zunino
A Note on the Perfect Encryption Assumption in a Process Calculus. FoSSaCS 2004: 514-528 - 2003
- [c1]Roberto Zunino
Control Flow Analysis for the Applied Pi-calculus. MEFISTO 2003: 87-110
Coauthor Index
[j20] [c45] [i19] [i18] [j19] [i17] [i16] [i15] [j18] [c44] [c43] [c42] [i14] [c41] [c39] [i13] [i12] [i11] [i10] [i9] [j17] [c38] [c37] [i8] [c36] [c35] [c34] [c33] [i7] [i6] [i5] [i4] [j15] [c32] [i3] [j13] [j12] [i2] [j11] [j10] [j9] [c31] [c30] [c28] [c27] [j8] [c26] [c25] [c24] [c23] [c21] [j6] [c20] [c16] [i1] [c14] [p2] [p1] [c13] [c12] [c11] [j4] [j3] [c10] [c9] [c8] [j2] [c7] [c6] [c5] [c4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: