<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<meta name="Generator" content="Microsoft Word 15 (filtered medium)">
<style><!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
@font-face
{font-family:Aptos;}
/* Style Definitions */
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
span.E-MailFormatvorlage18
{mso-style-type:personal-compose;
font-family:"Arial",sans-serif;
color:black;}
.MsoChpDefault
{mso-style-type:export-only;
font-size:10.0pt;
mso-ligatures:none;}
@page WordSection1
{size:612.0pt 792.0pt;
margin:70.85pt 70.85pt 2.0cm 70.85pt;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang="DE-AT" link="blue" vlink="purple" style="word-wrap:break-word">
<div class="WordSection1">
<div id="divtagdefaultwrapper">
<p><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">Dear all!</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">We are excited to announce the next talk in the seminar series called "Women in Logic Online" by Laura Kovács!</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">Date: Monday, November 25, 2024</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">Time: 17:00 CEST</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">Venue: Online via Zoom (link for free registration will be shared asap)</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">TITLE: Automating Game Reasoning in Blockchain Security</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">ABSTRACT:</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">We advocate a game-theoretic approach for the security analysis of blockchain protocols.</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">Doing so, we model protocols as games to precisely capture security properties and apply automated reasoning techniques to determine whether a game-theoretic protocol
model is game-theoretically secure. Security analysis becomes a satisfiability checking problem in first-order real arithmetic, which we solve within our CheckMate verifier. Our method has been successfully applied to decentralized protocols, board games,
and game-theoretic examples.</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">This is a joint work with Ivana Bocevska, Lea Brugger, Anja Petkovic Komel, Sophie Rain and Michael Rawson.</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">SHORT BIO:</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">Laura Kovács is a full professor of computer science at the TU Wien, leading the automated program reasoning (APRe) group of the Formal Methods in Systems Engineering
division. Her research focuses on the design and development of new theories, technologies, and tools for program analysis, with a particular focus on automated assertion generation, symbolic summation, computer algebra, and automated theorem proving. She
is the co-developer of the Vampire theorem prover and a Wallenberg Academy Fellow of Sweden. Her research has also been awarded with an ERC Starting Grant 2014, an ERC Proof of Concept Grant 2018, an ERC Consolidator Grant 2020, and two Amazon Research Awards
(2020 and 2023). Recently, she received financial support from LEA Frauenfonds to disseminate unplugged computer science to elementary schools, while organizing computer science workshops with school children at the TU Wien.</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">We hope to see you there!</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">Agata Ciabattoni & Josephine Dik</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><br>
<br>
</span><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black">Women in Logic
</span><span style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><a href="https://womeninlogic.org/" target="_blank"><span lang="EN-US" style="font-family:"Arial",sans-serif">https://womeninlogic.org/</span></a></span><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><o:p></o:p></span></p>
<p><span lang="EN-US" style="font-size:10.0pt;font-family:"Calibri",sans-serif;color:black"><o:p> </o:p></span></p>
<p><span lang="EN-US" style="font-size:10.0pt;font-family:"Arial",sans-serif;color:black"><a href="https://www.vcla.at/2024/10/women-in-logic-online-talk-announcement/">https://www.vcla.at/2024/10/women-in-logic-online-talk-announcement/</a><o:p></o:p></span></p>
</div>
</div>
</body>
</html>