Abstract: A technique includes identifying a statement of a program based on a category that is associated with a sensitive-information category. The technique includes, based on a variable that is contained in the program statement, identifying at least one modifiable parameter (MP) of the program; and obfuscating a portion of a memory image associated with the program based on the identified MP.

Abstract: A technique includes identifying a statement of a program based on a category that is associated with a sensitive-information category. The technique includes, based on a variable that is contained in the program statement, identifying at least one modifiable parameter (MP) of the program; and obfuscating a portion of a memory image associated with the program based on the identified MP.

Abstract: An eager reference-counting garbage collection system performs a static analysis on the intermediate representation of a program. The system then uses liveness information to inject eager reference-counting updates into the program. Through the use of the liveness information, reference-counting decrements can be made earlier in execution than in traditional reference-counting schemes, freeing up memory more efficiently. Additionally, a reference-counting subsumption optimization tool identifies redundant reference-counting updates and removes them, lowering the number of garbage collection update calls and improving execution throughput. Reference-counting subsumption can also be used as a throughput enhancer in traditional reference-counting schemes that maintain up-to-date tallies of references from the stack.

Abstract: An eager reference-counting garbage collection system performs a static analysis on the intermediate representation of a program. The system then uses liveness information to inject eager reference-counting updates into the program. Through the use of the liveness information, reference-counting decrements can be made earlier in execution than in traditional reference-counting schemes, freeing up memory more efficiently. Additionally, a reference-counting subsumption optimization tool identifies redundant reference-counting updates and removes them, lowering the number of garbage collection update calls and improving execution throughput. Reference-counting subsumption can also be used as a throughput enhancer in traditional reference-counting schemes that maintain up-to-date tallies of references from the stack.