a story of parametric trace slicing garbage and static
play

A Story of Parametric Trace Slicing, Garbage and Static Analysis - PowerPoint PPT Presentation

Dec 03, 2023 •268 likes •1.01k views

A Story of Parametric Trace Slicing, Garbage and Static Analysis Giles Reger School of Computer Science, University of Manchester, UK PrePost 2017 Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 1 / 31 Context

  1. A Story of Parametric Trace Slicing, Garbage and Static Analysis Giles Reger School of Computer Science, University of Manchester, UK PrePost 2017 Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 1 / 31

  2. Context Helped develop the Quantified Event Automata (QEA) language and associated MarQ runtime monitoring tool Have started thinking about typestate-analysis for QEA, wrote about it at ISoLA 2016 This idea grew out of that and I thank Adrian for encouraging me to write the idea down Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 2 / 31

  3. Introduction In this talk I will outline some ideas around how we can relate the ideas of Garbage collection at runtime Static identification of object unreachability to improve the performance of runtime monitoring based on parametric trace slicing Note that we are explicitly exclusively in the realms of monitoring Java programs using a monitor that shares the same JVM. These ideas haven’t yet been implemented but the intention is to realise them in the MarQ runtime monitoring tool for QEA Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 3 / 31

  4. The Idea At a high level: Parametric trace slicing is a runtime monitoring approach that tracks the behaviour of groups of objects By detecting when some of those objects become garbage we can ◮ Optimise the monitoring algorithm ◮ Potentially detect violations of co-safety properties But there can be a delay before something is recognised as garbage The idea is to statically identify points where an object will become unreachable to insert explicit garbage events Now I will introduce parametric trace slicing and how it can be improved by garbage detection and then discuss how static analysis can play a part Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 4 / 31

  5. Overview Parametric Trace Slicing 1 Online Monitoring and Garbage 2 Static Analysis 3 What’s Next? 4 Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 5 / 31

  6. Parametric Trace Slicing Used first in tracematches but named and extended to total matching in the JavaMOP work. Later adopted by the QEA language (and others) A solution for parametric runtime monitoring concerned with events that carry parameters The philosophy behind the approach is to slice a trace based on the values of parameters and to consider each slice separately I will introduce the idea by example Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 6 / 31

  7. HasNext Example HasNext For every iterator object i (instance of java.util.Iterator ) we only call i . next () if a preceding call of i . hasNext () returned true with no intermediate calls to i . next () or i . hasNext (). hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 7 / 31

  8. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  9. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ [ i �→ i2 ] �→ hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  10. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) [ i �→ i2 ] �→ hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  11. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) [ i �→ i2 ] �→ hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  12. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) [ i �→ i2 ] �→ hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  13. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) [ i �→ i2 ] �→ hasNextF ( i2 ) hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  14. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) [ i �→ i2 ] �→ hasNextF ( i2 ) next ( i2 ) hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  15. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) next ( i1 ) [ i �→ i2 ] �→ hasNextF ( i2 ) next ( i2 ) hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  16. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) next ( i1 ) [ i �→ i2 ] �→ hasNextF ( i2 ) next ( i2 ) hasNextT ( i ) hasNextT ( i ) next ( i ) hasNextT ( i ) 1 1 2 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  17. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) next ( i1 ) [ i �→ i2 ] �→ hasNextF ( i2 ) next ( i2 ) hasNextT ( i ) next ( i ) next ( i ) hasNextT ( i ) 1 1 2 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  18. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) next ( i1 ) [ i �→ i2 ] �→ hasNextF ( i2 ) next ( i2 ) hasNextT ( i ) hasNextT ( i ) next ( i ) hasNextT ( i ) 1 1 2 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  19. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) next ( i1 ) � [ i �→ i2 ] �→ hasNextF ( i2 ) next ( i2 ) hasNextT ( i ) next ( i ) next ( i ) hasNextT ( i ) 1 1 2 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  20. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) next ( i1 ) � [ i �→ i2 ] �→ hasNextF ( i2 ) next ( i2 ) hasNextT ( i ) next ( i ) hasNextT ( i ) 1 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) hasNextF ( i ) 3 3 4 next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  21. HasNext Example hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) hasNextF ( i2 ) next ( i2 ) next ( i1 ) [ i �→ i1 ] �→ hasNextT ( i1 ) next ( i1 ) hasNextT ( i1 ) next ( i1 ) � [ i �→ i2 ] �→ hasNextF ( i2 ) next ( i2 ) X hasNextT ( i ) next ( i ) hasNextT ( i ) 1 2 next ( i ) hasNextF ( i ) hasNextF ( i ) 3 3 4 4 next ( i ) , hasNextT ( i ) next ( i ) , hasNextT ( i ) Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 8 / 31

  22. UnsafeIter Example UnsafeIter For every collection c and iterator object i created from c , the iterator i is not used (e.g. by calls to i . next ()) after c has been updated. use ( i ) update ( c ) create ( c , i ) update ( c ) use ( i ) 1 2 3 4 Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 9 / 31

  23. UnsafeIter Example create ( A , i1 ) use ( i1 ) create ( A , i2 ) use ( i2 ) update ( A ) use ( i1 ) use ( i ) update ( c ) create ( c , i ) update ( c ) use ( i ) 1 2 3 4 Giles Reger A Story of Parametric Trace Slicing, Garbage and Static Analysis 10 / 31

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

What is Parametric Trace Slicing Good For? Giles Reger School of Computer Science, University of

What is Parametric Trace Slicing Good For? Giles Reger School of Computer Science, University of

What is Parametric Trace Slicing Good For? Giles Reger School of Computer Science, University of Manchester, UK Giles Reger What is Parametric Trace Slicing Good For? 1 / 13 The Setting: Events and Traces Parametric Trace Slicing (PTS): The

129 views • 12 slides
Performance issues and optimizations Giles Reger University of Manchester September 24, 2016

Performance issues and optimizations Giles Reger University of Manchester September 24, 2016

Optimising Parametric Trace Slicing Static Partial Evaluation of Monitors Evaluating Runtime Monitoring Tools Performance issues and optimizations Giles Reger University of Manchester September 24, 2016 Optimising Parametric Trace Slicing

1.76k views • 146 slides
From First-order Temporal Logic to Parametric Trace Slicing Giles Reger David Rydeheard

From First-order Temporal Logic to Parametric Trace Slicing Giles Reger David Rydeheard

Motivation FO-LTL f Slicing Slicability Usable Fragment Translation Conclude From First-order Temporal Logic to Parametric Trace Slicing Giles Reger David Rydeheard University of Manchester, Manchester, UK September 25, 2015 Motivation

590 views • 40 slides
From Parametric Trace Slicing to Rule Systems Giles Reger David Rydeheard University of

From Parametric Trace Slicing to Rule Systems Giles Reger David Rydeheard University of

Motivation Two Languages The Translation Properties Discussion From Parametric Trace Slicing to Rule Systems Giles Reger David Rydeheard University of Manchester, Manchester, UK November 11, 2018 Motivation Two Languages The Translation

885 views • 51 slides
Hosea 11:12 12:14 By Paul Lamey 1. Can I trace the story of Gods grace? (11:12 12:6) 1.

Hosea 11:12 12:14 By Paul Lamey 1. Can I trace the story of Gods grace? (11:12 12:6) 1.

Hosea 11:12 12:14 By Paul Lamey 1. Can I trace the story of Gods grace? (11:12 12:6) 1. Can I trace the story of Gods grace? (11:12 12:6) A. Episode #1 (e.g., Genesis 25 27) All are born in sin and deceit. 1. Can I trace

116 views • 8 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
FOX Garbage Collection FOX / GC Example 1 ex1: garbage at end let x = (1, 2) , y = let tmp =

FOX Garbage Collection FOX / GC Example 1 ex1: garbage at end let x = (1, 2) , y = let tmp =

FOX Garbage Collection FOX / GC Example 1 ex1: garbage at end let x = (1, 2) , y = let tmp = (10, 20) in tmp[0] + tmp[1] , p0 = x[0] + y , p1 = x[1] + y in (p0, p1) ebp 0x00 0x04 0x08 0x0c 0x10 0x14 0x18 0x1c 0x20 0x24 esi

1.36k views • 122 slides
of optimized code Michael Ernst University of Washington (work done at Microsoft Research)

of optimized code Michael Ernst University of Washington (work done at Microsoft Research)

Practical fine-grained static slicing of optimized code Michael Ernst University of Washington (work done at Microsoft Research) Ernst Slicing 5/97 Page 1 Simple example Ernst Slicing 5/97 Page 2 Example: function calls and pointers Ernst

862 views • 34 slides
1 For the love of money is a root of all kinds of evils. It is through this craving that some

1 For the love of money is a root of all kinds of evils. It is through this craving that some

COUNTING IT ALL GARBAGE Part 5: Spending - 05.16.10 PLAY Count It All Play: Count It All Garbage Video Clip [2:00] Garbage {2:00] Intro: We re now into part 5 of this sermon series. Garbage is anything that comes between us and

659 views • 4 slides
1 QC STORY -32 QC STORY -32 QC STORY -32 QC Story-1 QC Story-1 QC Story-1 Awards and

1 QC STORY -32 QC STORY -32 QC STORY -32 QC Story-1 QC Story-1 QC Story-1 Awards and

QC STORY -32 QC STORY -32 QC STORY -32 Shop Floor view QC Story-1 QC Story-1 FACTORY OVERVIEW QC Story-1 On Behalf of Susira Industries Ltd., Chennai. We Welcome the Delegates for the QCI DL SHAH NATIONAL AWARDS ON ECONOMICS OF

976 views • 13 slides
Efficient Parametric Identification for STL Thomas Ferr` ere Oded Maler Alexey Bakhirkin

Efficient Parametric Identification for STL Thomas Ferr` ere Oded Maler Alexey Bakhirkin

Efficient Parametric Identification for STL Thomas Ferr` ere Oded Maler Alexey Bakhirkin Monitoring vs. Parametric Identification Monitoring Do traces of a black box satisfy a property? Spec w SAT ? Trace w System Monitor 0 or 1

563 views • 21 slides
Garbage Collection Jan Midtgaard Michael I. Schwartzbach Aarhus University The Garbage

Garbage Collection Jan Midtgaard Michael I. Schwartzbach Aarhus University The Garbage

Compilation 2010 Garbage Collection Jan Midtgaard Michael I. Schwartzbach Aarhus University The Garbage Collector A garbage collector is part of the runtime system It reclaims heap-allocated records (objects) that are no longer in use

959 views • 56 slides
Sometimes There are Dumb Questions Garbage in-Garbage out: Why most surveys are worse than

Sometimes There are Dumb Questions Garbage in-Garbage out: Why most surveys are worse than

Sometimes There are Dumb Questions Garbage in-Garbage out: Why most surveys are worse than useless (except for yours of course ) Scott McIntyre, PhD Engineering & Experimental Psychologist Project Lifecycle 1. Identify Customer Needs

606 views • 33 slides
Is Big Data ready to improve outcomes or is it a new generation of garbage in/garbage out? Yves

Is Big Data ready to improve outcomes or is it a new generation of garbage in/garbage out? Yves

Is Big Data ready to improve outcomes or is it a new generation of garbage in/garbage out? Yves A. Lussier, M.D., Fellow ACMI Professor of Medicine, Assoc. Vice-President for Health Sciences & Chief Knowledge Officer Director for Precision

554 views • 26 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
Garbage Collection Akim Demaille, Etienne Renault, Roland Levillain June 4, 2019 TYLA Garbage

Garbage Collection Akim Demaille, Etienne Renault, Roland Levillain June 4, 2019 TYLA Garbage

Garbage Collection Akim Demaille, Etienne Renault, Roland Levillain June 4, 2019 TYLA Garbage Collection June 4, 2019 1 / 35 Table of contents Motivations and Definitions 1 Reference Counting Garbage Collection 2 Mark and Sweep Garbage

1.21k views • 95 slides
Distributed Garbage Collection for General Graphs Basic Approaches to Garbage Collection

Distributed Garbage Collection for General Graphs Basic Approaches to Garbage Collection

Distributed Garbage Collection for General Graphs Basic Approaches to Garbage Collection The Brownbridge Collector SWP Collector

1.16k views • 88 slides
ADVANCED DATABASE SYSTEMS Multi-Version Concurrency Control (Garbage Collection) @ Andy_Pavlo

ADVANCED DATABASE SYSTEMS Multi-Version Concurrency Control (Garbage Collection) @ Andy_Pavlo

Lect ure # 05 ADVANCED DATABASE SYSTEMS Multi-Version Concurrency Control (Garbage Collection) @ Andy_Pavlo // 15- 721 // Spring 2019 CMU 15-721 (Spring 2019) 2 MVCC GARBAGE COLLECTIO N A MVCC DBMS needs to remove reclaimable physical

837 views • 59 slides
Thompson Sampling Algorithms for Mean-Variance Bandits Qiuyu Zhu Vincent Y. F. Tan Institute of

Thompson Sampling Algorithms for Mean-Variance Bandits Qiuyu Zhu Vincent Y. F. Tan Institute of

Thompson Sampling Algorithms for Mean-Variance Bandits Qiuyu Zhu Vincent Y. F. Tan Institute of Operations Research and Analytics, National University of Singapore ICML 2020 Qiuyu Zhu, Vincent Y. F. Tan TS Algorithms for Mean-Variance

526 views • 27 slides
Rejection Power for the Hadron-cluster Background with the upgraded KOTO CsI calorimeter

Rejection Power for the Hadron-cluster Background with the upgraded KOTO CsI calorimeter

Rejection Power for the Hadron-cluster Background with the upgraded KOTO CsI calorimeter 2019/12/23 Osugi Mayu @ Year End Presentation 1 KOTO Experiment Hadron-cluster background & both-end readout Contents 2 Introduction

436 views • 14 slides
Basics of Garbage Collection Merlin Laue Universitt zu Lbeck 9. November 2015 Merlin Laue

Basics of Garbage Collection Merlin Laue Universitt zu Lbeck 9. November 2015 Merlin Laue

Motivation Problems Algorithms Exact vs. Conservative Conclusion Basics of Garbage Collection Merlin Laue Universitt zu Lbeck 9. November 2015 Merlin Laue (Uni Lbeck) Basics of Garbage Collection 9. November 2015 1 Motivation

525 views • 26 slides
GC Assertions: Using the Garbage Collector to check heap properties Shirley Gracelyn February

GC Assertions: Using the Garbage Collector to check heap properties Shirley Gracelyn February

GC Assertions: Using the Garbage Collector to check heap properties Shirley Gracelyn February 16, 2011 Motivation 1 Automatic memory management frees some burden from programmers 2 Fewer memory management errors Motivation 1 Automatic memory

278 views • 26 slides
C# Programming in Depth Prof. Dr. Bertrand Meyer March 2007 May 2007 Lecture 4: Garbage

C# Programming in Depth Prof. Dr. Bertrand Meyer March 2007 May 2007 Lecture 4: Garbage

Chair of Softw are Engineering C# Programming in Depth Prof. Dr. Bertrand Meyer March 2007 May 2007 Lecture 4: Garbage Collection & Exception Handling Lisa (Ling) Liu Overview Scope and lifetime Garbage collection mechanism

533 views • 26 slides
Intermediate Math Circles - When You Arrive If you have been here before Check your name on the

Intermediate Math Circles - When You Arrive If you have been here before Check your name on the

Intermediate Math Circles - When You Arrive If you have been here before Check your name on the attendance sheet Pick up this weeks handout While you are waiting try this question. Find the sum of the following series. 22 + 23 + 24 + 25 +

940 views • 68 slides

More recommend