Learning refinement types

DOI10.1145/2784731.2784766MaRDI QIDQ2981992zbMATH OpenOpenAlexFDO

Authors He Zhu, Aditya V. Nori, Suresh Jagannathan

Publication date 10 May 2017

Published in Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2784731.2784766

zbMATH Keywords

higher-order verificationlearningrefinement typestesting

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• ICE-based refinement type discovery for higher-order functional programs
• ICE-based refinement type discovery for higher-order functional programs
• Refinement types for program analysis
• Type Reconstruction for General Refinement Types
• Abstract refinement types

Cited in

(8)

• A learning-based approach to synthesizing invariants for incomplete verification engines
• Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking
• Modular verification of higher-order functional programs
• Understanding, Explaining, and Deriving Refinement
• ICE-based refinement type discovery for higher-order functional programs
• ICE-based refinement type discovery for higher-order functional programs
• Parameterized recursive refinement types for automated program verification
• Constraint-based relational verification

This page was built for publication: Learning refinement types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2981992)