pith. sign in

cvc5: A Versatile and Industrial-Strength SMT Solver

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

citation-role summary

background 2

citation-polarity summary

verdicts

UNVERDICTED 4

roles

background 2

polarities

background 2

representative citing papers

Certified Program Synthesis with a Multi-Modal Verifier

cs.SE · 2026-04-17 · unverdicted · novelty 7.0

LeetProof achieves higher rates of fully certified program synthesis from natural language by using a multi-modal verifier in Lean to validate specifications via randomized testing and delegate proofs to AI tools, outperforming single-mode baselines on benchmarks while uncovering defects in prior参考.

Soteria: Efficient Symbolic Execution as a Functional Library

cs.PL · 2025-11-11 · unverdicted · novelty 7.0

Soteria is a functional library for building direct symbolic execution engines, demonstrated by the first Rust engine supporting Tree Borrows and a compositional C engine that matches or exceeds prior tools.

Taking Complete Finite Prefixes To High Level, Symbolically

cs.LO · 2023-11-19 · unverdicted · novelty 6.0

Extends complete finite prefixes to symbolic unfoldings of high-level Petri nets by generalizing Esparza et al.'s algorithm for safe nets, with prototype evaluation on four new benchmark families and an extension to certain infinite-marking nets.

citing papers explorer

Showing 4 of 4 citing papers.

  • Certified Program Synthesis with a Multi-Modal Verifier cs.SE · 2026-04-17 · unverdicted · none · ref 6

    LeetProof achieves higher rates of fully certified program synthesis from natural language by using a multi-modal verifier in Lean to validate specifications via randomized testing and delegate proofs to AI tools, outperforming single-mode baselines on benchmarks while uncovering defects in prior参考.

  • Soteria: Efficient Symbolic Execution as a Functional Library cs.PL · 2025-11-11 · unverdicted · none · ref 6

    Soteria is a functional library for building direct symbolic execution engines, demonstrated by the first Rust engine supporting Tree Borrows and a compositional C engine that matches or exceeds prior tools.

  • Taking Complete Finite Prefixes To High Level, Symbolically cs.LO · 2023-11-19 · unverdicted · none · ref 26

    Extends complete finite prefixes to symbolic unfoldings of high-level Petri nets by generalizing Esparza et al.'s algorithm for safe nets, with prototype evaluation on four new benchmark families and an extension to certain infinite-marking nets.

  • TACO: A Toolsuite for the Verification of Threshold Automata cs.DC · 2026-05-07 · unverdicted · none · ref 4

    TACO provides a modular toolsuite with three model checkers for decidable threshold automata fragments and two semi-decision procedures for broader cases.