100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
Samenvatting Hoofdstuk 5b: Execution Model $3.76
Add to cart
Quickly navigate to
Preview
  2.  
  3. Vrije Universiteit Brussel (VUB)
  4.  
  5. Computerwetenschappen
  6.  
  7. Structuur van Computerprogramma\'s II

Summary

Samenvatting Hoofdstuk 5b: Execution Model
 0 purchase
  • Course
  • Structuur van Computerprogramma\'s II
  • Institution
  • Vrije Universiteit Brussel (VUB)
  • Book
  • The C Programming Language

Dit is de samenvatting van het achtste hoofdstuk van het vak Structuur van Computerprogramma's II. In deze samenvatting werd zowel alle relevante informatie uit de slides als informatie uit eigen notities opgenomen.

Preview 2 out of 11  pages

Document information

  • No
  • Unknown
  • July 28, 2022
  • 11
  • 2020/2021
  • Summary

Subjects

  • memory errors
  • memory safety
  • stack overflows
  • buffer overflows
  • stack exhaustion
  • tail call optimization
  • registers
  • trampolined form
  • c

Connected book

book image

Book Title:

Author(s):

  • Edition:
  • ISBN:
  • Edition:

Written for

  • Vrije Universiteit Brussel (VUB)
  • Computerwetenschappen
  • Structuur van Computerprogramma's II
All documents for this subject (9)

Seller

avatar-seller
lennyS

Reviews received

Content preview

Hoofdstuk 5b: Execution Model
1 Recall: Programs in Memory
• C programs can manipulate memory directly
o Advantages: efficiency
o Disadvantages: easy to violate data abstractions

2 Memory Errors
• Since C provides arbitrary access to memory, it can suffer
from different types of memory errors:
o dynamic memory errors (cf. chapter 3b):
▪ dangling pointer, invalid free, null pointer
accesses
o array bounds errors:
▪ buffer overflows (copying data into a
buffer without doing bounds checking can
corrupt the content of adjacent memory locations)
o out-of-memory errors:
▪ stack exhaustion (a program runs out of stack space due to e.g. too deep
recursion)

Those errors may be simple programming oversights, but they can cause security vulnerabilities as
they can be used by attackers for malicious ends.

• Unrestricted manual memory management is unsafe.

3 Memory safety




1

, 4 Stack Overflows
4.1 Buffer Overflows
putting m bytes into a buffer of size n, if m > n the surrounding memory is corrupted

• Still one of the most common vulnerabilities exploited
• Affects any function that copies input to memory without doing bounds checking
o Stack overflows
o Heap overflows
• Easy fix: check size of data before/when writing
• Nowadays Modern OSs include provision to avoid buffer overflow exploits
o randomizing the layout of memory
o leaving space between buffers
o looking for actions that write into “canaries” (values placed between buffer and
control area on the stack)

4.2 Stack Overflows
• First documented as a security threat in 1972
• First documented exploitation in 1988 used by the Morris worm to propagate over the
Internet
• Became widely known in 1996 through the influential article “Smashing the stack for fun and
profit” by Elias Levy (known as Aleph One)
• Since then popular used by Internet worms like Code Red (2001), SQL Slammer (2003),
Conficker (2008)

4.2.1 Stack Overflows Exploits
• Overwriting a local variable that is located near the vulnerable buffer on the stack.
• Overwriting the return address in a stack frame to point back into the stack, somewhere
before the attack code.
• Overwriting a function pointer.
• Overwriting a local variable or pointer of a different stack frame (which will be used by the
function which owns the frame later).

Simple Overflow Exploit: Corrupting Stack Variables

• Local variables are put close together on the stack.
o If a write goes beyond the size of one variable, it can corrupt another one.




2

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller lennyS. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $3.76. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

69052 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 15 years now

Start selling
$3.76
  • (0)
Add to cart
Added