Extending SAT Solvers to Cryptographic Problems. - Mate Soos; Karsten Nohl; Claude Castelluccia (SAT, 2009)

Enhanced Gaussian Elimination in DPLL-based SAT Solvers. - Mate Soos (POS@SAT, 2010)

FIRE: Fault Injection for Reverse Engineering. - Manuel San Pedro; Mate Soos; Sylvain Guilley (WISTP, 2011)

Lynx: A Programmatic SAT Solver for the RNA-Folding Problem. - Vijay Ganesh 001; Charles W. O'Donnell; Mate Soos; Srinivas Devadas; Martin C. Rinard; Armando Solar-Lezama (SAT, 2012)

BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting. - Mate Soos; Kuldeep S. Meel (AAAI, 2019)

Bosphorus: Bridging ANF and CNF Solvers. - Davin Choo; Mate Soos; Kian Ming Adam Chai; Kuldeep S. Meel (DATE, 2019)

GANAK: A Scalable Probabilistic Exact Model Counter. - Shubham Sharma 003; Subhajit Roy 001; Mate Soos; Kuldeep S. Meel (IJCAI, 2019)

CrystalBall: Gazing in the Black Box of SAT Solving. - Mate Soos; Raghav Kulkarni; Kuldeep S. Meel (SAT, 2019)

Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling. - Mate Soos; Stephan Gocht; Kuldeep S. Meel (CAV (1), 2020)

Designing Samplers is Easy: The Boon of Testers. - Priyanka Golia; Mate Soos; Sourav Chakraborty 001; Kuldeep S. Meel (FMCAD, 2021)

Gaussian Elimination Meets Maximum Satisfiability. - Mate Soos; Kuldeep S. Meel (KR, 2021)

Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving. - Nicolas Prevot; Mate Soos; Kuldeep S. Meel (SAT, 2021)

On Quantitative Testing of Samplers. - Mate Soos; Priyanka Golia; Sourav Chakraborty 001; Kuldeep S. Meel (CP, 2022)

Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling. - Mate Soos; Kuldeep S. Meel (ICCAD, 2022)

The Pancake Graph of Order 10 Is 4-Colorable. - Renzo Roel Perez Tan; Aldrich Ellis Catapang Asuncion; Brian Godwin Sy Lim; Mate Soos; Kazushi Ikeda (ICoMS, 2023)

Engineering an Efficient Approximate DNF-Counter. - Mate Soos; Divesh Aggarwal; Sourav Chakraborty 001; Kuldeep S. Meel; Maciej Obremski (IJCAI, 2023)

Explaining SAT Solving Using Causal Reasoning. - Jiong Yang 002; Arijit Shaw; Teodora Baluta; Mate Soos; Kuldeep S. Meel (SAT, 2023)

Algorithms Transcending the SAT-Symmetry Interface. - Markus Anders; Pascal Schweitzer; Mate Soos (SAT, 2023)

Proof Generation for CDCL Solvers Using Gauss-Jordan Elimination. - Mate Soos; Randal E. Bryant (CoRR, 2023)

Hevm, a Fast Symbolic Execution Framework for EVM Bytecode. - Dxo; Mate Soos; Zoe Paraskevopoulou; Martin Lundfall; Mikael Brockman (CAV (1), 2024)

Formally Certified Approximate Model Counting. - Yong Kiam Tan; Jiong Yang 002; Mate Soos; Magnus O. Myreen; Kuldeep S. Meel (CAV (1), 2024)

Engineering an Efficient Preprocessor for Model Counting. - Mate Soos; Kuldeep S. Meel (DAC, 2024)

Testing and Design of Uniform CNF Samplers: A Virtuous Cycle Enabled by Distribution Testing. - Mate Soos; Sourav Chakraborty 001; Kuldeep S. Meel (SETSS, 2024)

Engineering an Efficient Approximate DNF-Counter. - Mate Soos; Uddalok Sarkar; Divesh Aggarwal; Sourav Chakraborty 001; Kuldeep S. Meel; Maciej Obremski (CoRR, 2024)

Engineering an Efficient Probabilistic Exact Model Counter. - Mate Soos; Kuldeep S. Meel (CAV (3), 2025)

Efficient Certified Reasoning for Binarized Neural Networks. - Jiong Yang 002; Yong Kiam Tan; Mate Soos; Magnus O. Myreen; Kuldeep S. Meel (SAT, 2025)