eda045f program analysis
play

EDA045F: Program Analysis LECTURE 5 BONUS: BASIC CALLGRAPHS - PowerPoint PPT Presentation

Jan 13, 2024 •292 likes •582 views

EDA045F: Program Analysis LECTURE 5 BONUS: BASIC CALLGRAPHS Christoph Reichenbach The Call Graph void f(char *s) { for (char *p = s; *p; p++) { *p = up(*p); } puts(s); } int main(int argc, char *argv) { char up(char c) { if (argc > 1)

  1. EDA045F: Program Analysis LECTURE 5 BONUS: BASIC CALLGRAPHS Christoph Reichenbach

  2. The Call Graph void f(char *s) { for (char *p = s; *p; p++) { *p = up(*p); } puts(s); } int main(int argc, char *argv) { char up(char c) { if (argc > 1) { if (c >= ’a’ && c <= ’z’) { f(argv[0]); return c - (’a’ - ’A’); } } g(); return c; return 0; } } void g(void) { puts("Hello, World!"); } 2 / 15

  3. The Call Graph void f(char *s) { for (char *p = s; *p; p++) { *p = up(*p); } puts(s); } int main(int argc, char *argv) { char up(char c) { if (argc > 1) { if (c >= ’a’ && c <= ’z’) { f(argv[0]); return c - (’a’ - ’A’); } } g(); return c; return 0; } } void g(void) { puts("Hello, World!"); } 2 / 15

  4. The Call Graph ◮ G call = � P , E call � ◮ Connects procedures from P via call edges from E call ◮ ‘Which procedure can call which other procedure?’ ◮ Often refined to: ‘Which call site can call which procedure?’ ◮ Used by program analysis to find procedure call targets up f main g 3 / 15

  5. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 4 / 15

  6. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 4 / 15

  7. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 4 / 15

  8. Dynamic Dispatch: Call Graph Challenge: Computing the precise call graph: A.<init>() A.f() Main.main() A.g() B.<init>() a.f B.g() a.g C.<init>() a2.g C.g() direct call D.<init>() virtual call D.g() 5 / 15

  9. Summary ◮ Call Graphs capture which procedure calls which other procedure ◮ For program analysis, further specialised to map: Callsite → Procedure ◮ Direct calls: straightforward ◮ Virtual calls (dynamic dispatch): ◮ Multiple targets possible for call ◮ Not straightforward 6 / 15

  10. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 7 / 15

  11. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for ( A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 7 / 15

  12. Class Hierarchy Analysis Object Main A main(String[]) f() g() B C D g() g() g() ◮ Use declared type to determine possible targets 8 / 15

  13. Class Hierarchy Analysis Object Main A main(String[]) f() g() B C D g() g() g() ◮ Use declared type to determine possible targets ◮ Must consider all possible subtypes ◮ In our example: assume a.f can call any of: A.f() , B.f() , C.f() , D.f() 8 / 15

  14. Class Hierarchy Analysis: Example A.<init>() A.f() Main.main() A.g() B.<init>() a.f B.g() a.g C.<init>() a2.g C.g() direct call D.<init>() virtual call D.g() CHA prediction 9 / 15

  15. Class Hierarchy Analysis: Example A.<init>() A.f() Main.main() A.g() B.<init>() a.f B.g() a.g C.<init>() a2.g C.g() direct call D.<init>() virtual call D.g() CHA prediction 9 / 15

  16. Summary ◮ Call Hierarchy Analysis resolves virtual calls a . f () by: ◮ Examining static types T of receivers ( a : T ) ◮ Finding all subtypes S < : T ◮ Creating call edges to all S . f , if S . f exists ◮ Sound ◮ Assuming strongly and statically typed language with subtyping ◮ Not very precise 10 / 15

  17. Rapid Type Analysis ◮ Intuition: ◮ Only consider reachable code ◮ Ignore unused classes ◮ Ignore classes instantiated only by unused code 11 / 15

  18. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for ( A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 12 / 15

  19. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 12 / 15

  20. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 12 / 15

  21. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 12 / 15

  22. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 12 / 15

  23. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 12 / 15

  24. Finding Calls and Targets class Main { public void main(String[] args) { class A { A[] as = { new A(), new B() }; public A for (A a : as) { f() { return new C(); } A a2 = a.f(); print(a.g()); public String print(a2.g()); g() { return "A"; } } } } } class D extends A { class C extends A { class B extends A { @Override @Override @Override public String public String public String g() { return "D"; } g() { return "A"; } g() { return "B"; } } } } 12 / 15

  25. Rapid Type Analysis: Example A.<init>() A.f() Main.main() A.g() B.<init>() a.f B.g() a.g C.<init>() a2.g C.g() direct call D.<init>() virtual call D.g() RTA prediction 13 / 15

  26. Rapid Type Analysis: Example A.<init>() A.f() Main.main() A.g() B.<init>() a.f B.g() a.g C.<init>() a2.g C.g() direct call D.<init>() virtual call D.g() RTA prediction 13 / 15

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

EDA045F: Program Analysis LECTURE 2: DATAFLOW ANALYSIS 1 Christoph Reichenbach In the last

EDA045F: Program Analysis LECTURE 2: DATAFLOW ANALYSIS 1 Christoph Reichenbach In the last

EDA045F: Program Analysis LECTURE 2: DATAFLOW ANALYSIS 1 Christoph Reichenbach In the last lecture. . . Uses of Program Analysis Static vs. Dynamic Program Analysis Soundness, Precision, Termination Abstraction and Simplification

4.44k views • 52 slides
EDA045F: Program Analysis LECTURE 8: DYNAMIC ANALYSIS 1 Christoph Reichenbach In the last

EDA045F: Program Analysis LECTURE 8: DYNAMIC ANALYSIS 1 Christoph Reichenbach In the last

EDA045F: Program Analysis LECTURE 8: DYNAMIC ANALYSIS 1 Christoph Reichenbach In the last lecture. . . More Points-to Analysis Memory Errors 2 / 44 Challenges to Static Analysis Static analysis is far from solved Very active

574 views • 42 slides
EDA045F: Program Analysis LECTURE 6: DATALOG Christoph Reichenbach In the last lecture. . .

EDA045F: Program Analysis LECTURE 6: DATALOG Christoph Reichenbach In the last lecture. . .

EDA045F: Program Analysis LECTURE 6: DATALOG Christoph Reichenbach In the last lecture. . . Pointer Analysis Points-To Analysis Alias Analysis Concrete Heap Graphs Abstract Heap Graphs Access Paths Heap Summarisation

822 views • 53 slides
EDA045F: Program Analysis LECTURE 2: DATAFLOW BONUS EXAMPLE Christoph Reichenbach Example:

EDA045F: Program Analysis LECTURE 2: DATAFLOW BONUS EXAMPLE Christoph Reichenbach Example:

EDA045F: Program Analysis LECTURE 2: DATAFLOW BONUS EXAMPLE Christoph Reichenbach Example: Reaching Definitions x = 0 x = 0 y = 0 y = 0 z = 1 z = 1 while ( x &lt; 5) { x = x + 1 x = x + 1 i f ( x &gt;= 2) { y = 7 } e l s e { y =

477 views • 25 slides
Analysis and Optimizations Program Analysis P3 / 2006 Discovers properties of a program

Analysis and Optimizations Program Analysis P3 / 2006 Discovers properties of a program

Analysis and Optimizations Program Analysis P3 / 2006 Discovers properties of a program Optimizations Using Program Analysis Use analysis results to transform program for Optimization Goal: improve some aspect of program

232 views • 12 slides
Analysis and Optimizations Analysis and Optimizations Program Analysis Program Analysis

Analysis and Optimizations Analysis and Optimizations Program Analysis Program Analysis

Analysis and Optimizations Analysis and Optimizations Program Analysis Program Analysis Discovers properties of a program Optimizations Using Program Analysis Use analysis results to transform program Use analysis results

744 views • 17 slides
Program analysis INF4140 - Models of concurrency Program Analysis, lecture 5 Hsten 2015 28.

Program analysis INF4140 - Models of concurrency Program Analysis, lecture 5 Hsten 2015 28.

Program analysis INF4140 - Models of concurrency Program Analysis, lecture 5 Hsten 2015 28. 9. 2016 2 / 43 Program correctness Is my program correct? Central question for this and the next lecture. Does a given program behave as intended?

880 views • 43 slides
Program Analysis Attackers: need to analyze our program to modify it! Defenders: need to analyze

Program Analysis Attackers: need to analyze our program to modify it! Defenders: need to analyze

Program Analysis Attackers: need to analyze our program to modify it! Defenders: need to analyze our program to protect it! Two kinds of analyses: 1 static analysis tools collect information about a program by studying its code; 2 dynamic

1.21k views • 41 slides
Lexical analysis Lexical analysis Lexical analysis checks the correctness of program words and

Lexical analysis Lexical analysis Lexical analysis checks the correctness of program words and

Lexical analysis Lexical analysis Lexical analysis checks the correctness of program words and transforms a program to the stream of tokens: removes empty symbols and commentaries; identifies keywords, indentifiers and literal

400 views • 37 slides
Program Analysis in Software Development Summary of Papers Program Analysis Application Areas

Program Analysis in Software Development Summary of Papers Program Analysis Application Areas

Program Analysis in Software Development Summary of Papers Program Analysis Application Areas Compilation and Optimization LLVM: A Compilation Framework for Lifelong Program Analysis &amp; Transformation Obfuscation Generation and

1.64k views • 6 slides
Lecture 1: Introduction to Program Analysis 17-355/17-655/17-819: Program Analysis Claire Le

Lecture 1: Introduction to Program Analysis 17-355/17-655/17-819: Program Analysis Claire Le

Lecture 1: Introduction to Program Analysis 17-355/17-655/17-819: Program Analysis Claire Le Goues January 14, 2020 * Course materials developed with Jonathan Aldrich (c) 2020 C. Le Goues 1 Learning objectives Provide a high level

788 views • 50 slides
Information Flow and Program Analysis Program Analysis Markus Mller-Olm Westflische

Information Flow and Program Analysis Program Analysis Markus Mller-Olm Westflische

Information Flow and Program Analysis Program Analysis Markus Mller-Olm Westflische Wilhelms-Universitt Mnster, Germany IFIP WG 2.2 Meeting Singapore, September 13-16, 2016 Project Context Work in progress from a joint project with

762 views • 19 slides
Principles of Program Analysis An overview of approaches beyond loop analysis and optimizations

Principles of Program Analysis An overview of approaches beyond loop analysis and optimizations

Principles of Program Analysis An overview of approaches beyond loop analysis and optimizations cs6363 1 The Nature of static analysis --- approximation Static program analysis --- predict the dynamic behavior of programs without running

368 views • 19 slides
1 Programmers often use analysis tools to improve program quality. These are just tools to

1 Programmers often use analysis tools to improve program quality. These are just tools to

1 Programmers often use analysis tools to improve program quality. These are just tools to analyze, or carefully examine, some aspect of a program. We can categorize program analyses into two groups: Static analysis involves analyzing a program's

511 views • 35 slides
1 Analysis Information Where Do Facts Hold? How much information depends on the client

1 Analysis Information Where Do Facts Hold? How much information depends on the client

711? CS711 Advanced Programming Languages Topics in Program Analysis Radu Rugina Fall 2005 CS711 Overview 2 Program Analysis Static vs. Dynamic Static analysis: inspect programs at compile-time Static analysis: Work done at

282 views • 4 slides
Program Analysis 1 Summary Summary analysis of algorithms asymptotic analysis

Program Analysis 1 Summary Summary analysis of algorithms asymptotic analysis

csci 210: Data Structures Program Analysis 1 Summary Summary analysis of algorithms asymptotic analysis big-O big-Omega big-theta asymptotic notation commonly used functions discrete math

500 views • 33 slides
VPN Virtual Private Network zswu Computer Center, CS, NCTU Introduction Uses public

VPN Virtual Private Network zswu Computer Center, CS, NCTU Introduction Uses public

VPN Virtual Private Network zswu Computer Center, CS, NCTU Introduction Uses public telecommunication channels, such as the Internet or other network service, instead of leased lines channels. Described as Virtual because it is distant

680 views • 23 slides
Financial Markets Law Committee (FMLC) FinTech Scoping Forum Date: 5 November 2019 Time:

Financial Markets Law Committee (FMLC) FinTech Scoping Forum Date: 5 November 2019 Time:

Financial Markets Law Committee (FMLC) FinTech Scoping Forum Date: 5 November 2019 Time: 2.00 to 3.30pm Location: Herbert Smith Freehills LLP, Exchange House, Primrose Street, London, EC2A 2EG In Attendance: Cat Dankos (Chair) Herbert

667 views • 12 slides
How C++ Works 1 Overview Constructors and destructors Virtual functions Single

How C++ Works 1 Overview Constructors and destructors Virtual functions Single

How C++ Works 1 Overview Constructors and destructors Virtual functions Single inheritance Multiple inheritance RTTI Templates Exceptions Operator Overloading Motivation There are lot of myths about

564 views • 31 slides
James Findlay QC, Ranjit Bhose QC, Damien Welfare, Matt Lewin, Ruchi Parekh and Isabella Buono 20

James Findlay QC, Ranjit Bhose QC, Damien Welfare, Matt Lewin, Ruchi Parekh and Isabella Buono 20

James Findlay QC, Ranjit Bhose QC, Damien Welfare, Matt Lewin, Ruchi Parekh and Isabella Buono 20 April 2020 Overview Remote attendance by councillors Remote access by members of the public Standing orders Last minute changes

531 views • 22 slides
Advanced Air Mobility Ecosystem Crosscutting Working Group Virtual Kickoff June 2020

Advanced Air Mobility Ecosystem Crosscutting Working Group Virtual Kickoff June 2020

Advanced Air Mobility Ecosystem Crosscutting Working Group Virtual Kickoff June 2020 Organizational Framework and Barriers 1. Public Acceptance 2. Supporting Infrastructure 1. Safe Airspace Ops 3. Operational Integration 2. Efficient

222 views • 5 slides
1 The RES ESUL ULTS TS Un Unite ted d Na Nati tiona onal l Webin binar ar Welcom

1 The RES ESUL ULTS TS Un Unite ted d Na Nati tiona onal l Webin binar ar Welcom

1 The RES ESUL ULTS TS Un Unite ted d Na Nati tiona onal l Webin binar ar Welcom ome! Closed ed capti tionin oning: g: http://west.typewell.com/faelapgb 3 Babit ita Daware Fort Worth Welcome How I Met RESULTS 4

633 views • 48 slides
Vhost: Sharing is better Eyal Moscovici Bandan Das Partly sponsored by: 1 / 29 What's it about

Vhost: Sharing is better Eyal Moscovici Bandan Das Partly sponsored by: 1 / 29 What's it about

Vhost: Sharing is better Eyal Moscovici Bandan Das Partly sponsored by: 1 / 29 What's it about ? Paravirtualization: Shared Responsibilities Vhost: How much can we stretch ? Design Ideas: Parallelization Design Ideas:

1.04k views • 29 slides
Process Abstraction Physical Hardware Instruction Memory I/O Devices Set Registers MMU

Process Abstraction Physical Hardware Instruction Memory I/O Devices Set Registers MMU

Process Abstraction Physical Hardware Instruction Memory I/O Devices Set Registers MMU Virtual Memory Operating System System Calls CS 140 Lecture Notes: Virtual Machines Slide 1 Process Abstraction Physical Hardware Instruction

60 views • 4 slides

More recommend