Seminari - Dipartimento Informatica validi dal 09.03.2026 al 09.03.2027. https://www.di.univr.it/?ent=seminario&rss=0 https://www.di.univr.it/?ent=seminario&rss=0&id=6930 Relatore: Ihsen Yengui (Visiting Professor INdAM 2025-26); Provenienza: University of Sfax, Tunisia; Data inizio: 2026-03-23; Ora inizio: 14.30; Referente interno: Giulio Fellin; Riassunto: Abstract: After a reminder of the key concepts and methods of constructive/computational algebra, this course will aim at generalised Buchberger and Schreyer algorithms for coherent rings. Chapter 1 focuses on the concept of Grouml;bner bases over a field as a powerful tool for problem solving in algebraic geometry. In contrast to typical treatments of Grouml;bner bases, we give in Chapter 2 a theory of Grouml;bner bases in the broader framework of coherent arithmetical rings (possibly with nonzero zero-divisors) and, more generally in Chapter 3, over coherent strongly discrete rings. Notably, for any finitely generated submodule M of a free module over a multivariate polynomial ring with coefficients in a discrete coherent ring, we prove that its module LT(M) of leading terms is countably generated, and provide an algorithm for computing explicitly a generating set. This result is also useful when LT(M) is not finitely generated. We further give a general constructive version of Hilbertrsquo;s syzygy theorem over strongly discrete coherent rings, following Schreyer#39;s method. Format: The course is offered in a hybrid format, both in person and online.All participants will be provided with the necessary links. Assessment method: student project with essay, presentation and discussion Period: from 23rd March 2026 to 24th April 2026 Number of academic hours: 20 Tentative timetable: - Moday, March 23, 14:30-17:30, Aula L, - Wednesday, March 25, 15:30-17:30, Aula M, - Moday, March 30, 14:30-17:30, Aula L, - Wednesday, April 1, 15:30-17:30, Aula M, - Wednesday, April 8, 15:30-17:30, Aula M, - Moday, April 13, 14:30-17:30, Aula L, - Wednesday, April 15, 15:30-17:30, Aula M, - Wednesday, April 22, 15:30- 18:30 , Aula M. Venue: Department of Computer Science University of Verona Strada le Grazie 15 37134 Verona Enroll: LINK . Mon, 23 Mar 2026 14:30:00 +0100 https://www.di.univr.it/?ent=seminario&rss=0&id=6930 https://www.di.univr.it/?ent=seminario&rss=0&id=6912 Relatore: Francesco Logozzo; Provenienza: Meta - Menlo Park, CA, United States; Data inizio: 2026-03-25; Ora inizio: 11.30; Note orario: Sala Verde (solo presenza); Referente interno: Mila Dalla Preda; Riassunto: Abstract : Privacy and security share the same engineering goal: prevent harm by enforcing constraints. The difference is that privacy failures are often not immediately visible, and are therefore judged against explicit regulatory requirementsmdash;so ldquo;being compliantrdquo; must be engineered, continuously, and demonstrated with evidence.In this talk, drawing on how we build and operate technical safeguards at Meta, Irsquo;ll describe a practical lifecycle for privacy compliance at scale: first defining whatrsquo;s in scope, then preventing new leaks in new code (ldquo;stop the bleedrdquo;), remediating legacy issues, and finally preventing regressions through continuous monitoring. Irsquo;ll then cover how compliance is proven in practice, with automated reminders and workflows, or with targeted human reviews, or with secure-by-default frameworks, or with detection/understanding mechanisms.To ground the discussion, Irsquo;ll close with two concrete examples from Meta: deletion as a secure-by-default safeguard, and data lineage as a detection and enforcement capabilitymdash;illustrated through a sensitive ldquo;religionrdquo; use case. Bio: Francesco Logozzo is a director-level engineer at Meta, where he has played a pivotal role in shaping the companyrsquo;s security and privacy strategy. He joined Meta in 2015, where he has designed, led and grown Zoncolan, the static analysis platform that helps protect billions of people by automatically detecting security and privacy vulnerabilities across Metarsquo;s family of apps, including Facebook and Instagram. Zoncolan is a cornerstone of Metarsquo;s security infrastructure and is responsible for finding more than 50% of the security bugs across Metarsquo;s family of apps.Before Meta, Francesco spent nine years at Microsoft Research, Redmond, WA, contributing foundational work in program analysis and software verification. He studied at the Scuola Normale Superiore of Pisa before earning a PhD in computer science, advised by Radhia Cousot. He has published extensively in top research venues, including POPL, PLDI, OOPSLA, VMCAI, and SAS.Francesco is a frequent keynote speaker at leading academic and industry conferences and is a co-recipient of the IEEE Cybersecurity Award for contributions to scalable security solutions. He is recognized for deep technical expertise, leadership, and sustained impact on the security and privacy landscape. Wed, 25 Mar 2026 11:30:00 +0100 https://www.di.univr.it/?ent=seminario&rss=0&id=6912 https://www.di.univr.it/?ent=seminario&rss=0&id=6915 Relatore: Leonard P. Bos; Provenienza: University of Calgary; Data inizio: 2026-04-20; Ora inizio: 12.30; Note orario: Aula H; Referente interno: Giacomo Albi; Riassunto: Neural Nets generate outputs according to a specific recipe, i.e., they form a certain family of (vector valued) functions, determined by a typically large number of parameters (the weights). Training a Neural Net means to adjust the parameters to produce a desired output, i.e., find a good approximation to a given output function from the family of functions produced by the Net. In this course we will explore, in relation to classical approximation by polynomials and splines, how good an approximation can be so obtained. The course will be completely self contained. Schedule: (TBA). Mon, 20 Apr 2026 12:30:00 +0200 https://www.di.univr.it/?ent=seminario&rss=0&id=6915