Discover live virtual and in-person events offered by IEEE groups around the world.

“Polynomial Formal Verification: Ensuring Correctness under Resource Constraints” by Rolf Drechsler

We review recent developments in formal verification techniques and give a comprehensive overview of Polynomial Formal Verification (PFV). In PFV, polynomial upper bounds for the run-time and memory needed during the entire verification task hold. Thus, correctness under resource constraints can be ensured. We discuss the importance and advantages of PFV in the design flow. Formal methods on the ...

Learn More