Name
Abstract | ||
|---|---|---|
There have been two major approaches to fully automated verification of higher-order functional programs: higher-order model checking and refinement type inference. The former approach is precise, but suffers from a bottleneck in the predicate discovery phase. The latter approach is generally faster than the former, thanks to the recent advances in constrained Horn clause (CHC) solving, but is imprecise, in that it rejects some valid programs. To take the best of the two approaches, we refine the higher-order model checking approach, by employing CHC solving in the predicate discovery phase. We have implemented the new approach and confirmed that the new system can verify more programs than those based on the previous two approaches.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3294032.3294081 | POPL '19: 46th Annual ACM SIGPLAN Symposium on Principles of Programming Languages
Cascais
Portugal
January, 2019 |
Keywords | DocType | ISBN |
Automatic Verification, Higher-Order Programs, Higher-order Model Checking, Constrained Horn Clauses, Refinement Types | Conference | 978-1-4503-6226-9 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryosuke Sato | 1 | 21 | 5.07 |
| Naoki Iwayama | 2 | 0 | 0.34 |
| Naoki Kobayashi | 3 | 0 | 3.38 |