On Perfect Matchings for some Bipartite Graphs. - Alberto Casagrande; Francesco Di Cosmo; Eugenio G. Omodeo (SETS@ABZ, 2018)

FO Queries Strongly Distributing over Components in Arbitrary Cardinality. - Francesco Di Cosmo (CILC, 2019)

Convergence Verification of Declarative Distributed Systems. - Diego Calvanese; Francesco Di Cosmo; Jorge Lobo 001; Marco Montali (CILC, 2021)

The Impact of Propositional Messages on Termination of Declarative Distributed Systems. - Francesco Di Cosmo (ESSLLI Student Sessions, 2021)

Verification of Prev-Free Communicating Datalog Programs. - Francesco Di Cosmo (CILC, 2023)

Decidability Borders of Verification of Communicating Datalog Agents. - Francesco Di Cosmo (EUMAS, 2023)

Analyzing Termination for Prev-Aware Fragments of Communicating Datalog Programs. - Francesco Di Cosmo (RuleML+RR, 2023)

Verification of Sometimes Termination of Lazy-Bounded Declarative Distributed Systems. - Francesco Di Cosmo (CoRR, 2023)

Deciding Reachability and Coverability in Lossy EOS. - Francesco Di Cosmo; Soumodev Mal; Tephilla Prince (PNSE@Petri Nets, 2024)

Bounded Verification of Petri Nets and EOSs using Telingo: An Experience Report. - Francesco Di Cosmo; Tephilla Prince (CILC, 2024)

Verification of Unary Communicating Datalog Programs. - C. Aiswarya; Diego Calvanese; Francesco Di Cosmo; Marco Montali (Proc. ACM Manag. Data, 2024)

Verification of Coverability in Positive Interactive Datalog Programs. - Francesco Di Cosmo (CILC, 2025)

A Lower Bound on Conservative Elementary Object Systems Coverability. - Francesco Di Cosmo; Soumodev Mal; Tephilla Prince (CoRR, 2025)

Nets-within-Nets through the Lens of Data Nets. - Francesco Di Cosmo; Soumodev Mal; Tephilla Prince (CoRR, 2025)