From North Stars to Clever Insights — On using grand challenges to drive new techniques in automated theorem proving (Nikolaj Bjørner, ISPRASOPEN-2019) — различия между версиями
Материал из 0x1.tv
StasFomin (обсуждение | вклад) |
StasFomin (обсуждение | вклад) |
||
[[File:{{#setmainimage:From North Stars to Clever Insights — On using grand challenges to drive new techniques in automated theorem proving (Nikolaj Bjørner, ISPRASOPEN-2019)!.jpg}}|center|640px]] {{LinksSection}} <!-- * [ Talks page on site] --> <!-- <blockquote>[©]</blockquote> --> <references/> <!-- topub --> [[Категория:ISPRASOPEN-2019]] [[Категория:Верификация]] {{stats|disqus_comments=0|refresh_time=2019-12-30T15:52:152020-01-04T15:53:58.267640617933|vimeo_plays=1|youtube_plays=0}} |
Версия 12:53, 4 января 2020
- Speaker
- Nikolaj Bjørner
Modern theorem provers have in the past decade demonstrated immense capabilities and found numerous practical applications. Building a theorem prover takes extensive empirical research, supported by careful thought, clever insight, and a deep theoretical understanding of logical formalisms and reasoning. In this talk I describe an underlying insight that has found its way into Z3's core in different guises over the years: model-based search and saturation. Z3 is a state-of-art theorem prover available from Microsoft Research. Inspiration isn't born in vacuum. A set of north stars taken from driving scenarios, such verifying compilers, symbolic execution, quantum compilation, and network verification to name a few, have shaped directions of research and systems building in Z3.
Video
Посмотрели доклад? Понравился? Напишите комментарий! Не согласны? Тем более напишите.
Slides
Links
Plays:1 Comments:0