Suchergebnisse - "Symbolic and algebraic algorithms"
-
1
Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling
ISSN: 1558-2434Veröffentlicht: ACM 29.10.2022Veröffentlicht in 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) (29.10.2022)“… 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
Tagungsbericht -
2
A Logic for Locally Complete Abstract Interpretations
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… 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
Tagungsbericht -
3
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, …”
Volltext
Tagungsbericht -
4
This is the moment for probabilistic loops
ISSN: 2475-1421, 2475-1421Veröffentlicht: New York, NY, USA ACM 31.10.2022Veröffentlicht in Proceedings of ACM on programming languages (31.10.2022)“… We present a novel static analysis technique to derive higher moments for program variables for a large class of probabilistic loops with potentially …”
Volltext
Journal Article -
5
Leveraging Critical Proof Obligations for Efficient IC3 Verification
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… 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
Tagungsbericht -
6
QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning
ISSN: 1558-1225Veröffentlicht: IEEE 26.04.2025Veröffentlicht in Proceedings / International Conference on Software Engineering (26.04.2025)“… Formal verification is a promising method for producing reliable software, but the difficulty of manually writing verification proofs severely limits its …”
Volltext
Tagungsbericht -
7
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… 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
Tagungsbericht -
8
First-Order Reasoning and Efficient Semi-Algebraic Proofs
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… 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
Tagungsbericht -
9
CoqPilot, a plugin for LLM-based generation of proofs
ISSN: 2643-1572Veröffentlicht: ACM 27.10.2024Veröffentlicht in IEEE/ACM International Conference on Automated Software Engineering : [proceedings] (27.10.2024)“… 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
Tagungsbericht -
10
A Solver‐Aided Hierarchical Language for LLM‐Driven CAD Design
ISSN: 0167-7055, 1467-8659Veröffentlicht: Oxford Blackwell Publishing Ltd 01.10.2025Veröffentlicht in Computer graphics forum (01.10.2025)“… Parametric CAD systems use domain‐specific languages (DSLs) to represent geometry as programs, enabling both flexible modeling and structured editing. With the …”
Volltext
Journal Article -
11
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics
ISSN: 2475-1421, 2475-1421Veröffentlicht: New York, NY, USA ACM 06.06.2023Veröffentlicht in Proceedings of ACM on programming languages (06.06.2023)“… We develop a new derivative based theory and algorithm for nonbacktracking regex matching that supports anchors and counting, preserves backtracking semantics, …”
Volltext
Journal Article -
12
Pipirima: Predicting Patterns in Sparsity to Accelerate Matrix Algebra
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… While sparsity, a feature of data in many applications, provides optimization opportunities such as reducing unnecessary computations, data transfers, and …”
Volltext
Tagungsbericht -
13
Learning-Aided Safe Controller Synthesis with Formal Guarantees via Vector Barrier Certificates
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… The design of controllers for safety-critical systems is an important research issue. Especially, the generation of controllers with formal safety guarantees …”
Volltext
Tagungsbericht -
14
ReSMiPS: A ReRAM-based Sparse Mixed-precision Solver with Fast Matrix Reordering Algorithm
Veröffentlicht: IEEE 22.06.2025Veröffentlicht in 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… The solution of sparse matrix equations is essential in scientific computing. However, traditional solvers on digital computing platforms are limited by memory …”
Volltext
Tagungsbericht -
15
AI-Assisted Autoformalization of Combinatorics Problems in Proof Assistants
ISSN: 2832-7632Veröffentlicht: IEEE 27.04.2025Veröffentlicht in IEEE/ACM International Conference on Software Engineering: New Ideas and Emerging Technologies Results (Online) (27.04.2025)“… Proof assistants such as Coq and LEAN have been increasingly used by renowned mathematicians to formalize and prove mathematical theorems. Despite their …”
Volltext
Tagungsbericht -
16
Some constructive variants of S4 with the finite model property
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… 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
Tagungsbericht -
17
Harnessing GPU Tensor Cores for Fast FP16 Arithmetic to Speed up Mixed-Precision Iterative Refinement Solvers
Veröffentlicht: IEEE 01.11.2018Veröffentlicht in SC18: International Conference for High Performance Computing, Networking, Storage and Analysis (01.11.2018)“… Low-precision floating-point arithmetic is a powerful tool for accelerating scientific computing applications, especially those in artificial intelligence …”
Volltext
Tagungsbericht -
18
Separating Rank Logic from Polynomial Time
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… 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
Tagungsbericht -
19
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes
Veröffentlicht: IEEE 29.06.2021Veröffentlicht in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem …”
Volltext
Tagungsbericht -
20
Decictor: Towards Evaluating the Robustness of Decision-Making in Autonomous Driving Systems
ISSN: 1558-1225Veröffentlicht: IEEE 26.04.2025Veröffentlicht in Proceedings / International Conference on Software Engineering (26.04.2025)“… Autonomous Driving System (ADS) testing is crucial in ADS development, with the current primary focus being on safety. However, the evaluation of …”
Volltext
Tagungsbericht