scientific article; zbMATH DE number 4014000

MaRDI QIDQ3026317zbMATH OpenFDO

Authors Chris Martin, Chris Hankin

Publication date 1987

zbMATH Keywords

abstract interpretation of declarative languagescorrectnessfixpoints of recursive functionsperformance improvementsprogram analysisrun-time properties of programsstrictness analysisterminationvalue domains

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Fixed points and frontiers: a new perspective
• Approximate fixed points in abstract interpretation
• A syntactic method for finding least fixed points of higher-order functions over finite domains
• Strictness analysis and denotational abstract interpretation
• Strictness analysis for higher-order functions

Cited in

(8)

• Approximate fixed points in abstract interpretation
• Local higher-order fixpoint iteration
• A syntactic method for finding least fixed points of higher-order functions over finite domains
• scientific article; zbMATH DE number 1487857 (Why is no real title available?)
• Fixed points and frontiers: a new perspective
• Projections for polymorphic strictness analysis
• Bounded Fixed-Point Iteration
• Immediate fixpoints and their use in groundness analysis

This page was built for publication:

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