This shows you the differences between two versions of the page.
|
cns:lectures:lecture-02 [2013/10/13 23:21] razvan.deaconescu |
cns:lectures:lecture-02 [2019/10/09 18:53] (current) razvan.deaconescu |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Lecture 02 - The Stack. Buffer Management ====== | + | ====== Lecture 02 - Program Analysis ====== |
| - | *[[http://elf.cs.pub.ro/cns/res/lectures/lecture-02.pdf | Slides]] | + | * [[http://elf.cs.pub.ro/cns/res/lectures/02-program-analysis-handout.pdf|Slides]] |
| - | ***Keywords**: address space, stack, push, pop, stack frame, call stack, stack trace, ''call'', ''ret'', buffer, allocation, buffer overflow, return address, NOP sled, shellcode | + | * **Keywords**: static analysis, dynamic analysis, executable, ELF, readelf, section, segment, disassembling, objdump, symbols, linker, process, strace / ltrace, lsof / pmap, perf, GDB, breakpoint, ''info'', ''examine'', ''ni'', ''si'', ''backtrace'', ''up'', ''down'', ''write'', ''searchmem'', dynamic linking, dynamic loading, lazy binding, trampoline, PLT, GOT |
| <html> | <html> | ||
| - | <iframe src="http://docs.google.com/viewer?url=http://elf.cs.pub.ro/cns/res/lectures/lecture-02.pdf&embedded=true" width="600" height="470" style="border: none;"></iframe> | + | <center> |
| + | <iframe src="https://docs.google.com/viewer?url=http://elf.cs.pub.ro/cns/res/lectures/02-program-analysis-handout.pdf&embedded=true" width="600" height="470" style="border: none;"></iframe> | ||
| + | </center> | ||
| </html> | </html> | ||
| - | |||