Skip to main content

Automated Verification of Higher-Order Functional Programs

  • Conference paper
  • 571 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7294)

Abstract

Recently, motivated by the success of software model checkers for automated first-order program verification, researchers have proposed “model checkers” for automated verification of higher-order functional programs. Following the first-order methods, the higher-order verifiers employ a framework that separates control from data, allowing a smooth migration of tools and techniques such as predicate abstraction, CEGAR, SMT solving, and interpolation that have proven effective in first-order program verification. In this talk, we report on the state of the art in this emerging area of research, and discuss some future issues. In particular, we show that, in contrast to the automated methods for first-order programs, the current approaches lack relative completeness, and we present our ongoing research toward that end.

Keywords

  • Artificial Intelligence
  • Mathematical Logic
  • Model Checker
  • Software Engineer
  • Current Approach

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terauchi, T. (2012). Automated Verification of Higher-Order Functional Programs. In: Schrijvers, T., Thiemann, P. (eds) Functional and Logic Programming. FLOPS 2012. Lecture Notes in Computer Science, vol 7294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29822-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29822-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29821-9

  • Online ISBN: 978-3-642-29822-6

  • eBook Packages: Computer ScienceComputer Science (R0)