Termination analysis and call graph construction for higher-order functional programs

DOI10.1145/1291151.1291165MaRDI QIDQ5168926zbMATH OpenOpenAlexFDO

Authors Damien Sereni

Publication date 21 July 2014

Published in Proceedings of the 12th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

zbMATH Keywords

functional programsprogram analysissemanticstermination

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Programming Languages and Systems
• Automatic Termination Verification for Higher-Order Functional Programs
• Exact flow analysis by higher-order model checking
• Control-flow analysis of functional programs
• Termination Analysis with Calling Context Graphs

Cited in

(4)

• Termination analysis for functional programs
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
• Second-order programs with preconditions
• A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs

Describes a project that uses

Uses Software

• AProVE

This page was built for publication: Termination analysis and call graph construction for higher-order functional programs

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