Computer-assisted microanalysis of programs

DOI10.1145/358656.358674MaRDI QIDQ3953163zbMATH OpenOpenAlexWikidataFDO

Authors Jacques Cohen

Publication date 1982

Published in Communications of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

analysis of algorithmsfinite-difference equationsprogram correctnesssummationssymbolic executionsymbolic manipulationtime-formulastime-variables

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Cited in

(6)

• A note on a fast algorithm for sparse matrix multiplication
• Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
• Automatic average-case analysis of algorithms
• Dense polynomial multiplication with reduced array manipulation overhead
• An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences
• A mathematical model to estimate average response time of parallel programs

This page was built for publication: Computer-assisted microanalysis of programs

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