semantic slicing of software version histories
play

Semantic Slicing of Software Version Histories Yi Li / U Toronto - PowerPoint PPT Presentation

Sep 19, 2023 •138 likes •864 views

Semantic Slicing of Software Version Histories Yi Li / U Toronto Julia Rubin / MIT Marsha Chechik / U Toronto ASE 2015 / Lincoln, NE Motivation Feb, 2015 release [1.3.8] v1.3.8 make groovy.sandbox.blacklist append-only avoid

  1. Semantic Slicing of Software Version Histories Yi Li / U Toronto Julia Rubin / MIT Marsha Chechik / U Toronto ASE 2015 / Lincoln, NE

  2. Motivation Feb, 2015 release [1.3.8] v1.3.8 … make ’groovy.sandbox.blacklist’ append-only avoid NullPointerException if optional Groovy jar is removed 30 authors 67 commits make groovy sandbox method blacklist dynamically additive 87 files changed … prepare for next development iteration (1.3.7-SNAPSHOT) updated docs to use v1.3.6 as current Nov, 2014 release [1.3.6] v1.3.6 2

  3. Motivation Feb, 2015 release [1.3.8] v1.3.8 … make ’groovy.sandbox.blacklist’ append-only avoid NullPointerException if optional Groovy jar is removed 30 authors 67 commits make groovy sandbox method blacklist dynamically additive 87 files changed … prepare for next development iteration (1.3.7-SNAPSHOT) updated docs to use v1.3.6 as current Nov, 2014 release [1.3.6] v1.3.6 2

  4. Motivation Feb, 2015 release [1.3.8] v1.3.8 … make ’groovy.sandbox.blacklist’ append-only avoid NullPointerException if optional Groovy jar is removed 30 authors 67 commits make groovy sandbox method blacklist dynamically additive 87 files changed … prepare for next development iteration (1.3.7-SNAPSHOT) updated docs to use v1.3.6 as current Nov, 2014 release [1.3.6] v1.3.6 2

  5. Motivation Feb, 2015 release [1.3.8] v1.3.8 … make ’groovy.sandbox.blacklist’ append-only avoid NullPointerException if optional Groovy jar is removed 30 authors 67 commits make groovy sandbox method blacklist dynamically additive 87 files changed … prepare for next development iteration (1.3.7-SNAPSHOT) updated docs to use v1.3.6 as current Nov, 2014 release [1.3.6] v1.3.6 2

  6. Why is it so hard? target base 3

  7. Why is it so hard? Options? target 1. Pick target commits 2. Pick the whole history 3. Manually identify necessary commits base 3

  8. Why is it so hard? Options? target 1. Pick target commits 2. Pick the whole history 3. Manually identify necessary commits base 3

  9. Why is it so hard? Options? target 1. Pick target commits 2. Pick the whole history 3. Manually identify necessary commits base 3

  10. Why is it so hard? Options? target 1. Pick target commits // comment int boo1() { 2. Pick the whole history - {return 0;} + {return (new Bar()).y;} } 3. Manually identify necessary commits class Bar { + int y = 0; static int bar1(int x) {return x - 1;} Existing version control tools: • Code treated as plain texts • Do not understand the semantics • User provided semantic/logical grouping is inaccurate! base 3

  11. What can we do? Exploit existing artifacts: target • Strictly structured data • Well-defined language syntax and semantics • Carefully designed test suites base 4

  12. What can we do? Exploit existing artifacts: target • Strictly structured data • Well-defined language syntax and semantics • Carefully designed test suites base 4

  13. Solution: Semantic Slicing Exploit existing artifacts: target target • Strictly structured data • Well-defined language syntax and semantics • Carefully designed test suites base History: Sub-history: sequence of commits well-formed: compiles + & Criterion: semantic preserving: set of tests passing tests base 4

  14. Outline 1. Introduction 2. Dependency Hierarchy 3. CSlicer Algorithm 4. Evaluation 5. Related Work & Conclusion 5

  15. Running Example class A { int g() {return 0;} } class B { static int f(int x) v1.0 {return x + 1;} } 6

  16. Running Example class A { // comment int g() {return 0;} class A { } + // comment C 1 int g() class B { {return 0;} static int f(int x) v1.0 {return x + 1;} } 6

  17. Running Example class A { class A { static int f(int x) { // comment - {return x + 1;} C 2 + {return x - 1;} int g() } {return 0;} class A { } + // comment C 1 int g() class B { {return 0;} static int f(int x) v1.0 {return x - 1;} } 6

  18. Running Example // comment int g() { - {return 0;} + {return (new B()).y;} class A { C 3 } class A { // comment class B { static int f(int x) { + int y = 0; int g() - {return x + 1;} static int f(int x) C 2 + {return x - 1;} {return x - 1;} {return (new B()).y;} } } class A { class B { + // comment C 1 int g() int y = 0; {return 0;} static int f(int x) v1.0 {return x - 1;} } 6

  19. Running Example class A { C 4 + int x; // comment // comment int g() { int g() class A { - {return 0;} + {return (new B()).y;} int x; C 3 } class A { // comment class B { static int f(int x) { + int y = 0; int g() - {return x + 1;} static int f(int x) C 2 + {return x - 1;} {return x - 1;} {return (new B()).y;} } } class A { class B { + // comment C 1 int g() int y = 0; {return 0;} static int f(int x) v1.0 {return x - 1;} } 6

  20. Running Example Test case: class TestA { a.g()==-1 public void t1() class A { A a = new A(); int x; v1.1 {assertEquals(-1, a.g();} + int g() C 5 + {return B.f(x);} } // comment int h() class A { class A { C 4 + int x; // comment int x; // comment int g() { int g() int g() - {return 0;} + {return (new B()).y;} {return B.f(x);} C 3 } class A { // comment class B { static int f(int x) { + int y = 0; int h() - {return x + 1;} static int f(int x) C 2 + {return x - 1;} {return x - 1;} {return (new B()).y;} } } class A { class B { + // comment C 1 int g() int y = 0; {return 0;} static int f(int x) v1.0 {return x - 1;} } 6

  21. Running Example Test case: class TestA { a.g()==-1 public void t1() class A { A a = new A(); int x; v1.1 {assertEquals(-1, a.g();} + int g() C 5 + {return B.f(x);} } // comment int h() class A { C 4 + int x; // comment class A { // comment int g() { int g() int x; - {return 0;} + {return (new B()).y;} int g() C 3 } class A { {return B.f(x);} class B { static int f(int x) { + int y = 0; // comment - {return x + 1;} static int f(int x) C 2 + {return x - 1;} {return x - 1;} int h() } {return 0;} class A { } + // comment C 1 int g() class B{ {return 0;} static int f(int x) v1.0 {return x - 1;} } 6

  22. Running Example Test case: class TestA { a.g()==-1 public void t1() class A { A a = new A(); int x; v1.1 {assertEquals(-1, a.g();} + int g() C 5 + {return B.f(x);} } // comment int h() class A { C 4 + int x; // comment class A { // comment int g() { int g() int x; - {return 0;} + {return (new B()).y;} int g() C 3 } class A { {return B.f(x);} class B { static int f(int x) { + int y = 0; // comment - {return x + 1;} static int f(int x) C 2 + {return x - 1;} {return x - 1;} int h() } {return 0;} class A { } + // comment C 1 int g() class B{ {return 0;} static int f(int x) v1.0 {return x - 1;} } 6

  23. Running Example Test case: class TestA { a.g()==-1 public void t1() class A { A a = new A(); int x; v1.1 {assertEquals(-1, a.g();} + int g() C 5 + {return B.f(x);} } // comment int h() class A { C 4 + int x; // comment class A { // comment int g() { int g() int x; - {return 0;} + {return (new B()).y;} int g() C 3 } class A { {return B.f(x);} class B { static int f(int x) { + int y = 0; // comment - {return x + 1;} static int f(int x) C 2 + {return x - 1;} {return x - 1;} int h() } {return 0;} class A { } + // comment C 1 int g() class B{ {return 0;} static int f(int x) v1.0 {return x - 1;} } 6

  24. Running Example Test case: class TestA { a.g()==-1 public void t1() class A { A a = new A(); int x; v1.1 {assertEquals(-1, a.g();} + int g() C 5 + {return B.f(x);} } // comment int h() class A { C 4 + int x; // comment class A { // comment int g() { int g() int x; - {return 0;} + {return (new B()).y;} int g() C 3 } class A { {return B.f(x);} class B { static int f(int x) { + int y = 0; // comment - {return x + 1;} static int f(int x) C 2 + {return x - 1;} {return x - 1;} int h() } {return 0;} class A { } + // comment C 1 int g() class B{ {return 0;} static int f(int x) v1.0 {return x - 1;} } 6

  25. Dependency Hierarchy Dependency Examples Definitions Types class A { required for maintaining the static int f(int x) { - {return x + 1;} Functional semantic behaviours (e.g., pass C 2 + {return x - 1;} } the same tests) required for maintaining the class A { C 4 wellformedness of the program + int x; Compilation // comment (e.g., free from compilation int g() errors) class A { specific to text-based version + // comment Hunk C 1 int g() control systems (e.g., Git) {return 0;} 7

  26. Dependency Hierarchy Dependency Examples Definitions Dependency Hierarchy Types class A { Correctness required for maintaining the static int f(int x) { - {return x + 1;} Functional Functional semantic behaviours (e.g., pass C 2 + {return x - 1;} } Core the same tests) required for maintaining the Well-formedness class A { Structural C 4 wellformedness of the program + int x; Compilation // comment Glue Code (e.g., free from compilation int g() errors) class A { specific to text-based version Applicability + // comment Hunk Textual Contexts C 1 int g() control systems (e.g., Git) {return 0;} 7

  27. Outline 1. Introduction 2. Dependency Hierarchy 3. CSlicer Algorithm 4. Evaluation 5. Related Work & Conclusion 8

Recommend

Mining Version Histories to Guide Software Changes by T. Zimmermann, P. Weigerber, S. Diehl, A.

Mining Version Histories to Guide Software Changes by T. Zimmermann, P. Weigerber, S. Diehl, A.

Mining Version Histories to Guide Software Changes by T. Zimmermann, P. Weigerber, S. Diehl, A. Zeller in IEEE Transaction on Software Engineering, Vol. 31, No. 6., June 2005 The Idea Can we make similar suggestions for software changes?

605 views • 39 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
CS510 Software Engineering Program Slicing Asst. Prof. Mathias Payer Department of Computer

CS510 Software Engineering Program Slicing Asst. Prof. Mathias Payer Department of Computer

CS510 Software Engineering Program Slicing Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15-CS510-SE Spring 2015 What is slicing?

812 views • 39 slides
FHistorian: Locating Features in Version Histories Yi Li / UToronto Chenguang Zhu / UToronto

FHistorian: Locating Features in Version Histories Yi Li / UToronto Chenguang Zhu / UToronto

FHistorian: Locating Features in Version Histories Yi Li / UToronto Chenguang Zhu / UToronto Julia Rubin / UBC Marsha Chechik / UToronto Sep 27, 2017 Feature Location Feature location is the activity of identifying an initial location

713 views • 50 slides
Compositional Transfinite Semantics of While Hrmel Nestra Institute of Computer Science

Compositional Transfinite Semantics of While Hrmel Nestra Institute of Computer Science

1 Compositional Transfinite Semantics of While Hrmel Nestra Institute of Computer Science University of Tartu e-mail: harmel.nestra@ut.ee 2 1 Motivation: Semantic Anomaly of Program Slicing Motivation: Semantic Anomaly of Program Slicing

511 views • 33 slides
1 Mining Event Histories Mining Event Histories Sequence Analysis in Social Sciences Sequence

1 Mining Event Histories Mining Event Histories Sequence Analysis in Social Sciences Sequence

Mining Event Histories Mining Event Histories My talk is about life courses, So, let me start with an example of scientific life course Mining Event Histories: date event Some New Insights on Personal Swiss Life Courses 1970-1979 Studies in

175 views • 13 slides
Learning about the Histories of Computerizing Publishing and Desktop Publishing, 20172019 See:

Learning about the Histories of Computerizing Publishing and Desktop Publishing, 20172019 See:

Learning about the Histories of Computerizing Publishing and Desktop Publishing, 20172019 See: history.computer.org/annals/dtp TUG Annual Conference, August 2019 David Walden dave@walden-family.com The written version of this will have

444 views • 27 slides
1 Baselines Version control Baseline: A specification or a product, which is Procedures

1 Baselines Version control Baseline: A specification or a product, which is Procedures

CONFIGURATION MANAGEMENT WHY CM? Today we talk about Software Configuration Multiple people are working on changing software Management (SCM for short): More than one version of the software needs to be - What? supported: - Why?

392 views • 3 slides
Making histories, sharing histories: Community-based Archives & Digging Where We Stand Dr

Making histories, sharing histories: Community-based Archives & Digging Where We Stand Dr

Making histories, sharing histories: Community-based Archives & Digging Where We Stand Dr Andrew Flinn, Reader in Archive Studies & Oral History University College London THATCamp Community Archives, Sonja Haynes Stone Centre for

1.08k views • 19 slides
EECS 394 Software Project Management Chris Riesbeck Getting things done Sunday, October 16,

EECS 394 Software Project Management Chris Riesbeck Getting things done Sunday, October 16,

EECS 394 Software Project Management Chris Riesbeck Getting things done Sunday, October 16, 2011 Tracking Progress Slicing Pulling Continuous Integration Chapter 15, Agile Samurai 2 Sunday, October 16, 2011 Slicing into Very Small

513 views • 49 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
Sequence-to-Action: End-to-End Semantic Graph Generation for Semantic Parsing Bo Chen , Le Sun,

Sequence-to-Action: End-to-End Semantic Graph Generation for Semantic Parsing Bo Chen , Le Sun,

Sequence-to-Action: End-to-End Semantic Graph Generation for Semantic Parsing Bo Chen , Le Sun, Xianpei Han Institute of Software, Chinese Academy of Sciences Task: Semantic Parsing Translate natural language sentences to meaning

1.4k views • 82 slides
Case Histories of Life Cycle Well Integrity Management Using iWIT Software SPE London, Nov 29 th

Case Histories of Life Cycle Well Integrity Management Using iWIT Software SPE London, Nov 29 th

www.intetech.com Case Histories of Life Cycle Well Integrity Management Using iWIT Software SPE London, Nov 29 th , 2011 Liane Smith and Ged Lunt, Intetech Ltd. www.intetech.com INTEGRITY TECHNOLOGY Focus: - on integrity in design work

780 views • 42 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
MEDIA HISTORIES 1850-2050 Winter 2017 DESMA 8 Media Histories Dr. Peter Lunenfeld

MEDIA HISTORIES 1850-2050 Winter 2017 DESMA 8 Media Histories Dr. Peter Lunenfeld

MEDIA HISTORIES 1850-2050 Winter 2017 DESMA 8 Media Histories Dr. Peter Lunenfeld [lunenfeld@ucla.edu] Second Wave: Cinema (1900-1950) Plato, The Allegory of the Cave The Cave (2008), written, produced and directed by Michael Ramsey

1.23k views • 87 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
Main Use Cases and Gap Analysis for Network Slicing draft-netslices-usecases-01

Main Use Cases and Gap Analysis for Network Slicing draft-netslices-usecases-01

July 7 th , 2017 version Part II: - What are my main use cases? Security Level: - What IETF work is in progress? Main Use Cases and Gap Analysis for Network Slicing draft-netslices-usecases-01 draft-qiang-netslices-gap-analysis-01

197 views • 16 slides
Semantic Web-based Mobile Knowledge Management Rachid Benlamri Professor Dept. of Software

Semantic Web-based Mobile Knowledge Management Rachid Benlamri Professor Dept. of Software

Semantic Web-based Mobile Knowledge Management Rachid Benlamri Professor Dept. of Software Engineering Head of the Semantic Web & Ubiquitous Computing Lab Lakehead University Ontario - Canada rbenlamr@lakeheadu.ca

1.48k views • 93 slides
Semantic Web 2008 Se a t c eb 008 Semantic Web ca. 2008 S ti W b 2008 Semantic Web

Semantic Web 2008 Se a t c eb 008 Semantic Web ca. 2008 S ti W b 2008 Semantic Web

Semantic Web 2008 Se a t c eb 008 Semantic Web ca. 2008 S ti W b 2008 Semantic Web companies starting & growing Siderean, SandPiper, SiberLogic, Ontology Works, Intellidimension, Intellisophic, TopQuadrant, Data Grid, Mondeca,

481 views • 23 slides
S LICING : Forward Slicing: Used to extract the implementation of the desired feature.

S LICING : Forward Slicing: Used to extract the implementation of the desired feature.

G ENETIC P ROGRAMMING FOR S OFTWARE T RANSPLANTS I MAN H EMATI M OGHADAM I MPLEMENTED A PPROACH : O VERVIEW 1 /20 S LICING : Forward Slicing: Used to extract the implementation of the desired feature. Backward Slicing: Used to extract

553 views • 22 slides
Strategies for Spectrum Slicing Based on Restarted Lanczos Methods Carmen Campos and Jose E.

Strategies for Spectrum Slicing Based on Restarted Lanczos Methods Carmen Campos and Jose E.

Spectrum Slicing SLEPc Evaluation Strategies for Spectrum Slicing Based on Restarted Lanczos Methods Carmen Campos and Jose E. Roman Universitat Polit` ecnica de Val` encia, Spain SC2011 Spectrum Slicing SLEPc Evaluation Goal Context:

638 views • 22 slides
AIRS Science Processing Software Version 4.0 Status Version 5.0 Strategy and Goals Steven

AIRS Science Processing Software Version 4.0 Status Version 5.0 Strategy and Goals Steven

National Aeronautics and Space Administration Jet Propulsion Laboratory California Institute of Technology Pasadena, California AIRS Science Processing Software Version 4.0 Status Version 5.0 Strategy and Goals Steven Friedman AIRS Science

131 views • 11 slides
Program Slicing Gias Uddin Special Topic Lecture prepared from the Survey of Frank Tip on Program

Program Slicing Gias Uddin Special Topic Lecture prepared from the Survey of Frank Tip on Program

Program Slicing Gias Uddin Special Topic Lecture prepared from the Survey of Frank Tip on Program Slicing : Frank Tip. A Survey of Program Slicing Techniques. Technical Report, CWI (Centre for Mathematics and Computer Science) Amsterdam, The

517 views • 15 slides
Review Version Control Concepts SWEN-261 Introduction to Software Engineering Department of

Review Version Control Concepts SWEN-261 Introduction to Software Engineering Department of

Review Version Control Concepts SWEN-261 Introduction to Software Engineering Department of Software Engineering Rochester Institute of Technology Managing change is a constant aspect of software development. The Product and Sprint

534 views • 16 slides

More recommend