BIT Numerical Mathematics

, Volume 14, Issue 3, pp 273–278 | Cite as

A note on the assignment of measurement points for frequency counts in structured programs

  • Stefan Arnborg


The problem of assigning optimal measurement points in a single scan of a program text is treated for various classes of structured programs. The most restricted class permits insertion of a minimal set of points, but for programs with computed and non-local jumps a single scan algorithm must insert redundant points.


Computational Mathematic Measurement Point Structure Program Frequency Count Optimal Measurement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. E. Knuth and F. R. Stevenson,Optimal Measurement Points for Program Frequency Counts, BIT 13 (1973), 313–322.Google Scholar
  2. 2.
    N. Wirth,The Programming Language PASCAL, Acta Informatica 1 (1971), 35–63.CrossRefGoogle Scholar
  3. 3.
    S. Arnborg,Programvara för programoptimering, FOA P rapport C 8350-M3(E5), Jan. 1973 (in Swedish).Google Scholar
  4. 4.
    W. Wulf, D. Russel and A. Habermann,BLISS: A Language for Systems Programming. CACM 14 (Dec 1971), 780–790.Google Scholar
  5. 5.
    M. Clint,Program Proving: Coroutines, Acta Informatica 2 (1973), 50–63.CrossRefGoogle Scholar

Copyright information

© BIT Foundations 1974

Authors and Affiliations

  • Stefan Arnborg
    • 1
  1. 1.Försvarets ForskningsanstaltStockholm 80Sweden

Personalised recommendations