Tootfinder

A New Family of Thread to Core Allocation Policies for an SMT ARM Processor
Marta Navarro, Josu\'e Feliu, Salvador Petit, Mar\'ia E. G\'omez, Julio Sahuquillo
https://arxiv.org/abs/2507.00855

A New Family of Thread to Core Allocation Policies for an SMT ARM Processor
Modern high-performance servers commonly integrate Simultaneous Multithreading (SMT) processors, which efficiently boosts throughput over single-threaded cores. Optimizing performance in SMT processors faces challenges due to the inter-application interference within each SMT core. To mitigate the interference, thread-to-core (T2C) allocation policies play a pivotal role. State-of-the-art T2C policies work in two steps: i) building a per-application performance stack using performance counters …

SMT-Sweep: Word-Level Representation Unification for Hardware Verification
Ziyi Yang, Guangyu Hu, Mingkai Miao, Changyuan Yu, Hongce Zhang
https://arxiv.org/abs/2507.02008

SMT-Sweep: Word-Level Representation Unification for Hardware Verification
SAT sweeping has long been a cornerstone technique in logic simplification and equivalence checking at the bit level, leveraging structural hashing, simulation and SAT solving to prune redundant logic. However, with the growing adoption of word-level constructs in hardware verification, such as bit-vector operations, arithmetics and arrays, there lacks a counterpart of SAT sweeping at the word level. In this paper, we introduce SMT-Sweep, a novel extension of SAT sweeping into the word level, g…

Accelerating Latency-Critical Applications with AI-Powered Semi-Automatic Fine-Grained Parallelization on SMT Processors
Denis Los, Igor Petushkov
https://arxiv.org/abs/2509.00883

Accelerating Latency-Critical Applications with AI-Powered Semi-Automatic Fine-Grained Parallelization on SMT Processors
Latency-critical applications tend to show low utilization of functional units due to frequent cache misses and mispredictions during speculative execution in high-performance superscalar processors. However, due to significant impact on single-thread performance, Simultaneous Multithreading (SMT) technology is rarely used with heavy threads of latency-critical applications. In this paper, we explore utilization of SMT technology to support fine-grained parallelization of latency-critical appli…

ON SEMI MICROFC-60035-SMT-TR1 6mm square SIPM. This is the photodetector used in the Radiacode (or a very close cousin of it).
Full die (Mitutoyo 5x)
https://siliconpr0n.org/map/onsemi/microfc-60035-smt/azonenberg_mz_mit5x/
Full die…

Decision Procedure for A Theory of String Sequences
Denghang Hu, Taolue Chen, Philipp R\"ummer, Fu Song, Zhilin Wu
https://arxiv.org/abs/2509.00948 https://

Decision Procedure for A Theory of String Sequences
The theory of sequences, supported by many SMT solvers, can model program data types including bounded arrays and lists. Sequences are parameterized by the element data type and provide operations such as accessing elements, concatenation, forming sub-sequences and updating elements. Strings and sequences are intimately related; many operations, e.g., matching a string according to a regular expression, splitting strings, or joining strings in a sequence, are frequently used in string-manipulat…

Boosting Skeleton-Driven SMT Solver Fuzzing by Leveraging LLM to Produce Formula Generators
Maolin Sun, Yibiao Yang, Yuming Zhou
https://arxiv.org/abs/2508.20340 https://…

Boosting Skeleton-Driven SMT Solver Fuzzing by Leveraging LLM to Produce Formula Generators
Satisfiability Modulo Theory (SMT) solvers are foundational to modern systems and programming languages research, providing the foundation for tasks like symbolic execution and automated verification. Because these solvers sit on the critical path, their correctness is essential, and high-quality test formulas are key to uncovering bugs. However, while prior testing techniques performed well on earlier solver versions, they struggle to keep pace with rapidly evolving features. Recent approaches…

Projective Delineability for Single Cell Construction
Jasper Nalbach, Lucas Michel, Erika \'Abrah\'am, Christopher W. Brown, James H. Davenport, Matthew England, Pierre Mathonet, Na\"im Z\'ena\"idi
https://arxiv.org/abs/2508.00512

Projective Delineability for Single Cell Construction
The cylindrical algebraic decomposition (CAD) is the only complete method used in practice for solving problems like quantifier elimination or SMT solving related to real algebra, despite its doubly exponential complexity. Recent exploration-guided algorithms like NLSAT, NuCAD, and CAlC rely on CAD technology but reduce the computational effort heuristically. Single cell construction is a paradigm that is used in each of these algorithms. The central property on which the CAD algorithm is bas…

The Vampire Diary
Filip B\'artek, Ahmed Bhayat, Robin Coutelier, M\'arton Hajdu, Matthias Hetzenberger, Petra Hozzov\'a, Laura Kov\'acs, Jakob Rath, Michael Rawson, Giles Reger, Martin Suda, Johannes Schoisswohl, Andrei Voronkov
https://arxiv.org/abs/2506.03030

The Vampire Diary
During the past decade of continuous development, the theorem prover Vampire has become an automated solver for the combined theories of commonly-used data structures. Vampire now supports arithmetic, induction, and higher-order logic. These advances have been made to meet the demands of software verification, enabling Vampire to effectively complement SAT/SMT solvers and aid proof assistants. We explain how best to use Vampire in practice and review the main changes Vampire has undergone since…

Verifying Probabilistic Regions of Attraction with Neural Lyapunov Functions for Stochastic Systems
Yun Su, Hans De Sterck, Jun Liu
https://arxiv.org/abs/2508.21213 https://

Verifying Probabilistic Regions of Attraction with Neural Lyapunov Functions for Stochastic Systems
Leveraging a stochastic extension of Zubov's equation, we develop a physics-informed neural network (PINN) approach for learning a neural Lyapunov function that captures the largest probabilistic region of attraction (ROA) for stochastic systems. We then provide sufficient conditions for the learned neural Lyapunov functions that can be readily verified by satisfiability modulo theories (SMT) solvers, enabling formal verification of both local stability analysis and probabilistic ROA estimates.…

A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
Jasper Nalbach, Erika \'Abrah\'am
https://arxiv.org/abs/2508.00505 https://

A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponential complexity, different exploration-guided adaptations try to avoid some of the computations. The first such adaptation named NLSAT was followed by Non-uniform CAD (NuCAD) and the Cylindrical Algebraic Covering (CAlC). Both NLSAT and CAlC have been developed and implemented in SMT solvers for satisfiability checkin…

Approximate SMT Counting Beyond Discrete Domains
Arijit Shaw, Kuldeep S. Meel
https://arxiv.org/abs/2507.18612 https://arxiv.org/pdf/2507.18612

Approximate SMT Counting Beyond Discrete Domains
Satisfiability Modulo Theory (SMT) solvers have advanced automated reasoning, solving complex formulas across discrete and continuous domains. Recent progress in propositional model counting motivates extending SMT capabilities toward model counting, especially for hybrid SMT formulas. Existing approaches, like bit-blasting, are limited to discrete variables, highlighting the challenge of counting solutions projected onto the discrete domain in hybrid formulas. We introduce pact, an SMT model…

The Arizona Molecular ISM Survey with the SMT: The Diverse Carbon Monoxide Line Ratios and Spectral Line Energy Distributions of Star Forming Galaxies
Ryan P. Keenan, Daniel P. Marrone, Garrett K. Keating
https://arxiv.org/abs/2507.18823

The Arizona Molecular ISM Survey with the SMT: The Diverse Carbon Monoxide Line Ratios and Spectral Line Energy Distributions of Star Forming Galaxies
The carbon monoxide (CO) spectral line energy distributions (SLEDs) of galaxies contain a wealth of information about conditions in their cold interstellar gas. Here we use galaxy-scale observations of the three lowest energy CO lines to determine SLEDs and line ratios in a sample of 47 nearby, predominantly star forming galaxies. We find systematic trend of higher gas excitation with increasing star formation rate (SFR) and SFR surface density ($Σ_{\rm SFR}$), with the range of variations bei…

PuzzleClone: An SMT-Powered Framework for Synthesizing Verifiable Data
Kai Xiong, Yanwei Huang, Rongjunchen Zhang, Kun Chen, Haipang Wu
https://arxiv.org/abs/2508.15180 https://…

PuzzleClone: An SMT-Powered Framework for Synthesizing Verifiable Data
High-quality mathematical and logical datasets with verifiable answers are essential for strengthening the reasoning capabilities of large language models (LLMs). While recent data augmentation techniques have facilitated the creation of large-scale benchmarks, existing LLM-generated datasets often suffer from limited reliability, diversity, and scalability. To address these challenges, we introduce PuzzleClone, a formal framework for synthesizing verifiable data at scale using Satisfiability M…

From MBQI to Enumerative Instantiation and Back
Marek Dan\v{c}o, Petra Hozzov\'a, Mikol\'a\v{s} Janota
https://arxiv.org/abs/2506.22584 https://

From MBQI to Enumerative Instantiation and Back
This work investigates the relation between model-based quantifier instantiation (MBQI) and enumerative instantiation (EI) in Satisfiability Modulo Theories (SMT). MBQI operates at the semantic level and guarantees to find a counterexample to a given a non-model. However, it may lead to weak instantiations. In contrast, EI strives for completeness by systematically enumerating terms at the syntactic level. However, such terms may not be counter-examples. Here we investigate the relation between…

Crosslisted article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Boosting Skeleton-Driven SMT Solver Fuzzing by Leveraging LLM to Produce Formula Generators
Maolin Sun, Yibiao Yang, Yuming Zhou

CPED-NCBFs: A Conformal Prediction for Expert Demonstration-based Neural Control Barrier Functions
Sumeadh MS, Kevin Dsouza, Ravi Prakash
https://arxiv.org/abs/2507.15022

CPED-NCBFs: A Conformal Prediction for Expert Demonstration-based Neural Control Barrier Functions
Among the promising approaches to enforce safety in control systems, learning Control Barrier Functions (CBFs) from expert demonstrations has emerged as an effective strategy. However, a critical challenge remains: verifying that the learned CBFs truly enforce safety across the entire state space. This is especially difficult when CBF is represented using neural networks (NCBFs). Several existing verification techniques attempt to address this problem including SMT-based solvers, mixed-integer …

Symbolic Reduction for Formal Synthesis of Global Lyapunov Functions
Jun Liu, Maxwell Fitzsimmons
https://arxiv.org/abs/2506.18171 https://

Symbolic Reduction for Formal Synthesis of Global Lyapunov Functions
We investigate the formal synthesis of global polynomial Lyapunov functions for polynomial vector fields. We establish that a sign-definite polynomial must satisfy specific algebraic constraints, which we leverage to develop a set of straightforward symbolic reduction rules. These rules can be recursively applied to symbolically simplify the Lyapunov candidate, enabling more efficient and robust discovery of Lyapunov functions via optimization or satisfiability modulo theories (SMT) solving. In…

An ACL2s Interface to Z3
Andrew T. Walter (Northeastern University), Panagiotis Manolios (Northeastern University)
https://arxiv.org/abs/2507.19014 https://

An ACL2s Interface to Z3
We present Lisp-Z3, an extension to the ACL2s systems programming framework (ASPF) that supports the use of the Z3 satisfiability modulo theories (SMT) solver. Lisp-Z3 allows one to develop tools written using the full feature set of Common Lisp that can use both ACL2/s (either ACL2 or ACL2s) and Z3 as services, combining the power of SMT and interactive theorem proving. Lisp-Z3 is usable by anyone who would like to interact with Z3 from Common Lisp, as it does not depend on the availability of…

Solvable Tuple Patterns and Their Applications to Program Verification
Naoki Kobayashi, Ryosuke Sato, Ayumi Shinohara, Ryo Yoshinaka
https://arxiv.org/abs/2508.20365 https://

Solvable Tuple Patterns and Their Applications to Program Verification
Despite the recent progress of automated program verification techniques, fully automated verification of programs manipulating recursive data structures remains a challenge. We introduce the notion of solvable tuple patterns (STPs) to express invariants between list-like recursive data structures. A distinguishing feature of STPs is that they can be efficiently inferred from only a small number of positive samples; no negative samples are required. An SMT solver that supports the sequence theo…

Efficient Volume Computation for SMT Formulas
Arijit Shaw, Uddalok Sarkar, Kuldeep S. Meel
https://arxiv.org/abs/2508.09934 https://arxiv.org/pdf/2508.0993…

Efficient Volume Computation for SMT Formulas
Satisfiability Modulo Theory (SMT) has recently emerged as a powerful tool for solving various automated reasoning problems across diverse domains. Unlike traditional satisfiability methods confined to Boolean variables, SMT can reason on real-life variables like bitvectors, integers, and reals. A natural extension in this context is to ask quantitative questions. One such query in the SMT theory of Linear Real Arithmetic (LRA) is computing the volume of the entire satisfiable region defined by…

NP-Completeness of Multicast Beamforming in Wireless Communication
Sagar Shrestha
https://arxiv.org/abs/2508.12241 https://arxiv.org/pdf/2508.12241

NP-Completeness of Multicast Beamforming in Wireless Communication
In this work, the classical problem of multi-cast beamforming in wireless communication is reconsidered. An existing work has shown that the multi-cast beamforming problem is NP-hard. In this project, we show that the corresponding decision problem for real channel matrices and beamformers is NP-complete. Finally, we carry out simulations to reveal the computational complexity of solving the NP-complete beamforming problem in various setting using SAT/SMT solvers.

LLM-based Satisfiability Checking of String Requirements by Consistent Data and Checker Generation
Boqi Chen, Aren A. Babikian, Shuzhao Feng, D\'aniel Varr\'o, Gunter Mussbacher
https://arxiv.org/abs/2506.16639

LLM-based Satisfiability Checking of String Requirements by Consistent Data and Checker Generation
Requirements over strings, commonly represented using natural language (NL), are particularly relevant for software systems due to their heavy reliance on string data manipulation. While individual requirements can usually be analyzed manually, verifying properties (e.g., satisfiability) over sets of NL requirements is particularly challenging. Formal approaches (e.g., SMT solvers) may efficiently verify such properties, but are known to have theoretical limitations. Additionally, the translati…

Quantifier Instantiations: To Mimic or To Revolt?
Jan Jakub\r{u}v, Mikol\'a\v{s} Janota
https://arxiv.org/abs/2508.13811 https://arxiv.org/pdf/2508.138…

Quantifier Instantiations: To Mimic or To Revolt?
Quantified formulas pose a significant challenge for Satisfiability Modulo Theories (SMT) solvers due to their inherent undecidability. Existing instantiation techniques, such as e-matching, syntax-guided, model-based, conflict-based, and enumerative methods, often complement each other. This paper introduces a novel instantiation approach that dynamically learns from these techniques during solving. By treating observed instantiations as samples from a latent language, we use probabilistic con…

Z3Guide: A Scalable, Student-Centered, and Extensible Educational Environment for Logic Modeling
Ruanqianqian Huang, Ayana Monroe, Peli de Halleux, Sorin Lerner, Nikolaj Bj{\o}rner
https://arxiv.org/abs/2506.08294

Z3Guide: A Scalable, Student-Centered, and Extensible Educational Environment for Logic Modeling
Constraint-satisfaction problems (CSPs) are ubiquitous, ranging from budgeting for grocery shopping to verifying software behavior. Logic modeling helps solve CSPs programmatically using SMT solvers. Despite its importance in many Computer Science disciplines, resources for teaching and learning logic modeling are scarce and scattered, and challenges remain in designing educational environments for logic modeling that are accessible and meet the needs of teachers and students. This paper explor…

Solving Set Constraints with Comprehensions and Bounded Quantifiers
Mudathir Mohamed, Nick Feng, Andrew Reynolds, Cesare Tinelli, Clark Barrett, Marsha Chechik
https://arxiv.org/abs/2508.08496

Solving Set Constraints with Comprehensions and Bounded Quantifiers
Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have been developed to tackle this. However, SMT solvers still struggle with quantified formulas generated by some applications. In this paper, we discuss the use of set-bounded quantifiers, quantifiers whose variable ranges over a finite set. These quantifiers can…

OSTRICH2: Solver for Complex String Constraints
Matthew Hague, Denghang Hu, Artur Je\.z, Anthony W. Lin, Oliver Markgraf, Philipp R\"ummer, Zhilin Wu
https://arxiv.org/abs/2506.14363

OSTRICH2: Solver for Complex String Constraints
We present OSTRICH2, the latest evolution of the SMT solver OSTRICH for string constraints. OSTRICH2 supports a wide range of complex functions on strings and provides completeness guarantees for a substantial fragment of string constraints, including the straight-line fragment and the chain-free fragment. OSTRICH2 provides full support for the SMT-LIB theory of Unicode strings, extending the standard with several unique features not found in other solvers: among others, parsing of ECMAScript r…

Replaced article(s) found for cs.SC. https://arxiv.org/list/cs.SC/new
[1/1]:
- A Hybrid SMT-NRA Solver: Integrating 2D Cell-Jump-Based Local Search, MCSAT and OpenCAD
Tianyi Ding, Haokun Li, Xinpeng Ni, Bican Xia, Tianqi Zhao

Loop Invariant Generation: A Hybrid Framework of Reasoning optimised LLMs and SMT Solvers
Varun Bharti, Shashwat Jha, Dhruv Kumar, Pankaj Jalote
https://arxiv.org/abs/2508.00419

Loop Invariant Generation: A Hybrid Framework of Reasoning optimised LLMs and SMT Solvers
Loop invariants are essential for proving the correctness of programs with loops. Developing loop invariants is challenging, and fully automatic synthesis cannot be guaranteed for arbitrary programs. Some approaches have been proposed to synthesize loop invariants using symbolic techniques and more recently using neural approaches. These approaches are able to correctly synthesize loop invariants only for subsets of standard benchmarks. In this work, we investigate whether modern, reasoning-opt…

Heterogeneous Dynamic Logic: Provability Modulo Program Theories
Samuel Teuber, Mattias Ulbrich, Andr\'e Platzer, Bernhard Beckert
https://arxiv.org/abs/2507.08581

Heterogeneous Dynamic Logic: Provability Modulo Program Theories
Formally specifying, let alone verifying, properties of systems involving multiple programming languages is inherently challenging. We introduce Heterogeneous Dynamic Logic (HDL), a framework for combining reasoning principles from distinct (dynamic) program logics in a modular and compositional way. HDL mirrors the architecture of satisfiability modulo theories (SMT): Individual dynamic logics, along with their calculi, are treated as dynamic theories that can be flexibly combined to reason ab…