PolyAdd: Polynomial formal verification of adder circuits

R Drechsler - 2021 24th International Symposium on Design …, 2021 - ieeexplore.ieee.org
Only by formal verification approaches functional correctness can be ensured. While for
many circuits fast verification is possible, in other cases the approaches fail. In general no …

SoK: Attacks on industrial control logic and formal verification-based defenses

R Sun, A Mera, L Lu, D Choffnes - 2021 IEEE European …, 2021 - ieeexplore.ieee.org
Programmable Logic Controllers (PLCs) play a critical role in the industrial control systems.
Vulnerabilities in PLC programs might lead to attacks causing devastating consequences to …

The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing

R Wille, L Berent, T Forster, J Kunasaikaran… - arxiv preprint arxiv …, 2024 - arxiv.org
Quantum computers are becoming a reality and numerous quantum computing applications
with a near-term perspective (eg, for finance, chemistry, machine learning, and optimization) …

[BOOK][B] Towards a design flow for reversible logic

R Wille, R Drechsler - 2010 - books.google.com
The development of computing machines found great success in the last decades. But the
ongoing miniaturization of integrated circuits will reach its limits in the near future. Shrinking …

Random stimuli generation for the verification of quantum circuits

L Burgholzer, R Kueng, R Wille - Proceedings of the 26th Asia and South …, 2021 - dl.acm.org
Verification of quantum circuits is essential for guaranteeing correctness of quantum
algorithms and/or quantum descriptions across various levels of abstraction. In this work, we …

Polynomial formal verification of arithmetic circuits

R Drechsler, A Mahzoon, L Weingarten - Proceedings of International …, 2022 - Springer
The size and the complexity of digital circuits are increasing rapidly. This makes the circuits
highly error-prone. As a result, proving the correctness of a circuit is of utmost importance …