Topic: hard real time systems
Topic: program proof via assertions
Topic: for loop
Topic: simple loop
However, it seems perfectly feasible to eliminate the … must halt, thereby greatly simplifying the overall proof. … [p. 242] An iterative facility provided by many languages … or may not include conditional exits. [They recommend explicit bounds for any loop].
Copyright clearance needed for quotation.
Topic: hard real time systems (64 items)
Topic: program proof via assertions (61 items)
Topic: for loop (18 items)
Topic: simple loop (15 items)