MCSat-based Finite Field Reasoning in the Yices2 SMT Solver
Fuente:
arXiv
Saved in:
| Main Authors: | Hader, Thomas, Kaufmann, Daniela, Irfan, Ahmed, Graham-Lengrand, Stéphane, Kovács, Laura |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Boosting MCSat Modulo Nonlinear Integer Arithmetic via Local Search
by: Lipparini, Enrico, et al.
Published: (2025)
by: Lipparini, Enrico, et al.
Published: (2025)
An SMT-LIB Theory of Finite Fields
by: Hader, Thomas, et al.
Published: (2024)
by: Hader, Thomas, et al.
Published: (2024)
LLM2SMT: Building an SMT Solver with Zero Human-Written Code
by: Janota, Mikoláš, et al.
Published: (2026)
by: Janota, Mikoláš, et al.
Published: (2026)
System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers
by: Bartholomew, Michael, et al.
Published: (2025)
by: Bartholomew, Michael, et al.
Published: (2025)
PolySAT: Word-level Bit-vector Reasoning in Z3
by: Rath, Jakob, et al.
Published: (2024)
by: Rath, Jakob, et al.
Published: (2024)
Towards SMT Solver Stability via Input Normalization
by: Amrollahi, Daneshvar, et al.
Published: (2024)
by: Amrollahi, Daneshvar, et al.
Published: (2024)
Integer Reasoning Modulo Different Constants in SMT
by: Pertseva, Elizaveta, et al.
Published: (2025)
by: Pertseva, Elizaveta, et al.
Published: (2025)
Portus: Linking Alloy with SMT-based Finite Model Finding
by: Dancy, Ryan, et al.
Published: (2024)
by: Dancy, Ryan, et al.
Published: (2024)
Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles
by: Davis, Liam, et al.
Published: (2025)
by: Davis, Liam, et al.
Published: (2025)
Loop Invariant Generation: A Hybrid Framework of Reasoning optimised LLMs and SMT Solvers
by: Bharti, Varun, et al.
Published: (2025)
by: Bharti, Varun, et al.
Published: (2025)
Lean-SMT: An SMT tactic for discharging proof goals in Lean
by: Mohamed, Abdalrhman, et al.
Published: (2025)
by: Mohamed, Abdalrhman, et al.
Published: (2025)
Invariant Checking for SMT-based Systems with Quantifiers
by: Redondi, Gianluca, et al.
Published: (2024)
by: Redondi, Gianluca, et al.
Published: (2024)
Rewriting and Inductive Reasoning
by: Hajdu, Márton, et al.
Published: (2024)
by: Hajdu, Márton, et al.
Published: (2024)
Automated Verification of Silq Quantum Programs using SMT Solvers
by: Lewis, Marco, et al.
Published: (2024)
by: Lewis, Marco, et al.
Published: (2024)
An SMT Theory for n-Indexed Sequences
by: Hara, Hichem Rami Ait El, et al.
Published: (2024)
by: Hara, Hichem Rami Ait El, et al.
Published: (2024)
On SMT Theory Design: The Case of Sequences
by: Hara, Hichem Rami Ait El, et al.
Published: (2024)
by: Hara, Hichem Rami Ait El, et al.
Published: (2024)
Efficient Volume Computation for SMT Formulas
by: Shaw, Arijit, et al.
Published: (2025)
by: Shaw, Arijit, et al.
Published: (2025)
Hint-Based SMT Proof Reconstruction
by: Clune, Joshua, et al.
Published: (2026)
by: Clune, Joshua, et al.
Published: (2026)
Life span of SAT techniques
by: Fleury, Mathias, et al.
Published: (2024)
by: Fleury, Mathias, et al.
Published: (2024)
Number theory combination: natural density and SMT
by: Toledo, Guilherme V., et al.
Published: (2025)
by: Toledo, Guilherme V., et al.
Published: (2025)
SMT-Layout: A MaxSMT-based Approach Supporting Real-time Interaction of Real-world GUI Layout
by: Li, Bohan, et al.
Published: (2024)
by: Li, Bohan, et al.
Published: (2024)
Towards Learning Infinite SMT Models (Work in Progress)
by: Janota, Mikoláš, et al.
Published: (2025)
by: Janota, Mikoláš, et al.
Published: (2025)
SMT with Uninterpreted Functions and Monotonicity Constraints in Systems Biology
by: Huvar, Ondřej, et al.
Published: (2026)
by: Huvar, Ondřej, et al.
Published: (2026)
A Hybrid SMT-NRA Solver: Integrating 2D Cell-Jump-Based Local Search, MCSAT and OpenCAD
by: Ding, Tianyi, et al.
Published: (2025)
by: Ding, Tianyi, et al.
Published: (2025)
Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2024)
by: Spallitta, Giuseppe, et al.
Published: (2024)
A Relational Theory of Grounding and a new Grounder for SMT
by: Carbonnelle, Pierre
Published: (2026)
by: Carbonnelle, Pierre
Published: (2026)
Synthesiz3 This: an SMT-Based Approach for Synthesis with Uncomputable Symbols
by: Hozzová, Petra, et al.
Published: (2025)
by: Hozzová, Petra, et al.
Published: (2025)
Extracting Linear Relations from Gröbner Bases for Formal Verification of And-Inverter Graphs
by: Kaufmann, Daniela, et al.
Published: (2024)
by: Kaufmann, Daniela, et al.
Published: (2024)
Positive Almost-Sure Termination of Polynomial Random Walks
by: Winkler, Lorenz, et al.
Published: (2025)
by: Winkler, Lorenz, et al.
Published: (2025)
SMT and Functional Equation Solving over the Reals: Challenges from the IMO
by: Brown, Chad E., et al.
Published: (2025)
by: Brown, Chad E., et al.
Published: (2025)
A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
by: Arias, Jaime, et al.
Published: (2024)
by: Arias, Jaime, et al.
Published: (2024)
Synthesis Benchmarks for Automated Reasoning
by: Hajdu, Márton, et al.
Published: (2025)
by: Hajdu, Márton, et al.
Published: (2025)
An Encoding for CLP Problems in SMT-LIB
by: Amrollahi, Daneshvar, et al.
Published: (2024)
by: Amrollahi, Daneshvar, et al.
Published: (2024)
SMT(LIA) Sampling with High Diversity
by: Lai, Yong, et al.
Published: (2025)
by: Lai, Yong, et al.
Published: (2025)
A Local Search Algorithm for MaxSMT(LIA)
by: He, Xiang, et al.
Published: (2024)
by: He, Xiang, et al.
Published: (2024)
'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions
by: Judson, Samuel, et al.
Published: (2023)
by: Judson, Samuel, et al.
Published: (2023)
Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT
by: Civini, Emanuele, et al.
Published: (2026)
by: Civini, Emanuele, et al.
Published: (2026)
Approximate SMT Counting Beyond Discrete Domains
by: Shaw, Arijit, et al.
Published: (2025)
by: Shaw, Arijit, et al.
Published: (2025)
CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model
by: Jeanteur, Simon, et al.
Published: (2023)
by: Jeanteur, Simon, et al.
Published: (2023)
Spanning Matrices via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2024)
by: Eisenhofer, Clemens, et al.
Published: (2024)
Similar Items
-
Boosting MCSat Modulo Nonlinear Integer Arithmetic via Local Search
by: Lipparini, Enrico, et al.
Published: (2025) -
An SMT-LIB Theory of Finite Fields
by: Hader, Thomas, et al.
Published: (2024) -
LLM2SMT: Building an SMT Solver with Zero Human-Written Code
by: Janota, Mikoláš, et al.
Published: (2026) -
System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers
by: Bartholomew, Michael, et al.
Published: (2025) -
PolySAT: Word-level Bit-vector Reasoning in Z3
by: Rath, Jakob, et al.
Published: (2024)