"uuid","repository link","title","author","contributor","publication year","abstract","subject topic","language","publication type","publisher","isbn","issn","patent","patent status","bibliographic note","access restriction","embargo date","faculty","department","research group","programme","project","coordinates"
"uuid:59adc536-7b53-415c-b7bb-0e1205f5c0d4","http://resolver.tudelft.nl/uuid:59adc536-7b53-415c-b7bb-0e1205f5c0d4","Crawl-Based Analysis of Web Applications: Prospects and Challenges","Van Deursen, A.; Mesbah, A.; Nederlof, A.","","2014","In this paper we review five years of research in the field of automated crawling and testing of web applications. We describe the open source Crawljax tool, and the various extensions that have been proposed in order to address such issues as cross-browser compatibility testing, web application regression testing, and style sheet usage analysis. Based on that we identify the main challenges and future directions of crawl-based testing of web applications. In particular, we explore ways to reduce the exponential growth of the state space, as well as ways to involve the human tester in the loop, thus reconciling manual exploratory testing and automated test input generation. Finally, we sketch the future of crawl-based testing in the light of upcoming developments, such as the pervasive use of touch devices and mobile computing, and the increasing importance of cyber-security.","test automation; web crawling; software evolution","en","report","Delft University of Technology, Software Engineering Research Group","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Software Technology","","","",""
"uuid:dd5dca96-2c8e-4bb3-ab02-369d9540c8d7","http://resolver.tudelft.nl/uuid:dd5dca96-2c8e-4bb3-ab02-369d9540c8d7","Predicting the fix time of bugs","Giger, E.; Pinzger, M.; Gall, H.C.","","2013","Two important questions concerning the coordination of development effort are which bugs to fix first and how long it takes to fix them. In this paper we investigate empirically the relationships between bug report attributes and the time to fix. The objective is to compute prediction models that can be used to recommend whether a new bug should and will be fixed fast or will take more time for resolution. We examine in detail if attributes of a bug report can be used to build such a recommender system. We use decision tree analysis to compute and 10-fold cross validation to test prediction models. We explore prediction models in a series of empirical studies with bug report data of six systems of the three open source projects Eclipse, Mozilla, and Gnome. Results show that our models perform significantly better than random classification. For example, fast fixed Eclipse Platform bugs were classified correctly with a precision of 0.654 and a recall of 0.692. We also show that the inclusion of postsubmission bug report data of up to one month can further improve prediction models. Preprint accepted for publication in the Proceedings of the 2nd International Workshop on Recommendation Systems for Software Engineering (RSSE), Cape Town (South Africa) May, 2010","","en","report","Delft University of Technology, Software Engineering Research Group","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Software Technology","","","",""
"uuid:ebf61531-bbdf-4bde-b991-7733d9ae4af4","http://resolver.tudelft.nl/uuid:ebf61531-bbdf-4bde-b991-7733d9ae4af4","Declarative Name Binding and Scope Rules","Konat, G.; Kats, L.C.L.; Wachsmuth, G.; Visser, E.","","2012","Preprint of paper published in: SLE 2012 - 5th International Conference on Software Language Engineering, 26-28 September 2012, Lecture Notes in Computer Science 7745; doi:10.1007/978-3-642-36089-3_18 In textual software languages, names are used to reference elements like variables, methods, classes, etc. Name resolution analyses these names in order to establish references between definition and use sites of elements. In this paper, we identify recurring patterns for name bindings in programming languages and introduce a declarative metalanguage for the specification of name bindings in terms of namespaces, definition sites, use sites, and scopes. Based on such declarative name binding specifications, we provide a language-parametric algorithm for static name resolution during compile-time. We discuss the integration of the algorithm into the Spoofax Language Workbench and show how its results can be employed in semantic editor services like reference resolution, constraint checking, and content completion.","","en","lecture notes","Delft University of Technology, Software Engineering Research Group","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Software Computer Technology","","","",""
"uuid:b5b0430e-928e-444f-9501-f699e7953dbe","http://resolver.tudelft.nl/uuid:b5b0430e-928e-444f-9501-f699e7953dbe","Dependency Profiles for Software Architecture Evaluations","Bouwers, E.; Van Deursen, A.; Visser, J.","","2011","In this paper we introduce the concept of a -dependency profile-, a system level metric aimed at quantifying the level of encapsulation and independence within a system. We verify that these profiles are suitable to be used in an evaluation context by inspecting the dependency profiles for a repository of almost 100 systems. Furthermore we outline the steps we are taking to validate the usefulness and applicability of the proposed profiles. Accepted for publication in the Proceedings of the 27th IEEE International Conference on Software Maintenance (ICSM), 2011, IEEE Computer Society.","","en","report","Delft University of Technology, Software Engineering Research Group","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Software Technology","","","",""
"uuid:0bc86607-68ef-48a9-9902-d4f3933d220b","http://resolver.tudelft.nl/uuid:0bc86607-68ef-48a9-9902-d4f3933d220b","Using Association Rules to Study the Co-evolution of Production & Test Code","Lubsen, Z.; Zaidman, A.; Pinzger, M.","","2009","Paper accepted for publication in the proceedings of the 6th International Working Conference on Mining Software Repositories (MSR 2009). Unit tests are generally acknowledged as an important aid to produce high quality code, as they provide quick feedback to developers on the correctness of their code. In order to achieve high quality, well-maintained tests are needed. Ideally, tests co-evolve with the production code to test changes as soon as possible. In this paper, we explore an approach based on association rule mining to determine whether production and test code co-evolve synchronously. Through two case studies, one with an open source and another one with an industrial software system, we show that our association rule mining approach allows one to assess the co-evolution of product and test code in a software project and, moreover, to uncover the distribution of programmer effort over pure coding, pure testing, or a more test-driven-like practice.","","en","report","Delft University of Technology, Software Engineering Research Group","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Software Computer Technology","","","",""
"uuid:1f8a6c57-24ee-46e4-8cc8-9ef962ad9248","http://resolver.tudelft.nl/uuid:1f8a6c57-24ee-46e4-8cc8-9ef962ad9248","Reducing the Runtime Acceptance Costs of Large-Scale Distributed Component-Based Systems","Gonzalez, A.; Piel, E.; Gross, H.G.","","2008","Software Systems of Systems (SoS) are large-scale distributed component-based systems in which the individual components are elaborate and complex systems in their own right. Distinguishing characteristics are their short expected integration and deployment time, and the need to modify their architecture at runtime, while preserving the integrity of the system. Integration testing is a commonly used technique employed in the acceptance processes of software SoS. In this paper, we propose a scheme to test a complete SoS at every reconfiguration, re-exercising the test cases of every updated component. In practice, re-executing all the test cases, whenever a modification takes place in one of the components, would be very costly. This is the case, in particular, when the system has to keep running all the time. Our proposal, therefore, encompasses several methods to limit the amount of test cases to be executed. The basis of all these methods is to rely on as much information as possible extracted from previous runs of the test cases. We illustrate our findings with an example SoS coming from the maritime safety and security domain.","","en","report","Delft University of Technology, Software Engineering Research Group","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Software Computer Technology","","","",""
"uuid:33a06c9c-86c7-41e4-8a2b-89f6ebdadaab","http://resolver.tudelft.nl/uuid:33a06c9c-86c7-41e4-8a2b-89f6ebdadaab","Reformulating Component Identification as Document Analysis Problem","Gross, H.G.; Lormans, M.; Zhou, J.","","2007","One of the first steps of component procurement is the identification of required component features in large repositories of existing components. On the highest level of abstraction, component requirements as well as component descriptions are usually written in natural language. Therefore, we can reformulate component identification as a text analysis problem and apply latent semantic analysis for automatically identifying suitable existing components in large repositories, based on the descriptions of required component features. In this article, we motivate our choice of this technique for feature identification, describe how it can be applied to feature tracing problems, and discuss the results that we achieved with the application of this technique in a number of case studies. Paper accepted for publication in ICSOFT 2007, Proceedings of the Second International Conference on Software and Data Technologies, Volume SE, Barcelona, Spain, July 22-25, 2007.","Latent Semantic Analysis; Component Identification; Component Selection; Procurement Automation","en","report","Delft University of Technology, Software Engineering Research Group","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Software Technology","","","",""