Optimization Among Provably Equivalent Programs

DOI10.1145/322033.322046zbMath0401.68016OpenAlexW2060012383MaRDI QIDQ4185798

No author found.

Publication date: 1977

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

Full work available at URL: https://docs.lib.purdue.edu/cstech/103

zbMATH Keywords

Program CorrectnessProbably Equivalent ProgramsRecursion-Theoretic Complexity Theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Complexity classes of provable recursive functions, Independence results in computer science?, Discontinuities of provably correct operators on the provably recursive real numbers, Relations between diagonalization, proof systems, and complexity gaps, On “provable” analogs of and