Shared by 
Unlock all 23 pages
Get it free by sharing your own notes, buy just this one, or become a member and unlock documents with your plan.
How to unlock this document
Choose the way that suits you. Each one gives you all 23 pages to read online and the PDF to download.
Share your notes, unlock for free
2 free unlocks for every 5 approved uploads
- Upload your own lecture notes, assignments, essays or past papers
- PDF, Word, PowerPoint and Excel files all work, and you can send many at once
- We check each upload; you get a notification when it is approved
- Spend a free unlock on this document or any other, and keep it for good
- Shared under your public username, never your email
Then upload your notes from your profile.
Buy this document
$23 one-time payment
- All 23 pages of this document, yours to keep
- Download the PDF and read it any time, also offline
- No subscription and nothing to cancel
- Find it again any time under My Profile → Library
You log in or create a free account first, then pay securely.
Become a member
Unlock documents from the whole library, which keeps growing
- Choose any documents you like, up to your plan’s unlocks
- Documents you unlock stay yours, even if you cancel later
- Your unlocks start again with every renewal
- Secure checkout by Dodo Payments
You log in or create a free account first, then pay securely.
Compare the plansAlready a member, or bought this before? Log in to open it
About this document
- Pages
- 23 pages
- Price
- $23 one-time, yours to keep
- Membership
- Included in every plan
- Format
- Subject
- Computer Science
This document explains what call graphs are, their uses, and different types. It covers static and dynamic call graphs, their precision, and applications in program analysis. It also briefly mentions sampling in statistics.
What's inside
- Definition of call graphs
- Static and dynamic call graphs
- Precision of call graphs
- Applications of call graphs
- Brief mention of sampling in statistics
Who it is for: Students of computer science studying program analysis. (Undergraduate)
Share with classmates: WhatsApp Telegram X LinkedIn Facebook
Summary
Call graphs are a way to map how subroutines in a computer program call each other. Students learn how call graphs are used in program analysis, and how they can be dynamic or static.
Call Graphs
Call graphs show the calling relationships between subroutines in a program. Each node is a procedure, and each edge shows one procedure calling another. Call graphs help find procedures that are never called.
Static and Dynamic
A dynamic call graph records one execution of a program. A static call graph tries to represent all possible runs of a program. Static call graphs are often overapproximations.
Precision of Call Graphs
Call graphs can be more or less precise. The most precise call graph is fully context-sensitive. The least precise call graph is context-insensitive.
Sampling
Sampling is a statistical practice to select a subset of a population to make predictions. It is used for gathering information about a population. There are different sampling methods.
Key terms
- Call Graph
- A directed graph showing calling relationships between subroutines in a program.
- Dynamic Call Graph
- A call graph that records one execution of a program.
- Static Call Graph
- A call graph that tries to represent all possible runs of a program.
- Context-Sensitive
- A call graph that has a separate node for each call stack a procedure can be activated with.
- Context-Insensitive
- A call graph that has only one node for each procedure.
- Sampling
- The practice of selecting a subset of a population to make predictions.
Questions this document helps with
- What is a call graph?
- What are the differences between static and dynamic call graphs?
- What are the advantages of sampling?
Summary written with AI from the document's text.
Ask the AI Teacher
Ask any question about this document or your course, and get a clear explanation.
Log in to ask Create a free account
Free accounts can ask 5 questions a day.