Viverra generates C code from text descriptions together with assertions that are verified by model checkers, and a user study with over 400 participants shows the verified assertions improve code comprehension.
Title resolution pending
2 Pith papers cite this work, alongside 2 external citations. Polarity classification is still indexing.
2
Pith papers citing it
2
external citations · Crossref
representative citing papers
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
citing papers explorer
-
Viverra: Text-to-Code with Guarantees
Viverra generates C code from text descriptions together with assertions that are verified by model checkers, and a user study with over 400 participants shows the verified assertions improve code comprehension.
-
Logic-Constrained Shortest Paths for Flight Planning
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.