Ikuo Nakagawa, Koheix Ichikawa, T. Kondo, Yoshiaki Kitaguchi, Hiroki Kashiwazaki, S. Shimojo
In recent years, much attention has been paid to wide area distributed storages to backup data remotely and ensure that business processes can continue in terms of disaster recovery. In the 'distcloud' project, authors have been involved in the research of wide area distributed storage by clustering many computer resources located in geographically distributed areas, where the number of sites is more than 2 (N > 2). The storage supports a shared single POSIX file system so that LDLM (Long Distance Live Migration) of VMs (Virtual Machines) works well between multiple sites. We introduce the concept and basic architecture of the wide area distributed storage and its technical improvement for LDLM. We describe the result of our experiment, that is, 1) Nation Wide Live Migration (about 500 Km) in Japan, and 2) Transpacific Live Migration (over 24,000 Km). We show the technical benefit of the current implementation and discuss suitable applications and remaining issues for further research topics.
{"title":"Transpacific Live Migration with Wide Area Distributed Storage","authors":"Ikuo Nakagawa, Koheix Ichikawa, T. Kondo, Yoshiaki Kitaguchi, Hiroki Kashiwazaki, S. Shimojo","doi":"10.1109/COMPSAC.2014.71","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.71","url":null,"abstract":"In recent years, much attention has been paid to wide area distributed storages to backup data remotely and ensure that business processes can continue in terms of disaster recovery. In the 'distcloud' project, authors have been involved in the research of wide area distributed storage by clustering many computer resources located in geographically distributed areas, where the number of sites is more than 2 (N > 2). The storage supports a shared single POSIX file system so that LDLM (Long Distance Live Migration) of VMs (Virtual Machines) works well between multiple sites. We introduce the concept and basic architecture of the wide area distributed storage and its technical improvement for LDLM. We describe the result of our experiment, that is, 1) Nation Wide Live Migration (about 500 Km) in Japan, and 2) Transpacific Live Migration (over 24,000 Km). We show the technical benefit of the current implementation and discuss suitable applications and remaining issues for further research topics.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115559449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Requirements are usually presented as Natural Language based documents. In the conceptual modeling phase, requirements are collected from different stakeholders and analyzed by requirement engineers. However, the size of the requirements documents can become very large, and the modeling process is quite time consuming and resource consuming. In order to solve this problem, much has been written on the processing of requirements documents to yield conceptual models. In this paper, we proposed an approach for identifying and extracting relations in a range of requirements documents with three steps: text analysis, entity extraction and relation mapping. If the entities in the relation are quite close to each other, for example, in the strategic dependency relationship, we will define a set of linguistic patterns used for identifying relations and propose a matching algorithm of semantic automata to extract the relation. Based on this approach, we developed a system to automatically generate the strategic dependency model of i framework and the activity model from Chinese requirements documents. A series of experiments were conducted to evaluate the performance of the automated requirements analysis system. The results show that the system achieves high recall with a consistent improvement in precision, which demonstrates the applicability of our approach.
{"title":"Eliciting Relations from Natural Language Requirements Documents Based on Linguistic and Statistical Analysis","authors":"Lin Liu, Tianying Li, Xiaoxi Kou","doi":"10.1109/COMPSAC.2014.27","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.27","url":null,"abstract":"Requirements are usually presented as Natural Language based documents. In the conceptual modeling phase, requirements are collected from different stakeholders and analyzed by requirement engineers. However, the size of the requirements documents can become very large, and the modeling process is quite time consuming and resource consuming. In order to solve this problem, much has been written on the processing of requirements documents to yield conceptual models. In this paper, we proposed an approach for identifying and extracting relations in a range of requirements documents with three steps: text analysis, entity extraction and relation mapping. If the entities in the relation are quite close to each other, for example, in the strategic dependency relationship, we will define a set of linguistic patterns used for identifying relations and propose a matching algorithm of semantic automata to extract the relation. Based on this approach, we developed a system to automatically generate the strategic dependency model of i framework and the activity model from Chinese requirements documents. A series of experiments were conducted to evaluate the performance of the automated requirements analysis system. The results show that the system achieves high recall with a consistent improvement in precision, which demonstrates the applicability of our approach.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120927190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xuling Chang, Linpeng Huang, Jianpeng Hu, Chen Li, Bei Cao
The activity diagram is widely used for describing and understanding workflows, however, it lacks a formal semantics and cannot be manipulated by computer. In this paper, we present a transformation from UML activity diagrams with time properties to timed coloured petri nets (TCPNs) in a formal way. We extend the activity diagram with time properties and a formal model named extended activity hyper graph (EAH) is defined. By mapping this formal model to a clocked transition system (CTS), we define a weak semantics for it. A list of transformation rules are proposed to show how this can be transformed to a TCPN model. We partially prove the model equivalence of the two models. Finally, an example of Game Capture application is used to validate our approach.
{"title":"Transformation from Activity Diagrams with Time Properties to Timed Coloured Petri Nets","authors":"Xuling Chang, Linpeng Huang, Jianpeng Hu, Chen Li, Bei Cao","doi":"10.1109/COMPSAC.2014.36","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.36","url":null,"abstract":"The activity diagram is widely used for describing and understanding workflows, however, it lacks a formal semantics and cannot be manipulated by computer. In this paper, we present a transformation from UML activity diagrams with time properties to timed coloured petri nets (TCPNs) in a formal way. We extend the activity diagram with time properties and a formal model named extended activity hyper graph (EAH) is defined. By mapping this formal model to a clocked transition system (CTS), we define a weak semantics for it. A list of transformation rules are proposed to show how this can be transformed to a TCPN model. We partially prove the model equivalence of the two models. Finally, an example of Game Capture application is used to validate our approach.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126543099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Ciraci, J. Fuller, J. Daily, A. Makhmalbaf, D. Callahan
In a standard workflow for the validation of a control system, the control system is implemented as an extension to a simulator. Such simulators are complex software systems, and engineers may unknowingly violate constraints a simulator places on extensions. As such, errors may be introduced in the implementation of either the control system or the simulator leading to invalid simulation results. This paper presents a novel runtime verification approach for verifying control system implementations within simulators. The major contribution of the approach is the two-tier specification process. In the first tier, engineers model constraints using a domain-specific language tailored to modeling a controller's response to changes in its input. The language is high-level and effectively hides the implementation details of the simulator, allowing engineers to specify design-level constraints independent of low-level simulator interfaces. In the second tier, simulator developers provide mapping rules for mapping design-level constraints to the implementation of the simulator. Using the rules, an automated tool transforms the design-level specifications into simulator-specific runtime verification specifications and generates monitoring code which is injected into the implementation of the simulator. During simulation, these monitors observe the input and output variables of the control system and report changes to the verifier. The verifier checks whether these changes follow the constraints of the control system. We describe application of this approach to the verification of the constraints of an HVAC control system implemented with the power grid simulator Grid LAB-D.
{"title":"A Runtime Verification Framework for Control System Simulation","authors":"S. Ciraci, J. Fuller, J. Daily, A. Makhmalbaf, D. Callahan","doi":"10.1109/COMPSAC.2014.14","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.14","url":null,"abstract":"In a standard workflow for the validation of a control system, the control system is implemented as an extension to a simulator. Such simulators are complex software systems, and engineers may unknowingly violate constraints a simulator places on extensions. As such, errors may be introduced in the implementation of either the control system or the simulator leading to invalid simulation results. This paper presents a novel runtime verification approach for verifying control system implementations within simulators. The major contribution of the approach is the two-tier specification process. In the first tier, engineers model constraints using a domain-specific language tailored to modeling a controller's response to changes in its input. The language is high-level and effectively hides the implementation details of the simulator, allowing engineers to specify design-level constraints independent of low-level simulator interfaces. In the second tier, simulator developers provide mapping rules for mapping design-level constraints to the implementation of the simulator. Using the rules, an automated tool transforms the design-level specifications into simulator-specific runtime verification specifications and generates monitoring code which is injected into the implementation of the simulator. During simulation, these monitors observe the input and output variables of the control system and report changes to the verifier. The verifier checks whether these changes follow the constraints of the control system. We describe application of this approach to the verification of the constraints of an HVAC control system implemented with the power grid simulator Grid LAB-D.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134327268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cloud federation allows individual cloud providers dynamically collaborate to offer services to their end-users with the Quality of Service (QoS) targets agreed in the Service Level Agreements (SLA). However, the current federated cloud models are not QoS-oriented or SLA-aware. This paper proposes a QoS-oriented federated cloud computing framework where multiple independent cloud providers can cooperate seamlessly to provide scalable QoS-assured services and discusses a high level architecture of the federation components. The distinct features of the proposed federation framework is its QoS-orientation that can trigger the on-demand resource provisioning across multiple providers, hence helping to maximize QoS targets and resources usage, eliminate SLA violations and enhance SLA formalization.
{"title":"A QoS-Oriented Inter-cloud Federation Framework","authors":"M. Salama, Shawish Ahmed","doi":"10.1109/COMPSAC.2014.51","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.51","url":null,"abstract":"Cloud federation allows individual cloud providers dynamically collaborate to offer services to their end-users with the Quality of Service (QoS) targets agreed in the Service Level Agreements (SLA). However, the current federated cloud models are not QoS-oriented or SLA-aware. This paper proposes a QoS-oriented federated cloud computing framework where multiple independent cloud providers can cooperate seamlessly to provide scalable QoS-assured services and discusses a high level architecture of the federation components. The distinct features of the proposed federation framework is its QoS-orientation that can trigger the on-demand resource provisioning across multiple providers, hence helping to maximize QoS targets and resources usage, eliminate SLA violations and enhance SLA formalization.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130882069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The use of software tools has become a common practice in global software engineering to handle requirements and to exchange project status amongst distributed teams and stakeholders. In context of agile software development the replacement of paper-based media (e.g. Task Board) with software tools results in heavily decreased collaboration and transparency within agile teams. Since the number of agile projects in global context increases, it is necessary to find an adequate solution to share project status without influencing the underlying agile process in a negative way. The proposed research project investigates why the replacement of paper-based media has such strong influence on group work in agile teams. Thereby, the focus of research is on the agile Task Board as the most important example for paper-based media of agile workspaces. With help of these findings we will develop a conceptual and technical solution, based on optical tracking of a paper-based Task Board, to share project status amongst stakeholders. The paper introduces the current state of the art, corresponding research questions, the entire research methods and current progress of our research.
{"title":"Media Supported Workspaces in Agile Software Development: Doctoral Symposium Paper","authors":"Florian Raith, Robert Lindermeier","doi":"10.1109/COMPSAC.2014.46","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.46","url":null,"abstract":"The use of software tools has become a common practice in global software engineering to handle requirements and to exchange project status amongst distributed teams and stakeholders. In context of agile software development the replacement of paper-based media (e.g. Task Board) with software tools results in heavily decreased collaboration and transparency within agile teams. Since the number of agile projects in global context increases, it is necessary to find an adequate solution to share project status without influencing the underlying agile process in a negative way. The proposed research project investigates why the replacement of paper-based media has such strong influence on group work in agile teams. Thereby, the focus of research is on the agile Task Board as the most important example for paper-based media of agile workspaces. With help of these findings we will develop a conceptual and technical solution, based on optical tracking of a paper-based Task Board, to share project status amongst stakeholders. The paper introduces the current state of the art, corresponding research questions, the entire research methods and current progress of our research.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131214675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
During bug reporting, The same bugs could be repeatedly reported. As a result, extra time could be spent on bug triaging and fixing. In order to reduce redundant effort, it is important to provide bug reporters with the ability to search for previously reported bugs efficiently and accurately. The existing bug tracking systems are using relatively simple ranking functions, which often produce unsatisfactory results. In this paper, we apply Ranking SVM, a Learning to Rank technique to construct a ranking model for accurate bug report search. Based on the search results, a topic model is used to cluster the bug reports into multiple facets. Each facet contains similar bug reports of the same topic. Users and testers can locate relevant bugs more efficiently through a simple query. We perform evaluations on more than 16,340 Eclipse and Mozilla bug reports. The evaluation results show that the proposed approach can achieve better search results than the existing search functions.
{"title":"Faceted Bug Report Search with Topic Model","authors":"K. Liu, Hee Beng Kuan Tan","doi":"10.1109/COMPSAC.2014.19","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.19","url":null,"abstract":"During bug reporting, The same bugs could be repeatedly reported. As a result, extra time could be spent on bug triaging and fixing. In order to reduce redundant effort, it is important to provide bug reporters with the ability to search for previously reported bugs efficiently and accurately. The existing bug tracking systems are using relatively simple ranking functions, which often produce unsatisfactory results. In this paper, we apply Ranking SVM, a Learning to Rank technique to construct a ranking model for accurate bug report search. Based on the search results, a topic model is used to cluster the bug reports into multiple facets. Each facet contains similar bug reports of the same topic. Users and testers can locate relevant bugs more efficiently through a simple query. We perform evaluations on more than 16,340 Eclipse and Mozilla bug reports. The evaluation results show that the proposed approach can achieve better search results than the existing search functions.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127855770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Akira Nagata, Kohei Kotera, Katsuichi Nakamura, Y. Hori
For a computer network in the era of big data, we discuss a behavioral anomaly detection system which makes it possible to analyze and immediately detect anomaly traffic behavior. Many sensor devices connect to the network and tend to generate their application traffic at quite a low communication rate. In order to observe necessary traffic information for traffic analysis in a short time, the monitoring system integrates traffic statistics of flows sent from devices which are considered to generate the same application. It detects anomaly traffic behavior on the basis of application analysis using NMF(Non-Negative Matrix Factorization).
{"title":"Behavioral Anomaly Detection System on Network Application Traffic from Many Sensors","authors":"Akira Nagata, Kohei Kotera, Katsuichi Nakamura, Y. Hori","doi":"10.1109/COMPSAC.2014.85","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.85","url":null,"abstract":"For a computer network in the era of big data, we discuss a behavioral anomaly detection system which makes it possible to analyze and immediately detect anomaly traffic behavior. Many sensor devices connect to the network and tend to generate their application traffic at quite a low communication rate. In order to observe necessary traffic information for traffic analysis in a short time, the monitoring system integrates traffic statistics of flows sent from devices which are considered to generate the same application. It detects anomaly traffic behavior on the basis of application analysis using NMF(Non-Negative Matrix Factorization).","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131273980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Accurate detection of software components that need to be exposed to additional verification and validation offers the path to high quality products while minimizing non essential software assurance expenditures. In this type of quality modeling we assume that software modules with known fault content developed in similar environment are available. Supervised learning algorithms are the traditional methods of choice for training on existing modules. The models are then used to predict fault content for newly developed software components prior to product release. However, one needs to realize that establishing whether a module contains a fault or not, only to be used for model training, can be expensive. The basic idea behind semi-supervised learning is to learn from a small number of software modules with known fault content and supplement model training with modules for which the fault information is not available, thus reducing the overall cost of quality assurance. In this study, we investigate the performance of semi-supervised learning for software fault prediction. A preprocessing strategy, multidimensional scaling, is embedded in the approach to reduce the dimensional complexity of software metrics used for prediction. Our results show that the dimension-reduction with semi-supervised learning algorithm preforms significantly better than one of the best performing supervised learning algorithm - random forest - in situations when few modules with known fault content are available. We compare our results with the published benchmarks and clearly demonstrate performance benefits.
{"title":"A Semi-supervised Approach to Software Defect Prediction","authors":"Huihua Lu, B. Cukic, M. Culp","doi":"10.1109/COMPSAC.2014.65","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.65","url":null,"abstract":"Accurate detection of software components that need to be exposed to additional verification and validation offers the path to high quality products while minimizing non essential software assurance expenditures. In this type of quality modeling we assume that software modules with known fault content developed in similar environment are available. Supervised learning algorithms are the traditional methods of choice for training on existing modules. The models are then used to predict fault content for newly developed software components prior to product release. However, one needs to realize that establishing whether a module contains a fault or not, only to be used for model training, can be expensive. The basic idea behind semi-supervised learning is to learn from a small number of software modules with known fault content and supplement model training with modules for which the fault information is not available, thus reducing the overall cost of quality assurance. In this study, we investigate the performance of semi-supervised learning for software fault prediction. A preprocessing strategy, multidimensional scaling, is embedded in the approach to reduce the dimensional complexity of software metrics used for prediction. Our results show that the dimension-reduction with semi-supervised learning algorithm preforms significantly better than one of the best performing supervised learning algorithm - random forest - in situations when few modules with known fault content are available. We compare our results with the published benchmarks and clearly demonstrate performance benefits.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128428677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We performed an empirical study to understand how different language features are used by JavaScript developers in practice, with the goal of using this information to assist future extensions of JavaScript. We inspected more than one million unique scripts (over 80 million lines of code) from various sources: JavaScript programs in the wild collected by a spider, (supposedly) better JavaScript programs collected from the top 100 URLs from the Alex a list, JavaScript programs with new language features used in Firefox Add-ons, widely used JavaScript libraries, and Node.js applications. Our corpus is larger and more diversified than those in prior studies. We also performed a study on 45 JavaScript developers to understand the reasons behind some of their language feature choices. Our study shows that there is a wide-spread confusion about newly introduced JavaScript features, a continuing misuse of existing problematic features, and a surprising lack of adoption of object-oriented features. Understanding JavaScript programming practices will assist many stakeholders: tool developers can analyze the requirements of better tools and more responsive IDEs and programmers can learn about the used (and the good) parts of JavaScript.
{"title":"JavaScript: The Used Parts","authors":"S. Gude, M. Hafiz, Allen Wirfs-Brock","doi":"10.1109/COMPSAC.2014.69","DOIUrl":"https://doi.org/10.1109/COMPSAC.2014.69","url":null,"abstract":"We performed an empirical study to understand how different language features are used by JavaScript developers in practice, with the goal of using this information to assist future extensions of JavaScript. We inspected more than one million unique scripts (over 80 million lines of code) from various sources: JavaScript programs in the wild collected by a spider, (supposedly) better JavaScript programs collected from the top 100 URLs from the Alex a list, JavaScript programs with new language features used in Firefox Add-ons, widely used JavaScript libraries, and Node.js applications. Our corpus is larger and more diversified than those in prior studies. We also performed a study on 45 JavaScript developers to understand the reasons behind some of their language feature choices. Our study shows that there is a wide-spread confusion about newly introduced JavaScript features, a continuing misuse of existing problematic features, and a surprising lack of adoption of object-oriented features. Understanding JavaScript programming practices will assist many stakeholders: tool developers can analyze the requirements of better tools and more responsive IDEs and programmers can learn about the used (and the good) parts of JavaScript.","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129795727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：