Martin Blicha

Orcid: 0000-0001-8140-4098

According to our database1, Martin Blicha authored at least 24 papers between 2018 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Analyzing multiloop programs with Golem.
Sci. Comput. Program., 2026

Hornix: From LLVM IR to Constrained Horn Clauses and Back (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2026

2025
Validation of CHC Satisfiability with ATHENA.
Formal Aspects Comput., December, 2025

Golem: a flexible and efficient solver for constrained Horn clauses.
Formal Methods Syst. Des., November, 2025

Artifact for the paper Unsatisfiability Proofs for Horn Solving.
Dataset, January, 2025

Unsatisfiability Proofs for Horn Solving.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2025

Space Explanations of Neural Network Classification.
Proceedings of the Computer Aided Verification - 37th International Conference, 2025

2024
The FMCAD 2024 Student Forum.
Proceedings of the Formal Methods in Computer-Aided Design, 2024

Reachability Analysis for Multiloop Programs Using Transition Power Abstraction.
Proceedings of the Formal Methods - 26th International Symposium, 2024

2023
CHC Model Validation with Proof Guarantees.
Proceedings of the iFM 2023 - 18th International Conference, 2023

The Golem Horn Solver.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Using linear algebra in decomposition of Farkas interpolants.
Int. J. Softw. Tools Technol. Transf., 2022

SMT-based verification of program changes through summary repair.
Formal Methods Syst. Des., 2022

Transition Power Abstractions for Deep Counterexample Detection.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Summarization of branching loops.
Proceedings of the SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Virtual Event, April 25, 2022

Split Transition Power Abstraction for Unbounded Safety.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

SolCMC: Solidity Compiler's Model Checker.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Theory-Specific Proof Steps Witnessing Correctness of SMT Executions.
Proceedings of the 58th ACM/IEEE Design Automation Conference, 2021

2020
A Cooperative Parallelization Approach for Property-Directed k-Induction.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Farkas-Based Tree Interpolation.
Proceedings of the Static Analysis - 27th International Symposium, 2020

Incremental Verification by SMT-based Summary Repair.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

2019
Decomposing Farkas Interpolants.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

2018
Function Summarization Modulo Theories.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Computing Exact Worst-Case Gas Consumption for Smart Contracts.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice, 2018


  Loading...