Katalin Fazekas

Orcid: 0000-0002-0497-3059

Affiliations:
  • TU Wien, Vienna, Austria


According to our database1, Katalin Fazekas authored at least 30 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Real-time Proof Checking for Distributed Incremental SAT Solving.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2026

2025
Interactions in Constraint Optimization (Dagstuhl Seminar 25371).
Dagstuhl Reports, September, 2025

Hardware Model Checking Certificates Benchmarks.
Dataset, April, 2025

Clausal Equivalence Checking Miters and SAT Competition Artifact.
Dataset, April, 2025

Clausal Equivalence Checking Miters and SAT Competition Artifact.
Dataset, April, 2025

CNF Encoded Isomorphic and Optimized Miters from Hardware Model Checking Competition 2024 Models.
Dataset, April, 2025

CaDiCaL 2.2 System Description Artifact.
Dataset, February, 2025

CaDiCaL 2.2 System Description Artifact.
Dataset, February, 2025

CaDiCaL 2.2 System Description Artifact.
Dataset, February, 2025

Incremental Inprocessing Rules beyond Resolution.
Proceedings of the Joint Proceedings of the 23rd International Workshop on Satisfiability Modulo Theories and the 16th Pragmatics of SAT International Workshop co-located with the 31st International Conference on Principles and Practice of Constraint Programming, 2025

SAT Reasoning in CDCL(T) Solvers.
Proceedings of the Joint Proceedings of the 23rd International Workshop on Satisfiability Modulo Theories and the 16th Pragmatics of SAT International Workshop co-located with the 31st International Conference on Principles and Practice of Constraint Programming, 2025

2024
Supplementary material of "Satisfiability modulo User Propagators".
Dataset, September, 2024

Clausal Equivalence Sweeping Paper Logs.
Dataset, May, 2024

CNF Encoded Isomorphic and Optimized Miters from Hardware Model Checking Competition 2020 Models.
Dataset, May, 2024

CaDiCaL 2.0 CAV'24 Tool-Paper Artifact.
Dataset, April, 2024

Satisfiability Modulo User Propagators.
J. Artif. Intell. Res., 2024

Clausal Congruence Closure.
Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

Certifying Incremental SAT Solving.
Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

Clausal Equivalence Sweeping.
Proceedings of the Formal Methods in Computer-Aided Design, 2024

CaDiCaL 2.0.
Proceedings of the Computer Aided Verification - 36th International Conference, 2024

2023
Supplementary material of submission "IPASIR-UP: User Propagators for CDCL".
Dataset, June, 2023

IPASIR-UP: User Propagators for CDCL.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

SAT-Based Quantified Symmetric Minimization of the Reachable States of Distributed Protocols.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

On Incremental Pre-processing for SMT.
Proceedings of the Automated Deduction - CADE 29, 2023

2021
Model Checking AUTOSAR Components with CBMC.
Proceedings of the Formal Methods in Computer Aided Design, 2021

2020
Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Incremental Inprocessing in SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
Skolem Function Continuation for Quantified Boolean Formulas.
Proceedings of the Tests and Proofs - 11th International Conference, 2017

2016
A Duality-Aware Calculus for Quantified Boolean Formulas.
Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016


  Loading...