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:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:Europe/Bucharest
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20191027T010000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20190522T183000
DTEND;TZID=UTC:20190522T193000
DTSTAMP:20260404T214950
CREATED:20190521T040714Z
LAST-MODIFIED:20190521T040714Z
UID:413-1558549800-1558553400@sal.cs.unibuc.ro
SUMMARY:House of clouds – sau cum sa auditezi un sistem in cloud
DESCRIPTION:Speaker: Georgel Gheorghe este absolvent al facultatii de Electronica\, Telecomunicatii si Tehnologia a informatiei. Este membru ISACA si detine certificari precum CISA (Certified Information Systems Auditor)\, CGEIT (Certified in the Governance of Enterprise IT) si CRISC (Certified in Risk and Information Systems Control). \nAre o experienta de peste 11 ani in audit si consultanta in industrii de tipologii diferite (servicii financiare\, retail\, productie\, telecomunicatii\, energie) cu proiecte precum: evaluari ale mediilor IT&IS\, audituri de conformitate\, evaluari ale configurarilor de securitate\, managementul vulnerabilitatilor\, managementul continuitatii afacerii\, managementul schimbarilor. \nDupa mai multi ani petrecuti in Deloitte\, Ericson si Mazars\, s-a alaturat unei noi echipe unde cunostintele si experienta sa sunt o baza solida pentru identificarea unor solutii potrivite pentru noile provocari digitale. \n\nAbstract: Prezentarea propusa\, House of clouds – sau cum sa auditezi un sistem in cloud\, va aborda aspecte relevante ce tin de intelegerea si delimitarea sistemelor in scop\, identificarea riscurilor si selectarea masurilor de control necesare. \nIn introducere\, Gratiela Magdalinoiu (presedinte ISACA Romania) va face o scurta prezentare ISACA Romania.
URL:https://sal.cs.unibuc.ro/event/house-of-clouds-sau-cum-sa-auditezi-un-sistem-in-cloud/
LOCATION:Facultatea de Matematica si Informatica\, sala 219
CATEGORIES:Cryptography Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190530T100000
DTEND;TZID=UTC:20190530T120000
DTSTAMP:20260404T214950
CREATED:20190529T063857Z
LAST-MODIFIED:20190529T063857Z
UID:421-1559210400-1559217600@sal.cs.unibuc.ro
SUMMARY:Protocols in Dynamic Epistemic Logic
DESCRIPTION:Speaker:  Alexandru Dragomir (University of Bucharest) \n\nAbstract: Dynamic epistemic logics are useful in reasoning about knowledge and certain acts of learning (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: one based on [1]\, and the second on [2]. \nReferences:\n[1] T. Hoshi\, Epistemic dynamics and protocol information\, PhD thesis\, Stanford University\, 2009.\n[2] Y. Wang\, Y. Epistemic Modelling and Protocol Dynamics\, PhD thesis\, University of Amsterdam\, 2010.
URL:https://sal.cs.unibuc.ro/event/protocols-in-dynamic-epistemic-logic/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190530T170000
DTEND;TZID=UTC:20190530T180000
DTSTAMP:20260404T214950
CREATED:20190527T112423Z
LAST-MODIFIED:20190528T055503Z
UID:418-1559235600-1559239200@sal.cs.unibuc.ro
SUMMARY:Dynamic Code Analysis
DESCRIPTION:Speaker:  Radu Velea (BitDefender) \n\nAbstract: Static code analysis methods have the advantage of providing deterministic and reliable results. Malware has evolved beyond the point where simple pattern matching algorithms or signatures can provide adequate levels of protection. To respond to new threats we have to look at other hidden aspects such as execution behavior and fight evasive techniques by performing dynamic code analysis. This presentation discusses how to do this using runtime emulation and describes the existing challenges for the most popular architectures and executable file formats.
URL:https://sal.cs.unibuc.ro/event/dynamic-code-analysis/
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20190725T100000
DTEND;TZID=Europe/Bucharest:20190725T233000
DTSTAMP:20260404T214950
CREATED:20190723T083825Z
LAST-MODIFIED:20190723T083855Z
UID:433-1564048800-1564097400@sal.cs.unibuc.ro
SUMMARY:Anomaly Detection Reading Group: Deep OC-SVM
DESCRIPTION:Speaker:  Andrei Pătrașcu (University of Bucharest) \n\nAbstract: Recent empirical results confirm that one-class (OC) classification methods remain among the most important learning strategies for anomaly detection. In this seminar\, we will technically describe in detail multiple basic OC schemes such as OC-SVM and SVDD and their deep variants\, in order to identify room of improvements or generalization directions towards the graph anomaly detection context.
URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-deep-oc-svm/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20190801T100000
DTEND;TZID=Europe/Bucharest:20190801T233000
DTSTAMP:20260404T214950
CREATED:20190729T061912Z
LAST-MODIFIED:20190729T061912Z
UID:435-1564653600-1564702200@sal.cs.unibuc.ro
SUMMARY:Anomaly Detection Reading Group: Deep RPCA
DESCRIPTION:Speaker:  Andrei Pătrașcu (University of Bucharest) \n\nAbstract: We continue our adventure by investigating existing results with Robust Principal Component Analysis (RPCA) and its adaptation to existing deep neural networks. \nRequired reading: \nZHOU\, Chong; PAFFENROTH\, Randy C. Anomaly detection with robust deep autoencoders. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM\, 2017. p. 665-674. \nCANDÈS\, Emmanuel J.\, et al. Robust principal component analysis?. Journal of the ACM (JACM)\, 2011\, 58.3: 11.
URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-deep-rpca/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20190808T100000
DTEND;TZID=Europe/Bucharest:20190808T233000
DTSTAMP:20260404T214950
CREATED:20190805T174148Z
LAST-MODIFIED:20190805T174714Z
UID:437-1565258400-1565307000@sal.cs.unibuc.ro
SUMMARY:Anomaly Detection Reading Group: Graph Classification
DESCRIPTION:Speaker:  Andra Băltoiu (University of Bucharest) \n\nAbstract: We continue our investigation on the task of detecting outliers in networks\, by looking at the concept of signal variation on a graph. \nRequired reading: \nA. Sandryhaila and J. M. F. Moura\, “Classification via regularization on graphs\,” 2013 IEEE Global Conference on Signal and Information Processing\, Austin\, TX\, 2013\, pp. 495-498. \nS. Chen\, A. Sandryhaila\, J. M. F. Moura and J. Kovačević\, “Signal Recovery on Graphs: Variation Minimization\,” in IEEE Transactions on Signal Processing\, vol. 63\, no. 17\, pp. 4609-4624\, Sept.1\, 2015.
URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-graph-classification/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190821T100000
DTEND;TZID=UTC:20190821T233000
DTSTAMP:20260404T214950
CREATED:20190819T095240Z
LAST-MODIFIED:20190819T095240Z
UID:439-1566381600-1566430200@sal.cs.unibuc.ro
SUMMARY:Anomaly Detection Reading Group: Distributed Online AD
DESCRIPTION:Speaker: Paul Irofti (University of Bucharest) \n\nAbstract: We continue our investigation on the task of detecting outliers in networks when dealing with big-data and investigate existing online and distributed solutions. \nRequired reading: \nMiao\, Xuedan\, et al. “Distributed online one-class support vector machine for anomaly detection over networks.” IEEE transactions on cybernetics 49.4 (2018): 1475-1488. \nLiu\, Zhaoting\, Ying Liu\, and Chunguang Li. “Distributed sparse recursive least-squares over networks.” IEEE Transactions on Signal Processing 62.6 (2014): 1386-1395.
URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-distributed-online-ad/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20190830T100000
DTEND;TZID=Europe/Bucharest:20190830T233000
DTSTAMP:20260404T214950
CREATED:20190827T051705Z
LAST-MODIFIED:20190827T053239Z
UID:441-1567159200-1567207800@sal.cs.unibuc.ro
SUMMARY:Anomaly Detection Reading Group: Gaussian Mixture Models
DESCRIPTION:Speaker: Andrei Pătrașcu (University of Bucharest) \n\nAbstract: We continue our adventure by investigating existing results using Gaussian Mixture Models (GMM) for anomaly detection and their adaptation to existing deep neural networks. \nRequired reading: \nZong\, Bo\, et al. “Deep autoencoding gaussian mixture model for unsupervised anomaly detection.” (2018). \nChapter 11 from Deisenroth\, Marc Peter\, A. Aldo Faisal\, and Cheng Soon Ong. “Mathematics for Machine Learning.” (2018).
URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-gaussian-mixture-models/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190919T100000
DTEND;TZID=UTC:20190919T120000
DTSTAMP:20260404T214950
CREATED:20190918T215721Z
LAST-MODIFIED:20190918T215721Z
UID:449-1568887200-1568894400@sal.cs.unibuc.ro
SUMMARY:Local Reasoning about Parametric and Reconfigurable Component-based Systems
DESCRIPTION:Speaker: Radu Iosif (CNRS – VERIMAG\, France) \n\nAbstract: We introduce a logical framework for the specification and verification of component-based systems\, in which finitely many component instances are active\, but the bound on their number is not known. Besides specifying and verifying parametric systems\, we consider the aspect of dynamic reconfiguration\, in which components can migrate at runtime on a physical map\, whose shape and size may change. We describe such para- metric and reconfigurable architectures using resource logics\, close in spirit to Separation Logic\, used to reason about dynamic pointer structures. These logics support the principle of local reasoning\, which is the key for writing modular specifications and building scalable verification algorithms\, that deal with large industrial-size systems. Joint work with Marius Bozga and Joseph Sifakis.
URL:https://sal.cs.unibuc.ro/event/local-reasoning-about-parametric-and-reconfigurable-component-based-systems/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20190920T100000
DTEND;TZID=Europe/Bucharest:20190920T233000
DTSTAMP:20260404T214950
CREATED:20190917T073657Z
LAST-MODIFIED:20190918T051001Z
UID:446-1568973600-1569022200@sal.cs.unibuc.ro
SUMMARY:Optimal Transport for (Unsupervised) Machine Learning
DESCRIPTION:Speaker: Andra Băltoiu (University of Bucharest) \n\nAbstract: After attending the “Summer School on Applied Harmonic Analysis and Machine Learning” in Genova\,  Andra will give us a short introduction on Optimal Transport in the attempt of finding new prospects for the anomaly detection problem.
URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-optimal-transport-for-unsupervised-machine-learning/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20191024T100000
DTEND;TZID=UTC:20191024T120000
DTSTAMP:20260404T214950
CREATED:20191021T122914Z
LAST-MODIFIED:20191027T090711Z
UID:510-1571911200-1571918400@sal.cs.unibuc.ro
SUMMARY:An introduction to BAN logic (a logic of authentication)
DESCRIPTION:Speaker: Alexandru Dragomir (University of Bucharest) \n\nAbstract: One of the first and most discussed logical approaches to the problem of verifying security protocols is the one proposed in BAN logic [1]. BAN logic is a many-sorted modal logic used for its intuitive and compelling set of inference rules devised for reasoning about an agent’s beliefs\, trust and message exchange. My presentation will focus on (1) presenting the language and inference rules of BAN logic\, (2) following the original paper’s analysis of the Otway-Rees protocol\, (3) presenting some objections to using BAN\, and (4) discussing the problem of offering a semantics of BAN logic. \nReferences:\n[1] M. Burrows\, M. Abadi\, R. Needham\, A logic of authentication. Proc. Roy. Soc. London Ser. A 426\, no. 1871\, 233–271\, 1989.
URL:https://sal.cs.unibuc.ro/event/an-introduction-to-ban-logic-a-logic-of-authentication-2/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20191101T093000
DTEND;TZID=UTC:20191103T130000
DTSTAMP:20260404T214950
CREATED:20191031T062011Z
LAST-MODIFIED:20191031T062011Z
UID:516-1572600600-1572786000@sal.cs.unibuc.ro
SUMMARY:ManyVal 2019
DESCRIPTION:In perioada 1-3 noiembrie organizam workshop-ul international ManyVal 2019\, dedicat in special cercetarilor in logica cu mai multe valori. Editia actuala beneficiaza si de participarea unor filozofi-logicieni de marca. Pentru mai multe detalii puteti consulta pagina manifestarii:\n\n\n\n\n\nhttps://cs.unibuc.ro/events/manyval2019/\n\n\n\n\n\nPersoanele inregistrate vor primi kit-ul workshop-ului si vor putea participa la mesele si activitatile sociale anuntate.\n\n\n\n\n\nParticiparea la prezentari NU presupune plata taxei de inregistrare\, iar anumite materiale (program\, carte de abstracte) vor putea fi descarcate de pe pagina ManyVal 2019.
URL:https://sal.cs.unibuc.ro/event/manyval-2019/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20191121T083000
DTEND;TZID=Europe/Bucharest:20191121T100000
DTSTAMP:20260404T214950
CREATED:20191118T084219Z
LAST-MODIFIED:20191120T180808Z
UID:518-1574325000-1574330400@sal.cs.unibuc.ro
SUMMARY:Anomaly Detection Reading Group: Anomaly Detection by Unmasking
DESCRIPTION:Speaker: Marius Popescu (University of Bucharest) \n\nAbstract: We continue our adventure by investigating existing natural language processing results that deal with unmasking authorship and their application to anomaly detection. \nRequired reading: \nM. Koppel\, J. Schler\, and E. Bonchek-Dokow. Measuring Differentiability: Unmasking Pseudonymous Authors. Journal of Machine Learning Research\, 8:1261–1276\,  2007. \nT.R. Ionescu\, S. Smeureanu\, B. Alexe\,  and M. Popescu. Unmasking the abnormal events in video. In Proceedings of the IEEE International Conference on Computer Vision (pp. 2895-2903)\, 2017.
URL:https://sal.cs.unibuc.ro/event/anomaly-detection-by-unmasking/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20191121T100000
DTEND;TZID=UTC:20191121T120000
DTSTAMP:20260404T214950
CREATED:20191118T114517Z
LAST-MODIFIED:20191211T053442Z
UID:521-1574330400-1574337600@sal.cs.unibuc.ro
SUMMARY:Operational Semantics of Security Protocols
DESCRIPTION:Speaker:  Ioana Leustean (University of Bucharest) \n\nAbstract: After a brief overview of the formal methods used for analyzing security protocols\, we will focus on the operational semantics developed in: \nC. Cremers\, S. Mauw\, Operational Semantics and Verification of Security Protocols\, Springer\, 2012. \n 
URL:https://sal.cs.unibuc.ro/event/operational-semantics-of-security-protocols/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20191212T083000
DTEND;TZID=Europe/Bucharest:20191212T110000
DTSTAMP:20260404T214950
CREATED:20191209T092219Z
LAST-MODIFIED:20191209T092219Z
UID:531-1576139400-1576148400@sal.cs.unibuc.ro
SUMMARY:Executarea\, detecţia și prevenţia atacurilor de tip R.O.P
DESCRIPTION:Speaker: Sorin-Gabriel Radu (University of Bucharest) \n\nAbstract: Va fi prezentată o versiune extinsă a lucrări de licență ce va prezenta concepte de Return Orientated Programming\, o tehnică de reciclare și combinare a bucăților de cod existent\, curat\, astfel încât cod nou\, nedorit\, în general de tip malware\, să fie executat.
URL:https://sal.cs.unibuc.ro/event/executarea-detectia-si-preventia-atacurilor-de-tip-r-o-p/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20191212T100000
DTEND;TZID=UTC:20191212T120000
DTSTAMP:20260404T214950
CREATED:20191125T084235Z
LAST-MODIFIED:20191211T053426Z
UID:524-1576144800-1576152000@sal.cs.unibuc.ro
SUMMARY:Operational Semantics of Security Protocols II
DESCRIPTION:Speaker: Ioana Leustean (University of Bucharest) \n\nAbstract:  We continue our presentation on operational semantics of  security protocols\, as developed in: \nC. Cremers\, S. Mauw\, Operational Semantics and Verification of Security Protocols\, Springer\, 2012.
URL:https://sal.cs.unibuc.ro/event/524/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20191219T100000
DTEND;TZID=UTC:20191219T120000
DTSTAMP:20260404T214950
CREATED:20191217T061235Z
LAST-MODIFIED:20191217T061235Z
UID:548-1576749600-1576756800@sal.cs.unibuc.ro
SUMMARY:First-order logic and vagueness
DESCRIPTION:Speaker: Marian Calborean (University of Bucharest) \n\nAbstract: The Sorites paradox is usually studied as a propositional paradox. However\, the general form of the Sorites is second-order\, with three main features. It doesn’t contain any arbitrary parameters. It can be used to generate the propositional Sorites by appropriate replacement of the second-order premise with arbitrary clauses. Finally\, it is generally nonfirstorderizable\, relying on the notion of transitive closure of a relation. However\, it can be expressed in FOL with a finite upper bound on the elements of the relation. This leads to a definition of vagueness in classical FOL\, using the interplay between a total preorder and a monadic predicate. A notational extension of FOL will introduce a vague structure formed by the predicate (e.g.tall)\, the broad predicate (e.g. broadly tall) and the strict predicate (e.g. strictly tall). It allows the failure of a weak non-contradiction (e.g. ‘Some men are both broadly tall and broadly short’)\, the failure of a weak LEM (e.g. ‘Some men are neither strictly tall nor strictly short`)\, and the truth of a non-paradoxical tolerance (e.g. ‘If a person of n cm is strictly tall\, a person of n-1 cm is broadly tall’). \nReferences:\n[1] P. Cobreros\, P. Egré\, D. Ripley\, R\, Van Rooij\, Tolerant\, Classical\, Strict\, Journal of Philosophical Logic 41 (2019)\, 347-385.\n[2] D. Graff\, Shifting Sands: An Interest-Relative Theory of Vagueness\, Philosophical Topics 28 (2000)\, 45-81.\n[3] U. Keller\, Some remarks on the definability of transitive closure in first-order logic and Datalog\, Internal report\, Digital Enterprise Research Institute (DERI)\, University of Innsbruck\, 2004.\n[4] K.G. Lucey\, he ancestral relation without classes\, Notre Dame Journal of Formal Logic 20 (1979)\, 281-284.
URL:https://sal.cs.unibuc.ro/event/first-order-logic-and-vagueness/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20191219T183000
DTEND;TZID=UTC:20191219T200000
DTSTAMP:20260404T214950
CREATED:20191209T112956Z
LAST-MODIFIED:20191209T113237Z
UID:533-1576780200-1576785600@sal.cs.unibuc.ro
SUMMARY:Off-the-Record Communication (OTR) si CryptoGo (joc de carti de criptografie)
DESCRIPTION:Title: Off-the-Record Communication (OTR) \nSpeaker: Mihail-Iulian Plesa \n\nAbstract:  Off-the-Record Communication (OTR) este un protocol care modealeaza o discutie dintre doua entitati\, care ar trebui sa satisfaca anumite proprietati de securitate. Vom vorbi despre proprietatile acestui tip de comunicatie si despre cum pot fi acestea implementate in mediul online. Vom discuta apoi despre protocolul OTR integrat in Signal si cum anume difera acesta fata de versiunea originala. \nNota: Prezentarea va fi urmata de o sesiune de  joc CryptoGo – joc de carti educational pentru criptografie. \nMai multe informatii aici.
URL:https://sal.cs.unibuc.ro/event/off-the-record-communication-otr-si-cryptogo-joc-de-carti-de-criptografie/
LOCATION:Facultatea de Matematica si Informatica\, amf.2 (Pompei)
CATEGORIES:Cryptography Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20200130T083000
DTEND;TZID=Europe/Bucharest:20200130T100000
DTSTAMP:20260404T214950
CREATED:20200120T083733Z
LAST-MODIFIED:20200122T130127Z
UID:550-1580373000-1580378400@sal.cs.unibuc.ro
SUMMARY:Challenges in Banking
DESCRIPTION:Speaker: Horia Velicu (BRD – Groupe Societe Generale) \n\nAbstract: Presentation of topics of interest for 2020\, objectives and data available at BRD. Proposals for the themes for the applied research institute that will be sponsored this year. Presentation of the new BRD AI Hub.
URL:https://sal.cs.unibuc.ro/event/challenges-in-banking/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20200227T100000
DTEND;TZID=Europe/Bucharest:20200227T120000
DTSTAMP:20260404T214950
CREATED:20200309T105935Z
LAST-MODIFIED:20200309T110749Z
UID:585-1582797600-1582804800@sal.cs.unibuc.ro
SUMMARY:A quantitative analysis of the “Lion-Man” game
DESCRIPTION:Speaker: Ulrich Kohlenbach (Technische Universität Darmstadt)\nTitle: A quantitative analysis of the “Lion-Man” game\nAbstract: We analyze\, based on an interplay between ideas and techniques from logic and geometric analysis\, a pursuit-evasion game. More precisely\, we focus on a discrete lion and man game with an ε-capture criterion. We prove that in uniformly convex bounded domains the lion always wins and\, using ideas stemming from proof mining\, we extract a uniform rate of convergence for the successive distances between the lion and the man. As a byproduct of our analysis\, we study the relation among different convexity properties in the setting of geodesic spaces.\nJoint work with Genaro López-Acedo and Adriana Nicolae. \n\n\nReferences:\n[1] U. Kohlenbach\, G. López-Acedo\, A. Nicolae\, A quantitative analysis of the “Lion-Man” game. arXiv:1806.04496 [math.MG]\, 2019. Submitted.
URL:https://sal.cs.unibuc.ro/event/a-quantitative-analysis-of-the-lion-man-game/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20200302T183000
DTEND;TZID=UTC:20200302T200000
DTSTAMP:20260404T214950
CREATED:20200228T185325Z
LAST-MODIFIED:20200228T185356Z
UID:572-1583173800-1583179200@sal.cs.unibuc.ro
SUMMARY:BLOCKCHAIN - More than a buzzword
DESCRIPTION:Title: BLOCKCHAIN – More than a buzzword \nSpeaker: Ionut-Daniel Dobos (MBN Technologies) \n\nAbstract: In this presentation we will take a look at the concept of a blockchain as a mean to hold historical transactional data (while maintaining all the core concepts of Cryptography) and moreover\, to see how IPFS uses such approaches to ensure a way of general data storage with the same capabilities. We will choose the Ethereum network as a use case for the first topic\, taking a deeper look into the upcoming Casper update for the consensus mechanism\, introducing the Proof of Stake paradigm.
URL:https://sal.cs.unibuc.ro/event/blockchain-more-than-a-buzzword/
LOCATION:Facultatea de Matematica si Informatica\, sala 219
CATEGORIES:Cryptography Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20200312T083000
DTEND;TZID=Europe/Bucharest:20200312T100000
DTSTAMP:20260404T214950
CREATED:20200302T083259Z
LAST-MODIFIED:20200311T122700Z
UID:575-1584001800-1584007200@sal.cs.unibuc.ro
SUMMARY:POSTPONED: Securing Businesses and Critical Infrastructure
DESCRIPTION:POSTPONED UNTIL FURTHER NOTICE. \n  \nSpeaker: Ioan Constantin (Orange Romania) \n\nAbstract: A brief walkthrough some of the challenges in offering advanced cyber security solutions for Business and Critical Infrastructures\, from a Managed Security Services Provider’s standpoint. We’ll talk threat detection and mitigation\, the specifics of OT Security in Critical Infrastructure\, compliance and best practices. We’ll also glance at some of the research and development in these areas.
URL:https://sal.cs.unibuc.ro/event/securing-businesses-and-critical-infrastructure/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20200312T100000
DTEND;TZID=Europe/Bucharest:20200312T120000
DTSTAMP:20260404T214950
CREATED:20200309T110155Z
LAST-MODIFIED:20200311T122705Z
UID:588-1584007200-1584014400@sal.cs.unibuc.ro
SUMMARY:POSTPONED: Protocols in Dynamic Epistemic Logic
DESCRIPTION:POSTPONED UNTIL FURTHER NOTICE.\n\nSpeaker: Alexandru Dragomir (University of Bucharest)\n\nTitle: Protocols in Dynamic Epistemic Logic\nAbstract: Dynamic epistemic logics are useful in reasoning about knowledge and certain acts of learning (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 the account of protocols in [1\, 2]. \n\n\nReferences:\n[1] H. van Ditmarsch\, S. Ghosh\, R. Verbrugge\, Y. Wang\, Hidden protocols: Modifying our expectations in an evolving world\, Artificial Intelligence 208 (2014)\, 18-40.\n[2] Y. Wang\, Epistemic Modelling and Protocol Dynamics\, PhD thesis\, University of Amsterdam\, 2010.
URL:https://sal.cs.unibuc.ro/event/protocols-in-dynamic-epistemic-logic-2/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20210225T100000
DTEND;TZID=Europe/Bucharest:20210225T120000
DTSTAMP:20260404T214950
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:20260404T214950
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:20260404T214950
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:20260404T214950
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:20260404T214950
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:20260404T214950
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:20260404T214950
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
END:VCALENDAR