Suchergebnisse - Computing methodologies → Algebraic algorithms Algorithms

Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling von Soos, Mate, Meel, Kuldeep S.

“… Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent …”
Volltext

First-Order Reasoning and Efficient Semi-Algebraic Proofs von Part, Fedor, Thapen, Neil, Tzameret, Iddo

“… Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3 …”
Volltext

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP von Barto, Libor, Brady, Zarathustra, Bulatov, Andrei, Kozik, Marcin, Zhuk, Dmitriy

“… This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP …”
Volltext

ReSMiPS: A ReRAM-based Sparse Mixed-precision Solver with Fast Matrix Reordering Algorithm von Fu, Yuyang, Li, Jiancong, Chen, Jia, Zhou, Zhiwei, Zhou, Houji, Peng, Wenlong, Li, Yi, Miao, Xiangshui

“… The solution of sparse matrix equations is essential in scientific computing. However, traditional solvers on digital computing platforms are limited by memory bottlenecks in largescale sparse matrix storage and computation …”
Volltext

Pipirima: Predicting Patterns in Sparsity to Accelerate Matrix Algebra von Bakhtiar, Ubaid, Joo, Donghyeon, Asgari, Bahar

“… While sparsity, a feature of data in many applications, provides optimization opportunities such as reducing unnecessary computations, data transfers, and …”
Volltext

QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning von Sanchez-Stern, Alex, Varghese, Abhishek, Kaufman, Zhanna, Zhang, Dylan, Ringer, Talia, Brun, Yuriy

“… Formal verification is a promising method for producing reliable software, but the difficulty of manually writing verification proofs severely limits its …”
Volltext

SpV8: Pursuing Optimal Vectorization and Regular Computation Pattern in SpMV von Li, Chenyang, Xia, Tian, Zhao, Wenzhe, Zheng, Nanning, Ren, Pengju

“… We evaluate SpV8 on Intel Xeon CPU and compare with multiple state-of-art SpMV algorithms using 71 sparse matrices …”
Volltext

Decictor: Towards Evaluating the Robustness of Decision-Making in Autonomous Driving Systems von Cheng, Mingfei, Xie, Xiaofei, Zhou, Yuan, Wang, Junjie, Meng, Guozhu, Yang, Kairui

“… Autonomous Driving System (ADS) testing is crucial in ADS development, with the current primary focus being on safety. However, the evaluation of …”
Volltext

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments von Jung, Jean Christoph, Wolter, Frank

“… In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In …”
Volltext

A Logic for Locally Complete Abstract Interpretations von Bruni, Roberto, Giacobazzi, Roberto, Gori, Roberta, Ranzato, Francesco

“… We introduce the notion of local completeness in abstract interpretation and define a logic for proving both the correctness and incorrectness of some program …”
Volltext

AI-Assisted Autoformalization of Combinatorics Problems in Proof Assistants von Doan, Long, Nguyen, ThanhVu

“… Proof assistants such as Coq and LEAN have been increasingly used by renowned mathematicians to formalize and prove mathematical theorems. Despite their …”
Volltext

Learning-Aided Safe Controller Synthesis with Formal Guarantees via Vector Barrier Certificates von Zeng, Xia, Ren, Mengxin, Liu, Zhiming, Yang, Zhengfeng

“… The design of controllers for safety-critical systems is an important research issue. Especially, the generation of controllers with formal safety guarantees …”
Volltext

Separating Rank Logic from Polynomial Time von Lichter, Moritz

“… In the search for a logic capturing polynomial time the most promising candidates are Choiceless Polynomial Time (CPT) and rank logic. Rank logic extends …”
Volltext

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic von Zhou, Li, Barthe, Gilles, Hsu, Justin, Ying, Mingsheng, Yu, Nengkun

“… on the Variational Quantum Algorithm (VQA) …”
Volltext

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes von Dreier, Jan

“… The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem …”
Volltext

Some constructive variants of S4 with the finite model property von Balbiani, Philippe, Dieguez, Martin, Fernandez-Duque, David

“… The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a …”
Volltext

Leveraging Critical Proof Obligations for Efficient IC3 Verification von Zhu, Lingfeng, Zhang, Xindi, Li, Yongjian, Cai, Shaowei

“… IC3 and its variants are SAT-based model-checking methods that play a critical role in hardware verification. Efficient management of proof obligations, which …”
Volltext

Harnessing GPU Tensor Cores for Fast FP16 Arithmetic to Speed up Mixed-Precision Iterative Refinement Solvers von Haidar, Azzam, Tomov, Stanimire, Dongarra, Jack, Higham, Nicholas J.

“… Low-precision floating-point arithmetic is a powerful tool for accelerating scientific computing applications, especially those in artificial intelligence …”
Volltext

CoqPilot, a plugin for LLM-based generation of proofs von Kozyrev, Andrei, Solovev, Gleb, Khramov, Nikita, Podkopaev, Anton

“… We present CoqPilot, a VS Code extension designed to help automate writing of Coq proofs. The plugin collects the parts of proofs marked with the admit tactic …”
Volltext

FSPA: An FeFET-based Sparse Matrix-Dense Vector Multiplication Accelerator von Zhang, Xiaoyu, Li, Zerun, Liu, Rui, Chen, Xiaoming, Han, Yinhe

“… The performance of traditional SpMV accelerators is bounded by memory. In-memory computing (IMC) is a promising technique to alleviate the memory bottleneck …”
Volltext