| 
|
QuoteRef: knooJ5_1995
Topic:
code optimization by flow analysis
Topic:
parallel algorithms
Topic:
boolean values, binary numbers, and bit strings
Topic:
string operations
Reference
Knoop, J., Steffen, B., Vollmer, J., "Parallelism for free: bitvector analyses => no state explosion!", in Brinksma, E., et. al. (ed.), Tools and Algorithms for the Construction and Analysis of Systems, First International Workshop, TACAS '95, Aarhus, Denmark, May 1995, Springer, LNCS 1019, pp. 264-289. Google
265 ;;Quote: efficient, unidirectional bitvector analysis for parallel programs with shared memory; optimal for interference
265 ;;Quote: bitvector analysis can ignore the various interleavings of parallel components; parallel-meet over all paths (PMOP) is equivalent to parallel bitvector maximal fixed point
265 ;;Quote: unidirectional bitvector analysis used for liveness, reaching def, def-use, code motion, partial dead code, and strength reduction; works for parallel programs
Topic: code optimization by flow analysis (47 items)
Topic: parallel algorithms (15 items)
Topic: boolean values, binary numbers, and bit strings (44 items)
Topic: string operations (20 items)