Introduces a programming language for which average-case time analysis of its programs is guaranteed to be modular. This book includes sample programs and sample derivations of the average-case time of these programs to illustrate this radically different approach to average-case timing.

The main time measure currently used for real-time languages (worst-case time) is well-known not to be modular in general, which makes average-case analysis notoriously difficult, involving a variety of techniques which typically do not allow for automation. This book introduces the first programming language for which average-case time analysis of its programs is guaranteed to be modular. The book includes sample programs and sample derivations of the average-case time of these programs to illustrate this radically different approach to average-case timing. The book presents a single foundation for Average-Case Analysis, based on the notion of Random Structure Preservation, and solves several well-known open problems discussed by Knuth.

Bridging Semantics and Complexity.- The MOQA Programming Language.- Implications for Real-Time Languages and Automated Average-Case Analysis.- Basic sorting Algorithms.- Compositionality as a Key to Software Timing.- Random Structures.- Series-Parallel MOQA Data Structures.- Examples of MOQA Programs.- Compositional Determination of Average Time.- Examples of Average-Case Analysis in MOQA