Bounding Fixed Points of Non-Monotone Processes: Theory to Practice
arXiv 2605.06803•35d8f64e17532860ea133c71819156d2d45f8a7b6bb59d0432cb24d2db7f621b
CktFormalizerHDLKeYLLM-driven-synthesisLean4PPA-optimizationabstract-interpretationanswer-set-programmingapproximation-fixpoint-theoryautoactive-verificationautoformalizationdependent-typesformal-methodshardware-designincorrectness-typinginteractive-verificationmachine-checked-proofsnon-monotone-processesprogram-verificationspeculative-analysisstatic-analysissynthesis-place-and-routetheorem-provingtype-systemsverification-modulo-testing','DUALIS','CHC-solvers','ICE‑learnin
Paper metadata
- arXiv ID
- 2605.06803
- Version
- Not specified by this published record
- Category
- Computer Science — Programming Languages (cs.PL)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_cs_pl
- Record identifier
- 35d8f64e17532860ea133c71819156d2d45f8a7b6bb59d0432cb24d2db7f621b
- Enrichment time
- 2026-05-11T08:52:07Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.