| 
|
QuoteRef: kharM10_2006
Group:
security
Topic:
heap memory management
Group:
memory management
Topic:
arrays
Topic:
boolean values, binary numbers, and bit strings
Group:
parallel processing
Reference
Kharbutli, M., Jiang, X., Solihin, Y., Venkataramani, G., Prvulovic, M., "Comprehensively and efficiently protecting the heap", ASPLOS XII Twelfth International Conference on Architectural Support for Programming Languages and Operating Systems, San Jose, California, USA, ACM Press, October 2006, pp. 207-218. Google
208 ;;Quote: comprehensive protection of the heap with minimal assumptions and low overhead; separates heap data and meta-data; layout obfuscation, random padding between objects, random recycling
212 ;;Quote: two bits of meta-data per heap data; delimiter bit and value bit gives size, free and allocated
213 ;;Quote: efficient heap management via a separate process; bulk deallocate, pre-allocation of multiple objects
Group: security (23 topics, 874 quotes)
Topic: heap memory management (33 items)
Group: memory management (11 topics, 367 quotes)
Topic: arrays (58 items)
Topic: boolean values, binary numbers, and bit strings (44 items)
Group: parallel processing (41 topics, 1125 quotes)