A Naïve Time Analysis and its Theory of Cost Equivalence
From MaRDI portal
Publication:4847380
DOI10.1093/logcom/5.4.495zbMath0942.68623MaRDI QIDQ4847380
Publication date: 26 February 1996
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1bbb9e0c89795c812b1e8c63b0d298c811a70541
68Q55: Semantics in the theory of computing
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Cost analysis of object-oriented bytecode programs, On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus, Automated higher-order complexity analysis, Closed-form upper bounds in static cost analysis, Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis