SPLASH Companion 2016 – Author Index |
Contents -
Abstracts -
Authors
|
Bach, Christoph Tobias |
SPLASH Companion '16-POSTERS: "libDSU: Towards Hot-Swapping ..."
libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux
Martin Alexander Neumann, Christoph Tobias Bach, Stefan Kratochwil, Marcel Kost, and Michael Beigl (KIT, Germany) Dynamically linked libraries such as libssl, libxml or libpam are in widespread use in server applications. Fixes to these libraries are released frequently, with security critical ones being among them few times each year--for example, to fix remote code execution. Such updates require applications to restart to make the dynamic linker effectively load the fix into the application. This is challenged by uptime-sensitive services leading to delayed installation of security patches and long periods of vulnerability. Current approaches to hot fixing such services allow instant replacement of functions. We discuss that security critical updates also affect data and present an approach for dynamically updating code and data in stock dynamically linked libraries in ELF format on Linux. The approach does not require source code access nor is preparation of applications ahead-of-time necessary, for example by code instrumentation. It uses the debugging symbols of all involved dynamic shared objects only. @InProceedings{SPLASH Companion16p41, author = {Martin Alexander Neumann and Christoph Tobias Bach and Stefan Kratochwil and Marcel Kost and Michael Beigl}, title = {libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {41--42}, doi = {}, year = {2016}, } |
|
Barzilay, Regina |
SPLASH Companion '16-POSTERS: "sk_p: A Neural Program Corrector ..."
sk_p: A Neural Program Corrector for MOOCs
Yewen Pu, Karthik Narasimhan, Armando Solar-Lezama , and Regina Barzilay (Massachusetts Institute of Technology, USA) We present a novel technique for automatic program correction in MOOCs, capable of fixing both syntactic and semantic errors without manual, problem specific correction strategies. Given an incorrect student program, it generates candidate programs from a distribution of likely corrections, and checks each candidate for correctness against a test suite. The key observation is that in MOOCs many programs share similar code fragments, and the seq2seq neural network model, used in the natural-language processing task of machine translation, can be modified and trained to recover these fragments. Experiment shows our scheme can correct 29% of all incorrect submissions and out-performs state of the art approach which requires manual, problem specific correction strategies. @InProceedings{SPLASH Companion16p39, author = {Yewen Pu and Karthik Narasimhan and Armando Solar-Lezama and Regina Barzilay}, title = {sk_p: A Neural Program Corrector for MOOCs}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {39--40}, doi = {}, year = {2016}, } |
|
Beigl, Michael |
SPLASH Companion '16-POSTERS: "libDSU: Towards Hot-Swapping ..."
libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux
Martin Alexander Neumann, Christoph Tobias Bach, Stefan Kratochwil, Marcel Kost, and Michael Beigl (KIT, Germany) Dynamically linked libraries such as libssl, libxml or libpam are in widespread use in server applications. Fixes to these libraries are released frequently, with security critical ones being among them few times each year--for example, to fix remote code execution. Such updates require applications to restart to make the dynamic linker effectively load the fix into the application. This is challenged by uptime-sensitive services leading to delayed installation of security patches and long periods of vulnerability. Current approaches to hot fixing such services allow instant replacement of functions. We discuss that security critical updates also affect data and present an approach for dynamically updating code and data in stock dynamically linked libraries in ELF format on Linux. The approach does not require source code access nor is preparation of applications ahead-of-time necessary, for example by code instrumentation. It uses the debugging symbols of all involved dynamic shared objects only. @InProceedings{SPLASH Companion16p41, author = {Martin Alexander Neumann and Christoph Tobias Bach and Stefan Kratochwil and Marcel Kost and Michael Beigl}, title = {libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {41--42}, doi = {}, year = {2016}, } |
|
Buckley, Scott |
SPLASH Companion '16-POSTERS: "Specifying CSS Layout with ..."
Specifying CSS Layout with Reference Attribute Grammars
Scott Buckley, Anthony Sloane, and Matthew Roberts (Macquarie University, Australia) Layout for web documents is a complex process described by the lengthy prose Cascading Style Sheets (CSS) specification. It is difficult to ensure that implementations match this specification. We show how an implementation can more closely match the specification by using attribute grammars to define layout computations. Particularly, we show how high-level patterns encode the terminology of the specification, discriminating between elements using the same language as in the specification. We also present a new method of injecting artificial structure into an existing tree using reference attribute grammars. The result is a high-level executable specification for CSS layout that can form the basis for a full declarative implementation. @InProceedings{SPLASH Companion16p29, author = {Scott Buckley and Anthony Sloane and Matthew Roberts}, title = {Specifying CSS Layout with Reference Attribute Grammars}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {29--30}, doi = {}, year = {2016}, } |
|
Charousset, Dominik |
SPLASH Companion '16-POSTERS: "Reconsidering Reliability ..."
Reconsidering Reliability in Distributed Actor Systems
Raphael Hiesgen, Dominik Charousset, and Thomas C. Schmidt (Hamburg University of Applied Sciences, Germany) Frameworks inspired by the actor model have recently attracted much attention. Actor systems promise transparent concurrency and distribution by combining message passing with a strong failure model. In this work, we re-examine distribution transparency and find that reliability breaks the promise in several dimensions. Solutions for regaining awareness of failures are briefly discussed. @InProceedings{SPLASH Companion16p31, author = {Raphael Hiesgen and Dominik Charousset and Thomas C. Schmidt}, title = {Reconsidering Reliability in Distributed Actor Systems}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {31--32}, doi = {}, year = {2016}, } |
|
Hiesgen, Raphael |
SPLASH Companion '16-POSTERS: "Reconsidering Reliability ..."
Reconsidering Reliability in Distributed Actor Systems
Raphael Hiesgen, Dominik Charousset, and Thomas C. Schmidt (Hamburg University of Applied Sciences, Germany) Frameworks inspired by the actor model have recently attracted much attention. Actor systems promise transparent concurrency and distribution by combining message passing with a strong failure model. In this work, we re-examine distribution transparency and find that reliability breaks the promise in several dimensions. Solutions for regaining awareness of failures are briefly discussed. @InProceedings{SPLASH Companion16p31, author = {Raphael Hiesgen and Dominik Charousset and Thomas C. Schmidt}, title = {Reconsidering Reliability in Distributed Actor Systems}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {31--32}, doi = {}, year = {2016}, } |
|
Jamali, Nadeem |
SPLASH Companion '16-POSTERS: "Supporting Resource Bounded ..."
Supporting Resource Bounded Multitenancy in Akka
Ahmed Abdel Moamen and Nadeem Jamali (University of Saskatchewan, Canada) There are several advantages of multitenancy: the serving of multiple tenants, each with its own privileges, from the same instance of a software system. Although the naming convention in actor systems -- actor names cannot be guessed -- naturally supports multitenancy, there is no explicit way of managing the resource competition between tenants. There are models for coordinating resource use in actor systems; however, they are difficult to implement for efficient implementations of Actors. This paper presents our efforts in implementing resource coordination support for actor systems implemented using the Akka library. @InProceedings{SPLASH Companion16p33, author = {Ahmed Abdel Moamen and Nadeem Jamali}, title = {Supporting Resource Bounded Multitenancy in Akka}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {33--34}, doi = {}, year = {2016}, } |
|
Kamina, Tetsuo |
SPLASH Companion '16-POSTERS: "Introducing Lightweight Reactive ..."
Introducing Lightweight Reactive Values to Java
Tetsuo Kamina (Ritsumeikan University, Japan) This paper introduces SignalJ, a lightweight extension of Java with reactive values. A reactive value is a value that can depend on other reactive values, and it is implicitly updated when the depended reactive values are updated. Each reactive value is typed with a signal type, which ensures that the dependent reactive values are functional. SignalJ also provides handlers of reactive values that are called whenever the monitored reactive value is updated. With these features, SignalJ declaratively specifies dataflows within an application in a functional manner, which enables effective implementation of reactive software. The syntax of SignalJ is almost identical to that of Java 8 except that it introduces a new modifier, signal, to represent signal types. @InProceedings{SPLASH Companion16p27, author = {Tetsuo Kamina}, title = {Introducing Lightweight Reactive Values to Java}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {27--28}, doi = {}, year = {2016}, } |
|
Kost, Marcel |
SPLASH Companion '16-POSTERS: "libDSU: Towards Hot-Swapping ..."
libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux
Martin Alexander Neumann, Christoph Tobias Bach, Stefan Kratochwil, Marcel Kost, and Michael Beigl (KIT, Germany) Dynamically linked libraries such as libssl, libxml or libpam are in widespread use in server applications. Fixes to these libraries are released frequently, with security critical ones being among them few times each year--for example, to fix remote code execution. Such updates require applications to restart to make the dynamic linker effectively load the fix into the application. This is challenged by uptime-sensitive services leading to delayed installation of security patches and long periods of vulnerability. Current approaches to hot fixing such services allow instant replacement of functions. We discuss that security critical updates also affect data and present an approach for dynamically updating code and data in stock dynamically linked libraries in ELF format on Linux. The approach does not require source code access nor is preparation of applications ahead-of-time necessary, for example by code instrumentation. It uses the debugging symbols of all involved dynamic shared objects only. @InProceedings{SPLASH Companion16p41, author = {Martin Alexander Neumann and Christoph Tobias Bach and Stefan Kratochwil and Marcel Kost and Michael Beigl}, title = {libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {41--42}, doi = {}, year = {2016}, } |
|
Kratochwil, Stefan |
SPLASH Companion '16-POSTERS: "libDSU: Towards Hot-Swapping ..."
libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux
Martin Alexander Neumann, Christoph Tobias Bach, Stefan Kratochwil, Marcel Kost, and Michael Beigl (KIT, Germany) Dynamically linked libraries such as libssl, libxml or libpam are in widespread use in server applications. Fixes to these libraries are released frequently, with security critical ones being among them few times each year--for example, to fix remote code execution. Such updates require applications to restart to make the dynamic linker effectively load the fix into the application. This is challenged by uptime-sensitive services leading to delayed installation of security patches and long periods of vulnerability. Current approaches to hot fixing such services allow instant replacement of functions. We discuss that security critical updates also affect data and present an approach for dynamically updating code and data in stock dynamically linked libraries in ELF format on Linux. The approach does not require source code access nor is preparation of applications ahead-of-time necessary, for example by code instrumentation. It uses the debugging symbols of all involved dynamic shared objects only. @InProceedings{SPLASH Companion16p41, author = {Martin Alexander Neumann and Christoph Tobias Bach and Stefan Kratochwil and Marcel Kost and Michael Beigl}, title = {libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {41--42}, doi = {}, year = {2016}, } |
|
Lorenz, David H. |
SPLASH Companion '16-POSTERS: "A Web Application Is a Domain-Specific ..."
A Web Application Is a Domain-Specific Language
David H. Lorenz and Boaz Rosenan (Open University of Israel, Israel; Technion, Israel; University of Haifa, Israel) We introduce a correspondence between the design space of web applications and that of domain-specific languages (DSLs). We note that while most web applications today are implemented in ways that correspond to external DSLs, very little attention is given to implementation techniques corresponding to internal DSLs. We contribute a technique based on internal DSLs, and demonstrate a web application implemented with our technique. @InProceedings{SPLASH Companion16p35, author = {David H. Lorenz and Boaz Rosenan}, title = {A Web Application Is a Domain-Specific Language}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {35--36}, doi = {}, year = {2016}, } |
|
Moamen, Ahmed Abdel |
SPLASH Companion '16-POSTERS: "Supporting Resource Bounded ..."
Supporting Resource Bounded Multitenancy in Akka
Ahmed Abdel Moamen and Nadeem Jamali (University of Saskatchewan, Canada) There are several advantages of multitenancy: the serving of multiple tenants, each with its own privileges, from the same instance of a software system. Although the naming convention in actor systems -- actor names cannot be guessed -- naturally supports multitenancy, there is no explicit way of managing the resource competition between tenants. There are models for coordinating resource use in actor systems; however, they are difficult to implement for efficient implementations of Actors. This paper presents our efforts in implementing resource coordination support for actor systems implemented using the Akka library. @InProceedings{SPLASH Companion16p33, author = {Ahmed Abdel Moamen and Nadeem Jamali}, title = {Supporting Resource Bounded Multitenancy in Akka}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {33--34}, doi = {}, year = {2016}, } |
|
Murphy, Gail C. |
SPLASH Companion '16-POSTERS: "Removing Stagnation from Modern ..."
Removing Stagnation from Modern Code Review
Giovanni Viviani and Gail C. Murphy (University of British Columbia, Canada) Finding defects efficently is one of the major problems in software development, a problem that often still relies largely on human inspection of code to find defects. Many software development projects use code reviews as a mean to ensure this human inspection occurs. Known as modern code review, this approach is based on tools, such as Gerrit, that help the developers in the reviewing process. As part of this approach, developers are often presented with a list of open code reviews requiring attention; it is left to the developer to find a suitable review on which to work on from a long list of reviews. We present an investigation of two algorithms that recommend an ordering of the list of open reviews based on properties of the reviews. We use a simulation study over the JGit project from the Eclipse Foundation to show that an algorithm based on ordering reviews from least lines of codes changed in the code review to most lines of code out performs other algorithms. This algorithm shows promise for eliminating stagnation of reviews and optimizing the average duration reviews are open. @InProceedings{SPLASH Companion16p43, author = {Giovanni Viviani and Gail C. Murphy}, title = {Removing Stagnation from Modern Code Review}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {43--44}, doi = {}, year = {2016}, } |
|
Narasimhan, Karthik |
SPLASH Companion '16-POSTERS: "sk_p: A Neural Program Corrector ..."
sk_p: A Neural Program Corrector for MOOCs
Yewen Pu, Karthik Narasimhan, Armando Solar-Lezama , and Regina Barzilay (Massachusetts Institute of Technology, USA) We present a novel technique for automatic program correction in MOOCs, capable of fixing both syntactic and semantic errors without manual, problem specific correction strategies. Given an incorrect student program, it generates candidate programs from a distribution of likely corrections, and checks each candidate for correctness against a test suite. The key observation is that in MOOCs many programs share similar code fragments, and the seq2seq neural network model, used in the natural-language processing task of machine translation, can be modified and trained to recover these fragments. Experiment shows our scheme can correct 29% of all incorrect submissions and out-performs state of the art approach which requires manual, problem specific correction strategies. @InProceedings{SPLASH Companion16p39, author = {Yewen Pu and Karthik Narasimhan and Armando Solar-Lezama and Regina Barzilay}, title = {sk_p: A Neural Program Corrector for MOOCs}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {39--40}, doi = {}, year = {2016}, } |
|
Neumann, Martin Alexander |
SPLASH Companion '16-POSTERS: "libDSU: Towards Hot-Swapping ..."
libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux
Martin Alexander Neumann, Christoph Tobias Bach, Stefan Kratochwil, Marcel Kost, and Michael Beigl (KIT, Germany) Dynamically linked libraries such as libssl, libxml or libpam are in widespread use in server applications. Fixes to these libraries are released frequently, with security critical ones being among them few times each year--for example, to fix remote code execution. Such updates require applications to restart to make the dynamic linker effectively load the fix into the application. This is challenged by uptime-sensitive services leading to delayed installation of security patches and long periods of vulnerability. Current approaches to hot fixing such services allow instant replacement of functions. We discuss that security critical updates also affect data and present an approach for dynamically updating code and data in stock dynamically linked libraries in ELF format on Linux. The approach does not require source code access nor is preparation of applications ahead-of-time necessary, for example by code instrumentation. It uses the debugging symbols of all involved dynamic shared objects only. @InProceedings{SPLASH Companion16p41, author = {Martin Alexander Neumann and Christoph Tobias Bach and Stefan Kratochwil and Marcel Kost and Michael Beigl}, title = {libDSU: Towards Hot-Swapping Dynamically Linked Libraries on Stock Linux}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {41--42}, doi = {}, year = {2016}, } |
|
Pu, Yewen |
SPLASH Companion '16-POSTERS: "sk_p: A Neural Program Corrector ..."
sk_p: A Neural Program Corrector for MOOCs
Yewen Pu, Karthik Narasimhan, Armando Solar-Lezama , and Regina Barzilay (Massachusetts Institute of Technology, USA) We present a novel technique for automatic program correction in MOOCs, capable of fixing both syntactic and semantic errors without manual, problem specific correction strategies. Given an incorrect student program, it generates candidate programs from a distribution of likely corrections, and checks each candidate for correctness against a test suite. The key observation is that in MOOCs many programs share similar code fragments, and the seq2seq neural network model, used in the natural-language processing task of machine translation, can be modified and trained to recover these fragments. Experiment shows our scheme can correct 29% of all incorrect submissions and out-performs state of the art approach which requires manual, problem specific correction strategies. @InProceedings{SPLASH Companion16p39, author = {Yewen Pu and Karthik Narasimhan and Armando Solar-Lezama and Regina Barzilay}, title = {sk_p: A Neural Program Corrector for MOOCs}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {39--40}, doi = {}, year = {2016}, } |
|
Roberts, Matthew |
SPLASH Companion '16-POSTERS: "Specifying CSS Layout with ..."
Specifying CSS Layout with Reference Attribute Grammars
Scott Buckley, Anthony Sloane, and Matthew Roberts (Macquarie University, Australia) Layout for web documents is a complex process described by the lengthy prose Cascading Style Sheets (CSS) specification. It is difficult to ensure that implementations match this specification. We show how an implementation can more closely match the specification by using attribute grammars to define layout computations. Particularly, we show how high-level patterns encode the terminology of the specification, discriminating between elements using the same language as in the specification. We also present a new method of injecting artificial structure into an existing tree using reference attribute grammars. The result is a high-level executable specification for CSS layout that can form the basis for a full declarative implementation. @InProceedings{SPLASH Companion16p29, author = {Scott Buckley and Anthony Sloane and Matthew Roberts}, title = {Specifying CSS Layout with Reference Attribute Grammars}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {29--30}, doi = {}, year = {2016}, } |
|
Rosenan, Boaz |
SPLASH Companion '16-POSTERS: "A Web Application Is a Domain-Specific ..."
A Web Application Is a Domain-Specific Language
David H. Lorenz and Boaz Rosenan (Open University of Israel, Israel; Technion, Israel; University of Haifa, Israel) We introduce a correspondence between the design space of web applications and that of domain-specific languages (DSLs). We note that while most web applications today are implemented in ways that correspond to external DSLs, very little attention is given to implementation techniques corresponding to internal DSLs. We contribute a technique based on internal DSLs, and demonstrate a web application implemented with our technique. @InProceedings{SPLASH Companion16p35, author = {David H. Lorenz and Boaz Rosenan}, title = {A Web Application Is a Domain-Specific Language}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {35--36}, doi = {}, year = {2016}, } |
|
Schkufza, Eric |
SPLASH Companion '16-POSTERS: "A Sampling-Based Approach ..."
A Sampling-Based Approach to Accelerating Queries in Log Management Systems
Tal Wagner, Eric Schkufza, and Udi Wieder (Massachusetts Institute of Technology, USA; VMware, USA) Log management systems are common in industry and an essential part of a system administrator’s toolkit. Examples include Splunk, elk, Log Insight, Sexilog, and more. Logs in these systems are characterized by a small number of predefined fields such as timestamp and host, with the bulk of an entry being unstructured text. System administrators query these logs using a combination of range constraints over predefined fields and patterns or regular expressions over the text portion of the message. These queries are both complex and diverse. We propose a method for maintaining a subset of these logs in a much smaller database known as a sublog. Because queries are issued against a much smaller data set they run to completion quickly and avoid common scaling bottlenecks. However, the improvement in performance comes at a price. Because we only consider a subset of the original data, we are only able to provide approximate responses. Nonetheless, the reduction in accuracy is minimal and we are able to produce high-quality, high-performance results. @InProceedings{SPLASH Companion16p37, author = {Tal Wagner and Eric Schkufza and Udi Wieder}, title = {A Sampling-Based Approach to Accelerating Queries in Log Management Systems}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {37--38}, doi = {}, year = {2016}, } |
|
Schmidt, Thomas C. |
SPLASH Companion '16-POSTERS: "Reconsidering Reliability ..."
Reconsidering Reliability in Distributed Actor Systems
Raphael Hiesgen, Dominik Charousset, and Thomas C. Schmidt (Hamburg University of Applied Sciences, Germany) Frameworks inspired by the actor model have recently attracted much attention. Actor systems promise transparent concurrency and distribution by combining message passing with a strong failure model. In this work, we re-examine distribution transparency and find that reliability breaks the promise in several dimensions. Solutions for regaining awareness of failures are briefly discussed. @InProceedings{SPLASH Companion16p31, author = {Raphael Hiesgen and Dominik Charousset and Thomas C. Schmidt}, title = {Reconsidering Reliability in Distributed Actor Systems}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {31--32}, doi = {}, year = {2016}, } |
|
Sloane, Anthony |
SPLASH Companion '16-POSTERS: "Specifying CSS Layout with ..."
Specifying CSS Layout with Reference Attribute Grammars
Scott Buckley, Anthony Sloane, and Matthew Roberts (Macquarie University, Australia) Layout for web documents is a complex process described by the lengthy prose Cascading Style Sheets (CSS) specification. It is difficult to ensure that implementations match this specification. We show how an implementation can more closely match the specification by using attribute grammars to define layout computations. Particularly, we show how high-level patterns encode the terminology of the specification, discriminating between elements using the same language as in the specification. We also present a new method of injecting artificial structure into an existing tree using reference attribute grammars. The result is a high-level executable specification for CSS layout that can form the basis for a full declarative implementation. @InProceedings{SPLASH Companion16p29, author = {Scott Buckley and Anthony Sloane and Matthew Roberts}, title = {Specifying CSS Layout with Reference Attribute Grammars}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {29--30}, doi = {}, year = {2016}, } |
|
Solar-Lezama, Armando |
SPLASH Companion '16-POSTERS: "sk_p: A Neural Program Corrector ..."
sk_p: A Neural Program Corrector for MOOCs
Yewen Pu, Karthik Narasimhan, Armando Solar-Lezama , and Regina Barzilay (Massachusetts Institute of Technology, USA) We present a novel technique for automatic program correction in MOOCs, capable of fixing both syntactic and semantic errors without manual, problem specific correction strategies. Given an incorrect student program, it generates candidate programs from a distribution of likely corrections, and checks each candidate for correctness against a test suite. The key observation is that in MOOCs many programs share similar code fragments, and the seq2seq neural network model, used in the natural-language processing task of machine translation, can be modified and trained to recover these fragments. Experiment shows our scheme can correct 29% of all incorrect submissions and out-performs state of the art approach which requires manual, problem specific correction strategies. @InProceedings{SPLASH Companion16p39, author = {Yewen Pu and Karthik Narasimhan and Armando Solar-Lezama and Regina Barzilay}, title = {sk_p: A Neural Program Corrector for MOOCs}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {39--40}, doi = {}, year = {2016}, } |
|
Viviani, Giovanni |
SPLASH Companion '16-POSTERS: "Removing Stagnation from Modern ..."
Removing Stagnation from Modern Code Review
Giovanni Viviani and Gail C. Murphy (University of British Columbia, Canada) Finding defects efficently is one of the major problems in software development, a problem that often still relies largely on human inspection of code to find defects. Many software development projects use code reviews as a mean to ensure this human inspection occurs. Known as modern code review, this approach is based on tools, such as Gerrit, that help the developers in the reviewing process. As part of this approach, developers are often presented with a list of open code reviews requiring attention; it is left to the developer to find a suitable review on which to work on from a long list of reviews. We present an investigation of two algorithms that recommend an ordering of the list of open reviews based on properties of the reviews. We use a simulation study over the JGit project from the Eclipse Foundation to show that an algorithm based on ordering reviews from least lines of codes changed in the code review to most lines of code out performs other algorithms. This algorithm shows promise for eliminating stagnation of reviews and optimizing the average duration reviews are open. @InProceedings{SPLASH Companion16p43, author = {Giovanni Viviani and Gail C. Murphy}, title = {Removing Stagnation from Modern Code Review}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {43--44}, doi = {}, year = {2016}, } |
|
Wagner, Tal |
SPLASH Companion '16-POSTERS: "A Sampling-Based Approach ..."
A Sampling-Based Approach to Accelerating Queries in Log Management Systems
Tal Wagner, Eric Schkufza, and Udi Wieder (Massachusetts Institute of Technology, USA; VMware, USA) Log management systems are common in industry and an essential part of a system administrator’s toolkit. Examples include Splunk, elk, Log Insight, Sexilog, and more. Logs in these systems are characterized by a small number of predefined fields such as timestamp and host, with the bulk of an entry being unstructured text. System administrators query these logs using a combination of range constraints over predefined fields and patterns or regular expressions over the text portion of the message. These queries are both complex and diverse. We propose a method for maintaining a subset of these logs in a much smaller database known as a sublog. Because queries are issued against a much smaller data set they run to completion quickly and avoid common scaling bottlenecks. However, the improvement in performance comes at a price. Because we only consider a subset of the original data, we are only able to provide approximate responses. Nonetheless, the reduction in accuracy is minimal and we are able to produce high-quality, high-performance results. @InProceedings{SPLASH Companion16p37, author = {Tal Wagner and Eric Schkufza and Udi Wieder}, title = {A Sampling-Based Approach to Accelerating Queries in Log Management Systems}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {37--38}, doi = {}, year = {2016}, } |
|
Wieder, Udi |
SPLASH Companion '16-POSTERS: "A Sampling-Based Approach ..."
A Sampling-Based Approach to Accelerating Queries in Log Management Systems
Tal Wagner, Eric Schkufza, and Udi Wieder (Massachusetts Institute of Technology, USA; VMware, USA) Log management systems are common in industry and an essential part of a system administrator’s toolkit. Examples include Splunk, elk, Log Insight, Sexilog, and more. Logs in these systems are characterized by a small number of predefined fields such as timestamp and host, with the bulk of an entry being unstructured text. System administrators query these logs using a combination of range constraints over predefined fields and patterns or regular expressions over the text portion of the message. These queries are both complex and diverse. We propose a method for maintaining a subset of these logs in a much smaller database known as a sublog. Because queries are issued against a much smaller data set they run to completion quickly and avoid common scaling bottlenecks. However, the improvement in performance comes at a price. Because we only consider a subset of the original data, we are only able to provide approximate responses. Nonetheless, the reduction in accuracy is minimal and we are able to produce high-quality, high-performance results. @InProceedings{SPLASH Companion16p37, author = {Tal Wagner and Eric Schkufza and Udi Wieder}, title = {A Sampling-Based Approach to Accelerating Queries in Log Management Systems}, booktitle = {Proc.\ SPLASH Companion}, publisher = {ACM}, pages = {37--38}, doi = {}, year = {2016}, } |
25 authors
proc time: 1.38