So basically the way that this is going to work is like you've got a program that was written by some developer and so the formal verifier at the end of the day has to know the semantics of the language. So it is going to reason very concretely about the program itself and what it's going to check is whether anything that would violate the specification is potentially possible. This violation could be not specific to being under constrained or over constrained instead what you have to write these properties that you want to check using a logical formula. If they're different then you have found an under constrained circuit but it's not necessarily configured to look for this one problem.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode