Wonder what's the latest development of automated reasoning? Join Prof. Laura Kovacs to learn more in our upcoming webinar on May 30th!
Register to attend this free webinar here.
Abstract: Automated reasoning, and in particular first-order theorem proving, is one of the earliest research areas within artificial intelligence. It is undergoing a rapid development thanks to its successful use in program analysis and verification, security analysis, symbolic computation, theorem proving in mathematics, and other related areas. Breakthrough results in all areas of theorem proving have been obtained, including improvements in theory, implementation, and the development of powerful theorem proving tools.
In this talk, Prof. Kovacs will describe recent developments in applications of first-order theorem proving in program analysis, in particular in the setting of generating inductive loop properties and proving partial correctness of program loops.
About the speaker: Laura Kovacs is a full professor in 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 and an ERC Consolidator Grant 2020.
Previous IE webinars can be viewed on our Informatics Europe YouTube channel under the playlist "Informatics Europe Webinars" - please follow and share our channel!
Netlogica