1 from stack traces to lazy rewriting sequences
play

1 From Stack Traces to Lazy Rewriting Sequences Stephen Chang , Eli - PowerPoint PPT Presentation

Sep 23, 2022 •110 likes •976 views

1 From Stack Traces to Lazy Rewriting Sequences Stephen Chang , Eli Barzilay, John Clements*, Matthias Felleisen Northeastern University *California Polytechnic State University 10/5/2011 2 Debugging lazy programs is hard. 3 Freja (Nilsson

  1. 1

  2. From Stack Traces to Lazy Rewriting Sequences Stephen Chang , Eli Barzilay, John Clements*, Matthias Felleisen Northeastern University *California Polytechnic State University 10/5/2011 2

  3. Debugging lazy programs is hard. 3

  4. Freja (Nilsson and Fritzson 1992) Hat (Sparud and Runciman, 1997) Buddha (Pope, 1998) HOOD (Gill, 2000) New Hat (Wallace et al., 2001) HsDebug (Ennals and Peyton Jones, 2003) Rectus (Murk and Kolmoldin, 2006) GHCi debugger (Marlow et al., 2007) StackTrace (Allwood et al., 2009) 4

  5. Freja (Nilsson and Fritzson 1992) Hat (Sparud and Runciman, 1997) Buddha (Pope, 1998) HOOD (Gill, 2000) New Hat (Wallace et al., 2001) HsDebug (Ennals and Peyton Jones, 2003) Rectus (Murk and Kolmoldin, 2006) GHCi debugger (Marlow et al., 2007) StackTrace (Allwood et al., 2009) What do you think is Haskell's most glaring weakness / blind spot / problem? [Tibell, Knowlson 2011] Inadequate Tools (50%) 5

  6. [State of Haskell Survey 2011] 6

  7. [State of Haskell Survey 2011] "A debugger adjusted to the complexity of debugging lazily evaluated structures." (weeks) 7

  8. [State of Haskell Survey 2011] "A debugger adjusted to the complexity of debugging lazily evaluated structures." (weeks) "Laziness is hard to come to grips with. It's powerful and good, but it also causes strange problems that a beginner often cannot diagnose." (months) 8

  9. [State of Haskell Survey 2011] "A debugger adjusted to the complexity of debugging lazily evaluated structures." (weeks) "Laziness is hard to come to grips with. It's powerful and good, but it also causes strange problems that a beginner often cannot diagnose." (months) "I think that a good debugger that lets me step through a program /quickly and comfortably/ would be a great help." (1yr) 9

  10. [State of Haskell Survey 2011] "A debugger adjusted to the complexity of debugging lazily evaluated structures." (weeks) "Laziness is hard to come to grips with. It's powerful and good, but it also causes strange problems that a beginner often cannot diagnose." (months) "I think that a good debugger that lets me step through a program /quickly and comfortably/ would be a great help." (1yr) "I'd love to see some debugging (~step by step evaluation/run tracing) support." (2yrs) 10

  11. [State of Haskell Survey 2011] "A debugger adjusted to the complexity of debugging lazily evaluated structures." (weeks) "Laziness is hard to come to grips with. It's powerful and good, but it also causes strange problems that a beginner often cannot diagnose." (months) "I think that a good debugger that lets me step through a program /quickly and comfortably/ would be a great help." (1yr) "I'd love to see some debugging (~step by step evaluation/run tracing) support." (2yrs) "Debugging lazy code" (4 yrs) 11

  12. [State of Haskell Survey 2011] "A debugger adjusted to the complexity of debugging lazily evaluated structures." (weeks) "Laziness is hard to come to grips with. It's powerful and good, but it also causes strange problems that a beginner often cannot diagnose." (months) "I think that a good debugger that lets me step through a program /quickly and comfortably/ would be a great help." (1yr) "I'd love to see some debugging (~step by step evaluation/run tracing) support." (2yrs) "Debugging lazy code" (4 yrs) Better lazy step-based tools are needed. 12

  13. What's a "step"? 13

  14. HsDebug [Ennals and Peyton Jones 2003] 14

  15. HsDebug [Ennals and Peyton Jones 2003] • Evaluate expressions optimistically. 15

  16. HsDebug [Ennals and Peyton Jones 2003] non-termination errors • Evaluate expressions optimistically. • To preserve lazy behavior, handle special cases: 16

  17. HsDebug [Ennals and Peyton Jones 2003] non-termination errors • Evaluate expressions optimistically. • To preserve lazy behavior, handle special cases: • Too difficult to implement. 17

  18. Idea #1: Debugger shouldn't change the program evaluation model. 18

  19. GHCi Debugger [Marlow et al. 2007] 19

  20. GHCi Debugger [Marlow et al. 2007] • Shows the effects of laziness. 20

  21. GHCi Debugger [Marlow et al. 2007] • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 21

  22. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 22

  23. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 23

  24. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 24

  25. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 25

  26. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 26

  27. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 27

  28. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 28

  29. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 29

  30. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 30

  31. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 31

  32. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 32

  33. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4) ) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 33

  34. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" 34

  35. GHCi Debugger [Marlow et al. 2007] test1 x y = (test2 y) + x test2 x = x * 2 test3 x = x + 1 main = print $ test1 (1 + 2) (test3 (3 + 4)) -- unfamiliar to programmers. • Shows the effects of laziness. • "having execution jump around can be distracting and confusing" • Step semantics correspond to low-level implementation 35

  36. Idea #2: Debugger should use a high-level semantics familiar to programmers. 36

  37. A reduction semantics-based tool [Gibbons and Wansbrough 1996, Ariola et al. 1995] 37

  38. A reduction semantics-based tool [Gibbons and Wansbrough 1996, Ariola et al. 1995] • Persistent arguments clutter reductions. 38

  39. A reduction semantics-based tool [Gibbons and Wansbrough 1996, Ariola et al. 1995] • Persistent arguments clutter reductions. 39

  40. A reduction semantics-based tool [Gibbons and Wansbrough 1996, Ariola et al. 1995] • Persistent arguments clutter reductions. 40

  41. A reduction semantics-based tool [Gibbons and Wansbrough 1996, Ariola et al. 1995] • Persistent arguments clutter reductions. 41

  42. A reduction semantics-based tool [Gibbons and Wansbrough 1996, Ariola et al. 1995] • Persistent arguments clutter reductions. • Extraneous reductions. 42

  43. A reduction semantics-based tool [Gibbons and Wansbrough 1996, Ariola et al. 1995] • Persistent arguments clutter reductions. • Extraneous reductions. 43

  44. A reduction semantics-based tool [Gibbons and Wansbrough 1996, Ariola et al. 1995] • Persistent arguments clutter reductions. • Extraneous reductions. 44

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

Lazy Context Cloning for Non-Deterministic Graph Rewriting Sergio Antoy Portland State

Lazy Context Cloning for Non-Deterministic Graph Rewriting Sergio Antoy Portland State

Lazy Context Cloning for Non-Deterministic Graph Rewriting Sergio Antoy Portland State University TERMGRAPH06, Vienna, Austria, April 1, 2006 Joint work with Daniel Brown and Su-Hui Chiang Partially supported by the NSF grant CCR-0218224

482 views • 20 slides
Option Values, Arrays, Sequences, and Lazy Evaluation Bjrn Lisper School of Innovation,

Option Values, Arrays, Sequences, and Lazy Evaluation Bjrn Lisper School of Innovation,

Option Values, Arrays, Sequences, and Lazy Evaluation Bjrn Lisper School of Innovation, Design, and Engineering Mlardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/blr/ Option Values, Arrays, Sequences, and Lazy Evaluation

711 views • 39 slides
1 Array-based Stack (2.1.1) Algorithm pop (): if isEmpty () then A simple way of throw

1 Array-based Stack (2.1.1) Algorithm pop (): if isEmpty () then A simple way of throw

Elementary Data Structures Stacks, Queues, Vectors, Lists & Sequences Trees The Stack ADT (2.1.1) The Stack ADT stores arbitrary objects Insertions and deletions Auxiliary stack follow the last-in first-out operations: scheme

473 views • 13 slides
Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis Sahar Abbaspour,

Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis Sahar Abbaspour,

Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis Sahar Abbaspour, Alexander Jordan Florian Brandner Embedded Systems Engineering Sect. Unit e dInformatique et dIng. des Syst` emes Technical University of

805 views • 80 slides
BECLoMA: Augmenting Stack Traces with User Review Information L. Pelloni, G. Grano, A.

BECLoMA: Augmenting Stack Traces with User Review Information L. Pelloni, G. Grano, A.

BECLoMA: Augmenting Stack Traces with User Review Information L. Pelloni, G. Grano, A. Ciurumelea, S. Panichella, F. Palomba, H. Gall SANER 2018, 20-23 March, Campobasso (Italy) grano@ifi.uzh.ch giograno90 149 billions of apps 12 millions

592 views • 18 slides
Stack Traces in Haskell Arash Rouhani Chalmers University of Technology Master thesis

Stack Traces in Haskell Arash Rouhani Chalmers University of Technology Master thesis

Stack Traces in Haskell Arash Rouhani Chalmers University of Technology Master thesis presentation March 21, 2014 Contents Motivation Background The attempt in August 2013 Contribution Arash Rouhani Thesis presentation

904 views • 69 slides
Elementary Data Structures Stacks & Queues Lists, Vectors, Sequences Amortized Analysis

Elementary Data Structures Stacks & Queues Lists, Vectors, Sequences Amortized Analysis

Elementary Data Structures Stacks & Queues Lists, Vectors, Sequences Amortized Analysis Trees push pop Stack ADT top of stack Container that stores arbitrary objects Insertions and deletions follow last-in first-out (LIFO) scheme

786 views • 36 slides
Eligibility Traces Chapter 12 Eligibility traces are Another way of interpolating between MC and

Eligibility Traces Chapter 12 Eligibility traces are Another way of interpolating between MC and

Eligibility Traces Chapter 12 Eligibility traces are Another way of interpolating between MC and TD methods A way of implementing compound -return targets A basic mechanistic idea a short-term, fading memory A new style of algorithm

881 views • 31 slides
Imagine for a moment @trentmwillis Lazy Loading Engines: Anything But Lazy Engines allow

Imagine for a moment @trentmwillis Lazy Loading Engines: Anything But Lazy Engines allow

Imagine for a moment @trentmwillis Lazy Loading Engines: Anything But Lazy Engines allow multiple logical applications to be composed together into a single application from the users perspective. - Engine RFC Lazy Loading Engines.

1.44k views • 78 slides
Evaluating Call-by-need on the Control Stack Stephen Chang, David Van Horn, Matthias Felleisen

Evaluating Call-by-need on the Control Stack Stephen Chang, David Van Horn, Matthias Felleisen

Evaluating Call-by-need on the Control Stack Stephen Chang, David Van Horn, Matthias Felleisen Northeastern University Lazy Abstract Machines Sharing implemented with: heap Lazy Abstract Machines Sharing implemented with: heap

1.1k views • 88 slides
Capture, conversion, and analysis of an intense NFS workload uating newer storage systems because

Capture, conversion, and analysis of an intense NFS workload uating newer storage systems because

the analysis or simulation. about 750 million operations per day. In comparison, the vironment than prior traces, we limit our comparisons Since our traces were captured in such a different en- convert, and analyze the traces. quired us to

366 views • 14 slides
Modeling interaction traces of an online panel From raw interaction traces to actionable

Modeling interaction traces of an online panel From raw interaction traces to actionable

Modeling interaction traces of an online panel From raw interaction traces to actionable indicators: lessons learned 8th European Survey Research Association conference July 2019, Zagreb Simon DELLAC Elodie PETORIN (both CDSP, Sciences Po)

435 views • 18 slides
20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more

20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more

20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more generally behaviors are about Sequences are used integrating the concept of time into what is learned. In } to analyze time dependent data general,

298 views • 6 slides
Can We Represent Infinite Lists? Lazy Evaluation Amtoft Motivation Lazy Lists Conversions

Can We Represent Infinite Lists? Lazy Evaluation Amtoft Motivation Lazy Lists Conversions

Can We Represent Infinite Lists? Lazy Evaluation Amtoft Motivation Lazy Lists Conversions to/from Certain collections are infinite, like the set of all natural Standard Lists Higher-Order Functions numbers. We may try Merging Lazy Lists

556 views • 13 slides
Optimizing Scheme, part I cons should not cons its arguments, part I a Lazy Alloc is a Smart Alloc

Optimizing Scheme, part I cons should not cons its arguments, part I a Lazy Alloc is a Smart Alloc

Optimizing Scheme, part I cons should not cons its arguments, part I a Lazy Alloc is a Smart Alloc Alex Gal COMP 621 cancelled Samuel G elineau stack-storage optimization for short-lived data a one slide summary most object are

395 views • 28 slides
Stack and Queue Stack Overview Stack ADT Basic operations of stack Pushing, popping

Stack and Queue Stack Overview Stack ADT Basic operations of stack Pushing, popping

Stack and Queue Stack Overview Stack ADT Basic operations of stack Pushing, popping etc. Implementations of stacks using array linked list The Stack ADT A stack is a list with the restriction that insertions and

566 views • 44 slides
Anterior Spine Exposure Lessons Learned & Relearned Charles Eichler , MD UCSF Division of

Anterior Spine Exposure Lessons Learned & Relearned Charles Eichler , MD UCSF Division of

UC SF Anterior Spine Exposure Lessons Learned & Relearned Charles Eichler , MD UCSF Division of Vascular Surgery VASCULAR SURGERY UC SAN FRANCISCO UC SF No Disclosues VASCULAR SURGERY UC SAN FRANCISCO 1 UC SF VASCULAR

388 views • 26 slides
Self-service Training slides Part 1 of 3 1. Overview 2. Structure of tool/scoring system 3.

Self-service Training slides Part 1 of 3 1. Overview 2. Structure of tool/scoring system 3.

Self-service Training slides Part 1 of 3 1. Overview 2. Structure of tool/scoring system 3. Scoring guidelines 4. Completion of NPDS-H Basic Care Needs 1. NPDS designed to provide a seamless service from hospital to community setting 2.

526 views • 39 slides
THE TRANSFORMATION OF THE TRANSFORMATION OF TECHNOLOGY BY SCIENCE --- --- TECHNOLOGY BY SCIENCE

THE TRANSFORMATION OF THE TRANSFORMATION OF TECHNOLOGY BY SCIENCE --- --- TECHNOLOGY BY SCIENCE

THE TRANSFORMATION OF THE TRANSFORMATION OF TECHNOLOGY BY SCIENCE --- --- TECHNOLOGY BY SCIENCE IMPLICATIONS AND INTERROGATIONS IMPLICATIONS AND INTERROGATIONS JOO CARAA Calouste Gulbenkian Foundation Calouste Gulbenkian Foundation and

510 views • 9 slides
Climate Adaptation Planning for the Town of Truckee GEOS INSTITUTE Whole Community Adaptation

Climate Adaptation Planning for the Town of Truckee GEOS INSTITUTE Whole Community Adaptation

U.S. Army NOAA K. Schafer Climate Adaptation Planning for the Town of Truckee GEOS INSTITUTE Whole Community Adaptation Cultural Systems Human Systems Economic Systems Built Systems Natural Systems Whole Community Adaptation 1.

580 views • 21 slides
1 Biologically-active Chiral Molecules HO HO OH HO O O O OH HO H NH 2 HO HO OH H H

1 Biologically-active Chiral Molecules HO HO OH HO O O O OH HO H NH 2 HO HO OH H H

Chapter 7 - Stereochemistry Enantiomers of bromochlorofluoromethane Non-superimposable mirror images Enantiomers YSU YSU Biologically-active Chiral Molecules YSU YSU 1 Biologically-active Chiral Molecules HO HO OH HO O O O OH

571 views • 13 slides
Transactional Recovery Transactional Recovery Transactions: ACID Properties Transactions: ACID

Transactional Recovery Transactional Recovery Transactions: ACID Properties Transactions: ACID

Transactional Recovery Transactional Recovery Transactions: ACID Properties Transactions: ACID Properties Full-blown transactions guarantee four intertwined properties: Atomicity . Transactions can never partly commit; their

928 views • 41 slides
Extended Medical Leave of Absence Management Sam Sears, Associate Vice Chancellor & Deputy

Extended Medical Leave of Absence Management Sam Sears, Associate Vice Chancellor & Deputy

2/21/20 Extended Medical Leave of Absence Management Sam Sears, Associate Vice Chancellor & Deputy General Counsel Jeff Jensen, Senior Associate General Counsel February 26, 2020 Overview u Introduction to Applicable Laws, including:

549 views • 10 slides
FMLA Retaliation: Understanding and Managing the Risks Presented by: Meg LePage and Dan Strader

FMLA Retaliation: Understanding and Managing the Risks Presented by: Meg LePage and Dan Strader

FMLA Retaliation: Understanding and Managing the Risks Presented by: Meg LePage and Dan Strader September 13, 2018 FMLA Basics: An Overview Federal FMLA Em ployee Coverage Worked for employer for 12 months total, and for 1250 hours in 12

582 views • 39 slides

More recommend