scientific article; zbMATH DE number 4014000

MaRDI QIDQ3026317zbMATH OpenFDO

Authors Chris Martin, Chris Hankin

Publication date 1987

zbMATH Keywords

terminationprogram analysiscorrectnessstrictness analysisperformance improvementsabstract interpretation of declarative languagesfixpoints of recursive functionsrun-time properties of programsvalue 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

(4)

• Immediate fixpoints and their use in groundness analysis
• Projections for polymorphic strictness analysis
• Fixed points and frontiers: a new perspective
• Approximate fixed points in abstract interpretation

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)