A bounded model checking technique for higher-order programs

DOI10.1007/978-3-030-35540-1_1MaRDI QIDQ6535909zbMATH OpenFDO

Authors Yu-Yang Lin, Nikos Tzevelekos

Publication date 12 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-35540-1_1

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model checking higher-order programs
• Higher-order model checking in direct style
• Higher-order model checking: an overview
• Saturation-Based Model Checking of Higher-Order Recursion Schemes.
• From bounded checking to verification of equivalence via symbolic up-to techniques

Cites work

• A ZDD-Based Efficient Higher-Order Model Checking Algorithm
• Computer Aided Verification
• Definitional interpreters for higher-order programming languages
• scientific article; zbMATH DE number 1956571 (Why is no real title available?)
• Symbolic Testing and the DISSECT Symbolic Evaluation System
• Tools and Algorithms for the Construction and Analysis of Systems
• Types and higher-order recursion schemes for verification of higher-order programs

Cited in

(1)

• From bounded checking to verification of equivalence via symbolic up-to techniques

This page was built for publication: A bounded model checking technique for higher-order programs

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