Liveness Analysis

Duration: 29 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/compiler-design/code-optimization/liveness-analysis/asset-liveness-analysis after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces liveness analysis in compiler design, beginning with the definitions of USE/GEN and DEF/KILL sets. The instructor uses a simple code example, x = a + b and y = x + c, to show that USE/GEN is {a, b, c} and DEF/KILL is {x, y}. The core dataflow equations are then presented: IN(n) = USE(n) ∪ (OUT(n) - DEF(n)) and OUT(n) = ⋃ IN(s) for s ∈ Successor(n). The term successor is defined as the node to which control can directly move. A four-block Control Flow Graph (CFG) is introduced as the main worked example: Block 1 contains p = q + r, s = p * q (or p + q), u = s / v; Block 2 contains v = u * r (or u + r); Block 3 contains q = s - u; and Block 4 contains q = v + r. The instructor builds a table with columns for Basic Block, USE, DEF, IN, and OUT, filling in the sets row by row. For example, Block 1 has USE {q, r, v} and DEF {p, s, u}. The lecture proceeds by applying the IN/OUT equations iteratively to compute live variables at entry and exit for each basic block, using the CFG edges including a back edge from Block 4 to Block 1. The final section continues filling the table with variable sets such as {p, q, r, v} and {s, u}, demonstrating the fixed-point computation of liveness.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture opens with a slide titled 'Liveness Analysis' and defines USE/GEN as variables used in a block before any assignment. The on-screen example shows 'x = a + b' and 'y = x + c', with USE/GEN = {a, b, c} highlighted. A DEF/KILL section is also shown. The view then switches to a Control Flow Graph with four boxes labeled Basic Block 1 through Basic Block 4, connected by arrows including a back edge from block 4 to block 1.

  2. 2:00 – 5:00 02:00-05:00

    The instructor presents the CFG with four basic blocks and asks for IN (Entry) and OUT (Exit) live variables. The slide defines USE/GEN as variables used before assignment, with the example 'x = a + b' and 'y = x + c' yielding USE/GEN {a, b, c}. DEF/KILL is defined as variables assigned a value in the block. The IN(n) and OUT(n) formulas are introduced: IN(n) = USE(n) ∪ (OUT(n) - DEF(n)) and OUT(n) = ⋃ IN(s) over s ∈ Successor(n). The instructor points to Basic Block 1 in the CFG.

  3. 5:00 – 10:00 05:00-10:00

    The instructor writes liveness formulas in magenta marker on the whiteboard: IN(m) = USE(m) ∪ (DEF(m) - OUT(m)) and later corrects to IN(m) = USE(m) ∪ (OUT(m) - DEF(m)), with OUT(m) = ⋃ IN(n), n ∈ Successor. A CFG is drawn with Basic Block 1 containing 'p = q + r', 's = p * q' (or 's = p + q'), 'u = s / v'; Block 2 with 'v = u * r' (or 'v = u + r'); Block 3 with 'q = s - u'; and Block 4 with 'q = v + r'. The on-screen prompt reads 'Q. Consider the following Control Flow Graph:' asking to determine IN and OUT live variables.

  4. 10:00 – 15:00 10:00-15:00

    The instructor begins filling a table with columns 'Basic Block', 'USE', 'DEF'. Row 1 shows USE {q, r, v} and DEF {p, s, u}. The table then gains 'IN' and 'OUT' columns. The purple formulas at the top read IN(m) = USE(m) ∪ (OUT(m) - DEF(m)) and OUT(m) = ⋃ IN(n), n ∈ Successor. The CFG blocks contain statements such as 'q = p + r', 's = p + q', 'u = s / v' in Block 1, 'v = u * r' in Block 2, and 'q = s - u' in Block 3.

  5. 15:00 – 20:00 15:00-20:00

    The instructor continues writing into the liveness table while the CFG is drawn on the left. The CFG shows Basic Block 1 with 'p = q + r', 's = p + q', 'u = s / v'; Block 2 with 'v = u * r' (or 'v = u + r'); Block 3 with 'q = s - u'; and Block 4 with 'q = v + r'. Top-right formulas read IN(m) = USE(m) ∪ (OUT(m) - DEF(m)) and OUT(m) = ⋃ IN(n), S ∈ Successor. The table headers are 'Basic Block', 'USE', 'DEF', 'IN', 'OUT'; row 1 lists USE {q, r, v} and DEF {p, s, u}.

  6. 20:00 – 25:00 20:00-25:00

    The instructor continues filling the liveness table row by row with variable sets. The CFG lists Basic Block 1 (p = q + r, s = p + q, u = s / v), Block 2 (v = u + r), Block 3 (q = s - u), and Block 4 (q = v + r). Top-right formulas read IN(m) = USE(m) ∪ (OUT(m) − DEF(m)) and OUT(m) = ⋃ IN(n), S ∈ Successor. A table with columns Basic Block, USE, DEF, IN, OUT plus a second IN/OUT pair is filled with variable sets such as {p, q, r, v} and {s, u}.

  7. 25:00 – 28:32 25:00-28:32

    The final section shows the completed or nearly completed liveness table with all four basic blocks. The graph lists Basic Block 1 (p = q + r, s = p + q, u = s / v), Block 2 (v = u + r), Block 3 (q = s - u), and Block 4 (q = v + r). Top-right formulas read IN(m) = USE(m) ∪ (OUT(m) − DEF(m)) and OUT(m) = ⋃ IN(n), S ∈ Successor. The table is filled row by row with variable sets, demonstrating the iterative fixed-point computation of live variables at entry and exit for each block.

The lecture systematically builds liveness analysis from definitions to a worked example. First, USE/GEN and DEF/KILL are defined using the simple code x = a + b; y = x + c, yielding USE/GEN {a, b, c} and DEF/KILL {x, y}. The dataflow equations IN(n) = USE(n) ∪ (OUT(n) - DEF(n)) and OUT(n) = ⋃ IN(s) for s ∈ Successor(n) are then introduced. The successor concept is defined as the node control can directly move to. A four-block CFG serves as the main example, with Block 1 containing three statements (p = q + r, s = p * q or p + q, u = s / v), Block 2 (v = u * r or u + r), Block 3 (q = s - u), and Block 4 (q = v + r). The instructor constructs a table with USE, DEF, IN, and OUT columns for each block. Block 1's USE is {q, r, v} and DEF is {p, s, u}. The IN/OUT equations are applied iteratively across the CFG edges, including a back edge from Block 4 to Block 1, to compute live variable sets at entry and exit. The table is filled row by row with sets such as {p, q, r, v} and {s, u}, illustrating the fixed-point iteration process central to liveness analysis.

Loading lesson…