Map
Index
Random
Help
th

Quote: eliminate proofs of termination by avoiding loop forever constructs

topics > all references > references a-b > QuoteRef: andeT_1985 , p. 241



Topic:
hard real time systems
Topic:
program proof via assertions
Topic:
for loop
Topic:
simple loop

Quotation Skeleton

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].   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: hard real time systems (64 items)
Topic: program proof via assertions (61 items)
Topic: for loop (18 items)
Topic: simple loop (15 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.