Laura Bozzelli

Laura Bozzelli

Auto-generated profile, based on publicly available information

Laura Bozzelli

University Federico II

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 September 2025
Verified
Book Chapter
Closed access
PDF file
NANazaro Aversano
Nazaro Aversano
GBGuido Bozzelli
Guido Bozzelli
LBLaura Bozzelli
Laura Bozzelli
MNMaurizio De Nino
Maurizio De Nino
FPFrancesco de Pandi
Francesco de Pandi
SRStefano Ricciardi
Stefano Ricciardi

15 April 2026
Verified
Book Chapter
Closed access
LBLaura Bozzelli
Laura Bozzelli
TLTadeusz Litak
Tadeusz Litak
MMMunyque Mittelmann
Munyque Mittelmann
AMAniello Murano
Aniello Murano

2 July 2026
Verified
Book Chapter
Closed access
PDF file
LBLaura Bozzelli
Laura Bozzelli
ACAndrea Capone
Andrea Capone
DCDavide Catta
Davide Catta
VMVadim Malvone
Vadim Malvone
AMAniello Murano
Aniello Murano

26 May 2026 in ACM Transactions on Computational Logic
Verified
Journal Article
Open access
LBLaura Bozzelli
Laura Bozzelli
APAdriano Peron
Adriano Peron
CSCésar Sánchez
César Sánchez
Hyperproperties are a modern specification paradigm that extends properties of a single trace to express properties of a set of traces. Temporal logics for hyperproperties studied in the literature, including HyperLTL, assume a synchronous semantics and enjoy a decidable model checking problem. In this paper, we introduce two asynchronous and orthogonal extensions of HyperLTL, Stuttering HyperLTL (HyperLTL S ) and Context HyperLTL (HyperLTL C ). Both of these extensions are useful, for instance, to formulate asynchronous variants of information-flow security properties. We show that for these logics, model checking is in general undecidable. On the positive side, for each of them, we identify a fragment with a decidable model checking problem that subsumes HyperLTL and that can express meaningful asynchronous requirements. Moreover, we provide the exact computational complexity of model checking for these two fragments which, for the (HyperLTL S ) fragment, coincides with that of the strictly less expressive logic HyperLTL.