Carla Piazza
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Carla Piazza has a total of 160 co-authors. Here are the top co-authors by number of shared publications:
- Alberto Casagrande
Università degli Studi di Udine, Italy
17 shared publications - Sabina Rossi
Università Ca’ Foscari Venezia
16 shared publications Sabina Rossi
Ca' Foscari University of Venice, Italy
15 shared publicationsAlberto Policriti
Dip. di Matematica e Informatica, Università degli Studi di Udine, Via Le Scienze 206, Udine (IT)
12 shared publications- Riccardo Focardi
Università Ca' Foscari Venezia, Venice, Italy
11 shared publications - Agostino Dovier
University of Udine
10 shared publications
Latest Publications
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
Noninterference in Smart Contracts: MEV Detection and Protection
Maximal Extractable Value (MEV) refers to the maximum profit that Blockchain users–including miners and validators–can extract through strategic transaction manipulation and block reordering. With the rise of smart contracts, MEV has become increasingly pervasive, distorting the intended behavior of smart contracts and accumulating to billions of dollars annually. In response, Flashbots has emerged as a community focused on developing solutions to mitigate MEV. These solutions primarily rely on private pools of users and miners, bypassing the public mempool to protect transactions by directly proposing new blocks. However, it has been observed that such approaches merely shift the problem to a different level, redistributing MEV gains rather than eliminating them. In this paper, we take the perspective of a user preparing to deploy a new smart contract on the Blockchain, aiming to understand how their contract might become a target for MEV and how modifications could reduce the risk of exploitation. Specifically, we explore the use of noninterference, formalized through unwinding conditions, to identify potential sources of MEV, while leveraging oracles and other techniques to create an additional verification layer that can be integrated before executing high-value transactions. We demonstrate our methodology through a case study of a betting contract, using formal modeling to show both the strengths and limitations of our approach.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
Open AccessNoninterference in Smart Contracts: MEV Detection and Protection
Maximal Extractable Value (MEV) refers to the maximum profit that Blockchain users–including miners and validators–can extract through strategic transaction manipulation and block reordering. With the rise of smart contracts, MEV has become increasingly pervasive, distorting the intended behavior of smart contracts and accumulating to billions of dollars annually. In response, Flashbots has emerged as a community focused on developing solutions to mitigate MEV. These solutions primarily rely on private pools of users and miners, bypassing the public mempool to protect transactions by directly proposing new blocks. However, it has been observed that such approaches merely shift the problem to a different level, redistributing MEV gains rather than eliminating them. In this paper, we take the perspective of a user preparing to deploy a new smart contract on the Blockchain, aiming to understand how their contract might become a target for MEV and how modifications could reduce the risk of exploitation. Specifically, we explore the use of noninterference, formalized through unwinding conditions, to identify potential sources of MEV, while leveraging oracles and other techniques to create an additional verification layer that can be integrated before executing high-value transactions. We demonstrate our methodology through a case study of a betting contract, using formal modeling to show both the strengths and limitations of our approach.
- 2 July 2026
- Published by Springer Nature
- p. 215-227
Enhancing the PEPA Eclipse Plug-in
- 2 July 2026
- Published by Springer Nature
- p. 70-87
Exact Persistent Stochastic Non-interference
- 23 June 2026
- Published by Springer Nature
- p. 64-79
Qubit Routing via swap Network: A Minimum Dominating Path Approach
- 23 June 2026
- Published by Springer Nature
- p. 64-79
Qubit Routing via swap Network: A Minimum Dominating Path Approach
- Open Access
- 16 December 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (12) , 794
Advanced Research on Machine Learning Algorithms in Bioinformatics
Epigenetic variation and somatic mutations represent molecular components of biodiversity that directly link the genome to the environment
- 16 December 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (12) , 794
Open AccessAdvanced Research on Machine Learning Algorithms in Bioinformatics
Epigenetic variation and somatic mutations represent molecular components of biodiversity that directly link the genome to the environment
- Open Access
- 24 September 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 7 (6)
Vulnerability detection in Solidity smart contracts via machine learning: A qualitative analysis
- 24 September 2025
- Published by Elsevier in Blockchain: Research and Applications
- Vol. 7 (6)
Open AccessVulnerability detection in Solidity smart contracts via machine learning: A qualitative analysis
- Open Access
Exact Persistent Stochastic Non-Interference
Persistent Stochastic Non-Interference (PSNI) was introduced to capture a quantitative security property in stochastic process algebras, ensuring that a high-level process does not influence the observable behaviour of a low-level component, as formalised via lumpable bisimulation. In this work, we revisit PSNI from a performance-oriented perspective and propose a new characterisation based on a refined behavioural relation. We introduce \emph{weak-exact equivalence}, which extends exact equivalence with a relaxed treatment of internal (\(τ\)) actions, enabling precise control over quantitative observables while accommodating unobservable transitions. Based on this, we define \emph{Exact PSNI} (EPSNI), a variant of PSNI characterised via weak-exact equivalence. We show that EPSNI admits the same bisimulation-based and unwinding-style characterisations as PSNI, and enjoys analogous compositionality properties. These results confirm weak-exact equivalence as a robust foundation for reasoning about non-interference in stochastic systems.Open AccessExact Persistent Stochastic Non-Interference
Persistent Stochastic Non-Interference (PSNI) was introduced to capture a quantitative security property in stochastic process algebras, ensuring that a high-level process does not influence the observable behaviour of a low-level component, as formalised via lumpable bisimulation. In this work, we revisit PSNI from a performance-oriented perspective and propose a new characterisation based on a refined behavioural relation. We introduce \emph{weak-exact equivalence}, which extends exact equivalence with a relaxed treatment of internal (\(τ\)) actions, enabling precise control over quantitative observables while accommodating unobservable transitions. Based on this, we define \emph{Exact PSNI} (EPSNI), a variant of PSNI characterised via weak-exact equivalence. We show that EPSNI admits the same bisimulation-based and unwinding-style characterisations as PSNI, and enjoys analogous compositionality properties. These results confirm weak-exact equivalence as a robust foundation for reasoning about non-interference in stochastic systems. - 13 February 2025
- Published by Springer Nature
- p. 91-105
Under the Space Threat: Quantitative Analysis of Cosmos Blockchain
- 13 February 2025
- Published by Springer Nature
- p. 91-105
Under the Space Threat: Quantitative Analysis of Cosmos Blockchain
- 28 August 2024
- Published by Springer Nature
- p. 127-139
Towards a Computational Approach to Quantification of Allele Specific Expression at Population Level
- 28 August 2024
- Published by Springer Nature
- p. 127-139
Towards a Computational Approach to Quantification of Allele Specific Expression at Population Level