slicing unconditional jumps with unnecessary control
play

Slicing Unconditional Jumps with Unnecessary Control Dependencies - PowerPoint PPT Presentation

Jan 23, 2023 •153 likes •522 views

Slicing Unconditional Jumps with Unnecessary Control Dependencies Carlos Galindo Sergio P erez Josep Silva VRAIN Universitat Polit` ecnica de Val` encia, Spain 30th International Symposium on Logic-Based Program Synthesis and

  1. Slicing Unconditional Jumps with Unnecessary Control Dependencies Carlos Galindo Sergio P´ erez Josep Silva VRAIN Universitat Polit` ecnica de Val` encia, Spain 30th International Symposium on Logic-Based Program Synthesis and Transformation September 9th, 2020 C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 1 / 14

  2. Program slicing Program slicing A software analysis technique to extract the statements of a program that affect a given slicing criterion . 1 void main(int n) { 1 void main(int n) { int sum = 0; int sum = 0; 2 2 int prod = 0; int prod = 0; 3 3 int i = 0; int i = 0; 4 4 while (i < 10) { while (i < 10) { 5 5 sum += 1; sum += 1; 6 6 prod += n; prod += n; 7 7 i++; i++; 8 8 } } 9 9 log(sum); log(sum ); 10 10 log(prod ); log(prod ); 11 11 12 } 12 } C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 2 / 14

  3. Program slicing Program slicing A software analysis technique to extract the statements of a program that affect a given slicing criterion . 1 void main(int n) { 1 void main(int n) { int sum = 0; int sum = 0; 2 2 int prod = 0; int prod = 0; 3 3 int i = 0; int i = 0; 4 4 while (i < 10) { while (i < 10) { 5 5 sum += 1; sum += 1; 6 6 prod += n; prod += n; 7 7 i++; i++; 8 8 } } 9 9 log(sum); log(sum ); 10 10 log(prod ); log(prod ); 11 11 12 } 12 } C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 2 / 14

  4. Program slicing Program slicing A software analysis technique to extract the statements of a program that affect a given slicing criterion . 1 void main(int n) { 1 void main(int n) { int sum = 0; int sum = 0; 2 2 int prod = 0; int prod = 0; 3 3 int i = 0; int i = 0; 4 4 while (i < 10) { while (i < 10) { 5 5 sum += 1; sum += 1; 6 6 prod += n; prod += n; 7 7 i++; i++; 8 8 } } 9 9 log(sum); log(sum ); 10 10 log(prod ); log(prod ); 11 11 12 } 12 } C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 2 / 14

  5. Program slicing Example 1 public void f() { 1 public void f() { 1 public void f() { while (X) { while (X) { while (X) { 2 2 2 if (Y) { if (Y) { if (Y) { 3 3 3 if (Z) { if (Z) { if (Z) { 4 4 4 A; A; A; 5 5 5 break; break; break; 6 6 6 } } } 7 7 7 B; B; B; 8 8 8 break; break; break; 9 9 9 } } } 10 10 10 C; C; C; 11 11 11 } } } 12 12 12 D; D; D; 13 13 13 14 } 14 } 14 } (a) Original program (b) SDG slice (c) Minimal slice C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 3 / 14

  6. Program slicing Example 1 public void f() { 1 public void f() { 1 public void f() { while (X) { while (X) { while (X) { 2 2 2 if (Y) { if (Y) { if (Y) { 3 3 3 if (Z) { if (Z) { if (Z) { 4 4 4 A; A; A; 5 5 5 break; break; break; 6 6 6 } } } 7 7 7 B; B; B; 8 8 8 break; break; break; 9 9 9 } } } 10 10 10 C; C; C; 11 11 11 } } } 12 12 12 D; D; D; 13 13 13 14 } 14 } 14 } (a) Original program (b) SDG slice (c) Minimal slice C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 3 / 14

  7. Program slicing Example 1 public void f() { 1 public void f() { 1 public void f() { while (X) { while (X) { while (X) { 2 2 2 if (Y) { if (Y) { if (Y) { 3 3 3 if (Z) { if (Z) { if (Z) { 4 4 4 A; A; A; 5 5 5 break; break; break; 6 6 6 } } } 7 7 7 B; B; B; 8 8 8 break; break; break; 9 9 9 } } } 10 10 10 C; C; C; 11 11 11 } } } 12 12 12 D; D; D; 13 13 13 14 } 14 } 14 } (a) Original program (b) SDG slice (c) Minimal slice C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 3 / 14

  8. Program slicing The System Dependence Graph CDG CFG PDG SDG Slice DDG Figure: Sequence of graphs generated to produce a slice. Enter h() Enter h() 1 void h() { while (x < 10) while (x < 10) { 2 print(x); while (x < 10) 3 x++; 4 x++ print(x) } 5 print(x) x++ Exit h() 6 } PDG CFG Black: CDG, Red: DDG C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 4 / 14

  9. Program slicing The System Dependence Graph CDG CFG PDG SDG Slice DDG Figure: Sequence of graphs generated to produce a slice. Enter h() Enter h() 1 void h() { while (x < 10) while (x < 10) { 2 print(x); while (x < 10) 3 x++; 4 x++ print(x) } 5 print(x) x++ Exit h() 6 } PDG CFG Black: CDG, Red: DDG C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 4 / 14

  10. Program slicing The System Dependence Graph CDG CFG PDG SDG Slice DDG Figure: Sequence of graphs generated to produce a slice. Enter h() Enter h() 1 void h() { while (x < 10) while (x < 10) { 2 print(x); while (x < 10) 3 x++; 4 x++ print(x) } 5 print(x) x++ Exit h() 6 } PDG CFG Black: CDG, Red: DDG C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 4 / 14

  11. Program slicing The System Dependence Graph CDG CFG PDG SDG Slice DDG Figure: Sequence of graphs generated to produce a slice. Enter h() Enter h() 1 void h() { while (x < 10) while (x < 10) { 2 print(x); while (x < 10) 3 x++; 4 x++ print(x) } 5 print(x) x++ Exit h() 6 } PDG CFG Black: CDG, Red: DDG C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 4 / 14

  12. Program slicing Unconditional jumps ( break , return , goto ) in the CFG void main () { 1 x = 0; 2 while (true) { 3 x++; 4 if (x > 10) 5 break; 6 } 7 print(x); 8 } 9 C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

  13. Program slicing Unconditional jumps ( break , return , goto ) in the CFG void main () { 1 Enter main() x = 0; 2 while (true) { 3 x = 0 x++; 4 if (x > 10) 5 while (true) break; 6 break } 7 x++ if (x > 10) print(x) print(x); 8 } 9 Exit main() CFG: Jumps as arcs C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

  14. Program slicing Unconditional jumps ( break , return , goto ) in the CFG void main () { 1 Enter main() Enter main() x = 0; 2 while (true) { 3 x = 0 x++; 4 x = 0 while (true) print(x) if (x > 10) 5 while (true) break; 6 break } x++ if (x > 10) 7 x++ if (x > 10) print(x) print(x); 8 } 9 Exit main() CFG: Jumps as arcs C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

  15. Program slicing Unconditional jumps ( break , return , goto ) in the CFG void main () { 1 Enter main() Enter main() x = 0; 2 while (true) { 3 x = 0 x++; 4 x = 0 while (true) print(x) if (x > 10) 5 while (true) break; 6 break } x++ if (x > 10) 7 x++ if (x > 10) print(x) print(x); 8 } 9 Exit main() CFG: Jumps as arcs C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

  16. Program slicing Unconditional jumps ( break , return , goto ) in the CFG Enter main() void main () { 1 x = 0; 2 x = 0 while (true) { 3 x++; 4 while (true) if (x > 10) 5 break; 6 x++ if (x > 10) break print(x) } 7 print(x); 8 Exit main() } 9 CFG: Jumps as nodes C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

  17. Program slicing Unconditional jumps ( break , return , goto ) in the CFG Enter main() Enter main() void main () { 1 x = 0; 2 x = 0 while (true) { 3 x = 0 while (true) print(x) x++; 4 while (true) if (x > 10) 5 x++ if (x > 10) break; 6 x++ if (x > 10) break print(x) } 7 print(x); 8 break Exit main() } 9 CFG: Jumps as nodes C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

  18. Program slicing Unconditional jumps ( break , return , goto ) in the CFG Enter main() Enter main() void main () { 1 x = 0; 2 x = 0 while (true) { 3 x = 0 while (true) print(x) x++; 4 while (true) if (x > 10) 5 x++ if (x > 10) break; 6 x++ if (x > 10) break print(x) } 7 print(x); 8 break Exit main() } 9 CFG: Jumps as nodes C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

  19. Program slicing Unconditional jumps ( break , return , goto ) in the CFG void main () { Enter main() 1 x = 0; 2 while (true) { x = 0 3 x++; 4 if (x > 10) 5 while (true) break; 6 } 7 x++ if (x > 10) break print(x) print(x); 8 } 9 Exit main() ACFG: Adds non-exec. arcs to create control deps. C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

  20. Program slicing Unconditional jumps ( break , return , goto ) in the CFG Enter main() void main () { Enter main() 1 x = 0 while (true) x = 0; 2 while (true) { 3 x = 0 x++; 4 x++ if (x > 10) if (x > 10) 5 while (true) break; 6 } 7 x++ if (x > 10) break print(x) break print(x); 8 } 9 Exit main() print(x) ACFG: Adds non-exec. arcs to create control deps. C. Galindo et al. (UPV) Slicing Unconditional Jumps LOPSTR 2020 - September 9th 5 / 14

Recommend

Control flow Condition codes Conditional and unconditional jumps Loops Switch statements 1

Control flow Condition codes Conditional and unconditional jumps Loops Switch statements 1

Control flow Condition codes Conditional and unconditional jumps Loops Switch statements 1 Conditionals and Control Flow Two key pieces 1. Comparisons and tests: check conditions 2. Transfer control: choose next instruction Processor

2.09k views • 36 slides
Control flow (1) Condition codes Conditional and unconditional jumps Loops Conditional moves

Control flow (1) Condition codes Conditional and unconditional jumps Loops Conditional moves

Control flow (1) Condition codes Conditional and unconditional jumps Loops Conditional moves Switch statements 1 Conditionals and Control Flow Two key pieces 1. Comparisons and tests: check conditions 2. Transfer control: choose next

482 views • 37 slides
Control flow Condition codes Conditional and unconditional jumps Loops Switch statements 1

Control flow Condition codes Conditional and unconditional jumps Loops Switch statements 1

Control flow Condition codes Conditional and unconditional jumps Loops Switch statements 1 Conditionals and Control Flow Familiar C constructs l if else l while l do while l for l break l continue Two key pieces 1. Comparisons and tests:

809 views • 50 slides
Exceptional Control Flow: Hardware support for reacting to the rest of the world. Control Flow

Exceptional Control Flow: Hardware support for reacting to the rest of the world. Control Flow

Exceptional Control Flow: Hardware support for reacting to the rest of the world. Control Flow Processor: read instruction, execute it, go to next instruction, repeat Physical control flow Explicit changes: Jumps (conditional, unconditional)

428 views • 8 slides
An Overview of GIMPLE Control construct explicated into conditional and unconditional jumps

An Overview of GIMPLE Control construct explicated into conditional and unconditional jumps

1 July 2012 GIMPLE and RTL: Outline 1/39 Outline Workshop on Essential Abstractions in GCC Manipulating GIMPLE and RTL IRs An Overview of GIMPLE GCC Resource Center Using GIMPLE API in GCC-4.6.0 (www.cse.iitb.ac.in/grc) Adding a

436 views • 19 slides
DSL Design DSL Design Jumps/GOTOs Control flow in DSLs A jump transfers control to a

DSL Design DSL Design Jumps/GOTOs Control flow in DSLs A jump transfers control to a

DSL Design DSL Design Jumps/GOTOs Control flow in DSLs A jump transfers control to a specified program point A j f l ifi d i We will study a number of alternatives A jump has typical the form goto L; and transfer the control

173 views • 6 slides
Program Slicing 2 1 Program Slicing 1. Slicing overview 2. Types of slices, levels of slices

Program Slicing 2 1 Program Slicing 1. Slicing overview 2. Types of slices, levels of slices

Class 6 Review; questions Assign (see Schedule for links) Slicing overview (contd) Problem Set 3: due 9/8/09 1 Program Slicing 2 1 Program Slicing 1. Slicing overview 2. Types of slices, levels of slices 3. Methods

327 views • 28 slides
Excep&amp;onal Control Flow: Signals and Nonlocal Jumps

Excep&amp;onal Control Flow: Signals and Nonlocal Jumps

Carnegie Mellon Excep&amp;onal Control Flow: Signals and Nonlocal Jumps 15-213: Introduc0on to Computer Systems 13 th Lecture, Oct. 7, 2010 Instructors: Randy

871 views • 42 slides
Excep&amp;onal Control Flow: Signals and Nonlocal Jumps

Excep&amp;onal Control Flow: Signals and Nonlocal Jumps

Carnegie Mellon Excep&amp;onal Control Flow: Signals and Nonlocal Jumps 15-213: Introduc;on to Computer Systems 15 th Lecture, Oct. 20, 2015 Instructors:

563 views • 54 slides
Control Related Instructions - Jumps Control Related Instructions - Branches beq rs, rt,

Control Related Instructions - Jumps Control Related Instructions - Branches beq rs, rt,

Control Related Instructions - Jumps Control Related Instructions - Branches beq rs, rt, offset ; branch on equal: jr rs ; jump register: PC Regs[rs] if (Regs[rs] = Regs[rt]) then PC [PC]+4+ 14-bit sign extend || offset || 2

436 views • 4 slides
Excep&amp;onal Control Flow: Signals and Nonlocal Jumps

Excep&amp;onal Control Flow: Signals and Nonlocal Jumps

Excep&amp;onal Control Flow: Signals and Nonlocal Jumps (Chapter 8) 1 ECF Exists at All Levels of a System Excep&amp;ons Hardware and opera+ng

670 views • 50 slides
Maximum principles for optimal control of FBSDE with jumps Agn` es Sulem

Maximum principles for optimal control of FBSDE with jumps Agn` es Sulem

Maximum principles for optimal control of FBSDE with jumps Agn` es Sulem INRIA-Paris-Rocquencourt agnes.sulem@inria.fr RICAM Linz, October 20th 2008 joint work with Bernt ksendal (Oslo University) Agn` es Sulem INRIA-Paris-Rocquencourt

700 views • 34 slides
Exceptional Control Flow II Today Process Hierarchy Shells Signals Nonlocal jumps Next time

Exceptional Control Flow II Today Process Hierarchy Shells Signals Nonlocal jumps Next time

Exceptional Control Flow II Today Process Hierarchy Shells Signals Nonlocal jumps Next time I/O Chris Riesbeck, Fall 2011 Original: Fabian Bustamante Wednesday, November 16, 2011 The world of multitasking System runs many processes

942 views • 37 slides
Information Flow Control for Concurrent Programs via Program Slicing Dennis Giffhorn

Information Flow Control for Concurrent Programs via Program Slicing Dennis Giffhorn

Information Flow Control for Concurrent Programs via Program Slicing Dennis Giffhorn Universitt Karlsruhe (TH), Germany Dennis Giffhorn (Universitt Karlsruhe (TH)) IFC for Concurrent Programs via Slicing PLID08 1 / 19 Context

582 views • 23 slides
CS356 Unit 5 x86 Control Flow 5.2 JUMP/BRANCHING OVERVIEW 5.3 Concept of Jumps/Branches

CS356 Unit 5 x86 Control Flow 5.2 JUMP/BRANCHING OVERVIEW 5.3 Concept of Jumps/Branches

5.1 CS356 Unit 5 x86 Control Flow 5.2 JUMP/BRANCHING OVERVIEW 5.3 Concept of Jumps/Branches Assembly is executed in sequential movq addq order by default ---- Jump instruction (aka &quot;branches&quot;) ---- ---- cause execution

649 views • 32 slides
Key Points: Control Hazards Control hazards occur when we don t know what the next

Key Points: Control Hazards Control hazards occur when we don t know what the next

Key Points: Control Hazards Control hazards occur when we don t know what the next instruction is Caused by branches and jumps. Strategies for dealing with them Stall Guess! Leads to speculation Flushing the

657 views • 40 slides
Generalising Control Dependence 10th CREST Open Workshop Program Analysis and Slicing Sebastian

Generalising Control Dependence 10th CREST Open Workshop Program Analysis and Slicing Sebastian

Generalising Control Dependence 10th CREST Open Workshop Program Analysis and Slicing Sebastian Danicic Goldsmiths, University of London 25th January 2011 1 / 163 Co-Authors Richard W. Barraclough @UK PLC, Mark Harman Crest, University

2.06k views • 163 slides
Slicing Functional Programs: A Suspicion 10th CREST Open Workshop on Program Analysis and

Slicing Functional Programs: A Suspicion 10th CREST Open Workshop on Program Analysis and

Slicing Functional Programs: A Suspicion 10th CREST Open Workshop on Program Analysis and Slicing Henrik Nilsson School of Computer Science The University of Nottingham, UK Slicing Functional Programs: A Suspicion p.1/6 Slicing

410 views • 13 slides
Key Points: Control Hazards Control hazards occur when we dont know what the next

Key Points: Control Hazards Control hazards occur when we dont know what the next

Key Points: Control Hazards Control hazards occur when we dont know what the next instruction is Caused by branches and jumps. Strategies for dealing with them Stall Guess! Leads to speculation Flushing the

570 views • 32 slides
TDT4205 Lecture 18 2 Beyond jump and return Weve looked at how jumps to saved

TDT4205 Lecture 18 2 Beyond jump and return Weve looked at how jumps to saved

1 Function calls and the run-time stack TDT4205 Lecture 18 2 Beyond jump and return Weve looked at how jumps to saved addresses create the control flow of procedure calls Functions also require a local environment to be

534 views • 25 slides
Jumps and Non-jumps in q -Multigraphs Steve La Fleur (Joint work with Paul Horn and Vojt ech

Jumps and Non-jumps in q -Multigraphs Steve La Fleur (Joint work with Paul Horn and Vojt ech

Preliminary Known Results Jumps and Non-jumps in q -Multigraphs Steve La Fleur (Joint work with Paul Horn and Vojt ech R odl) May 14, 2011 Steve La Fleur (Joint work with Paul Horn and Vojt ech R odl) Jumps and Non-jumps in q

604 views • 32 slides
On the asymptotics of exit problem for controlled Markov diffusion processes with random jumps

On the asymptotics of exit problem for controlled Markov diffusion processes with random jumps

On the asymptotics of exit problem for controlled Markov diffusion processes with random jumps and vanishing diffusion terms CONTROL SYSTEMS AND THE QUEST FOR AUTONOMY A Symposium in Honor of Professor Panos J. Antsaklis University of Notre

472 views • 22 slides
Using program slicing data to predict code faults David Bowes University of Hertfordshire

Using program slicing data to predict code faults David Bowes University of Hertfordshire

Outline Using program slicing data to predict code faults Calculating the Slicing metrics for a module Relating slicing metrics to fault data Conclusion Using program slicing data to predict code faults David Bowes University of

579 views • 15 slides
Dynamic Slicing Techniques for Petri Nets M. Llorens, J. Oliver, J. Silva, S. Tamarit, G. Vidal

Dynamic Slicing Techniques for Petri Nets M. Llorens, J. Oliver, J. Silva, S. Tamarit, G. Vidal

Motivation Dynamic Slicing in PN from an initial marking Dynamic Slicing in PN from a firing sequence Conclusions and Future Work Dynamic Slicing Techniques for Petri Nets M. Llorens, J. Oliver, J. Silva, S. Tamarit, G. Vidal Dep. of

378 views • 35 slides

More recommend