The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification
No abstract available.
Related papers
- Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs APLAS 2015
- Predicate abstraction and CEGAR for higher-order model checking PLDI 2011
- Types and higher-order recursion schemes for verification of higher-order programs POPL 2009
- Specifying and Verifying Higher-order Rust Iterators TACAS 2023
- Higher-Order Specifications for Deductive Synthesis of Programs with Pointers ECOOP 2024
- Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency ICFP 2013
- Effectively Propositional Higher-Order Functional Programming OOPSLA 2026
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond TACAS 2021