Program generation, termination, and binding-time analysis

DOI10.1007/3-540-45821-2_1MaRDI QIDQ4440317zbMATH OpenFDO

Authors Neil D. Jones, Arne John Glenstrup

Publication date 16 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2487/24870001.htm

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• Fully Automatic Binding-Time Analysis for Prolog
• Fast offline partial evaluation of logic programs
• scientific article; zbMATH DE number 1438809
• Termination analysis for offline partial evaluation of a higher order functional language
• Static Analysis

Cited in

(4)

• Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
• Generation of efficient programs for solving maximum multi-marking problems
• scientific article; zbMATH DE number 2043478 (Why is no real title available?)
• Syntax-guided termination analysis

Describes a project that uses

Uses Software

• Bandera
• XSB
• ECCE

This page was built for publication: Program generation, termination, and binding-time analysis

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