Tootfinder

Verification of the Timing System for the X-ray Imaging and Spectroscopy Mission in the GPS Unsynchronized Mode
Megumi Shidatsu, Yukikatsu Terada, Takashi Kominato, So Kato, Ryohei Sato, Minami Sakama, Takumi Shioiri, Yugo Motogami, Yuuki Niida, Chulsoo Kang, Toshihiro Takagi, Taichi Nakamoto, Chikara Natsukari, Makoto S. Tashiro, Kenichi Toda, Hironori Maejima, Shin Watanabe, Ryo Iizuka, Rie Sato, Chris Baluta, Katsuhiro Hayashi, Tessei Yoshida, Shoji Ogawa, Yoshiaki Kanemaru, Kotaro Fukushima, Akio Hoshino, Hiromitsu Takahashi, Masayoshi Nobukawa, Tsunefumi Mizuno, Kazuhiro Nakazawa, Shinichiro Uno, Ken Ebisawa, Satoshi Eguchi, Satoru Katsuda, Aya Kubota, Naomi Ota, Atsushi Tanimoto, Yuichi Terashima, Yohko Tsuboi, Yuusuke Uchida, Hideki Uchiyama, Shigeo Yamauchi, Tomokage Yoneyama, Satoshi Yamada, Nagomi Uchida, Matt Holland, Michael Loewenstein, Tahir Yaqoob, Eric D. Miller, Robert S. Hill, Efrain C. Perez-Solis, Morgan D. Waddy, Mark Mekosh, Joseph B. Fox, Isabella S. Brewer, Emily Aldoretta, Koji Mukai, Kenji Hamaguchi, Francois Mernier, Anna Ogorzalek, Katja Pottschmidt, Mihoko Yukita
#toXiv_bot_toot

This https://arxiv.org/abs/2506.01832 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Pseudorandom bits for non-commutative programs
We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n g_i^{x_i}$ where $g_i\in G$, a special case of read-once permutation branching programs. We give generators with optimal seed length $c_G \log(n/\varepsilon)$ over any $p$-group. The proof uses the small-bias plus noise paradigm, but derandomizes the noise to av…

Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
Zhiwei Zhang, Samy Wu Fung, Anastasios Kyrillidis, Stanley Osher, Moshe Y. Vardi
https://arxiv.org/abs/2506.00674

Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
The Boolean satisfiability (SAT) problem lies at the core of many applications in combinatorial optimization, software verification, cryptography, and machine learning. While state-of-the-art solvers have demonstrated high efficiency in handling conjunctive normal form (CNF) formulas, numerous applications require non-CNF (hybrid) constraints, such as XOR, cardinality, and Not-All-Equal constraints. Recent work leverages polynomial representations to represent such hybrid constraints, but it re…

Veritas: Deterministic Verilog Code Synthesis from LLM-Generated Conjunctive Normal Form
Prithwish Basu Roy, Akashdeep Saha, Manaar Alam, Johann Knechtel, Michail Maniatakos, Ozgur Sinanoglu, Ramesh Karri
https://arxiv.org/abs/2506.00005

Veritas: Deterministic Verilog Code Synthesis from LLM-Generated Conjunctive Normal Form
Automated Verilog code synthesis poses significant challenges and typically demands expert oversight. Traditional high-level synthesis (HLS) methods often fail to scale for real-world designs. While large language models (LLMs) have enhanced scalability, they often introduce syntactical and logical errors requiring extensive post-generation verification. Here, we introduce a novel conjunctive normal form (CNF)-guided synthesis methodology. The idea is to have an LLM generate CNF clauses, a form…

Pseudorandom bits for non-commutative programs
Chin Ho Lee, Emanuele Viola
https://arxiv.org/abs/2506.01832 https://arxiv.org/pdf/250…

Pseudorandom bits for non-commutative programs
We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n g_i^{x_i}$ where $g_i\in G$, a special case of read-once permutation branching programs. We give generators with optimal seed length $c_G \log(n/\varepsilon)$ over any $p$-group. The proof uses the small-bias plus noise paradigm, but derandomizes the noise to av…