Adrian Rebola Pardo
Univ.Ass. Dr.techn. / MSc
Role
- PostDoc Researcher
Formal Methods in Systems Engineering, E192-04
Contact
- adrian.rebola@tuwien.ac.at
- +43-1-58801-740074
- 1040 Wien, Favoritenstrasse 11 / Room HE0316
- vCard from TISS
- orcid.org/0000-0001-9234-4377
- informatics.tuwien.ac.at/people/adrian-rebola
- tiss.tuwien.ac.at/person/296535
Courses
Winter 2026
- Computer-Aided Verification / 192.171 VU
- Formal Methods in Systems Engineering / 192.164 VU
Projects
- 2026 – 2029 / Vienna Science and Technology Fund (WWTF) / Website
Publications
- Adame, B. O., Bogaerts, B., Bogø, B., Dold, S., GONTIER, A., Koops, W., McCreesh, C., McIlree, M., Nordström, J., Oertel, A., Rebola Pardo, A., Turnbull, M. P. (2026). Trimming Pseudo-Boolean Proofs. In B. Dutertre B. Könighofer (Eds.), Proceedings of the 26th Conference on Formal Methods in Computer-Aided Design – FMCAD 2026 (pp. 743–756). TU Wien Academic Press. Peer-reviewed.DOI: 10.34727/2026/isbn.978-3-85448-093-8_74 / Download: PDF
- Simader, M., Rebola-Pardo, A., Seidl, M. (2025). FERAT: A New Expansion-Based Certification Framework for Quantified Boolean Formulas. In SAC ’25: Proceedings of the 40th ACM/SIGAPP Symposium on Applied Computing (pp. 1043–1050). Peer-reviewed.
- Heisinger, S., Heisinger, M., Rebola-Pardo, A., Seidl, M. (2024). Quantifier Shifting for Quantified Boolean Formulas Revisited. In Automated Reasoning: 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3–6, 2024, Proceedings, Part I (pp. 325–343). Springer International Publishing. Peer-reviewed.DOI: 10.1007/978-3-031-63498-7_20 / Download: PDF
- Rebola Pardo, A. (2023). Even Shorter Proofs Without New Variables. In M. Mahajan F. Slivovsky (Eds.), 26th International Conference on Theory and Applications of Satisfiability Testing (pp. 22:1-22:20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Peer-reviewed.DOI: 10.4230/LIPICS.SAT.2023.22 / Project: LCS
- Rebola Pardo, A. (2022). Interpolants and Interference. In M. Benedikt, P. Rümmer, C. Wernhard (Eds.), iPRA 2022 : The 4th Workshop on Interpolation: From Proofs to Applications : Book of Abstracts (pp. 27–35).HDL: 20.500.12708/198885 / Project: LCS
- Rebola Pardo, A., Weissenbacher, G. (2020). RAT Elimination. In L. Kovacs E. Albert (Eds.), LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 423–448). Peer-reviewed.DOI: 10.29007/fccb
- Altmanninger, J., Rebola Pardo, A. (2020). Frying the Egg, Roasting the Chicken: Unit Deletions in DRAT Proofs. In J. Blanchette C. Hritcu (Eds.), CPP 2020: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs. ACM.DOI: 10.1145/3372885.3373821 / Download: PDF
- Rebola Pardo, A., Suda, M. (2018). A Theory of Satisfiability-Preserving Proofs in SAT Solving. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 583–603). EasyChair Publications. Peer-reviewed.DOI: 10.29007/tc7q
- Kiesl, B., Rebola Pardo, A., Heule, M. (2018). Extended Resolution Simulates DRAT. In Automated Reasoning (pp. 516–531). LNCS. Peer-reviewed.
- Forkel, W., Philipp, T., Rebola Pardo, A., Werner, E. (2017). Fuzzing and Verifying RAT Refutations with Deletion Information. In Florida Artificial Intelligence Research Society Conference (pp. 190–193). AAAI Press.HDL: 20.500.12708/56283 / Project: BITVECTOR
- Philipp, T., Rebola Pardo, A. (2017). Towards a Semantics of Unsatisfiability Proofs with Inprocessing. In Logic Programming and Automated Reasoning (LPAR) (pp. 65–84). EasyChair EPiC Series in Computing.HDL: 20.500.12708/57273 / Project: BITVECTOR
- Philipp, T., Rebola-Pardo, A. (2016). DRAT proofs for XOR reasoning. In L. Michael A. Kakas (Eds.), Logics in Artificial Intelligence : 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings. Springer Cham.DOI: 10.1007/978-3-319-48758-8_27 / Download: PDF
Theses
- Rebola-Pardo, A. (2021). Interference-based proofs in SAT solving [Dissertation, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2022.102507 / Download: PDF
- Altmanninger, J. (2019). A Tiny tweak to proof generation in miniSat-based SAT solvers a complete and efficient DRAT proof checker [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2019.62440 / Download: PDF