Automating relatively complete verification of higher-order functional programs
From MaRDI portal
Publication:2931785
DOI10.1145/2429069.2429081zbMath1301.68182MaRDI QIDQ2931785
Hiroshi Unno, Naoki Kobayashi, Tachio Terauchi
Publication date: 27 November 2014
Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://tsukuba.repo.nii.ac.jp/record/29119/files/POPL2013.pdf
68N18: Functional programming and lambda calculus
68Q60: Specification and verification (program logics, model checking, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
ICE-based refinement type discovery for higher-order functional programs, On recursion-free Horn clauses and Craig interpolation, Modular Verification of Higher-Order Functional Programs