sweap is a CEGAR-based tool for infinite-state reactive synthesis over linear integer arithmetic that supports multiple input formats and outperforms the prior ISSY tool in experiments.
Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Multiple-choice queries synthesized from Hoare triples enable more reliable identification of intended programs than labeled-example supervision in active learning for program disambiguation.
A scalable verification framework for neural control barrier functions uses linear bound propagation on network gradients combined with McCormick relaxations to certify safety conditions for control-affine systems.
citing papers explorer
-
sweap: Reactive Synthesis for Infinite-State Integer Problems
sweap is a CEGAR-based tool for infinite-state reactive synthesis over linear integer arithmetic that supports multiple input formats and outperforms the prior ISSY tool in experiments.
-
Choose, Don't Label: Multiple-Choice Query Synthesis for Program Disambiguation
Multiple-choice queries synthesized from Hoare triples enable more reliable identification of intended programs than labeled-example supervision in active learning for program disambiguation.
-
Scalable Verification of Neural Control Barrier Functions Using Linear Bound Propagation
A scalable verification framework for neural control barrier functions uses linear bound propagation on network gradients combined with McCormick relaxations to certify safety conditions for control-affine systems.