Global program analysis in constraint form

DOI10.1007/BFB0017488MaRDI QIDQ4954456zbMATH OpenFDO

Authors Jens Palsberg

Publication date 7 June 2000

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

Full work available at URL https://doi.org/10.1007/BFB0017488

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Principles of program analysis
• Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^†
• Conjunctive Type Systems and Abstract Interpretation of Higher-order Functional Programs
• scientific article; zbMATH DE number 1738290

Cited in

(5)

• Managing the granularity of constraint-based analyses by rule transformation.
• p‐Version interface elements in global/local analysis
• Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging
• Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis
• Comparing flow-based binding-time analyses

This page was built for publication: Global program analysis in constraint form

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