Time zone: PST (UTC−08:00)
Website: CAV 2021 (opens in new tab)
Microsoft is excited to be a Platinum sponsor of the CAV 2021 is the 33rd in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. The conference will be held online, July 18-24, 2021. It was originally planned to take place in Los Angeles, California, USA.
The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers is expected to be invited to a special issue of Formal Methods in System Design and the Journal of the ACM.
See information of CAV from previous years.
CAV Award
Microsoft is proud to announce three of our very own researchers have received the CAV Award this year. Please join me in congratulating Nikolaj Bjørner, Shuvendu Lahiri, and Leonardo de Moura on this achievement.
Congratulations to the 21 recipients of the 2021 CAV Award! #21in21 🎉
The award recognizes their "pioneering contributions to the foundations of the theory and practice of satisfiability modulo theories (SMT)." #cav21 pic.twitter.com/FBp7YrvY2w— CAV (@confCAV) July 23, 2021
Microsoft Virtual Session
Microsoft hosted an interactive session Tuesday, July 20 at the CAV conference open to all conference attendees. This session was hosted with Microsoft researchers Nikolaj Bjorner, Shuvendu Lahiri, Akash Lal, Andrey Rybalchenko, and Nikhil Swamy who presented a broad overview of current projects and objectives while creating opportunities for ongoing engagements and potential external candidates. If you missed this session, please feel free to review the deck and follow up directly with any of the researchers involved.
Accepted papers
Synthesis with Asymptotic Resource Bounds
Qinheping Hu, John Cyphert, Loris D’Antoni and Thomas Reps
Program Committee members
Nikolaj Bjorner, Senior Principal Researcher
Leonardo de Moura, Senior Principal Researcher
Shuvendu Lahiri, Senior Principal Researcher
Akash Lal, Senior Principal Researcher
Madan Musuvathi, Partner Research Manager
Andrey Rybalchenko, Senior Principal Researcher
Nihkil Swamy, Senior Principal Researcher