BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.9//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:SECURITY & APPLIED LOGIC
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:VEVENT
DTSTART;TZID=UTC:20190117T083000
DTEND;TZID=UTC:20190117T100000
DTSTAMP:20260404T161908
CREATED:20190114T100137Z
LAST-MODIFIED:20190114T100208Z
UID:279-1547713800-1547719200@sal.cs.unibuc.ro
SUMMARY:Making Obsolete Malware Viable with Packing
DESCRIPTION:Speaker:  Mihai Stancu \n\nAbstract: \nThe security trend today is to stop security threats even before they\narrive on the target machine or system. \nWith that in mind we will explore\, what packers are and what they do to\ntransform original malicious code in into something that is much harder to\nconfidently mark as a threat. \nThis talk will be focused on executables in the PE format running on the\nWindows platform and during the presentation we will form a basic\nunderstanding of the executable structure\, packing technique\, and other\nanti-dumping and anti-debug techniques work to protect and run the original\npayload.
URL:https://sal.cs.unibuc.ro/event/making-obsolete-malware-viable-with-packing/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190131T100000
DTEND;TZID=UTC:20190131T120000
DTSTAMP:20260404T161908
CREATED:20190127T174249Z
LAST-MODIFIED:20190127T174249Z
UID:284-1548928800-1548936000@sal.cs.unibuc.ro
SUMMARY:The frontier between decidability and undecidability for logics for strategic reasoning in the presence of imperfect information
DESCRIPTION:Speaker:   Catalin Dima (Université Paris-Est Créteil.) \n\nAbstract: \nThe last 15-20 years have seen a number of logical formalisms that focus on strategic reasoning. These logics aim at giving specification languages for various multi-agent game structures\, in which agents have adversarial or cooperative objectives which may be qualitative or quantitative and may have various types of imperfect information. The presence of imperfect information raises a particular difficulty in that many games cannot be solved algorithmically\, as well as their corresponding logical formalisms. In this tutorial I will review some techniques for proving that the Alternating-time Temporal Logic has an undecidable model-checking problem\, but this problem becomes decidable when considering memoryless strategies\, coalitions with distributed knowledge\, hierarchical knowledge and public or coalition-public announcements. I will also give a short introduction to the model-checking tool MCMAS which relies on the memoryless semantics for ATL with imperfect information\, and the problems that arise when implementing the model-checking algorithms for this case.
URL:https://sal.cs.unibuc.ro/event/the-frontier-between-decidability-and-undecidability-for-logics-for-strategic-reasoning-in-the-presence-of-imperfect-information/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Logic Seminar
END:VEVENT
END:VCALENDAR