Martin Jonás

Orcid: 0000-0003-4703-0795

According to our database1, Martin Jonás authored at least 22 papers between 2016 and 2024.

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

2024
Gray-Box Fuzzing via Gradient Descent and Boolean Expression Coverage (Technical Report).
CoRR, 2024

Gray-Box Fuzzing via Gradient Descent and Boolean Expression Coverage.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Symbiotic 10: Lazy Memory Initialization and Compact Symbolic Execution - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Fizzer: New Gray-Box Fuzzer - (Competition Contribution).
Proceedings of the Fundamental Approaches to Software Engineering, 2024

2023
Kratos2: An SMT-Based Model Checker for Imperative Programs.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Efficient Analysis of Cyclic Redundancy Architectures via Boolean Fault Propagation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Analysis of Cyclic Fault Propagation via ASP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

2021
Reconfiguring Metamorphic Robots via SMT: Is It a Viable Way?
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

Optimization Modulo Non-linear Arithmetic via Incremental Linearization.
Proceedings of the Frontiers of Combining Systems - 13th International Symposium, 2021

Efficient SMT-Based Analysis of Failure Propagation.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2019
Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
On the complexity of the quantified bit-vector arithmetic with binary encoding.
Inf. Process. Lett., 2018

Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes? (Experimental Paper).
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

2017
SMT Queries Decomposition and Caching in Semi-Symbolic Model Checking.
CoRR, 2017

Optimizing and Caching SMT Queries in SymDIVINE - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Symbiotic 4: Beyond Reachability - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

On Simplification of Formulas with Unconstrained Variables and Quantifiers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016
On the Complexity of the Quantified Bit-Vector Arithmetic with Binary Encoded Bit-Widths.
CoRR, 2016

Symbiotic 3: New Slicer and Error-Witness Generation - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016


  Loading...