Nils Froleyks

Nils Froleyks

Auto-generated profile, based on publicly available information

Nils Froleyks

KU Leuven

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 July 2024
Verified
Book Chapter
Open access
PDF file
ABArmin Biere
Armin Biere
TFTobias Faller
Tobias Faller
KFKatalin Fazekas
Katalin Fazekas
MFMathias Fleury
Mathias Fleury
NFNils Froleyks
Nils Froleyks
FPFlorian Pollitt
Florian Pollitt
The SAT solver CaDiCaL provides a rich feature set with a clean library interface. It has been adopted by many users, is well documented and easy to extend due to its effective testing and debugging infrastructure. In this tool paper we give a high-level introduction into the solver architecture and then go briefly over implemented techniques. We describe basic features and novel advanced usage scenarios. Experiments confirm that CaDiCaL despite this flexibility has state-of-the-art performance both in a stand-alone as well as incremental setting.

1 December 2021 in Artificial Intelligence
Verified
Journal Article
Open access
NFNils Froleyks
Nils Froleyks
MHMarijn Heule
Marijn Heule
MIMarkus Iser
Markus Iser
MJMatti Järvisalo
Matti Järvisalo
MSMartin Suda
Martin Suda

22 July 2025
Verified
Book Chapter
Open access
PDF file
NFNils Froleyks
Nils Froleyks
EYEmily Yu
Emily Yu
MPMathias Preiner
Mathias Preiner
ABArmin Biere
Armin Biere
KHKeijo Heljanko
Keijo Heljanko
Certification was made mandatory for the first time in the latest hardware model checking competition. In this case study, we investigate the trade-offs of requiring certificates for both passing and failing properties in the competition. Our evaluation shows that participating model checkers were able to produce compact, correct certificates that could be verified with minimal overhead. Furthermore, the certifying winner of the competition outperforms the previous non-certifying state-of-the-art model checker, demonstrating that certification can be adopted without compromising model checking efficiency.

18 May 2026
Verified
Book Chapter
Open access
NFNils Froleyks
Nils Froleyks
EYEmily Yu
Emily Yu
ABArmin Biere
Armin Biere
KHKeijo Heljanko
Keijo Heljanko
Model checking is a powerful automated reasoning technique for verifying hardware designs, ensuring that they function correctly before deployment. However, modern model checkers are complex software systems with hundreds of thousands of lines of code, making them prone to errors. To increase confidence in verification results, recent efforts in hardware verification focus on requiring model checkers to produce machine-checkable proofs according to a standardized format that can be independently validated. Yet, implementing proof generation across different verification algorithms presents a unique challenge. In hardware model checking, constraints play an essential role, as they encode assumptions about the environment and help simplify analysis. This paper addresses the challenge by developing a certification approach that ensures verification results remain trustworthy when constraints are present. We introduce certificate generation methods for three classes of constraints that can be extracted from the models. Furthermore, to support a broader range of constraints and more complex reset logic for industrial use, we also provide alternative Quantified Boolean Formula checks in the proof format with a single quantifier alternation. Lastly, we present a certificate generation method for k -induction with uniqueness constraints, an important model checking technique. We implement these in a certification toolkit, and provide empirical evaluation on competition benchmarks, demonstrating their effectiveness.

24 July 2026
Verified
Book Chapter
Open access
PDF file
NFNils Froleyks
Nils Froleyks
EYEmily Yu
Emily Yu
BBBart Bogaerts
Bart Bogaerts
ABArmin Biere
Armin Biere
KHKeijo Heljanko
Keijo Heljanko
We introduce a generic certificate format for verifying liveness properties in hardware model checking. The format relies purely on propositional predicates and does not involve explicit counters. Our certificates can be efficiently validated using a fixed number of SAT checks. The proposed format is compatible with state-of-the-art liveness checking algorithms. We present certificate generation for several representative techniques, including rLive, liveness-to-safety reduction, and k -liveness, as well as for a preprocessing method based on stabilizing constraint extraction. Experimental results on benchmarks from the Hardware Model Checking Competition demonstrate that our approach is practically effective with very low certification overhead, and our certificate checker successfully validated all generated certificates.

24 July 2026
Verified
Book Chapter
Open access
PDF file
NFNils Froleyks
Nils Froleyks
EYEmily Yu
Emily Yu
Certificates are machine-checkable witnesses that help increase confidence in verification results by providing independently verifiable evidence beyond a simple yes/no answer. In this short paper, we present two certificate checkers for hardware model checking, Certifaiger and Cerbtora, which target bit-level and word-level verification of hardware designs, respectively. Certifaiger has been adopted in recent editions of the Hardware Model Checking Competition, but not described in the literature before. Cerbtora extends the same theoretical framework to the word level, in which certificates are expressed in the same modeling language as the design under test and are validated using efficient automated reasoning engines. We describe the architecture and main components of both tools and evaluate them on competition benchmarks.