BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.9//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://sal.cs.unibuc.ro
X-WR-CALDESC:Events for SECURITY & APPLIED LOGIC
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Bucharest
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20201025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20231029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20241027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20251026T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20261025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20270328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20271031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210225T100000
DTEND;TZID=Europe/Bucharest:20210225T120000
DTSTAMP:20260403T211111
CREATED:20210224T154805Z
LAST-MODIFIED:20210317T164757Z
UID:687-1614247200-1614254400@sal.cs.unibuc.ro
SUMMARY:Formalizing Gödel's System T in Lean
DESCRIPTION:Title: Formalizing Gödel’s System T in Lean \nSpeaker: Horațiu Cheval (University of Bucharest)  \n\nAbstract: \n\nIn 1958\, Gödel introduced his functional interpretation as a method of reducing the consistency of first-order arithmetic to that of a quantifier-free system of primitive recursive functionals of higher type. His work has since enabled other advances in proof theory\, notably the program of proof mining. We give a brief overview of Gödel’s System T and then explore a formalization thereof as a deep embedding in the Lean proof assistant. \nReferences: \n\n[1] mathlib Community\, The Lean Mathematical Library\, 2019.
URL:https://sal.cs.unibuc.ro/event/formalizing-go%cc%88dels-system-t-in-lean/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210304T100000
DTEND;TZID=Europe/Bucharest:20210304T120000
DTSTAMP:20260403T211111
CREATED:20210303T165215Z
LAST-MODIFIED:20210317T165240Z
UID:691-1614852000-1614859200@sal.cs.unibuc.ro
SUMMARY:Unwinding of proofs
DESCRIPTION:Title: Unwinding of proofs \nSpeaker: Pedro Pinto (TU Darmstadt)  \n\nAbstract: \nThe unwinding of proofs program dates back to Kreisel in the fifties and rests on the following broad question: “What more do we know if we have proved a theorem by restricted means than if we merely know that it is true?”\n \n \nThis research program has since been dubbed proof mining and has been greatly developed during the last two decades and emerged as a new form of applied proof theory [1\,2]. Through the use of proof-theoretical tools\, the proof mining program is concerned with the unveil of hidden finitary and combinatorial content from proofs that use infinitary noneffective principles.\n\nIn this talk\, we set out to give a brief introduction to the proof mining program\, focusing on the following points: \n\n\n\nfunctional interpretations in an introductory way;\nthe bounded functional interpretation [3\,4];\na concrete translation example: the metric projection argument.\n\nWe finish with a brief discussion of some recent results [5\,6]. \nReferences: \n\n[1] U. Kohlenbach. Applied Proof Theory: Proof Interpretations and their Use in Mathematics. Springer Monographs in Mathematics. Springer-Verlag Berlin Heidelberg\, 2008.\n[2] U. Kohlenbach. Proof-theoretic methods in nonlinear analysis. In M. Viana B. Sirakov\, P. Ney de Souza\, editor\, Proceedings of the International Congress of Mathematicians – Rio de Janeiro 2018\, Vol. II: Invited lectures\, pages 61–82. World Sci. Publ.\, Hackensack\, NJ\, 2019.\n[3] F. Ferreira and P. Oliva. Bounded functional interpretation. Annals of Pure and Applied Logic\, 135:73-112\, 2005.\n[4] F. Ferreira. Injecting uniformities into Peano arithmetic. Annals of Pure and Applied Logic\, 157:122-129\, 2009.\n[5] B. Dinis and P. Pinto. Effective metastability for a method of alternating resolvents. arXiv:2101.12675 [math.FA]\, 2021.\n[6] U. Kohlenbach and P. Pinto. Quantitative translations for viscosity approximation methods in hyperbolic spaces. arXiv:2102.03981 [math.FA]\, 2021.\n  \n\n  \nReferences:
URL:https://sal.cs.unibuc.ro/event/unwinding-of-proofs/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210311T100000
DTEND;TZID=Europe/Bucharest:20210311T120000
DTSTAMP:20260403T211111
CREATED:20210310T154158Z
LAST-MODIFIED:20210317T154308Z
UID:683-1615456800-1615464000@sal.cs.unibuc.ro
SUMMARY:Exponential Diophantine equations over ℚ 
DESCRIPTION:Title:  Exponential Diophantine equations over ℚ \nSpeaker: Mihai Prunescu (University of Bucharest & IMAR) \n\nAbstract: \n\nIn a previous exposition [1] we have seen that the solvability over ℚ is undecidable for systems of exponential Diophantine equations. We now show that the solvability of individual exponential Diophantine equations is also undecidable\, and that this happens as well for some narrower families of exponential Diophantine equations. \nReferences: \n\n[1] M. Prunescu\, The exponential Diophantine problem for ℚ. The Journal of Symbolic Logic\, Volume 85\, Issue 2\, 671–672\, 2020.
URL:https://sal.cs.unibuc.ro/event/exponential-diophantine-equations-over-%e2%84%9a/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210318T100000
DTEND;TZID=Europe/Bucharest:20210318T120000
DTSTAMP:20260403T211111
CREATED:20210317T151527Z
LAST-MODIFIED:20210317T204833Z
UID:681-1616061600-1616068800@sal.cs.unibuc.ro
SUMMARY:A proof mining case study on the unit interval
DESCRIPTION:Title: A proof mining case study on the unit interval \nSpeaker: Andrei Sipoș (University of Bucharest & IMAR) \n\nAbstract:  \n\nIn 1991\, Borwein and Borwein proved [1] the following: if L>0\, f : [0\,1] → [0\,1] is L-Lipschitz\, (xn)\, (tn) ⊆ [0\,1] are such that for all n\, xn+1=(1-tn)xn+tnf(xn) and there is a δ>0 such that for all n\, tn≤(2-δ)/(L+1)\, then the sequence (xn) converges.\nThe relevant fact here is that the main argument used in their proof is of a kind that hasn’t been analyzed yet from the point of view of proof mining\, and thus it may serve as an illustrative new case study. We shall present our work [2] on the proof\, showing how to extract a uniform and computable rate of metastability for the above family of sequences.\nReferences: \n\n\n[1] D. Borwein\, J. Borwein\, Fixed point iterations for real functions. J. Math. Anal. Appl. 157\, no. 1\, 112–126\, 1991.\n[2] A. Sipoș\, Rates of metastability for iterations on the unit interval. arXiv:2008.03934 [math.CA]\, 2020.
URL:https://sal.cs.unibuc.ro/event/a-proof-mining-case-study-on-the-unit-interval/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210325T100000
DTEND;TZID=Europe/Bucharest:20210325T120000
DTSTAMP:20260403T211111
CREATED:20210322T160836Z
LAST-MODIFIED:20210323T090618Z
UID:697-1616666400-1616673600@sal.cs.unibuc.ro
SUMMARY:Regular matching problems for infinite trees
DESCRIPTION:Title: Regular matching problems for infinite trees \nSpeaker: Mircea Marin (West University of Timișoara) \n\nAbstract:  \nWe study the matching problem “∃σ:σ(L)⊆R?” where L and R are regular tree languages over finite ranked alphabets X and Σ respectively\, and σ is a substitution such that σ(x) is a set of trees in T(Σ∪H)∖H for all x∈X. Here\, H denotes a set of holes which are used to define a concatenation of trees. Conway studied this problem in the special case for languages of finite words in his classical textbook Regular algebra and finite machines and showed that if L and R are regular\, then the problem “∃σ:∀x∈X:σ(x)≠∅∧σ(L)⊆R?” is decidable. Moreover\, there are only finitely many maximal solutions\, which are regular and effectively computable. We extend Conway’s results when L and R are regular languages of finite and infinite trees\, and language substitution is applied inside-out. We show that if L⊆T(X) and R⊆T(Σ) are regular tree languages then the problem “∃σ∀x∈X:σ(x)≠∅∧σio(L)⊆R?” is decidable. Moreover\, there are only finitely many maximal solutions\, which are regular and effectively computable. The corresponding question for the outside-in extension σoi remains open\, even in the restricted setting of finite trees. Our main result is the decidability of “∃σ:σio(L)⊆R?” if R is regular and L belongs to a class of tree languages closed under intersection with regular sets. Such a special case pops up if L is context-free.\nThis is joint work with Carlos Camino\, Volker Diekert\, Besik Dundua and Géraud Sénizergues. \n\nReferences: \n[1] C. Camino\, V. Diekert\, B. Dundua\, M. Marin\, G. Sénizergues\, Regular matching problems for infinite trees. arXiv:2004.09926 [cs.FL]\, 2021.
URL:https://sal.cs.unibuc.ro/event/regular-matching-problems-for-infinite-trees/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210401T100000
DTEND;TZID=Europe/Bucharest:20210401T120000
DTSTAMP:20260403T211111
CREATED:20210329T200608Z
LAST-MODIFIED:20210329T200608Z
UID:701-1617271200-1617278400@sal.cs.unibuc.ro
SUMMARY:An Introduction to Protocols in Dynamic Epistemic Logic
DESCRIPTION:Title: An Introduction to Protocols in Dynamic Epistemic Logic \nSpeaker: Alexandru Dragomir (University of Bucharest) \n\nAbstract:  \nDynamic epistemic logics are useful in reasoning about knowledge and acts of learning\, seen as epistemic actions. However\, not all epistemic actions are allowed to be executed in an initial epistemic model\, and this is where the concept of a protocol comes in: a protocol stipulates what epistemic actions are allowed to be performed in a model. The aim of my presentation is to introduce the audience to two accounts of protocols in DEL: Hoshi’s [1]\, and Wang’s [2]. \n\nReferences: \n[1] T. Hoshi\, Epistemic dynamics and protocol information. PhD thesis\, Stanford\, CA\, USA\, 2009.\n[2] Y. Wang\, Epistemic Modelling and Protocol Dynamics. PhD thesis\, University of Amsterdam\, 2010.
URL:https://sal.cs.unibuc.ro/event/an-introduction-to-protocols-in-dynamic-epistemic-logic/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210422T100000
DTEND;TZID=Europe/Bucharest:20210422T120000
DTSTAMP:20260403T211111
CREATED:20210421T165207Z
LAST-MODIFIED:20210421T165207Z
UID:706-1619085600-1619092800@sal.cs.unibuc.ro
SUMMARY:Kernelization\, Proof Complexity and Social Choice
DESCRIPTION:Title: Kernelization\, Proof Complexity and Social Choice \nSpeaker: Gabriel Istrate (West University of Timișoara) \n\nAbstract:  \n\nWe display an application of the notions of kernelization and data reduction from parameterized complexity to proof complexity: Specifically\, we show that the existence of data reduction rules for a parameterized problem having (a) a small-length reduction chain\, and (b) small-size (extended) Frege proofs certifying the soundness of reduction steps implies the existence of subexponential size (extended) Frege proofs for propositional formalizations of the given problem. We apply our result to infer the existence of subexponential Frege and extended Frege proofs for a variety of problems. Improving earlier results of Aisenberg et al. (ICALP 2015)\, we show that propositional formulas expressing (a stronger form of) the Kneser-Lovasz Theorem have polynomial size Frege proofs for each constant value of the parameter k. Previously only quasipolynomial bounds were known (and only for the ordinary Kneser-Lovasz Theorem). Another notable application of our framework is to impossibility results in computational social choice: we show that\, for any fixed number of agents\, propositional translations of the Arrow and Gibbard-Satterthwaite impossibility theorems have subexponential size Frege proofs. \nThis is joint work with Cosmin Bonchiș and Adrian Crăciun.
URL:https://sal.cs.unibuc.ro/event/kernelization-proof-complexity-and-social-choice/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210526T160000
DTEND;TZID=Europe/Bucharest:20210526T200000
DTSTAMP:20260403T211111
CREATED:20210524T095358Z
LAST-MODIFIED:20260330T131625Z
UID:709-1622044800-1622059200@sal.cs.unibuc.ro
SUMMARY:Active Defense in Cybersecurity
DESCRIPTION:Title: Active Defense in Cybersecurity \nSpeaker: Sergiu Bogdan Meseșan & Andreea Drugă\, Cybersecurity Specialists at ENEA \n\nAgenda: \n\nActive Defense Mechanisms – Notions\, principles and Active Defense mechanisms (ca.1h)\n\n\nPractical Application for Honeypot Analytics and Attacks Data Collection – Presentation of a platform implemented by ENEA specially for this lecture\, a practical demo of Active Defense (ca.1h)\n\n\nActive Defense DIY – Workshop installation\, running\, Internet access for a Honeypot type VM using an open source platform (Telekom Tpot CE) (ca.1h-1.5h)\n\nFor the students interested to attend the meeting: please contact Ruxandra Olimid (ruxandra.olimid@fmi.unibuc.ro)
URL:https://sal.cs.unibuc.ro/event/active-defense-in-cybersecurity/
LOCATION:online (via Teams)
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20260306T090000
DTEND;TZID=Europe/Bucharest:20260306T100000
DTSTAMP:20260403T211111
CREATED:20260301T192338Z
LAST-MODIFIED:20260301T192830Z
UID:831-1772787600-1772791200@sal.cs.unibuc.ro
SUMMARY:Introduction in Quantum Computing
DESCRIPTION:Title: Introduction in Quantum Computing \nSpeaker: Mihai Prunescu (UB) \n\nAbstract: Basing QC notions are presented: superposition\, wave-function and probability\, qubit\, independence\, entanglement.
URL:https://sal.cs.unibuc.ro/event/introduction-in-quantum-computing/
LOCATION:Facultatea de Matematica si Informatica\, sala S.211
CATEGORIES:Cryptography Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20260327T090000
DTEND;TZID=Europe/Bucharest:20260327T100000
DTSTAMP:20260403T211111
CREATED:20260319T004531Z
LAST-MODIFIED:20260319T004531Z
UID:835-1774602000-1774605600@sal.cs.unibuc.ro
SUMMARY:Introduction in Quantum Computing (II)
DESCRIPTION:Title: Introduction in Quantum Computing (II) \nSpeaker: Mihai Prunescu (UB) \n\nAbstract: We continue the discussion on QC.
URL:https://sal.cs.unibuc.ro/event/introduction-in-quantum-computing-ii/
LOCATION:Facultatea de Matematica si Informatica\, sala S.213
CATEGORIES:Cryptography Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20260402T140000
DTEND;TZID=Europe/Bucharest:20260402T160000
DTSTAMP:20260403T211111
CREATED:20260319T005106Z
LAST-MODIFIED:20260319T010415Z
UID:839-1775138400-1775145600@sal.cs.unibuc.ro
SUMMARY:Cybersecurity of Industrial Control Systems
DESCRIPTION:Title: Cybersecurity of Industrial Control Systems \nSpeaker: Stéphane Mocanu (INRIA) \n\nAbstract: In this talk\, we discuss the state of the art of industrial control systems cybersecurity. Based on classical events\, we analyse the typical threats and the vulnerabilities that they exploit. In the second part of the talk\, we present the security architectures and security practices as recommended by international standards (ISO 27000\, IEC 62443) and NIST Cybersecurity Framework).
URL:https://sal.cs.unibuc.ro/event/cybersecurity-of-industrial-control-systems/
LOCATION:503 PBT
CATEGORIES:Cryptography Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20260403T090000
DTEND;TZID=Europe/Bucharest:20260403T100000
DTSTAMP:20260403T211111
CREATED:20260402T101227Z
LAST-MODIFIED:20260402T101350Z
UID:852-1775206800-1775210400@sal.cs.unibuc.ro
SUMMARY:Introduction in Quantum Computing (III)
DESCRIPTION:Title: Introduction in Quantum Computing (III) \nSpeaker: Mihai Prunescu (UB) \n\nAbstract: We continue the discussion on QC.
URL:https://sal.cs.unibuc.ro/event/852/
LOCATION:Facultatea de Matematica si Informatica\, sala S.213
CATEGORIES:Cryptography Seminar
END:VEVENT
END:VCALENDAR