Yoni Zohar

Orcid: 0000-0002-2972-6695

According to our database1, Yoni Zohar authored at least 44 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Combining Stable Infiniteness and (Strong) Politeness.
J. Autom. Reason., December, 2023

Generating and Exploiting Automated Reasoning Proof Certificates.
Commun. ACM, October, 2023

Reasoning About Vectors: Satisfiability Modulo a Theory of Sequences.
J. Autom. Reason., September, 2023

Combining Finite Combination Properties: Finite Models and Busy Beavers.
Proceedings of the Frontiers of Combining Systems - 14th International Symposium, 2023

Formal Verification of Bit-Vector Invertibility Conditions in Coq.
Proceedings of the Frontiers of Combining Systems - 14th International Symposium, 2023

DNN Verification, Reachability, and the Exponential Function Problem.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness.
Proceedings of the Automated Deduction - CADE 29, 2023

2022
Polite Combination of Algebraic Datatypes.
J. Autom. Reason., 2022

Bit-Precise Reasoning via Int-Blasting.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2022

cvc5: A Versatile and Industrial-Strength SMT Solver.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Reasoning About Vectors Using an SMT Theory of Sequences.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

Effective Semantics for the Modal Logics K and KT via Non-deterministic Matrices.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

Flexible Proof Production in an Industrial-Strength SMT Solver.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021
Towards Satisfiability Modulo Parametric Bit-vectors.
J. Autom. Reason., 2021

lazybvtoint at the SMT Competition 2020.
CoRR, 2021

Smt-Switch: A Solver-Agnostic C++ API for SMT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Politeness for the Theory of Algebraic Datatypes (Extended Abstract).
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Politeness and Stable Infiniteness: Stronger Together.
Proceedings of the Automated Deduction - CADE 28, 2021

2020
Completeness and Cut-Elimination for First-Order Ideal Paraconsistent Four-Valued Logic.
Stud Logica, 2020

Resources: A Safe Language Abstraction for Money.
CoRR, 2020

Modal extension of ideal paraconsistent four-valued logic and its subsystem.
Ann. Pure Appl. Log., 2020

The Move Prover.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Politeness for the Theory of Algebraic Datatypes.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Pure Sequent Calculi: Analyticity and Decision Procedure.
ACM Trans. Comput. Log., 2019

Rexpansions of Nondeterministic matrices and their Applications in nonclassical Logics.
Rev. Symb. Log., 2019

Correction to: Sequent Systems for Negative Modalities.
Logica Universalis, 2019

Towards automated reasoning in Herbrand structures.
J. Log. Comput., 2019

Yet another paradefinite logic: The role of conflation1.
Log. J. IGPL, 2019

Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract).
Proceedings of the Proceedings Sixth Workshop on Proof eXchange for Theorem Proving, 2019

DRAT-based Bit-Vector Proofs in CVC4.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Finite Model Property for Modal Ideal Paraconsistent Four-Valued Logic.
Proceedings of the 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), 2019

Towards Bit-Width-Independent Proofs in SMT Solvers.
Proceedings of the Automated Deduction - CADE 27, 2019

Automating Automated Reasoning - The Case of Two Generic Automated Reasoning Tools.
Proceedings of the Description Logic, Theory Combination, and All That, 2019

2018
Online detection of effectively callback free objects with applications to smart contracts.
Proc. ACM Program. Lang., 2018

From the subformula property to cut-admissibility in propositional sequent calculi.
J. Log. Comput., 2018

2017
Sequent Systems for Negative Modalities.
Logica Universalis, 2017

Cut-Admissibility as a Corollary of the Subformula Property.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

Non-Deterministic Matrices in Action: Expansions, Refinements, and Rexpansions.
Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017

Reasoning Inside The Box: Deduction in Herbrand Logics.
Proceedings of the GCAI 2017, 2017

2016
'Mathematical' Does Not Mean 'Boring': Integrating Software Assignments to Enhance Learning of Logico-Mathematical Concepts.
Proceedings of the Advanced Information Systems Engineering Workshops, 2016

Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

It ain't necessarily so: Basic sequent systems for negative modalities.
Proceedings of the Advances in Modal Logic 11, 2016

2014
On the Construction of Analytic Sequent Calculi for Sub-classical Logics.
Proceedings of the Logic, Language, Information, and Computation, 2014

SAT-Based Decision Procedure for Analytic Pure Sequent Calculi.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014


  Loading...