{"title": "Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering, ASE 2016, Singapore, September 3-7, 2016", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David Lo", "Sven Apel", "Sarfraz Khurshid"], "abstract": null, "doi": "10.1145/2970276", "arxiv_id": "https://doi.org/10.1145/2970276", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276"}
{"title": "Program generation for performance", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Markus Püschel"], "abstract": "It has become extraordinarily difficult to write software that performs close to optimally on complex modern microarchitectures. Particularly plagued are domains that require complex mathematical computations such as multimedia processing, communication, control, graphics, and machine learning. In these domains, performance-critical components are usually written in C (with possible extensions) and often even in assembly, carefully \"tuned\" to the platform's architecture and microarchitecture. The result is usually long, rather unreadable code that needs to be re-written or re-tuned with every platform upgrade. On the other hand, the performance penalty for relying on straightforward, non-tuned, \"more elegant\" implementations can be often a factor of 10, 100, or even more. The overall problem is one of productivity, maintainability, and quality (namely performance), i.e., software engineering. However, even though a large set of sophisticated software engineering theory and tools exist, it appears that to date this community has not focused much on mathematical computations nor performance in the detailed, close-to-optimal sense above. The reason for the latter may be that performance, unlike various aspects of correctness, is not syntactic in nature (and in reality is often even unpredictable and, well, messy). The aim of this talk is to draw attention to the performance/productivity problem for mathematical applications and to make the case for a more interdisciplinary attack. As a set of thoughts in this direction we offer some of the lessons we have learned in the last decade in our own research on Spiral (www.spiral.net), a program generation framework for numerical kernels. Key techniques used in Spiral include staged declarative domain-specific languages to express algorithm knowledge and algorithm transformations, the use of platform-cognizant rewriting systems for parallelism and locality optimizations, and the use of search and machine learning techniques to navigate possible spaces of choices. Experimental results show that the codegenerated by Spiral competes with, and sometimes outperforms, the best available human-written code. Spiral has been used to generate part of Intel's commercial libraries IPP and MKL.", "doi": "10.1145/2970276.2985778", "arxiv_id": "https://doi.org/10.1145/2970276.2985778", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2985778"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2985778"}
{"title": "Changing microsoft's build: revolution or evolution", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wolfram Schulte"], "abstract": "Tens of thousands of Microsoft engineers build and test hundreds of software products several times a day. It is essential that this continuous integration scales, guarantees short feedback cycles, and functions reliably with minimal human intervention. During the past three years TSE's charter has been to shorten this cycle time. We went after this goal in two ways: Evolution via CloudBuild and Revolution via Concord. CloudBuild is a build service infrastructure, now being used by all major product groups in Microsoft, like Azure, Bing, Office, SQL except for Windows. CloudBuild addresses all aspects of a continuous integration workflow, like builds, test and code analysis, but also drops, package and symbol creation and storage. CloudBuild supports multiple build languages as long as they fulfill a coarse grained IO based contract. CloudBuild uses content based caching to run build-related tasks only when needed. Lastly, it builds on many machines in parallel. The speed ups of build and testing range from 1.2x to 10x. CloudBuild aims to rapidly onboard teams and hence has to support non-deterministic build tools and specification languages that under-declare dependencies. CloudBuild, being a reliable build service in the presence of unreliable components, currently achieves service availability better than 99%. Windows went a different path. Their past build exhaust was so massive that building Windows in the cloud and bringing the build results back for testing on corp.-net. was considered infeasible. So they decided to move to a new build language, codename Concord. By construction, Concord guarantees reliable builds, no over-build, and allows for efficient distribution. Adopting Concord has led to immense performance improvements, we have seen up to 100X speedup for Windows builds. But the path has been long and rocky, since it not only requires a substantial rewrite of existing build logic, but also all related developer and build lab processes have to change. Whether evolution or revolution is the right path forward -- the verdict is still out.", "doi": "10.1145/2970276.2985779", "arxiv_id": "https://doi.org/10.1145/2970276.2985779", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2985779"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2985779"}
{"title": "The power of probabilistic thinking", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David S. Rosenblum"], "abstract": "Traditionally, software engineering has dealt in absolutes. For instance, we talk about a system being \"correct\" or \"incorrect\", with the shades of grey in between occasionally acknowledged but rarely dealt with explicitly. And we typically employ logical, algebraic, relational and other representations and techniques that help us reason about software in such absolute terms. There of course have been notable exceptions to this, such as the use of statistical techniques in testing and debugging. But by and large, both researchers and practitioners have favored the relative comfort of an absolutist viewpoint in all aspects of development. In this talk, I will argue the benefits of taking a more thoroughly probabilistic approach in software engineering. Software engineering is rife with stochastic phenomena, and the vast majority of software systems operate in an environment of uncertain, random behavior, which suits an explicit probabilistic characterization. Furthermore, this uncertainty is becoming ever more pronounced in new software systems and platforms, such as the Internet of Things and autonomous vehicles, with their frequent imprecise outputs and heavy reliance on machine learning. To illustrate more deeply some of the considerations involved in taking a probabilistic approach, I will talk about some recent research I have been doing in probabilistic verification.", "doi": "10.1145/2970276.2985780", "arxiv_id": "https://doi.org/10.1145/2970276.2985780", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2985780"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2985780"}
{"title": "An empirical investigation into the nature of test smells", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michele Tufano", "Fabio Palomba", "Gabriele Bavota", "Massimiliano Di Penta", "Rocco Oliveto", "Andrea De Lucia", "Denys Poshyvanyk"], "abstract": "Test smells have been defined as poorly designed tests and, as reported by recent empirical studies, their presence may negatively affect comprehension and maintenance of test suites. Despite this, there are no available automated tools to support identification and repair of test smells. In this paper, we firstly investigate developers' perception of test smells in a study with 19 participants. The results show that developers generally do not recognize (potentially harmful) test smells, highlighting that automated tools for identifying such smells are much needed. However, to build effective tools, deeper insights into the test smells phenomenon are required. To this aim, we conducted a large-scale empirical investigation aimed at analyzing (i) when test smells occur in source code, (ii) what their survivability is, and (iii) whether their presence is associated with the presence of design problems in production code (code smells). The results indicate that test smells are usually introduced when the corresponding test code is committed in the repository for the first time, and they tend to remain in a system for a long time. Moreover, we found various unexpected relationships between test and code smells. Finally, we show how the results of this study can be used to build effective automated tools for test smell detection and refactoring.", "doi": "10.1145/2970276.2970340", "arxiv_id": "https://doi.org/10.1145/2970276.2970340", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970340"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970340"}
{"title": "Evaluating non-adequate test-case reduction", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Amin Alipour", "August Shi", "Rahul Gopinath", "Darko Marinov", "Alex Groce"], "abstract": "Given two test cases, one larger and one smaller, the smaller test case is preferred for many purposes. A smaller test case usually runs faster, is easier to understand, and is more convenient for debugging. However, smaller test cases also tend to cover less code and detect fewer faults than larger test cases. Whereas traditional research focused on reducing test suites while preserving code coverage, recent work has introduced the idea of reducing individual test cases, rather than test suites, while still preserving code coverage. Other recent work has proposed non-adequately reducing test suites by not even preserving all the code coverage. This paper empirically evaluates a new combination of these two ideas, non-adequate reduction of test cases, which allows for a wide range of trade-offs between test case size and fault detection. Our study introduces and evaluates C%-coverage reduction (where a test case is reduced to retain at least C% of its original coverage) and N -mutant reduction (where a test case is reduced to kill at least N of the mutants it originally killed). We evaluate the reduction trade-offs with varying values of C% and N for four real-world C projects: Mozilla’s SpiderMonkey JavaScript engine, the YAFFS2 flash file system, Grep, and Gzip. The results show that it is possible to greatly reduce the size of many test cases while still preserving much of their fault-detection capability.", "doi": "10.1145/2970276.2970361", "arxiv_id": "https://doi.org/10.1145/2970276.2970361", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970361"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970361"}
{"title": "Optimizing customized program coverage", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Peter Ohmann", "David Bingham Brown", "Naveen Neelakandan", "Jeff T. Linderoth", "Ben Liblit"], "abstract": "Program coverage is used across many stages of software development. While common during testing, program coverage has also found use outside the test lab, in production software. However, production software has stricter requirements on run-time overheads, and may limit possible program instrumentation. Thus, optimizing the placement of probes to gather program coverage is important. We introduce and study the problem of customized program coverage optimization. We generalize previous work that optimizes for complete coverage instrumentation with a system that adapts optimization to customizable program coverage requirements. Specifically, our system allows a user to specify desired coverage locations and to limit legal instrumentation locations. We prove that the problem of determining optimal coverage probes is NP-hard, and we present a solution based on mixed integer linear programming. Due to the computational complexity of the problem, we also provide two practical approximation approaches. We evaluate the effectiveness of our approximations across a diverse set of benchmarks, and show that our techniques can substantially reduce instrumentation while allowing the user immense freedom in defining coverage requirements. When naive instrumentation is dense or expensive, our optimizations succeed in lowering execution time overheads.", "doi": "10.1145/2970276.2970351", "arxiv_id": "https://doi.org/10.1145/2970276.2970351", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970351"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970351"}
{"title": "What makes killing a mutant hard", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Willem Visser"], "abstract": "Mutation operators have been studied at length to determine which ones are the ``best\" at some metric (for example creates the least equivalent mutants, creates hard-to-kill mutants, etc.). These studies though have focused on specific test suites, where the test inputs and oracles are fixed, which leads to results that are strongly influenced by the test suites and thus makes the conclusions potentially less general. In this paper we consider all test inputs and we assume we have no prior knowledge about the likelihood of any specific inputs. We will also show how varying the strength of the oracle have a big impact on the results. We only consider a few mutation operators (mostly relational), only a handful of programs to mutate (amenable to probabilistic symbolic execution), and only consider how likely it is that a mutant is killed. A core finding is that the likelihood of reaching the source line where the mutation is applied, is an important contributor to the likelihood of killing the mutant and when we control for this we can see which operators create mutations that are too easy versus very hard to kill.", "doi": "10.1145/2970276.2970345", "arxiv_id": "https://doi.org/10.1145/2970276.2970345", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970345"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970345"}
{"title": "Test case permutation to improve execution time", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Panagiotis Stratis", "Ajitha Rajan"], "abstract": "With the growing complexity of software, the number of test cases needed for effective validation is extremely large. Executing these large test suites is expensive, both in terms of time and energy. Cache misses are known to be one of the main factors contributing to execution time of a software. Cache misses are reduced by increasing the locality of memory references. For a single program run, compiler optimisations help improve data locality and code layout optimisations help improve spatial locality of instructions. Nevertheless, cache locality optimisations have not been proposed and explored across several program runs, which is the case when we run several test cases.", "doi": "10.1145/2970276.2970331", "arxiv_id": "https://doi.org/10.1145/2970276.2970331", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970331"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970331"}
{"title": "Predicting semantically linkable knowledge in developer online forums via convolutional neural network", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bowen Xu", "Deheng Ye", "Zhenchang Xing", "Xin Xia", "Guibin Chen", "Shanping Li"], "abstract": "Consider a question and its answers in Stack Overflow as a knowledge unit. Knowledge units often contain semantically relevant knowledge, and thus linkable for different purposes, such as duplicate questions, directly linkable for problem solving, indirectly linkable for related information. Recognizing different classes of linkable knowledge would support more targeted information needs when users search or explore the knowledge base. Existing methods focus on binary relatedness (i.e., related or not), and are not robust to recognize different classes of semantic relatedness when linkable knowledge units share few words in common (i.e., have lexical gap). In this paper, we formulate the problem of predicting semantically linkable knowledge units as a multiclass classification problem, and solve the problem using deep learning techniques. To overcome the lexical gap issue, we adopt neural language model (word embeddings) and convolutional neural network (CNN) to capture word- and document-level semantics of knowledge units. Instead of using human-engineered classifier features which are hard to design for informal user-generated content, we exploit large amounts of different types of user-created knowledge-unit links to train the CNN to learn the most informative word- and sentence-level features for the multiclass classification task. Our evaluation shows that our deep-learning based approach significantly and consistently outperforms traditional methods using traditional word representations and human-engineered classifier features.", "doi": "10.1145/2970276.2970357", "arxiv_id": "https://doi.org/10.1145/2970276.2970357", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970357"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970357"}
{"title": "Testing advanced driver assistance systems using multi-objective search and neural networks", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Raja Ben Abdessalem", "Shiva Nejati", "Lionel C. Briand", "Thomas Stifter"], "abstract": "Recent years have seen a proliferation of complex Advanced Driver Assistance Systems (ADAS), in particular, for use in autonomous cars. These systems consist of sensors and cameras as well as image processing and decision support software components. They are meant to help drivers by providing proper warnings or by preventing dangerous situations. In this paper, we focus on the problem of design time testing of ADAS in a simulated environment. We provide a testing approach for ADAS by combining multi-objective search with surrogate models developed based on neural networks. We use multi-objective search to guide testing towards the most critical behaviors of ADAS. Surrogate modeling enables our testing approach to explore a larger part of the input search space within limited computational resources. We characterize the condition under which the multi-objective search algorithm behaves the same with and without surrogate modeling, thus showing the accuracy of our approach. We evaluate our approach by applying it to an industrial ADAS system. Our experiment shows that our approach automatically identifies test cases indicating critical ADAS behaviors. Further, we show that combining our search algorithm with surrogate modeling improves the quality of the generated test cases, especially under tight and realistic computational resources.", "doi": "10.1145/2970276.2970311", "arxiv_id": "https://doi.org/10.1145/2970276.2970311", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970311"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970311"}
{"title": "Privacy preserving via interval covering based subclass division and manifold learning based bi-directional obfuscation for effort estimation", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fumin Qi", "Xiao-Yuan Jing", "Xiaoke Zhu", "Fei Wu", "Li Cheng"], "abstract": "When a company lacks local data in hand, engineers can build an effort model for the effort estimation of a new project by utilizing the training data shared by other companies. However, one of the most important obstacles for data sharing is the privacy concerns of software development organizations. In software engineering, most of existing privacy-preserving works mainly focus on the defect prediction, or debugging and testing, yet the privacy-preserving data sharing problem has not been well studied in effort estimation. In this paper, we aim to provide data owners with an effective approach of privatizing their data before release. We firstly design an Interval Covering based Subclass Division (ICSD) strategy. ICSD can divide the target data into several subclasses by digging a new attribute (i.e., class label) from the effort data. And the obtained class label is beneficial to maintaining the distribution of the target data after obfuscation. Then, we propose a manifold learning based bi-directional data obfuscation (MLBDO) algorithm, which uses two nearest neighbors, which are selected respectively from the previous and next subclasses by utilizing the manifold learning based nearest neighbor selector, as the disturbances to obfuscate the target sample. We call the entire approach as ICSD&MLBDO. Experimental results on seven public effort datasets show that: 1) ICSD&MLBDO can guarantee the privacy and maintain the utility of obfuscated data. 2) ICSD&MLBDO can achieve better privacy and utility than the compared privacy-preserving methods.", "doi": "10.1145/2970276.2970302", "arxiv_id": "https://doi.org/10.1145/2970276.2970302", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970302"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970302"}
{"title": "Deep learning code fragments for code clone detection", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin White", "Michele Tufano", "Christopher Vendome", "Denys Poshyvanyk"], "abstract": "Code clone detection is an important problem for software maintenance and evolution. Many approaches consider either structure or identifiers, but none of the existing detection techniques model both sources of information. These techniques also depend on generic, handcrafted features to represent code fragments. We introduce learning-based detection techniques where everything for representing terms and fragments in source code is mined from the repository. Our code analysis supports a framework, which relies on deep learning, for automatically linking patterns mined at the lexical level with patterns mined at the syntactic level. We evaluated our novel learning-based approach for code clone detection with respect to feasibility from the point of view of software maintainers. We sampled and manually evaluated 398 file- and 480 method-level pairs across eight real-world Java systems; 93% of the file- and method-level samples were evaluated to be true positives. Among the true positives, we found pairs mapping to all four clone types. We compared our approach to a traditional structure-oriented technique and found that our learning-based approach detected clones that were either undetected or suboptimally reported by the prominent tool Deckard. Our results affirm that our learning-based approach is suitable for clone detection and a tenable technique for researchers.", "doi": "10.1145/2970276.2970326", "arxiv_id": "https://doi.org/10.1145/2970276.2970326", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970326"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970326"}
{"title": "Automatically recommending code reviewers based on their expertise: an empirical comparison", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christoph Hannebauer", "Michael Patalas", "Sebastian Stünkel", "Volker Gruhn"], "abstract": "Code reviews are an essential part of quality assurance in Free, Libre, and Open Source (FLOSS) projects. However, finding a suitable reviewer can be difficult, and delayed or forgotten reviews are the consequence. Automating reviewer selection with suitable algorithms can mitigate this problem. We compare empirically six algorithms based on modification expertise and two algorithms based on review expertise on four major FLOSS projects. Our results indicate that the algorithms based on review expertise yield better recommendations than those based on modification expertise. The algorithm Weighted Review Count (WRC) recommends at least one out of five reviewers correctly in 69 % to 75 % of all cases, which is one of the best results achieved in the comparison.", "doi": "10.1145/2970276.2970306", "arxiv_id": "https://doi.org/10.1145/2970276.2970306", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970306"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970306"}
{"title": "Evaluating the evaluations of code recommender systems: a reality check", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sebastian Proksch", "Sven Amann", "Sarah Nadi", "Mira Mezini"], "abstract": "While researchers develop many new exciting code recommender systems, such as method-call completion, code-snippet completion, or code search, an accurate evaluation of such systems is always a challenge. We analyzed the current literature and found that most of the current evaluations rely on artificial queries extracted from released code, which begs the question: Do such evaluations reflect real-life usages? To answer this question, we capture 6,189 fine-grained development histories from real IDE interactions. We use them as a ground truth and extract 7,157 real queries for a specific method-call recommender system. We compare the results of such real queries with different artificial evaluation strategies and check several assumptions that are repeatedly used in research, but never empirically evaluated. We find that an evolving context that is often observed in practice has a major effect on the prediction quality of recommender systems, but is not commonly reflected in artificial evaluations.", "doi": "10.1145/2970276.2970330", "arxiv_id": "https://doi.org/10.1145/2970276.2970330", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970330"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970330"}
{"title": "Too much automation? the bellwether effect and its implications for transfer learning", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rahul Krishna", "Tim Menzies", "Wei Fu"], "abstract": "“Transfer learning”: is the process of translating quality predictors learned in one data set to another. Transfer learning has been the subject of much recent research. In practice, that research means changing models all the time as transfer learners continually exchange new models to the current project. This paper offers a very simple “bellwether” transfer learner. Given N data sets, we find which one produces the best predictions on all the others. This “bellwether” data set is then used for all subsequent predictions (or, until such time as its predictions start failing-at which point it is wise to seek another bellwether). Bellwethers are interesting since they are very simple to find (just wrap a for-loop around standard data miners). Also, they simplify the task of making general policies in SE since as long as one bellwether remains useful, stable conclusions for N data sets can be achieved just by reasoning over that bellwether. From this, we conclude (1) this bellwether method is a useful (and very simple) transfer learning method; (2) “bellwethers” are a baseline method against which future transfer learners should be compared; (3) sometimes, when building increasingly complex automatic methods, researchers should pause and compare their supposedly more sophisticated method against simpler alternatives.", "doi": "10.1145/2970276.2970339", "arxiv_id": "https://doi.org/10.1145/2970276.2970339", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970339"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970339"}
{"title": "Automatic microbenchmark generation to prevent dead code elimination and constant folding", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marcelino Rodriguez-Cancio", "Benoît Combemale", "Benoit Baudry"], "abstract": "Microbenchmarking evaluates, in isolation, the execution time of small code segments that play a critical role in large applications. The accuracy of a microbenchmark depends on two critical tasks: wrap the code segment into a pay-load that faithfully recreates the execution conditions of the large application; build a scaffold that runs the payload a large number of times to get a statistical estimate of the execution time. While recent frameworks such as the Java Microbenchmark Harness (JMH) address the scaffold challenge, developers have very limited support to build a correct payload. This work focuses on the automatic generation of pay-loads, starting from a code segment selected in a large application. Our generative technique prevents two of the most common mistakes made in microbenchmarks: dead code elimination and constant folding. A microbenchmark is such a small program that can be “over-optimized” by the JIT and result in distorted time measures, if not designed carefully. Our technique automatically extracts the segment into a compilable payload and generates additional code to prevent the risks of “over-optimization”. The whole approach is embedded in a tool called AutoJMH, which generates payloads for JMH scaffolds. We validate the capabilities AutoJMH, showing that the tool is able to process a large percentage of segments in real programs. We also show that AutoJMH can match the quality of payloads handwritten by performance experts and outperform those written by professional Java developers without experience in microbenchmarking.", "doi": "10.1145/2970276.2970346", "arxiv_id": "https://doi.org/10.1145/2970276.2970346", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970346"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970346"}
{"title": "Visualization of combinatorial models and test plans", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rachel Tzoref-Brill", "Paul A. Wojciak", "Shahar Maoz"], "abstract": "Combinatorial test design (CTD) is an effective and widely used test design technique. CTD provides automatic test plan generation, but it requires a manual definition of the test space in the form of a combinatorial model. One challenge for successful application of CTD in practice relates to this manual model definition and maintenance process. Another challenge relates to the comprehension and use of the test plan generated by CTD for prioritization purposes.", "doi": "10.1145/2970276.2970301", "arxiv_id": "https://doi.org/10.1145/2970276.2970301", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970301"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970301"}
{"title": "Finding access control bugs in web applications with CanCheck", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ivan Bocic", "Tevfik Bultan"], "abstract": "Access control bugs in web applications can have dire consequences since many web applications store private and sensitive data. In this paper we present an automated verification technique for access control in Ruby on Rails (Rails) applications. Our technique starts by automatically extracting a model that captures 1) the ways the data is accessed and modified by the application, 2) the access control policy of the application, and 3) the authorization checks used for access control policy enforcement. Then, it automatically translates this model to first order logic and uses automated theorem provers to check whether the declared access control policy is correctly enforced by the implementation. We implemented our technique in a tool called CanCheck. Using CanCheck on open source Rails applications, we found numerous previously unknown exploitable access control bugs as well as several deficiencies in access control policies.", "doi": "10.1145/2970276.2970350", "arxiv_id": "https://doi.org/10.1145/2970276.2970350", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970350"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970350"}
{"title": "SOFIA: an automated security oracle for black-box testing of SQL-injection vulnerabilities", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mariano Ceccato", "Cu D. Nguyen", "Dennis Appelt", "Lionel C. Briand"], "abstract": "Security testing is a pivotal activity in engineering secure software. It consists of two phases: generating attack inputs to test the system, and assessing whether test executions expose any vulnerabilities. The latter phase is known as the security oracle problem.", "doi": "10.1145/2970276.2970343", "arxiv_id": "https://doi.org/10.1145/2970276.2970343", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970343"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970343"}
{"title": "Supporting oracle construction via static analysis", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Junjie Chen", "Yanwei Bai", "Dan Hao", "Lingming Zhang", "Lu Zhang", "Bing Xie", "Hong Mei"], "abstract": "In software testing, the program under test is usually executed with test inputs and checked against a test oracle, which is a mechanism to verify whether the program behaves as expected. Selecting the right oracle data to observe is crucial in test oracle construction. In the literature, researchers have proposed two dynamic approaches to oracle data selection by analyzing test execution information (e.g., variables' values or interaction information). However, collecting such information during program execution may incur extra cost. In this paper, we present the first static approach to oracle data selection, SODS (Static Oracle Data Selection). In particular, SODS first identifies the substitution relationships between candidate oracle data by constructing a probabilistic substitution graph based on the definition-use chains of the program under test, then estimates the fault-observing capability of each candidate oracle data, and finally selects a subset of oracle data with strong fault-observing capability. For programs with analyzable test code, we further extend SODS via pruning the probabilistic substitution graph based on 0-1-CFA call graph analysis. The experimental study on 11 subject systems written in C or Java demonstrates that our static approach is more effective and much more efficient than state-of-the-art dynamic approaches in most cases.", "doi": "10.1145/2970276.2970366", "arxiv_id": "https://doi.org/10.1145/2970276.2970366", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970366"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970366"}
{"title": "Local-based active classification of test report to assist crowdsourced testing", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Junjie Wang", "Song Wang", "Qiang Cui", "Qing Wang"], "abstract": "In crowdsourced testing, an important task is to identify the test reports that actually reveal fault - true fault, from the large number of test reports submitted by crowd workers. Most existing approaches towards this problem utilized supervised machine learning techniques, which often require users to manually label a large amount of training data. Such process is time-consuming and labor-intensive. Thus, reducing the onerous burden of manual labeling while still being able to achieve good performance is crucial. Active learning is one potential technique to address this challenge, which aims at training a good classifier with as few labeled data as possible. Nevertheless, our observation on real industrial data reveals that existing active learning approaches generate poor and unstable performances on crowdsourced testing data. We analyze the deep reason and find that the dataset has significant local biases. To address the above problems, we propose LOcal-based Active ClassiFication (LOAF) to classify true fault from crowdsourced test reports. LOAF recommends a small portion of instances which are most informative within local neighborhood, and asks user their labels, then learns classifiers based on local neighborhood. Our evaluation on 14,609 test reports of 34 commercial projects from one of the Chinese largest crowdsourced testing platforms shows that our proposed LOAF can generate promising results. In addition, its performance is even better than existing supervised learning approaches which built on large amounts of labelled historical data. Moreover, we also implement our approach and evaluate its usefulness using real-world case studies. The feedbacks from testers demonstrate its practical value.", "doi": "10.1145/2970276.2970300", "arxiv_id": "https://doi.org/10.1145/2970276.2970300", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970300"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970300"}
{"title": "Multi-objective test report prioritization using image understanding", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yang Feng", "James A. Jones", "Zhenyu Chen", "Chunrong Fang"], "abstract": "In crowdsourced software testing, inspecting the large number of test reports is an overwhelming but inevitable software maintenance task. In recent years, to alleviate this task, many text-based test-report classification and prioritization techniques have been proposed. However in the mobile testing domain, test reports often consist of more screenshots and shorter descriptive text, and thus text-based techniques may be ineffective or inapplicable. The shortage and ambiguity of natural-language text information and the well defined screenshots of activity views within mobile applications motivate our novel technique based on using image understanding for multi-objective test-report prioritization. In this paper, by taking the similarity of screenshots into consideration, we present a multi-objective optimization-based prioritization technique to assist inspections of crowdsourced test reports. In our technique, we employ the Spatial Pyramid Matching (SPM) technique to measure the similarity of the screenshots, and apply the natural-language processing technique to measure the distance between the text of test reports. Furthermore, to validate our technique, an experiment with more than 600 test reports and 2500 images is conducted. The experimental results show that image-understanding techniques can provide benefit to test-report prioritization for most applications.", "doi": "10.1145/2970276.2970367", "arxiv_id": "https://doi.org/10.1145/2970276.2970367", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970367"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970367"}
{"title": "CrowdService: serving the individuals through mobile crowdsourcing and service composition", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xin Peng", "Jingxiao Gu", "Tian Huat Tan", "Jun Sun", "Yijun Yu", "Bashar Nuseibeh", "Wenyun Zhao"], "abstract": "Some user needs in real life can only be accomplished by leveraging the intelligence and labor of other people via crowdsourcing tasks. For example, one may want to confirm the validity of the description of a secondhand laptop by asking someone else to inspect the laptop on site. To integrate these crowdsourcing tasks into user applications, it is required that crowd intelligence and labor be provided as easily accessible services (e.g., Web services), which can be called crowd services. In this paper, we develop a framework named CROWDSERVICE which supplies crowd intelligence and labor as publicly accessible crowd services via mobile crowdsourcing. We implement the proposed framework on the Android platform and evaluate the usability of the framework with a user study.", "doi": "10.1145/2970276.2970334", "arxiv_id": "https://doi.org/10.1145/2970276.2970334", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970334"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970334"}
{"title": "QUICKAR: automatic query reformulation for concept location using crowdsourced knowledge", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Masudur Rahman", "Chanchal K. Roy"], "abstract": "  During maintenance, software developers deal with numerous change requests\nmade by the users of a software system. Studies show that the developers find\nit challenging to select appropriate search terms from a change request during\nconcept location. In this paper, we propose a novel technique--QUICKAR--that\nautomatically suggests helpful reformulations for a given query by leveraging\nthe crowdsourced knowledge from Stack Overflow. It determines semantic\nsimilarity or relevance between any two terms by analyzing their adjacent word\nlists from the programming questions of Stack Overflow, and then suggests\nsemantically relevant queries for concept location. Experiments using 510\nqueries from two software systems suggest that our technique can improve or\npreserve the quality of 76% of the initial queries on average which is\npromising. Comparison with one baseline technique validates our preliminary\nfindings, and also demonstrates the potential of our technique.\n", "doi": "10.1145/2970276.2970362", "arxiv_id": "https://doi.org/10.1145/2970276.2970362", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970362", "https://arxiv.org/pdf/1807.02964"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970362", "journal_ref": "Proc. ASE 2016, pp. 220--225", "categories": "cs.SE", "cited_by": 0}
{"title": "Taming Android fragmentation: characterizing and detecting compatibility issues for Android apps", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lili Wei", "Yepang Liu", "Shing-Chi Cheung"], "abstract": "Android ecosystem is heavily fragmented. The numerous combinations of different device models and operating system versions make it impossible for Android app developers to exhaustively test their apps. As a result, various compatibility issues arise, causing poor user experience. However, little is known on the characteristics of such fragmentation-induced compatibility issues and no mature tools exist to help developers quickly diagnose and fix these issues. To bridge the gap, we conducted an empirical study on 191 real-world compatibility issues collected from popular open-source Android apps. Our study characterized the symptoms and root causes of compatibility issues, and disclosed that the patches of these issues exhibit common patterns. With these findings, we propose a technique named FicFinder to automatically detect compatibility issues in Android apps. FicFinder performs static code analysis based on a model that captures Android APIs as well as their associated context by which compatibility issues are triggered. FicFinder reports actionable debugging information to developers when it detects potential issues. We evaluated FicFinder with 27 large-scale open-source Android apps. The results show that FicFinder can precisely detect compatibility issues in these apps and uncover previously-unknown issues.", "doi": "10.1145/2970276.2970312", "arxiv_id": "https://doi.org/10.1145/2970276.2970312", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970312"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970312"}
{"title": "Automated model-based Android GUI testing using multi-level GUI comparison criteria", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Young Min Baek", "Doo-Hwan Bae"], "abstract": "Automated Graphical User Interface (GUI) testing is one of the most widely used techniques to detect faults in mobile applications (apps) and to test functionality and usability. GUI testing exercises behaviors of an application under test (AUT) by executing events on GUIs and checking whether the app behaves correctly. In particular, because Android leads in market share of mobile OS platforms, a lot of research on automated Android GUI testing techniques has been performed. Among various techniques, we focus on model-based Android GUI testing that utilizes a GUI model for systematic test generation and effective debugging support. Since test inputs are generated based on the underlying model, accurate GUI modeling of an AUT is the most crucial factor in order to generate effective test inputs. However, most modern Android apps contain a number of dynamically constructed GUIs that make accurate behavior modeling more challenging. To address this problem, we propose a set of multi-level GUI Comparison Criteria (GUICC) that provides the selection of multiple abstraction levels for GUI model generation. By using multilevel GUICC, we conducted empirical experiments to identify the influence of GUICC on testing effectiveness. Results show that our approach, which performs model-based testing with multi-level GUICC, achieved higher effectiveness than activity-based GUI model generation. We also found that multi-level GUICC can alleviate the inherent state explosion problems of existing a single-level GUICC for behavior modeling of real-world Android apps by flexibly manipulating GUICC.", "doi": "10.1145/2970276.2970313", "arxiv_id": "https://doi.org/10.1145/2970276.2970313", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970313"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970313"}
{"title": "HybriDroid: static analysis framework for Android hybrid applications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sungho Lee", "Julian Dolby", "Sukyoung Ryu"], "abstract": "Mobile applications (apps) have long invaded the realm of desktop apps, and hybrid apps become a promising solution for supporting multiple mobile platforms. Providing both platform-specific functionalities via native code like native apps and user interactions via JavaScript code like web apps, hybrid apps help developers build multiple apps for different platforms without much duplicated efforts. However, most hybrid apps are developed in multiple programming languages with different semantics, which may be vulnerable to programmer errors. Moreover, because untrusted JavaScript code may access device-specific features via native code, hybrid apps may be vulnerable to various security attacks. Unfortunately, no existing tools can help hybrid app developers by detecting errors or security holes. In this paper, we present HybriDroid, the first static analysis framework for Android hybrid apps. We investigate the semantics of Android hybrid apps especially for the interoperation mechanism of Android Java and JavaScript. Then, we design and implement a static analysis framework that analyzes inter-communication between Android Java and JavaScript. As example analyses supported by HybriDroid, we implement a bug detector that identifies programmer errors due to the hybrid semantics, and a taint analyzer that finds information leaks cross language boundaries. Our empirical evaluation shows that the tools are practically usable in that they found previously uncovered bugs in real-world Android hybrid apps and possible information leaks via a widely-used advertising platform.", "doi": "10.1145/2970276.2970368", "arxiv_id": "https://doi.org/10.1145/2970276.2970368", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970368"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970368"}
{"title": "Locus: locating bugs from software changes", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ming Wen", "Rongxin Wu", "Shing-Chi Cheung"], "abstract": "Various information retrieval (IR) based techniques have been proposed recently to locate bugs automatically at the file level. However, their usefulness is often compromised by the coarse granularity of files and the lack of contextual information. To address this, we propose to locate bugs using software changes, which offer finer granularity than files and provide important contextual clues for bug-fixing. We observe that bug inducing changes can facilitate the bug fixing process. For example, it helps triage the bug fixing task to the developers who committed the bug inducing changes or enables developers to fix bugs by reverting these changes. Our study further identifies that change logs and the naturally small granularity of changes can help boost the performance of IR-based bug localization. Motivated by these observations, we propose an IR-based approach Locus to locate bugs from software changes, and evaluate it on six large open source projects. The results show that Locus outperforms existing techniques at the source file level localization significantly. MAP and MRR in particular have been improved, on average, by 20.1% and 20.5%, respectively. Locus is also capable of locating the inducing changes within top 5 for 41.0% of the bugs. The results show that Locus can significantly reduce the number of lines needing to be scanned to locate the bug compared with existing techniques.", "doi": "10.1145/2970276.2970359", "arxiv_id": "https://doi.org/10.1145/2970276.2970359", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970359"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970359"}
{"title": "Fine-tuning spectrum based fault localisation with frequent method item sets", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gulsher Laghari", "Alessandro Murgia", "Serge Demeyer"], "abstract": "Continuous integration is a best practice adopted in modern software development teams to identify potential faults immediately upon project build. Once a fault is detected it must be repaired immediately, hence continuous integration provides an ideal testbed for experimenting with the state of the art in fault localisation. In this paper we propose a variant of what is known as spectrum based fault localisation, which leverages patterns of method calls by means of frequent itemset mining. We compare our variant (we refer to it as patterned spectrum analysis) against the state of the art and demonstrate on 351 real bugs drawn from five representative open source java projects that patterned spectrum analysis is more effective in localising the fault. Based on anecdotal evidence from this comparison, we suggest avenues for further improvements. Keywords: Automated developer tests; Continuous Integration; Spectrum based fault localisation; Statistical debugging", "doi": "10.1145/2970276.2970308", "arxiv_id": "https://doi.org/10.1145/2970276.2970308", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970308"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970308"}
{"title": "Recommending relevant classes for bug reports using multi-objective search", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rafi Almhana", "Wiem Mkaouer", "Marouane Kessentini", "Ali Ouni"], "abstract": "Developers may follow a tedious process to find the cause of a bug based on code reviews and reproducing the abnormal behavior. In this paper, we propose an automated approach to finding and ranking potential classes with the respect to the probability of containing a bug based on a bug report description. Our approach finds a good balance between minimizing the number of recommended classes and maximizing the relevance of the proposed solution using a multi-objective optimization algorithm. The relevance of the recommended classes (solution) is estimated based on the use of the history of changes and bug-fixing, and the lexical similarity between the bug report description and the API documentation. We evaluated our system on 6 open source Java projects, using the version of the project before fixing the bug of many bug reports. The experimental results show that the search-based approach significantly outperforms three state-of-the-art methods in recommending relevant files for bug reports. In particular, our multi-objective approach is able to successfully locate the true buggy methods within the top 10 recommendations for over 87% of the bug reports.", "doi": "10.1145/2970276.2970344", "arxiv_id": "https://doi.org/10.1145/2970276.2970344", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970344"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970344"}
{"title": "An empirical study on dependence clusters for effort-aware fault-proneness prediction", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yibiao Yang", "Mark Harman", "Jens Krinke", "Syed S. Islam", "David W. Binkley", "Yuming Zhou", "Baowen Xu"], "abstract": "A dependence cluster is a set of mutually inter-dependent program elements. Prior studies have found that large dependence clusters are prevalent in software systems. It has been suggested that dependence clusters have potentially harmful effects on software quality. However, little empirical evidence has been provided to support this claim. The study presented in this paper investigates the relationship between dependence clusters and software quality at the function-level with a focus on effort-aware fault-proneness prediction. The investigation first analyzes whether or not larger dependence clusters tend to be more fault-prone. Second, it investigates whether the proportion of faulty functions inside dependence clusters is significantly different from the proportion of faulty functions outside dependence clusters. Third, it examines whether or not functions inside dependence clusters playing a more important role than others are more fault-prone. Finally, based on two groups of functions (i.e., functions inside and outside dependence clusters), the investigation considers a segmented fault-proneness prediction model. Our experimental results, based on five well-known open-source systems, show that (1) larger dependence clusters tend to be more fault-prone; (2) the proportion of faulty functions inside dependence clusters is significantly larger than the proportion of faulty functions outside dependence clusters; (3) functions inside dependence clusters that play more important roles are more fault-prone; (4) our segmented prediction model can significantly improve the effectiveness of effort-aware fault-proneness prediction in both ranking and classification scenarios. These findings help us better understand how dependence clusters influence software quality.", "doi": "10.1145/2970276.2970353", "arxiv_id": "https://doi.org/10.1145/2970276.2970353", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970353"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970353"}
{"title": "StraightTaint: decoupled offline symbolic taint analysis", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiang Ming", "Dinghao Wu", "Jun Wang", "Gaoyao Xiao", "Peng Liu"], "abstract": "Taint analysis has been widely applied in ex post facto security applications, such as attack provenance investigation, computer forensic analysis, and reverse engineering. Unfortunately, the high runtime overhead imposed by dynamic taint analysis makes it impractical in many scenarios. The key obstacle is the strict coupling of program execution and taint tracking logic code. To alleviate this performance bottleneck, recent work seeks to offload taint analysis from program execution and run it on a spare core or a different CPU. However, since the taint analysis has heavy data and control dependencies on the program execution, the massive data in recording and transformation overshadow the benefit of decoupling. In this paper, we propose a novel technique to allow very lightweight logging, resulting in much lower execution slowdown, while still permitting us to perform full-featured offline taint analysis. We develop StraightTaint, a hybrid taint analysis tool that completely decouples the program execution and taint analysis. StraightTaint relies on very lightweight logging of the execution information to reconstruct a straight-line code, enabling an offline symbolic taint analysis without frequent data communication with the application. While StraightTaint does not log complete runtime or input values, it is able to precisely identify the causal relationships between sources and sinks, for example. Compared with traditional dynamic taint analysis tools, StraightTaint has much lower application runtime overhead.", "doi": "10.1145/2970276.2970299", "arxiv_id": "https://doi.org/10.1145/2970276.2970299", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970299"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970299"}
{"title": "IncA: a DSL for the definition of incremental program analyses", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tamás Szabó", "Sebastian Erdweg", "Markus Voelter"], "abstract": "Program analyses support software developers, for example, through error detection, code-quality assurance, and by enabling compiler optimizations and refactorings. To provide real-time feedback to developers within IDEs, an analysis must run efficiently even if the analyzed code base is large.", "doi": "10.1145/2970276.2970298", "arxiv_id": "https://doi.org/10.1145/2970276.2970298", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970298"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970298"}
{"title": "What developers want and need from program analysis: an empirical study", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Maria Christakis", "Christian Bird"], "abstract": "Program Analysis has been a rich and fruitful field of research for many decades, and countless high quality program analysis tools have been produced by academia. Though there are some well-known examples of tools that have found their way into routine use by practitioners, a common challenge faced by researchers is knowing how to achieve broad and lasting adoption of their tools. In an effort to understand what makes a program analyzer most attractive to developers, we mounted a multi-method investigation at Microsoft. Through interviews and surveys of developers as well as analysis of defect data, we provide insight and answers to four high level research questions that can help researchers design program analyzers meeting the needs of software developers.", "doi": "10.1145/2970276.2970347", "arxiv_id": "https://doi.org/10.1145/2970276.2970347", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970347"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970347"}
{"title": "DistIA: a cost-effective dynamic impact analysis for distributed programs", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haipeng Cai", "Douglas Thain"], "abstract": "Dynamic impact analysis is a fundamental technique for understanding the impact of specific program entities, or changes to them, on the rest of the program for concrete executions. However, existing techniques are either inapplicable or of very limited utility for distributed programs running in multiple concurrent processes. This paper presents DISTIA, a dynamic analysis of distributed systems that predicts impacts propagated both within and across process boundaries by partially ordering distributed method-execution events, inferring causality from the ordered events, and exploiting message-passing semantics. We applied DISTIA to large distributed systems of various architectures and sizes, for which it on average finishes the entire analysis within one minute and safely reduces impact-set sizes by over 43% relative to existing options with run-time overhead less than 8%. Moreover, two case studies initially demonstrated the precision of DISTIA and its utility in distributed system understanding. While conservative thus subject to false positives, DistIA balances precision and efficiency to offer cost-effective options for evolving distributed programs.", "doi": "10.1145/2970276.2970352", "arxiv_id": "https://doi.org/10.1145/2970276.2970352", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970352"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970352"}
{"title": "Radius aware probabilistic testing of deadlocks with guarantees", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yan Cai", "Zijiang Yang"], "abstract": "Concurrency bugs only occur under certain interleaving. Existing randomized techniques are usually ineffective. PCT innovatively generates scheduling, before executing a program, based on priori-ties and priority change points. Hence, it provides a probabilistic guarantee to trigger concurrency bugs. PCT randomly selects prior-ity change points among all events, which might be effective for non-deadlock concurrency bugs. However, deadlocks usually in-volve two or more threads and locks, and require more ordering constraints to be triggered. We interestingly observe that, every two events of a deadlock usually occur within a short range. We gener-ally formulate this range as the bug Radius, to denote the max dis-tance of every two events of a concurrency bug. Based on the bug radius, we propose RPro (Radius aware Probabilistic testing) for triggering deadlocks. Unlike PCT, RPro selects priority change points within the radius of the targeted deadlocks but not among all events. Hence, it guarantees larger probabilities to trigger dead-locks. We have implemented RPro and PCT and evaluated them on a set of real-world benchmarks containing 10 unique deadlocks. The experimental results show that RPro triggered all deadlocks with higher probabilities (i.e., >7.7x times larger on average) than that by PCT. We also evaluated RPro with radius varying from 1 to 150 (or 300). The result shows that the radius of a deadlock is much smaller (i.e., from 2 to 114 in our experiment) than the num-ber of all events. This further confirms our observation and makes RPro meaningful in practice.", "doi": "10.1145/2970276.2970307", "arxiv_id": "https://doi.org/10.1145/2970276.2970307", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970307"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970307"}
{"title": "LockPeeker: detecting latent locks in Java APIs", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ziyi Lin", "Hao Zhong", "Yuting Chen", "Jianjun Zhao"], "abstract": "Detecting lock-related defects has long been a hot research topic in software engineering. Many efforts have been spent on detecting such deadlocks in concurrent software systems. However, latent locks may be hidden in application programming interface (API) methods whose source code may not be accessible to developers. Many APIs have latent locks. For example, our study has shown that J2SE alone can have 2,000+ latent locks. As latent locks are less known by developers, they can cause deadlocks that are hard to perceive or diagnose. Meanwhile, the state-of-the-art tools mostly handle API methods as black boxes, and cannot detect deadlocks that involve such latent locks. In this paper, we propose a novel black-box testing approach, called LockPeeker, that reveals latent locks in Java APIs. The essential idea of LockPeeker is that latent locks of a given API method can be revealed by testing the method and summarizing the locking effects during testing execution. We have evaluated LockPeeker on ten real-world Java projects. Our evaluation results show that (1) LockPeeker detects 74.9% of latent locks in API methods, and (2) it enables state-of-the-art tools to detect deadlocks that otherwise cannot be detected.", "doi": "10.1145/2970276.2970355", "arxiv_id": "https://doi.org/10.1145/2970276.2970355", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970355"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970355"}
{"title": "Sound static deadlock analysis for C/Pthreads", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniel Kroening", "Daniel Poetzl", "Peter Schrammel", "Björn Wachter"], "abstract": "We present a static deadlock analysis for C/Pthreads. The design of our method has been guided by the requirement to analyse real-world code. Our approach is sound (i.e., misses no deadlocks) for programs that have defined behaviour according to the C standard and the Pthreads specification, and is precise enough to prove deadlock-freedom for a large number of such programs. The method consists of a pipeline of several analyses that build on a new context- and thread-sensitive abstract interpretation framework. We further present a lightweight dependency analysis to identify statements relevant to deadlock analysis and thus speed up the overall analysis. In our experimental evaluation, we succeeded to prove deadlock-freedom for 292 programs from the Debian GNU/Linux distribution with in total 2.3 MLOC in 4 hours.", "doi": "10.1145/2970276.2970309", "arxiv_id": "https://doi.org/10.1145/2970276.2970309", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970309"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970309"}
{"title": "Static race detection for device drivers: the Goblint approach", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vesal Vojdani", "Kalmer Apinis", "Vootele Rõtov", "Helmut Seidl", "Varmo Vene", "Ralf Vogler"], "abstract": "Device drivers rely on fine-grained locking to ensure safe access to shared data structures. For human testers, concurrency makes such code notoriously hard to debug; for automated reasoning, dynamically allocated memory and low-level pointer manipulation poses significant challenges. We present a flexible approach to data race analysis, implemented in the open source Goblint static analysis framework, that combines different pointer and value analyses in order to handle a wide range of locking idioms, including locks allocated dynamically as well as locks stored in arrays. To the best of our knowledge, this is the most ambitious effort, having lasted well over ten years, to create a fully automated static race detection tool that can deal with most of the intricate locking schemes found in Linux device drivers. Our evaluation shows that these analyses are sufficiently precise, but practical use of these techniques requires inferring environmental and domain-specific assumptions.", "doi": "10.1145/2970276.2970337", "arxiv_id": "https://doi.org/10.1145/2970276.2970337", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970337"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970337"}
{"title": "An empirical evaluation of two user interfaces of an interactive program verifier", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Hentschel", "Reiner Hähnle", "Richard Bubel"], "abstract": "Theorem provers have highly complex interfaces, but there are not many systematic studies of their usability and effectiveness. Specifically, for interactive theorem provers the ability to quickly comprehend intermediate proof situations is of pivotal importance. In this paper we present the (as far as we know) first empirical study that systematically compares the effectiveness of different user interfaces of an interactive theorem prover. We juxtapose two different user interfaces of the interactive verifier KeY: the traditional one which focuses on proof objects and a more recent one that provides a view akin to an interactive debugger. We carefully designed a controlled experiment where users were given various proof understanding tasks that had to be solved with alternating interfaces. We provide statistical evidence that the conjectured higher effectivity of the debugger-like interface is not just a hunch.", "doi": "10.1145/2970276.2970303", "arxiv_id": "https://doi.org/10.1145/2970276.2970303", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970303"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970303"}
{"title": "Traceability maintenance: factors and guidelines", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Salome Maro", "Anthony Anjorin", "Rebekka Wohlrab", "Jan-Philipp Steghöfer"], "abstract": "Traceability is an important concern for numerous software engineering activities. Establishing traceability links is a challenging and cost-intensive task, which is uneconomical without suitable strategies for maintaining high link quality. Current approaches to Traceability Management (TM), however, often make important assumptions and choices without ensuring that the consequences and implications for traceability maintenance are feasible and desirable in practice.", "doi": "10.1145/2970276.2970314", "arxiv_id": "https://doi.org/10.1145/2970276.2970314", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970314"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970314"}
{"title": "Usage, costs, and benefits of continuous integration in open-source projects", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michael Hilton", "Timothy Tunnell", "Kai Huang", "Darko Marinov", "Danny Dig"], "abstract": "Continuous integration (CI) systems automate the compilation, building, and testing of software. Despite CI rising as a big success story in automated software engineering, it has received almost no attention from the research community. For example, how widely is CI used in practice, and what are some costs and benefits associated with CI? Without answering such questions, developers, tool builders, and researchers make decisions based on folklore instead of data. In this paper, we use three complementary methods to study the usage of CI in open-source projects. To understand which CI systems developers use, we analyzed 34,544 open-source projects from GitHub. To understand how developers use CI, we analyzed 1,529,291 builds from the most commonly used CI system. To understand why projects use or do not use CI, we surveyed 442 developers. With this data, we answered several key questions related to the usage, costs, and benefits of CI. Among our results, we show evidence that supports the claim that CI helps projects release more often, that CI is widely adopted by the most popular projects, as well as finding that the overall percentage of projects using CI continues to grow, making it important and timely to focus more research on CI.", "doi": "10.1145/2970276.2970358", "arxiv_id": "https://doi.org/10.1145/2970276.2970358", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970358"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970358"}
{"title": "DSL-maps: from requirements to design of domain-specific languages", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ana Pescador", "Juan de Lara"], "abstract": "Domain-Specific Languages (DSLs) are central to Model-Driven Engineering, where they are used for creating models for particular domains. However, current research and tools for building DSLs focus on the design and implementation aspects of the DSL, while the requirements analysis phase, and its automated transition to design is largely neglected.", "doi": "10.1145/2970276.2970328", "arxiv_id": "https://doi.org/10.1145/2970276.2970328", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970328"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970328"}
{"title": "The IDE as a scriptable information system", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dimitar Asenov", "Peter Müller", "Lukas Vogel"], "abstract": "Software engineering is extremely information-intensive. Every day developers work with source code, version repositories, issue trackers, documentation, web-based and other information resources. However, three key aspects of information work lack good support: (i) combining information from different sources; (ii) flexibly presenting collected information to enable easier comprehension; and (iii) automatically acting on collected information, for example to perform a refactoring. Poor support for these activities makes many common development tasks time-consuming and error-prone. We propose an approach that directly addresses these three issues by integrating a flexible query mechanism into the development environment. Our approach enables diverse ways to process and visualize information and can be extended via scripts. We demonstrate how an implementation of the approach can be used to rapidly write queries that meet a wide range of information needs.", "doi": "10.1145/2970276.2970329", "arxiv_id": "https://doi.org/10.1145/2970276.2970329", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970329"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970329"}
{"title": "Inferring annotations for device drivers from verification histories", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zvonimir Pavlinovic", "Akash Lal", "Rahul Sharma"], "abstract": "This paper studies and optimizes automated program verification. Detailed reasoning about software behavior is often facilitated by program invariants that hold across all program executions. Finding program invariants is in fact an essential step in automated program verification. Automatic discovery of precise invariants, however, can be very difficult in practice. The problem can be simplified if one has access to a candidate set of assertions (or annotations) and the search for invariants is limited over the space defined by these annotations. Then, the main challenge is to automatically generate quality program annotations. We present an approach that infers program annotations automatically by leveraging the history of verifying related programs. Our algorithm extracts high-quality annotations from previous verification attempts, and then applies them for verifying new programs. We present a case study where we applied our algorithm to Microsoft's Static Driver Verifier (SDV). SDV is an industrial-strength tool for verification of Windows device drivers that uses manually-tuned heuristics for obtaining a set of annotations. Our technique inferred program annotations comparable in performance to the existing annotations used in SDV that were devised manually by human experts over years. Additionally, the inferred annotations together with the existing ones improved the performance of SDV overall, proving correct 47% of drivers more while running 22% faster in our experiments.", "doi": "10.1145/2970276.2970305", "arxiv_id": "https://doi.org/10.1145/2970276.2970305", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970305"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970305"}
{"title": "Array length inference for C library bindings", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alisa J. Maas", "Henrique Nazaré", "Ben Liblit"], "abstract": "Simultaneous use of multiple programming languages (polyglot programming) assists in creating efficient, coherent, modern programs in the face of legacy code. However, manually creating bindings to low-level languages like C is tedious and error-prone. We offer relief in the form of an automated suite of analyses, designed to enhance the quality of automatically produced bindings. These analyses recover high-level array length information that is missing from C’s type system. We emit annotations in the style of GObject-Introspection, which produces bindings from annotations on function signatures. We annotate each array argument as terminated by a special sentinel value, fixed-length, or of length determined by another argument. These properties help produce more idiomatic, efficient bindings. We correctly annotate at least 70% of all arrays with these length types, and our results are comparable to those produced by human annotators, but take far less time to produce.", "doi": "10.1145/2970276.2970310", "arxiv_id": "https://doi.org/10.1145/2970276.2970310", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970310"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970310"}
{"title": "APEx: automated inference of error specifications for C APIs", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuan Jochen Kang", "Baishakhi Ray", "Suman Jana"], "abstract": "Although correct error handling is crucial to software robustness and security, developers often inadvertently introduce bugs in error handling code. Moreover, such bugs are hard to detect using existing bug-finding tools without correct error specifications. Creating error specifications manually is tedious and error-prone. In this paper, we present a new technique that automatically infers error specifications of API functions based on their usage patterns in C programs. Our key insight is that error-handling code tend to have fewer branching points and program statements than the code implementing regular functionality. Our scheme leverages this property to automatically identify error handling code at API call sites and infer the corresponding error constraints. We then use the error constraints from multiple call sites for robust inference of API error specifications. We evaluated our technique on 217 API functions from 6 different libraries across 28 projects written in C and found that it can identify error-handling paths with an average precision of 94% and recall of 66%. We also found that our technique can infer correct API error specifications with an average precision of 77% and recall of 47%. To further demonstrate the usefulness of the inferred error specifications, we used them to find 118 previously unknown potential bugs (including several security flaws that are currently being fixed by the corresponding developers) in the 28 tested projects.", "doi": "10.1145/2970276.2970354", "arxiv_id": "https://doi.org/10.1145/2970276.2970354", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970354"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970354"}
{"title": "On essential configuration complexity: measuring interactions in highly-configurable systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jens Meinicke", "Chu-Pan Wong", "Christian Kästner", "Thomas Thüm", "Gunter Saake"], "abstract": "Quality assurance for highly-configurable systems is challenging due to the exponentially growing configuration space. Interactions among multiple options can lead to surprising behaviors, bugs, and security vulnerabilities. Analyzing all configurations systematically might be possible though if most options do not interact or interactions follow specific patterns that can be exploited by analysis tools. To better understand interactions in practice, we analyze program traces to characterize and identify where interactions occur on control flow and data. To this end, we developed a dynamic analysis for Java based on variability-aware execution and monitor executions of multiple small to medium-sized programs. We find that the essential configuration complexity of these programs is indeed much lower than the combinatorial explosion of the configuration space indicates. However, we also discover that the interaction characteristics that allow scalable and complete analyses are more nuanced than what is exploited by existing state-of-the-art quality assurance strategies.", "doi": "10.1145/2970276.2970322", "arxiv_id": "https://doi.org/10.1145/2970276.2970322", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970322"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970322"}
{"title": "Precise semantic history slicing through dynamic delta refinement", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yi Li", "Chenguang Zhu", "Julia Rubin", "Marsha Chechik"], "abstract": "Semantic history slicing solves the problem of extracting changes related to a particular high-level functionality from the software version histories. State-of-the-art techniques combine static program analysis and dynamic execution tracing to infer an over-approximated set of changes that can preserve the functional behaviors captured by a test suite. However, due to the conservative nature of such techniques, the sliced histories may contain irrelevant changes. In this paper, we propose a divide-and-conquer-style partitioning approach enhanced by dynamic delta refinement to produce minimal semantic history slices. We utilize deltas in dynamic invariants generated from successive test executions to learn significance of changes with respect to the target functionality. Empirical results indicate that these measurements accurately rank changes according to their relevance to the desired test behaviors and thus partition history slices in an efficient and effective manner.", "doi": "10.1145/2970276.2970336", "arxiv_id": "https://doi.org/10.1145/2970276.2970336", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970336"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970336"}
{"title": "Goal-conflict detection based on temporal satisfiability checking", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Renzo Degiovanni", "Nicolás Ricci", "Dalal Alrajeh", "Pablo F. Castro", "Nazareno Aguirre"], "abstract": "Goal-oriented requirements engineering approaches propose capturing how a system should behave through the specification of high-level goals, from which requirements can then be systematically derived. Goals may however admit subtle situations that make them diverge, i.e., not be satisfiable as a whole under specific circumstances feasible within the domain, called boundary conditions. While previous work allows one to identify boundary conditions for conflicting goals written in LTL, it does so through a pattern-based approach, that supports a limited set of patterns, and only produces pre-determined formulations of boundary conditions.", "doi": "10.1145/2970276.2970349", "arxiv_id": "https://doi.org/10.1145/2970276.2970349", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970349"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970349"}
{"title": "Symbolic execution of stored procedures in database management systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Muhammad Suleman Mahmood", "Maryam Abdul Ghafoor", "Junaid Haroon Siddiqui"], "abstract": "Stored procedures in database management systems are often used to implement complex business logic. Correctness of these procedures is critical for correct working of the system. However, testing them remains difficult due to many possible states of data and database constraints. This leads to mostly manual testing. Newer tools offer automated execution for unit testing of stored procedures but the test cases are still written manually.", "doi": "10.1145/2970276.2970318", "arxiv_id": "https://doi.org/10.1145/2970276.2970318", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970318"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970318"}
{"title": "Conc-iSE: incremental symbolic execution of concurrent software", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shengjian Guo", "Markus Kusano", "Chao Wang"], "abstract": "Software updates often introduce new bugs to existing code bases. Prior regression testing tools focus mainly on test case selection and prioritization whereas symbolic execution tools only handle code changes in sequential software. In this paper, we propose the first incremental symbolic execution method for concurrent software to generate new tests by exploring only the executions affected by code changes between two program versions. Specifically, we develop an inter-thread and inter-procedural change-impact analysis to check if a statement is affected by the changes and then leverage the information to choose executions that need to be reexplored. We also check if execution summaries computed in the previous program can be used to avoid redundant explorations in the new program. We have implemented our method in an incremental symbolic execution tool called Conc-iSE and evaluated it on a large set of multithreaded C programs. Our experiments show that the new method can significantly reduce the overall symbolic execution time when compared with state-of-the-art symbolic execution tools such as KLEE.", "doi": "10.1145/2970276.2970332", "arxiv_id": "https://doi.org/10.1145/2970276.2970332", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970332"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970332"}
{"title": "Model-based whitebox fuzzing for program binaries", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Van-Thuan Pham", "Marcel Böhme", "Abhik Roychoudhury"], "abstract": "Many real-world programs take highly structured and very complex inputs. The automated testing of such programs is non-trivial. If the test input does not adhere to a specific file format, the program returns a parser error. For symbolic execution-based whitebox fuzzing the corresponding error handling code becomes a significant time sink. Too much time is spent in the parser exploring too many paths leading to trivial parser errors. Naturally, the time is better spent exploring the functional part of the program where failure with valid input exposes deep and real bugs in the program. In this paper, we suggest to leverage information about the file format and the data chunks of existing, valid files to swiftly carry the exploration beyond the parser code. We call our approach Model-based Whitebox Fuzzing (MoWF) because the file format input model of blackbox fuzzers can be exploited as a constraint on the vast input space to rule out most invalid inputs during path exploration in symbolic execution. We evaluate on 13 vulnerabilities in 8 large program binaries with 6 separate file formats and found that MoWF exposes all vulnerabilities while both, traditional whitebox fuzzing and model-based blackbox fuzzing, expose only less than half, respectively. Our experiments also demonstrate that MoWF exposes 70% vulnerabilities without any seed inputs.", "doi": "10.1145/2970276.2970316", "arxiv_id": "https://doi.org/10.1145/2970276.2970316", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970316"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970316"}
{"title": "Symbolic execution of complex program driven by machine learning based constraint solving", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xin Li", "Yongjuan Liang", "Hong Qian", "Yi-Qi Hu", "Lei Bu", "Yang Yu", "Xin Chen", "Xuandong Li"], "abstract": "Symbolic execution is a widely-used program analysis technique. It collects and solves path conditions to guide the program traversing. However, due to the limitation of the current constraint solvers, it is difficult to apply symbolic execution on programs with complex path conditions, like nonlinear constraints and function calls. In this paper, we propose a new symbolic execution tool MLB to handle such problem. Instead of relying on the classical constraint solving, in MLB, the feasibility problems of the path conditions are transformed into optimization problems, by minimizing some dissatisfaction degree. The optimization problems are then handled by the underlying optimization solver through machine learning guided sampling and validation. MLB is implemented on the basis of Symbolic PathFinder and encodes not only the simple linear path conditions, but also nonlinear arithmetic operations, and even black-box function calls of library methods, into symbolic path conditions. Experiment results show that MLB can achieve much better coverage on complex real-world programs.", "doi": "10.1145/2970276.2970364", "arxiv_id": "https://doi.org/10.1145/2970276.2970364", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970364"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970364"}
{"title": "Towards bounded model checking using nonlinear programming solver", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Masataka Nishi"], "abstract": "Due to their complexity, currently available bounded model checking techniques based on Boolean Satisfiability and Satisfiability Modulo Theories inadequately handle non-linear floating-point and integer arithmetic. Using a numerical approach, we reduce a bounded model checking problem to a constraint satisfaction problem. Currently available techniques attempt to solve the constraint problem but can guarantee neither global convergence nor correctness. Using the IPOPT and ANTIGONE non-linear programming (NLP) solvers, we transform the original constraint satisfaction problem from one having disjunctions of constraints into one having conjunctions of constraints with a few introduced auxiliary variables. The transformation lowers the computing cost and preserves the Boolean structure of the original problem while complying with limits of NLP solvers.", "doi": "10.1145/2970276.2970319", "arxiv_id": "https://doi.org/10.1145/2970276.2970319", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970319"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970319"}
{"title": "Identifying domain elements from textual specifications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jitendra Singh Thakur", "Atul Gupta"], "abstract": "Analysis modeling refers to the task of identifying domain objects, their attributes and operations, and the relationships between these objects from software requirements specifications which are usually written in some natural language. There have been a few efforts to automate this task, but they seem to be largely constrained by the language related issues as well as the lack of a systematic transformation process. In this paper, we propose a systematic, automated transformation approach which first interprets the specification sentences based on the Hornby's verb patterns, and then uses semantic relationships between the words in the sentences, obtained from Type Dependencies using Stanford NL Parser, to identify the domain elements from them. With the help of a controlled experiment, we show that the analysis class diagrams generated by the proposed approach are far more correct, far more complete and less redundant than those generated by the exiting automated approaches.", "doi": "10.1145/2970276.2970323", "arxiv_id": "https://doi.org/10.1145/2970276.2970323", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970323"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970323"}
{"title": "Continuous detection of design flaws in evolving object-oriented programs using incremental multi-pattern matching", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sven Peldszus", "Géza Kulcsár", "Malte Lochau", "Sandro Schulze"], "abstract": "Design flaws in object-oriented programs may seriously corrupt code quality thus increasing the risk for introducing subtle errors during software maintenance and evolution. Most recent approaches identify design flaws in an ad-hoc manner, either focusing on software metrics, locally restricted code smells, or on coarse-grained architectural anti-patterns. In this paper, we utilize an abstract program model capturing high-level object-oriented code entities, further augmented with qualitative and quantitative design-related information such as coupling/cohesion. Based on this model, we propose a comprehensive methodology for specifying object-oriented design flaws by means of compound rules integrating code metrics, code smells and anti-patterns in a modular way. This approach allows for efficient, automated design-flaw detection through incremental multi-pattern matching, by facilitating systematic information reuse among multiple detection rules as well as between subsequent detection runs on continuously evolving programs. Our tool implementation comprises well-known anti-patterns for Java programs. The results of our experimental evaluation show high detection precision, scalability to real-size programs, as well as a remarkable gain in efficiency due to information reuse.", "doi": "10.1145/2970276.2970338", "arxiv_id": "https://doi.org/10.1145/2970276.2970338", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970338"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970338"}
{"title": "Efficient detection of inconsistencies in a multi-developer engineering environment", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andreas Demuth", "Markus Riedl-Ehrenleitner", "Alexander Egyed"], "abstract": "Software developers work concurrently on different kinds of development artifacts such as requirements, architecture, design, or source code. To keep these development artifacts consistent, developers have a wide range of consistency checking approaches available. However, most existing consistency checkers work best in context of single tools and they are not well suited when development artifacts are distributed among different tools and are being modified concurrently by many developers.", "doi": "10.1145/2970276.2970304", "arxiv_id": "https://doi.org/10.1145/2970276.2970304", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970304"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970304"}
{"title": "How good are the specs? a study of the bug-finding effectiveness of existing Java API specifications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Owolabi Legunsen", "Wajih Ul Hassan", "Xinyue Xu", "Grigore Rosu", "Darko Marinov"], "abstract": "Runtime verification can be used to find bugs early, during software development, by monitoring test executions against formal specifications (specs). The quality of runtime verification depends on the quality of the specs. While previous research has produced many specs for the Java API, manually or through automatic mining, there has been no large-scale study of their bug-finding effectiveness. We present the first in-depth study of the bug-finding effectiveness of previously proposed specs. We used JavaMOP to monitor 182 manually written and 17 automatically mined specs against more than 18K manually written and 2.1M automatically generated tests in 200 open-source projects. The average runtime overhead was under 4.3x. We inspected 652 violations of manually written specs and (randomly sampled) 200 violations of automatically mined specs. We reported 95 bugs, out of which developers already fixed 74. However, most violations, 82.81% of 652 and 97.89% of 200, were false alarms. Our empirical results show that (1) runtime verification technology has matured enough to incur tolerable runtime overhead during testing, and (2) the existing API specifications can find many bugs that developers are willing to fix; however, (3) the false alarm rates are worrisome and suggest that substantial effort needs to be spent on engineering better specs and properly evaluating their effectiveness.", "doi": "10.1145/2970276.2970356", "arxiv_id": "https://doi.org/10.1145/2970276.2970356", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970356"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970356"}
{"title": "Greedy combinatorial test case generation using unsatisfiable cores", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Akihisa Yamada", "Armin Biere", "Cyrille Artho", "Takashi Kitamura", "Eun-Hye Choi"], "abstract": "Combinatorial testing aims at covering the interactions of parameters in a system under test, while some combinations may be forbidden by given constraints (forbidden tuples). In this paper, we illustrate that such forbidden tuples correspond to unsatisfiable cores, a widely understood notion in the SAT solving community. Based on this observation, we propose a technique to detect forbidden tuples lazily during a greedy test case generation, which significantly reduces the number of required SAT solving calls. We further reduce the amount of time spent in SAT solving by essentially ignoring constraints while constructing each test case, but then “amending” it to obtain a test case that satisfies the constraints, again using unsatisfiable cores. Finally, to complement a disturbance due to ignoring constraints, we implement an efficient approximative SAT checking function in the SAT solver Lingeling. Through experiments we verify that our approach significantly improves the efficiency of constraint handling in our greedy combinatorial testing algorithm.", "doi": "10.1145/2970276.2970335", "arxiv_id": "https://doi.org/10.1145/2970276.2970335", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970335"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970335"}
{"title": "Towards automatically generating descriptive names for unit tests", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Benwen Zhang", "Emily Hill", "James Clause"], "abstract": "During maintenance, developers often need to understand the purpose of a test. One of the most potentially useful sources of information for understanding a test is its name. Ideally, test names are descriptive in that they accurately summarize both the scenario and the expected outcome of the test. Despite the benefits of being descriptive, test names often fall short of this goal. In this paper we present a new approach for automatically generating descriptive names for existing test bodies. Using a combination of natural-language program analysis and text generation, the technique creates names that summarize the test's scenario and the expected outcome. The results of our evaluation show that, (1) compared to alternative approaches, the names generated by our technique are significantly more similar to human-generated names and are nearly always preferred by developers, (2) the names generated by our technique are preferred over or are equivalent to the original test names in 83% of cases, and (3) our technique is several orders of magnitude faster than manually writing test names.", "doi": "10.1145/2970276.2970342", "arxiv_id": "https://doi.org/10.1145/2970276.2970342", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970342"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970342"}
{"title": "Applying combinatorial test data generation to big data applications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nan Li", "Yu Lei", "Haider Riaz Khan", "Jingshu Liu", "Yun Guo"], "abstract": "Big data applications (e.g., Extract, Transform, and Load (ETL) applications) are designed to handle great volumes of data. However, processing such great volumes of data is time-consuming. There is a need to construct small yet effective test data sets during agile development of big data applications. In this paper, we apply a combinatorial test data generation approach to two real-world ETL applications at Medidata. In our approach, we first create Input Domain Models (IDMs) automatically by analyzing the original data source and incorporating constraints manually derived from requirements. Next, the IDMs are used to create test data sets that achieve t-way coverage, which has shown to be very effective in detecting software faults. The generated test data sets also satisfy all the constraints identified in the first step. To avoid creating IDMs from scratch when there is a change to the original data source or constraints, our approach extends the original IDMs with additional information. The new IDMs, which we refer to as Adaptive IDMs (AIDMs), are updated by comparing the changes against the additional information, and are then used to generate new test data sets. We implement our approach in a tool, called comBinatorial big daTa Test dAta Generator (BIT-TAG). Our experience shows that combinatorial testing can be effectively applied to big data applications. In particular, the test data sets created using our approach for the two ETL applications are only a small fraction of the original data source, but we were able to detect all the faults found with the original data source.", "doi": "10.1145/2970276.2970325", "arxiv_id": "https://doi.org/10.1145/2970276.2970325", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970325"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970325"}
{"title": "Generating test cases to expose concurrency bugs in Android applications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hongyin Tang", "Guoquan Wu", "Jun Wei", "Hua Zhong"], "abstract": "Mobile systems usually support an event-based model of concurrent programming. This model, although advantageous to maintain responsive user interfaces, may lead to subtle concurrency errors due to unforeseen threads interleaving coupled with non-deterministic reordering of asynchronous events. These bugs are very difficult to reproduce even by the same user action sequences that trigger them, due to the undetermined schedules of underlying events and threads. In this paper, we proposed RacerDroid, a novel technique that aims to expose concurrency bugs in android applications by actively controlling event schedule and thread interleaving, given the test cases that have potential data races. By exploring the state model of the application constructed dynamically, our technique starts first to generate a test case that has potential data races based on the results obtained from existing static or dynamic race detection technique. Then it reschedules test cases execution by actively controlling event dispatching and thread interleaving to determine whether such potential races really lead to thrown exceptions or assertion violations. Our preliminary experiments show that RacerDroid is effective, and it confirms real data races, while at the same time eliminates false warnings for Android apps found in the wild.", "doi": "10.1145/2970276.2970320", "arxiv_id": "https://doi.org/10.1145/2970276.2970320", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970320"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970320"}
{"title": "Automatic test image generation using procedural noise", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Matthew Patrick", "Matthew D. Castle", "Richard O. J. H. Stutt", "Christopher A. Gilligan"], "abstract": "It is difficult to test programs that input images, due to the large number of (pixel) values that must be chosen and the complex ways these values interact. Typically, such programs are tested manually, using images that have known results. However, this is a laborious process and limited in the range of tests that can be applied. We introduce a new approach for testing programs that input images automatically, using procedural noise and spatial statistics to create inputs that are both realistic and can easily be tuned to have specific properties. The effectiveness of our approach is illustrated on an epidemiological simulation of a recently introduced tree pest in Great Britain: Oriental Chestnut Gall Wasp. Our approach produces images that match the real landscapes more closely than other techniques and can be used (alongside metamorphic relations) to detect smaller (artificially introduced) errors with greater accuracy.", "doi": "10.1145/2970276.2970333", "arxiv_id": "https://doi.org/10.1145/2970276.2970333", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970333"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970333"}
{"title": "Move-optimized source code tree differencing", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Georg Dotzler", "Michael Philippsen"], "abstract": "When it is necessary to express changes between two source code files as a list of edit actions (an edit script), modern tree differencing algorithms are superior to most text-based approaches because they take code movements into account and express source code changes more accurately. We present 5 general optimizations that can be added to state-of-the-art tree differencing algorithms to shorten the resulting edit scripts. Applied to Gumtree, RTED, JSync, and ChangeDistiller, they lead to shorter scripts for 18-98% of the changes in the histories of 9 open-source software repositories. These optimizations also are parts of our novel Move-optimized Tree DIFFerencing algorithm (MTDIFF) that has a higher accuracy in detecting moved code parts. MTDIFF (which is based on the ideas of ChangeDistiller) further shortens the edit script for another 20% of the changes in the repositories. MTDIFF and all the benchmarks are available under an open-source license.", "doi": "10.1145/2970276.2970315", "arxiv_id": "https://doi.org/10.1145/2970276.2970315", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970315"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970315"}
{"title": "Migrating cascading style sheets to preprocessors by introducing mixins", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Davood Mazinanian", "Nikolaos Tsantalis"], "abstract": "Cascading Style Sheets (CSS) is the standard language for styling web documents and is extensively used in the industry. However, CSS lacks constructs that would allow code reuse (e.g., functions). Consequently, maintaining CSS code is often a cumbersome and error-prone task. Preprocessors (e.g., Less and Sass) have been introduced to fill this gap, by extending CSS with the missing constructs. Despite the clear maintainability benefits coming from the use of preprocessors, there is currently no support for migrating legacy CSS code to preprocessors. In this paper, we propose a technique for automatically detecting duplicated style declarations in CSS code that can be migrated to preprocessor functions (i.e., mixins). Our technique can parameterize differences in the style values of duplicated declarations, and ensure that the migration will not change the presentation semantics of the web documents. The evaluation has shown that our technique is able to detect 98% of the mixins that professional developers introduced in websites and Style Sheet libraries, and can safely migrate real CSS code.", "doi": "10.1145/2970276.2970348", "arxiv_id": "https://doi.org/10.1145/2970276.2970348", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970348"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970348"}
{"title": "Automatic runtime recovery via error handler synthesis", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tianxiao Gu", "Chengnian Sun", "Xiaoxing Ma", "Jian Lü", "Zhendong Su"], "abstract": "Software systems are often subject to unexpected runtime errors. Automatic runtime recovery (ARR) techniques aim at recovering them from erroneous states and maintaining them functional in the field. This paper proposes Ares , a novel, practical approach to performing ARR. Our key insight is to leverage a system's already built-in error handling support to recover from unexpected errors. To this end, we synthesize error handlers via two methods: error transformation and early return. We also equip Ares with a lightweight in-vivo testing infrastructure to select the right synthesis methods and avoid potentially dangerous error handlers. Unlike existing ARR techniques based on heavyweight mechanisms (e.g., checkpoint-restart and runtime monitoring), our approach expands the intrinsic capability of runtime error resilience already existing in software systems to handle unexpected errors. Ares's lightweight mechanism makes it practical and easy to be integrated into production environments. We have implemented Ares on top of both the Java HotSpot VM and Android ART, and applied it to 52 real-world bugs. The results are promising — Ares successfully recovers from 39 of them and incurs low overhead.", "doi": "10.1145/2970276.2970360", "arxiv_id": "https://doi.org/10.1145/2970276.2970360", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970360"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970360"}
{"title": "Mining revision histories to detect cross-language clones without intermediates", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiao Cheng", "Zhiming Peng", "Lingxiao Jiang", "Hao Zhong", "Haibo Yu", "Jianjun Zhao"], "abstract": "To attract more users on different platforms, many projects release their versions in multiple programming languages (e.g., Java and C#). They typically have many code snippets that implement similar functionalities, i.e., cross-language clones. Programmers often need to track and modify cross-language clones consistently to maintain similar functionalities across different language implementations. In literature, researchers have proposed approaches to detect cross- language clones, mostly for languages that share a common intermediate language (such as the .NET language family) so that techniques for detecting single-language clones can be applied. As a result, those approaches cannot detect cross-language clones for many projects that are not implemented in a .NET language. To overcome the limitation, in this paper, we propose a novel approach, CLCMiner, that detects cross-language clones automatically without the need of an intermediate language. Our approach mines such clones from revision histories, which reflect how programmers maintain cross-language clones in practice. We have implemented a prototype tool for our approach and conducted an evaluation on five open source projects that have versions in Java and C#. The results show that CLCMiner achieves high accuracy and point to promising future work.", "doi": "10.1145/2970276.2970363", "arxiv_id": "https://doi.org/10.1145/2970276.2970363", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970363"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970363"}
{"title": "Battery-aware transformations in mobile applications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jürgen Cito", "Julia Rubin", "Phillip Stanley-Marbell", "Martin C. Rinard"], "abstract": "We present an adaptive binary transformation system for reducing the energy impact of advertisements and analytics in mobile applications. Our approach accommodates both the needs of mobile app developers to obtain income from advertisements and the desire of mobile device users for longer battery life. Our technique automatically identifies recurrent advertisement and analytics requests and throttles these requests based on a mobile device's battery status. Of the Android applications we analyzed, 75% have at least one connection that exhibits such recurrent requests. Our automated detection scheme classifies these requests with 100% precision and 80.5% recall. Applying the proposed battery-aware transformations to a representative mobile application reduces the power consumption of the mobile device by 5.8%, without the negative effect of completely removing advertisements.", "doi": "10.1145/2970276.2970324", "arxiv_id": "https://doi.org/10.1145/2970276.2970324", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970324"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970324"}
{"title": "Bugram: bug detection with n-gram language models", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Song Wang", "Devin Chollak", "Dana Movshovitz-Attias", "Lin Tan"], "abstract": "To improve software reliability, many rule-based techniques have been proposed to infer programming rules and detect violations of these rules as bugs. These rule-based approaches often rely on the highly frequent appearances of certain patterns in a project to infer rules. It is known that if a pattern does not appear frequently enough, rules are not learned, thus missing many bugs.", "doi": "10.1145/2970276.2970341", "arxiv_id": "https://doi.org/10.1145/2970276.2970341", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970341"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970341"}
{"title": "Mining input grammars from dynamic taints", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Matthias Höschele", "Andreas Zeller"], "abstract": "Knowing which part of a program processes which parts of an input can reveal the structure of the input as well as the structure of the program. In a URL http://www.example.com/path/, for instance, the protocol http, the host www.example.com, and the path path would be handled by different functions and stored in different variables. Given a set of sample inputs, we use dynamic tainting to trace the data flow of each input character, and aggregate those input fragments that would be handled by the same function into lexical and syntactical entities. The result is a context-free grammar that reflects valid input structure. In its evaluation, our AUTOGRAM prototype automatically produced readable and structurally accurate grammars for inputs like URLs, spreadsheets or configuration files. The resulting grammars not only allow simple reverse engineering of input formats, but can also directly serve as input for test generators.", "doi": "10.1145/2970276.2970321", "arxiv_id": "https://doi.org/10.1145/2970276.2970321", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970321"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970321"}
{"title": "Phrase-based extraction of user opinions in mobile app reviews", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Phong Minh Vu", "Hung Viet Pham", "Tam The Nguyen", "Tung Thanh Nguyen"], "abstract": "Mobile app reviews often contain useful user opinions like bug reports or suggestions. However, looking for those opinions manually in thousands of reviews is inefective and time- consuming. In this paper, we propose PUMA, an automated, phrase-based approach to extract user opinions in app reviews. Our approach includes a technique to extract phrases in reviews using part-of-speech (PoS) templates; a technique to cluster phrases having similar meanings (each cluster is considered as a major user opinion); and a technique to monitor phrase clusters with negative sentiments for their outbreaks over time. We used PUMA to study two popular apps and found that it can reveal severe problems of those apps reported in their user reviews.", "doi": "10.1145/2970276.2970365", "arxiv_id": "https://doi.org/10.1145/2970276.2970365", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970365"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970365"}
{"title": "Practical guidelines for change recommendation using association rule mining", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Leon Moonen", "Stefano Di Alesio", "David W. Binkley", "Thomas Rolfsnes"], "abstract": "Association rule mining is an unsupervised learning technique that infers relationships among items in a data set. This technique has been successfully used to analyze a system's change history and uncover evolutionary coupling between system artifacts. Evolutionary coupling can, in turn, be used to recommend artifacts that are potentially affected by a given set of changes to the system. In general, the quality of such recommendations is affected by (1) the values selected for various parameters of the mining algorithm, (2) characteristics of the set of changes used to derive a recommendation, and (3) characteristics of the system's change history for which recommendations are generated. In this paper, we empirically investigate the extent to which certain choices for these factors affect change recommendation. Specifically, we conduct a series of systematic experiments on the change histories of two large industrial systems and eight large open source systems, in which we control the size of the change set for which to derive a recommendation, the measure used to assess the strength of the evolutionary coupling, and the maximum size of historical changes taken into account when inferring these couplings. We use the results from our study to derive a number of practical guidelines for applying association rule mining for change recommendation.", "doi": "10.1145/2970276.2970327", "arxiv_id": "https://doi.org/10.1145/2970276.2970327", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970327"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970327"}
{"title": "Learning a dual-language vector space for domain-specific cross-lingual question retrieval", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Guibin Chen", "Chunyang Chen", "Zhenchang Xing", "Bowen Xu"], "abstract": "The lingual barrier limits the ability of millions of non-English speaking developers to make effective use of the tremendous knowledge in Stack Overflow, which is archived in English. For cross-lingual question retrieval, one may use translation-based methods that first translate the non-English queries into English and then perform monolingual question retrieval in English. However, translation-based methods suffer from semantic deviation due to inappropriate translation, especially for domain-specific terms, and lexical gap between queries and questions that share few words in common. To overcome the above issues, we propose a novel cross-lingual question retrieval based on word embeddings and convolutional neural network (CNN) which are the state-of-the-art deep learning techniques to capture word- and sentence-level semantics. The CNN model is trained with large amounts of examples from Stack Overflow duplicate questions and their corresponding translation by machine, which guides the CNN to learn to capture informative word and sentence features to recognize and quantify semantic similarity in the presence of semantic deviations and lexical gaps. A uniqueness of our approach is that the trained CNN can map documents in two languages (e.g., Chinese queries and English questions) in a dual-language vector space, and thus reduce the cross-lingual question retrieval problem to a simple k-nearest neighbors search problem in the dual-language vector space, where no query or question translation is required. Our evaluation shows that our approach significantly outperforms the translation-based method, and can be extended to dual-language documents retrieval from different sources.", "doi": "10.1145/2970276.2970317", "arxiv_id": "https://doi.org/10.1145/2970276.2970317", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970317"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970317"}
{"title": "Reflection-aware static analysis of Android apps", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Li Li", "Tegawendé F. Bissyandé", "Damien Octeau", "Jacques Klein"], "abstract": "We demonstrate the benefits of DroidRA, a tool for taming reflection in Android apps. DroidRA first statically extracts reflection-related object values from a given Android app. Then, it leverages the extracted values to boost the app in a way that reflective calls are no longer a challenge for existing static analyzers. This is achieved through a bytecode instrumentation approach, where reflective calls are supplemented with explicit traditional Java method calls which can be followed by state-of-the-art analyzers which do not handle reflection. Instrumented apps can thus be completely analyzed by existing static analyzers, which are no longer required to be modified to support reflection-aware analysis. The video demo of DroidRA can be found at https://youtu.be/-HW0V68aAWc.", "doi": "10.1145/2970276.2970277", "arxiv_id": "https://doi.org/10.1145/2970276.2970277", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970277"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970277"}
{"title": "Relda2: an effective static analysis tool for resource leak detection in Android apps", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tianyong Wu", "Jierui Liu", "Xi Deng", "Jun Yan", "Jian Zhang"], "abstract": "Resource leak is a common bug in Android applications (apps for short). In general, it is caused by missing release operations of the resources provided by Android (like Camera, Media Player and Sensors) that require programmers to explicitly release them. It might lead to several serious problems for the app and system, such as performance degradation and system crash.", "doi": "10.1145/2970276.2970278", "arxiv_id": "https://doi.org/10.1145/2970276.2970278", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970278"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970278"}
{"title": "An end-user oriented tool suite for development of mobile applications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhongyi Zhai", "Bo Cheng", "Meng Niu", "Zhaoning Wang", "Yimeng Feng", "Junliang Chen"], "abstract": "In this paper, we show an end-user oriented tool suite for mobile application development. The advantages of this tool suite are that the graphical user interface (GUI), as well as the application logic can both be developed in a rapid and simple way, and web-based services on the Internet can be integrated into our platform by end-users. This tool suite involves three sub-systems, namely ServiceAccess, EasyApp and LSCE. ServiceAccess takes charge of the registration and management of heterogeneous services, and can export different form of services according to the requirements of the other sub-systems. EasyApp is responsible for developing GUI in the form of mobile app. LSCE takes charge of creating the application logic that can be invoked by mobile app directly. Finally, a development case is presented to illustrate the development process using this tool suite. The URL of demo video: https://youtu.be/mM2WkU1_k-w", "doi": "10.1145/2970276.2970279", "arxiv_id": "https://doi.org/10.1145/2970276.2970279", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970279"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970279"}
{"title": "Model driven design of heterogeneous synchronous embedded systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Huafeng Zhang", "Yu Jiang", "Han Liu", "Hehua Zhang", "Ming Gu", "Jia-Guang Sun"], "abstract": "Synchronous embedded systems are becoming more and more complicated and are usually implemented with integrated hardware/software solutions. This implementation manner brings new challenges to the traditional model-driven design environments such as SCADE and STATEMATE, that supports pure hardware or software design. In this paper, we propose a co-design tool Tsmart-Edola to facilitate the system developers, and automatically generate the executable VHDL code and C code from the for- mal verified SyncBlock computation model. SyncBlock is a lightweight high-level system specification model with well defined syntax, simulation and formal semantics. Based on which, the graphical model editor, graphical simulator, verification translator, and code generator are implemented and seamlessly integrated into the Tsmart-Edola. For evaluation, we apply Tsmart-Edola to the design of a real-world train controller based on the international standard IEC 61375. Several critical ambiguousness or bugs in the standard are detected during formal verification of the constructed system model. Furthermore, the generated VHDL code and C code of Tsmart-Edola outperform that of the state-of-the-art tools in terms of synthesized gate array resource consumption and binary code size.", "doi": "10.1145/2970276.2970280", "arxiv_id": "https://doi.org/10.1145/2970276.2970280", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970280"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970280"}
{"title": "MACKE: compositional analysis of low-level vulnerabilities with symbolic execution", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saahil Ognawala", "Martín Ochoa", "Alexander Pretschner", "Tobias Limmer"], "abstract": "Concolic (concrete+symbolic) execution has recently gained popularity as an effective means to uncover non-trivial vulnerabilities in software, such as subtle buffer overflows. However, symbolic execution tools that are designed to optimize statement coverage often fail to cover potentially vulnerable code because of complex system interactions and scalability issues of constraint solvers. In this paper, we present a tool (MACKE) that is based on the modular interactions inferred by static code analysis, which is combined with symbolic execution and directed inter-procedural path exploration. This provides an advantage in terms of statement coverage and ability to uncover more vulnerabilities. Our tool includes a novel feature in the form of interactive vulnerability report generation that helps developers prioritize bug fixing based on severity scores. A demo of our tool is available at https://youtu.be/icC3jc3mHEU.", "doi": "10.1145/2970276.2970281", "arxiv_id": "https://doi.org/10.1145/2970276.2970281", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970281"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970281"}
{"title": "BovInspector: automatic inspection and repair of buffer overflow vulnerabilities", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fengjuan Gao", "Linzhang Wang", "Xuandong Li"], "abstract": "Buffer overflow is one of the most common types of software vulnerabilities. Various static analysis and dynamic testing techniques have been proposed to detect buffer overflow vulnerabilities. With automatic tool support, static buffer overflow detection technique has been widely used in academia and industry. However, it tends to report too many false positives fundamentally due to the lack of software execution information. Currently, static warnings can only be validated by manual inspection, which significantly limits the practicality of the static analysis. In this paper, we present BovInspector, a tool framework for automatic static buffer overflow warnings inspection and validated bugs repair. Given the program source code and static buffer overflow vulnerability warnings, BovInspector first performs warning reachability analysis. Then, BovInspector executes the source code symbolically under the guidance of reachable warnings. Each reachable warning is validated and classified by checking whether all the path conditions and the buffer overflow constraints can be satisfied simultaneously. For each validated true warning, BovInspector fix it with three predefined strategies. BovInspector is complementary to prior static buffer overflow discovery schemes. Experimental results on real open source programs show that BovInspector can automatically inspect on average of 74.9% of total warnings, and false warnings account for about 25% to 100% (on average of 59.9%) of the total inspected warnings. In addition, the automatically generated patches fix all target vulnerabilities. Further information regarding the implementation and experimental results of BovInspector is available at http://bovinspectortool.github.io/project/. And a short video for demonstrating the capabilities of BovInspector is now available at https://youtu.be/IMdcksROJDg.", "doi": "10.1145/2970276.2970282", "arxiv_id": "https://doi.org/10.1145/2970276.2970282", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970282"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970282"}
{"title": "CORRECT: code reviewer recommendation at GitHub for Vendasta technologies", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Masudur Rahman", "Chanchal Kumar Roy", "Jesse Redl", "Jason A. Collins"], "abstract": "  Peer code review locates common coding standard violations and simple logical\nerrors in the early phases of software development, and thus, reduces overall\ncost. Unfortunately, at GitHub, identifying an appropriate code reviewer for a\npull request is challenging given that reliable information for reviewer\nidentification is often not readily available. In this paper, we propose a code\nreviewer recommendation tool--CORRECT--that considers not only the relevant\ncross-project work experience (e.g., external library experience) of a\ndeveloper but also her experience in certain specialized technologies (e.g.,\nGoogle App Engine) associated with a pull request for determining her expertise\nas a potential code reviewer. We design our tool using client-server\narchitecture, and then package the solution as a Google Chrome plug-in. Once\nthe developer initiates a new pull request at GitHub, our tool automatically\nanalyzes the request, mines two relevant histories, and then returns a ranked\nlist of appropriate code reviewers for the request within the browser's\ncontext.\n  Demo: https://www.youtube.com/watch?v=rXU1wTD6QQ0\n", "doi": "10.1145/2970276.2970283", "arxiv_id": "https://doi.org/10.1145/2970276.2970283", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970283", "https://arxiv.org/pdf/1807.04130"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970283", "journal_ref": "Proc. ASE 2016, pp. 792--797", "categories": "cs.SE", "cited_by": 0}
{"title": "ProcessPAIR: a tool for automated performance analysis and improvement recommendation in software development", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mushtaq Raza", "João Pascoal Faria"], "abstract": "High-maturity software development processes can generate significant amounts of data that can be periodically analyzed to identify performance problems, determine their root causes and devise improvement actions. However, conducting that analysis manually is challenging because of the potentially large amount of data to analyze and the effort and expertise required. In this paper, we present ProcessPAIR, a novel tool designed to help developers analyze their performance data with less effort, by automatically identifying and ranking performance problems and potential root causes, so that subsequent manual analysis for the identification of deeper causes and improvement actions can be properly focused. The analysis is based on performance models defined manually by process experts and calibrated automatically from the performance data of many developers. We also show how ProcessPAIR was successfully applied for the Personal Software Process (PSP). A video about ProcessPAIR is available in https://youtu.be/dEk3fhhkduo.", "doi": "10.1145/2970276.2970284", "arxiv_id": "https://doi.org/10.1145/2970276.2970284", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970284"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970284"}
{"title": "CVExplorer: identifying candidate developers by mining and exploring their open source contributions", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gillian J. Greene", "Bernd Fischer"], "abstract": "Open source code contributions contain a large amount of technical skill information about developers, which can help to identify suitable candidates for a particular development job and therefore impact the success of a development team. We develop CVExplorer as a tool to extract, visualize, and explore relevant technical skills data from GitHub, such as languages and libraries used. It allows non-technical users to filter and identify developers according to technical skills demonstrated across all of their open source contributions, in order to support more accurate candidate identification. We demonstrate the usefulness of CVExplorer by using it to recommend candidates for open positions in two companies.", "doi": "10.1145/2970276.2970285", "arxiv_id": "https://doi.org/10.1145/2970276.2970285", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970285"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970285"}
{"title": "Lightweight collection and storage of software repository data with DataRover", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Kowark", "Christoph Matthies", "Matthias Uflacker", "Hasso Plattner"], "abstract": "The ease of setting up collaboration infrastructures for software engineering projects creates a challenge for researchers that aim to analyze the resulting data. As teams can choose from various available software-as-a-service solutions and can configure them with a few clicks, researchers have to create and maintain multiple implementations for collecting and aggregating the collaboration data in order to perform their analyses across different setups. The DataRover system presented in this paper simplifies this task by only requiring custom source code for API authentication and querying. Data transformation and linkage is performed based on mappings, which users can define based on sample responses through a graphical front end. This allows storing the same input data in formats and databases most suitable for the intended analysis without requiring additional coding. Furthermore, API responses are continuously monitored to detect changes and allow users to update their mappings and data collectors accordingly. A screencast of the described use cases is available at https://youtu.be/mt4ztff4SfU", "doi": "10.1145/2970276.2970286", "arxiv_id": "https://doi.org/10.1145/2970276.2970286", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970286"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970286"}
{"title": "Visual contract extractor: a tool for reverse engineering visual contracts using dynamic analysis", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Abdullah M. Alshanqiti", "Reiko Heckel", "Timo Kehrer"], "abstract": "Visual contracts model the operations of classes, components or services by pre- and post-conditions formalised as graph transformation rules. They provide a precise but intuitive notation to test, document and analyse software systems. However, due to their detailed level of specification of data states and transformations, modelling a real application is a complex and error-prone process.", "doi": "10.1145/2970276.2970287", "arxiv_id": "https://doi.org/10.1145/2970276.2970287", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970287"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970287"}
{"title": "SuperMod: tool support for collaborative filtered model-driven software product line engineering", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Felix Schwägerl", "Bernhard Westfechtel"], "abstract": "The increase in productivity implied by model-driven software product line engineering is weakened by the complexity exposed to the user having to manage a multi-variant model. Recently, a new paradigm has emerged: filtered software product line engineering transfers the established check-out/modify/commit workflow from version control to variability management, allowing to iteratively develop the multi-variant model in a single-variant view. This paper demonstrates SuperMod, a tool that supports collaborative filtered model-driven product line engineering, implemented for and with the Eclipse Modeling Framework. Concerning variability management, the tool offers capabilities for editing feature models and specifying feature configurations, both being well-known formalisms in product line engineering. Furthermore, collaborative editing of product lines is provided through distributed version control. The accompanying video shows that SuperMod seamlessly integrates into existing tool landscapes, reduces the complexity of multi-variant editing, automates a large part of variability management, and ensures consistency. A tool demonstration video is available here: http://youtu.be/5XOk3x5kjFc", "doi": "10.1145/2970276.2970288", "arxiv_id": "https://doi.org/10.1145/2970276.2970288", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970288"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970288"}
{"title": "AnModeler: a tool for generating domain models from textual specifications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jitendra Singh Thakur", "Atul Gupta"], "abstract": "This paper presents AnModeler, a tool for generating analysis models from software requirements specified using use cases. The tool uses the Stanford natural language parser to extract type dependencies (TDs) and parts of speech tags (POS-tags) of sentences from input Use Case Specification (UCS). Then, it identifies sentence structures using a set of rules framed based on Hornby's verb patterns. With the information of the TDs, POS tags, and the identified sentence structures, the tool discovers domain elements, viz.: domain objects (including their attributes and operations) and interactions between them; it consolidates the domain information as a class diagram (as well as a sequence diagram). An experiment conducted on 10 UCSs with two industry experts as subjects showed that the analysis class diagrams generated by AnModeler were remarkably close to those generated by the two industry experts. Being lightweight and easy to use, the tool can also be used to assist students and young developers in acquiring object-oriented domain modeling skills quickly.", "doi": "10.1145/2970276.2970289", "arxiv_id": "https://doi.org/10.1145/2970276.2970289", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970289"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970289"}
{"title": "SimilarTech: automatically recommend analogical libraries across different programming languages", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chunyang Chen", "Zhenchang Xing"], "abstract": "Third-party libraries are an integral part of many software projects. It often happens that developers need to find analogical libraries that can provide comparable features to the libraries they are already familiar with. Existing methods to find analogical libraries are limited by the community-curated list of libraries, blogs, or Q&A posts, which often contain overwhelming or out-of-date information. This paper presents our tool SimilarTech (https://graphofknowledge.appspot.com/similartech) that makes it possible to automatically recommend analogical libraries by incorporating tag embeddings and domain-specific relational and categorical knowledge mined from Stack Overflow. SimilarTech currently supports recommendation of 6,715 libraries across 6 different programming languages. We release our SimilarTech website for public use. The SimilarTech website attracts more than 2,400 users in the past 6 months. We observe two typical usage patterns of our website in the website visit logs which can satisfy different information needs of developers. The demo video can be seen at https://youtu.be/ubx8h4D4ieE.", "doi": "10.1145/2970276.2970290", "arxiv_id": "https://doi.org/10.1145/2970276.2970290", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970290"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970290"}
{"title": "TeeVML: tool support for semi-automatic integration testing environment emulation", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jian Liu", "John C. Grundy", "Iman Avazpour", "Mohamed Almorsy Abdelrazek"], "abstract": "Software environment emulation provides a means for simulating an operational environment of a system. This process involves approximation of systems' external behaviors and their communications with a system to be tested in the environment. Development of such an environment is a tedious task and involves complex low level coding. Model driven engineering is an avenue to raise the level of abstraction beyond programming by specifying solution directly using problem domain concepts. In this paper we propose a novel domain-specific modeling tool to generate complex testing environments. Our tool employs a suite of domain-specific visual modeling languages for modeling emulation environment at a high level of abstraction. These high level specifications are then automatically transformed to runtime environment for application integration testing, boosting development productivity and ease of use. The tool demonstration video can be accessed here: https://youtu.be/H3Vg20Juq80.", "doi": "10.1145/2970276.2970291", "arxiv_id": "https://doi.org/10.1145/2970276.2970291", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970291"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970291"}
{"title": "The interactive verification debugger: effective understanding of interactive proof attempts", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Hentschel", "Reiner Hähnle", "Richard Bubel"], "abstract": "The Symbolic Execution Debugger (SED) is an extension of the Eclipse debug platform for interactive symbolic execution. Like a traditional debugger, the SED can be used to locate the origin of a defect and to increase program understanding. However, as it is based on symbolic execution, all execution paths are explored simultaneously. We demonstrate an extension of the SED called Interactive Verification Debugger (IVD) for inspection and understanding of formal verification attempts. By a number of novel views, the IVD allows to quickly comprehend interactive proof situations and to debug the reasons for a proof attempt that got stuck. It is possible to perform interactive proofs completely from within the IVD. It can be experimentally demonstrated that the IVD is more effective in understanding proof attempts than a conventional prover user interface. A screencast explaining proof attempt inspection with the IVD is available at youtu.be/8e-q9Jf1h_w.", "doi": "10.1145/2970276.2970292", "arxiv_id": "https://doi.org/10.1145/2970276.2970292", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970292"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970292"}
{"title": "Verifying simulink stateflow model: timed automata approach", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yixiao Yang", "Yu Jiang", "Ming Gu", "Jia-Guang Sun"], "abstract": "Simulink Stateflow is widely used for the model-driven development of software. However, the increasing demand of rigorous verification for safety critical applications brings new challenge to the Simulink Stateflow because of the lack of formal semantics. In this paper, we present STU, a self-contained toolkit to bridge the Simulink Stateflow and a well-defined rigorous verification. The tool translates the Simulink Stateflow into the Uppaal timed automata for verification. Compared to existing work, more advanced and complex modeling features in Stateflow such as the event stack, conditional action and timer are supported. Then, with the strong verification power of Uppaal, we can not only find design defects that are missed by the Simulink Design Verifier, but also check more important temporal properties. The evaluation on artificial examples and real industrial applications demonstrates the effectiveness.", "doi": "10.1145/2970276.2970293", "arxiv_id": "https://doi.org/10.1145/2970276.2970293", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970293"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970293"}
{"title": "GUICat: GUI testing as a service", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lin Cheng", "Jialiang Chang", "Zijiang Yang", "Chao Wang"], "abstract": "GUIs are event-driven applications where the flow of the program is determined by user actions such as mouse clicks and key presses. GUI testing is a challenging task not only because of the combinatorial explosion in the number of event sequences, but also because of the difficulty to cover the large number of data values. We propose GUICat, the first cloud based GUI testing framework that simultaneously generates event sequences and data values. It is a white-box GUI testing tool that augments traditional sequence generation techniques with concolic execution. We also propose a cloudbased parallel algorithm for mitigating both event sequence explosion and data value explosion, by distributing the concolic execution tasks over public clouds such as Amazon EC2. We have evaluated the tool on standard GUI testing benchmarks and showed that GUICat significantly outperforms state-of-the-art GUI testing tools. The video demo URL is https://youtu.be/rfnnQOmZqj4.", "doi": "10.1145/2970276.2970294", "arxiv_id": "https://doi.org/10.1145/2970276.2970294", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970294"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970294"}
{"title": "An automated collaborative requirements engineering tool for better validation of requirements", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nor Aiza Moketar", "Massila Kamalrudin", "Safiah Sidek", "Mark Robinson", "John C. Grundy"], "abstract": "This demo introduces an automated collaborative requirements engineering tool, called TestMEReq, which is used to promote effective communication and collaboration between client-stakeholders and requirements engineers for better requirements validation. Our tool is augmented with real time communication and collaboration support to allow multiple stakeholders to collaboratively validate the same set of requirements. We have conducted a user study focusing on validating requirements using TestMEReq with a few groups of requirements engineers and client stakeholders. The study shows that our automated tool support is able to assist requirements engineers to effectively communicate with client-stakeholders to better validate the requirements virtually in real time. (Demo video: https://www.youtube.com/watch?v=7sWLOx-N4Jo).", "doi": "10.1145/2970276.2970295", "arxiv_id": "https://doi.org/10.1145/2970276.2970295", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970295"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970295"}
{"title": "An extensible framework for variable-precision data-flow analyses in MPS", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tamás Szabó", "Simon Alperovich", "Markus Voelter", "Sebastian Erdweg"], "abstract": "Data-flow analyses are used as part of many software engineering tasks: they are the foundations of program under- standing, refactorings and optimized code generation. Similar to general-purpose languages (GPLs), state-of-the-art domain-specific languages (DSLs) also require sophisticated data-flow analyses. However, as a consequence of the different economies of DSL development and their typically relatively fast evolution, the effort for developing and evolving such analyses must be lowered compared to GPLs. This tension can be resolved with dedicated support for data-flow analyses in language workbenches.", "doi": "10.1145/2970276.2970296", "arxiv_id": "https://doi.org/10.1145/2970276.2970296", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2970296"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2970296"}
{"title": "Towards efficient and effective automatic program repair", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xuan-Bach Dinh Le"], "abstract": "Automatic Program Repair (APR) has recently been an emerging research area, addressing an important challenge in software engi- neering. APR techniques, if effective and efficient , can greatly help software debugging and maintenance. Recently proposed APR tech- niques can be generally classified into two families, namely search- based and semantics-based APR methods. To produce repairs, search- based APR techniques generate huge populations of possible re- pairs, i.e., search space, and lazily search for the best one among the search space. Semantics-based APR techniques utilize con- straint solving and program synthesis to make search space more tractable, and find those repairs that conform to semantics con- straints extracted via symbolic execution. Despite recent advances in APR, search-based APR still suffers from search space explo- sion problem, while the semantics-based APR could be hindered by limited capability of constraint solving and program synthesis. Furthermore, both APR families may be subject to overfitting, in which generated repairs do not generalize to other test sets. This thesis works towards enhancing both effectiveness and ef- ficiency in order for APR to be practically adopted in foreseeable future. To achieve this goal, other than using test cases as the pri- mary criteria for traversing the search space, we designed a new feature used for a new search-based APR technique to effectively traverse the search space, wherein bug fix history is used to evaluate the quality of repair candidates. We also developed a deductive- reasoning-based repair technique that combines search-based and semantics-based approaches to enhance the repair capability, while ensuring the soundness of generated repairs. We also leveraged machine-learning techniques to build a predictive model that pre- dicts whether an APR technique is effective in fixing particular bugs. In the future, we plan to synergize many existing APR tech- niques, improve our predictive model, and adopt the advances of other fields such as test case generation and program synthesis for APR.", "doi": "10.1145/2970276.2975934", "arxiv_id": "https://doi.org/10.1145/2970276.2975934", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2975934"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2975934"}
{"title": "Automated testing and notification of mobile app privacy leak-cause behaviours", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Joseph Chan Joo Keng"], "abstract": "I describe the design, implementation and evaluation of a novel hybrid static/dynamic analysis system for automatically uncovering and testing for the user-triggered causes and paths of privacy leaks in Android applications (privacy 'leak-causes'). I describe how I plan to further evaluate and demonstrate improvements in accuracy, coverage and testing speed of my hybrid testing approach against other currently available systems. I also show how user privacy is improved by the presentation of information on leak-causes in a field study as privacy notices. I present plans to investigate which of the commonly utilized mobile notification mechanisms is best suited to the presentation of leak-causes, as well as how users may set better privacy control policies with the information provided.", "doi": "10.1145/2970276.2975935", "arxiv_id": "https://doi.org/10.1145/2970276.2975935", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2975935"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2975935"}
{"title": "Factoring requirement dependencies in software requirement selection using graphs and integer programming", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Davoud Mougouei"], "abstract": "Software requirement selection is to find a subset of requirements (so-called optimal set) that gives the highest customer value for a release of software while keeping the cost within the budget. Several industrial studies however, have demonstrated that requirements of software projects are intricately interdependent and these interdependencies impact the values of requirements. Furthermore, the strengths of dependency relations among requirements vary in the context of real-world projects. For instance, requirements can be strongly or weakly interdependent. Therefore, it is important to consider both the existence and the strengths of dependency relations during requirement selection. The existing selection models however, have ignored either requirement dependencies altogether or the strengths of those dependencies. This research proposes an Integer programming model for requirement selection which considers both the existence and strengths of requirement dependencies. We further contribute a graph-based dependency modeling technique for capturing requirement dependencies and the their corresponding strengths. Automated/semi-automated techniques will also be devised to identify requirement dependencies and the strengths of those dependencies.", "doi": "10.1145/2970276.2975936", "arxiv_id": "https://doi.org/10.1145/2970276.2975936", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2975936"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2975936"}
{"title": "Statistical analysis of large sets of models", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Önder Babur"], "abstract": "Many applications in Model-Driven Engineering involve processing multiple models, e.g. for comparing and merging of model variants into a common domain model. Despite many sophisticated techniques for model comparison, little attention has been given to the initial data analysis and filtering activities. These are hard to ignore especially in the case of a large dataset, possibly with outliers and sub-groupings. We would like to develop a generic approach for model comparison and analysis for large datasets; using techniques from information retrieval, natural language processing and machine learning. We are implementing our approach as an open framework and have so far evaluated it on public datasets involving domain analysis, repository management and model searching scenarios.", "doi": "10.1145/2970276.2975938", "arxiv_id": "https://doi.org/10.1145/2970276.2975938", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2975938"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2975938"}
{"title": "Developer targeted analytics: supporting software development decisions with runtime information", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jürgen Cito"], "abstract": "Runtime information of deployed software has been used by business and operations units to make informed decisions under the term ``analytics\". However, decisions made by software engineers in the course of evolving software have, for the most part, been based on personal belief and gut-feeling. This could be attributed to software development being, for the longest time, viewed as an activity that is detached from the notion of operating software in a production environment. In recent years, this view has been challenged with the emergence of the DevOps movement, which aim is to promote cross-functional capabilities of development and operations activities within teams. This shift in process and mindset requires analytics tools that specifically target software developers. In this research, I investigate approaches to support developers in their decision-making by incorporating runtime information in source code and provide live feedback in IDEs by predicting the impact of code changes.", "doi": "10.1145/2970276.2975939", "arxiv_id": "https://doi.org/10.1145/2970276.2975939", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2975939"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2975939"}
{"title": "API recommendation system for software development", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ferdian Thung"], "abstract": "Nowadays, software developers often utilize existing third party libraries and make use of Application Programming Interface (API) to develop a software. However, it is not always obvious which library to use or whether the chosen library will play well with other libraries in the system. Furthermore, developers need to spend some time to understand the API to the point that they can freely use the API methods and putting the right parameters inside them. In this work, I plan to automatically recommend relevant APIs to developers. This API recommendation can be divided into multiple stages. First, we can recommend relevant libraries provided a given task to complete. Second, we can recommend relevant API methods that developer can use to program the required task. Third, we can recommend correct parameters for a given method according to its context. Last but not least, we can recommend how different API methods can be combined to achieve a given task. In effort to realize this API recommendation system, I have published two related papers. The first one deals with recommending additional relevant API libraries given known useful API libraries for the target program. This system can achieve recall rate@5 of 0.852 and recall rate@10 of 0.894 in recommending additional relevant libraries. The second one deals with recommending relevant API methods a given target API and a textual description of the task. This system can achieve recall-rate@5 of 0.690 and recall-rate@10 of 0.779. The results for both system indicate that the systems are useful and capable in recommending the right API/library reasonably well. Currently, I am working on another system which can recommend web APIs (i.e., libraries) given a description of the task. I am also working on a system that recommends correct parameters given an API method. In the future, I also plan to realize API composition recommendation for the given task.", "doi": "10.1145/2970276.2975940", "arxiv_id": "https://doi.org/10.1145/2970276.2975940", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2970276.2975940"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2970276.2975940"}
{"title": "Proceedings of the International Workshop on Formal Methods for Analysis of Business Systems, ForMABS@ASE 2016, Singapore, Singapore, September 4, 2016", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ravindra Naik", "Raveendra Kumar Medicherla", "Ansuman Banerjee"], "abstract": "Software systems are increasingly used to support business processes and knowledge workflows within critical areas, including transportation, finance, healthcare and government. The support for such processes, which are at the same time unpredictable ...", "doi": "10.1145/2975941", "arxiv_id": "https://doi.org/10.1145/2975941", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975941"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975941"}
{"title": "Flexible, adaptable, and compliant business systems with dynamic condition response graphs", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas T. Hildebrandt"], "abstract": "Software systems are increasingly used to support business processes and knowledge workflows within critical areas, including transportation, finance, healthcare and government. The support for such processes, which are at the same time unpredictable and subject to changing legal constraints, calls for flexibility, adaptability and compliancy. In this talk we will present theory and applications of Dynamic Condition Response (DCR) graphs, a formal declarative event-based process language implemented in the commercial web-tool DCRGraphs.net for collaborative process design and simulation and the academic tools dcr.itu.dk. The language and tools are the result of a series of research and PhD projects supported by the danish national research foundations, ITU and Exformatics A/S and the ongoing Computational Artefacts (CompArt.ku.dk) project supported by the Velux foundation.", "doi": "10.1145/2975941.2990287", "arxiv_id": "https://doi.org/10.1145/2975941.2990287", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975941.2990287"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975941.2990287"}
{"title": "SemFix and beyond: semantic techniques for program repair", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Abhik Roychoudhury"], "abstract": "Automated program repair is of great promise for future programming environments. It is also of obvious importance for patching vulnerabilities in software, or for building self-healing systems for critical infra-structure. Traditional program repair techniques tend to lift the fix from elsewhere in the program via syntax based approaches. In this talk, I will mention how the search problems in program repair can be solved by semantic analysis techniques. Here semantic analysis methods are not only used to guide the search, but also for extracting formal specifications from tests. I will conclude with positioning of the syntax based and semantic based methods for vulnerability patching, future generation programming, and self-healing systems.", "doi": "10.1145/2975941.2990288", "arxiv_id": "https://doi.org/10.1145/2975941.2990288", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975941.2990288"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975941.2990288"}
{"title": "Business process adaptation using discrete event controller synthesis", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sebastián Uchitel"], "abstract": "Discrete Event Controller Synthesis is a fully automated procedure for producing operational reactive strategies for achieving declarative goals. In this talk I will discuss how synthesis at runtime can play a key role in achieving self-adaptation. I will discuss a reference architecture for self-adaptive systems and focus on the problem of dynamic controller update. I will also explain why discrete event controller synthesis is particularly well suited for runtime adaptation of business processes, in particular for dynamic update of workflows.", "doi": "10.1145/2975941.2990289", "arxiv_id": "https://doi.org/10.1145/2975941.2990289", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975941.2990289"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975941.2990289"}
{"title": "Static analysis to enable verification and transformation of data-intensive business applications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Komondoor V. Raghavan"], "abstract": "Programs that process data that reside in files are widely used in varied enterprise domains, such as banking, healthcare, and web-traffic analysis. Precise static analysis of these programs in the context of software transformation and verification tasks is a challenging problem. Our key insight is that static analysis of file- processing programs can be made more useful if knowledge of the input file formats of these programs is made available to the analysis. We instantiate this idea to solve two practical problems: specializing the code of a program to a given restricted input file format, and verifying if a program conforms to a given input file format. We then discuss an implementation of our approach, and also empirical results on a set of real and realistic programs. The results are very encouraging in the terms of both scalability as well as precision of the approach.", "doi": "10.1145/2975941.2990290", "arxiv_id": "https://doi.org/10.1145/2975941.2990290", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975941.2990290"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975941.2990290"}
{"title": "Improving configurable software testing with statistical test selection", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dusica Marijan"], "abstract": "In software development of configurable systems, effective software testing is essential. As high configurability entails high testing effort, effective testing is required to meet cost constraints while ensuring satisfactory end product quality. In this paper, we present an initial study on the potential of using statistical testing techniques for improving the efficiency of test selection for configurable software. The study aims to answer whether statistical testing can reduce the effort of localizing the most critical software faults, seen from user perspective. We use probabilistic transition system as the formalism for modeling a probabilistic behavior of the system, and usage models to detect faults that would impact users the most. We present an exemplary case study used to assess the performance of statistical test selection compared to manual practice.", "doi": "10.1145/2975941.2975942", "arxiv_id": "https://doi.org/10.1145/2975941.2975942", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975941.2975942"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975941.2975942"}
{"title": "Domain-independent method of detecting inconsistencies in SBVR-based business rules", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pavan Kumar Chittimalli", "Kritika Anand"], "abstract": "Traditionally, business rules are expressed informally in English, captured eventually, as a part of UML use-cases. Detecting anomalies in business rules is extremely difficult to automate, due to their informal nature, and manually error-prone due to the size and complexity. In recent times, business rules are being expressed increasingly using standard representations (such as Semantics of Business Vocabularies and Rules (SBVR)). We present a method to detect inconsistencies amongst the rules, based on the model checking. We exploit the First Order Logic (FOL) basis of SBVR representation to propose a method that is independent of the business domain. We present a case-study of business rules for well-known example of car-rental, and our method shows promising results to detect inconsistencies.", "doi": "10.1145/2975941.2975943", "arxiv_id": "https://doi.org/10.1145/2975941.2975943", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975941.2975943"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975941.2975943"}
{"title": "Proceedings of the 1st International Workshop on Software Refactoring, IWoR@ASE 2016, Singapore, Singapore, September 4, 2016", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Ouni", "Marouane Kessentini", "Mel Ó Cinnéide"], "abstract": "Code smells and refactoring have received considerable interest from the academia as well as from the industry in the past two decades. The interest has given birth to various tools, processes, techniques, and practices to identify smells and refactor ...", "doi": "10.1145/2975945", "arxiv_id": "https://doi.org/10.1145/2975945", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975945"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975945"}
{"title": "Refactoring for software architecture smells", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ganesh Samarthyam", "Girish Suryanarayana", "Tushar Sharma"], "abstract": "Code smells and refactoring have received considerable interest from the academia as well as from the industry in the past two decades. The interest has given birth to various tools, processes, techniques, and practices to identify smells and refactor them. Despite the high interest, architecture smells and corresponding refactorings haven't received as much focus and adoption from the software engineering community. In this paper, we motivate the need of architecture refactoring, discuss the current related research, and present a few potential research directions for architecture refactoring.", "doi": "10.1145/2975945.2975946", "arxiv_id": "https://doi.org/10.1145/2975945.2975946", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975945.2975946"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975945.2975946"}
{"title": "Empirical evaluation of code smells in open source projects: preliminary results", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Aziz Nanthaamornphong", "Apatta Chaisutanon"], "abstract": "Open Source Software (OSS) now plays an important role in various industry domains. OSS is generally developed by highly experienced developers who have multiple perspectives. However, previous studies have indicated that OSS has quality limitations in software maintainability. In general, OSS developers typically focus on achieving the correct functionality. In contrast, in addition to focusing on building software functionality, software engineering practices also focus on the structure of the software and on its maintainability. Code with a well-designed structure is more likely to result in high quality software. To better understand how peer code review can reduce ``code smells\" in existing OSS projects, we examined comments from code reviewers that identified code smells in OSS projects. This paper is a proof-of-concept that presents the preliminary results from an analysis of comments we obtained for two OSS projects, OpenStack and WikiMedia, both of which use the code review data repository called Gerrit. The preliminary results of this ongoing research show that code reviewers comment on only a small number of code smells. The full-scale results would contribute to the empirical body of validated knowledge in the field of OSS quality and code review.", "doi": "10.1145/2975945.2975947", "arxiv_id": "https://doi.org/10.1145/2975945.2975947", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975945.2975947"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975945.2975947"}
{"title": "Measuring refactoring benefits: a survey of the evidence", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mel Ó Cinnéide", "Aiko Yamashita", "Steve Counsell"], "abstract": "Refactoring has become a standard technique for software developers to use when trying to improve or evolve the design of a program. It is a key component of Agile methods, the most popular family of software development methodologies in industrial practice. Refactoring has also been the subject of much attention from researchers and many practitioner textbooks have been written on the topic. It would be natural to assume then that the benefits of refactoring would be easy agree upon, and easy to measure. In this position paper we review a selection of the empirical studies that have attempted to measure the benefits of refactoring and find the situation to be quite unclear. The evidence suggests that what motivates developers to refactor, and what benefits accrue from refactoring, are open issues that require further research.", "doi": "10.1145/2975945.2975948", "arxiv_id": "https://doi.org/10.1145/2975945.2975948", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975945.2975948"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975945.2975948"}
{"title": "Graph-based approach for detecting impure refactoring from version commits", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shogo Tsutsumi", "Eunjong Choi", "Norihiro Yoshida", "Katsuro Inoue"], "abstract": "Impure refactoring is defined as a refactoring operation that was saved together with non-refactoring changes or several refactoring operations were saved at the same location stored in source code repositories. Many of existing approaches are not correctly viable for detecting impure refactoring. To mitigate this problem, we propose an approach that detects impure refactoring from commits stored in the repositories using a graph search algorithm. In case study, we applied our approach to two actual classes in Apache Xerces project and confirmed the feasibility of the approach.", "doi": "10.1145/2975945.2975949", "arxiv_id": "https://doi.org/10.1145/2975945.2975949", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975945.2975949"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975945.2975949"}
{"title": "Refactoring verification using model transformation", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Makoto Ichii", "Daisuke Shimbara", "Yasufumi Suzuki", "Hideto Ogawa"], "abstract": "Software refactoring is an effective way for dealing with technical debt accumulated in a software system; however, regression risk prevents developers from refactoring their code. Herein, we propose an approach to check the equivalence of source code before and after refactoring using the AST-based model extracted from source code. In order to detect unintended changes to the program structure, our approach first transforms the model from the refactored code in accordance with the refactoring pattern so that the refactoring is cancelled, and then compares it with the model from the code before refactoring. We also built a tool named POM/EQ based on the Eclipse Modeling Framework for checking C/C++ source code. As a result of the case study using the tool, we successfully checked 56 % of the refactoring changes that are performed on an industrial product.", "doi": "10.1145/2975945.2975950", "arxiv_id": "https://doi.org/10.1145/2975945.2975950", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975945.2975950"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975945.2975950"}
{"title": "Automated translation among EPSILON languages for performance-driven UML software model refactoring", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Davide Arcelli", "Vittorio Cortellessa", "Daniele Di Pompeo"], "abstract": "Although performance represents a crucial non-functional attribute of software, few model-based approaches have been introduced up today for reducing the gap between performance analysis results (e.g., mean response time) and the feedback expected by software engineers when performance problems are detected (i.e., refactoring actions). However, existing approaches aimed at performance-driven refactoring of software models suffer from fragmentation across different paradigms, languages, and meta-models.", "doi": "10.1145/2975945.2975951", "arxiv_id": "https://doi.org/10.1145/2975945.2975951", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975945.2975951"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975945.2975951"}
{"title": "Full application of the extract interface refactoring: conceptual structures in the hands of master students", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marianne Huchard"], "abstract": "Interfaces are data types that are very useful for providing abstract and organized views on programs and APIs, and opportunities for writing more generic code and for reuse. Extract interface refactoring is a well known local refactoring which is commonly used in development tools. Beyond that local refactoring, there is a need for mass extraction of an interface hierarchy from a class hierarchy. In this paper, we made an experience with master students to put into practice an existing Formal Concept Analysis (FCA) based approach for solving that problem. The results show that the data selection (selected datatypes: interfaces, abstract classes, concrete classes; attributes; attribute description; methods; method description; etc.) was not obvious as it was expected to be, and that the students used the approach more as an analysis technique that would guide the extraction, than as a turn key solution.", "doi": "10.1145/2975945.2975952", "arxiv_id": "https://doi.org/10.1145/2975945.2975952", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975945.2975952"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975945.2975952"}
{"title": "Proceedings of the 1st International Workshop on Specification, Comprehension, Testing, and Debugging of Concurrent Programs, SCTDCP@ASE 2016, Singapore, Singapore, September 3, 2016", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zijiang Yang", "Ting Liu", "Daniel Xiapu Luo"], "abstract": "Organization-oriented multi-agent system (OOMAS) points out organizational behaviors for self-organization. Existing development methods of organizational behaviors depend on preestablished organization structures during the development phase. For this ...", "doi": "10.1145/2975954", "arxiv_id": "https://doi.org/10.1145/2975954", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975954"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975954"}
{"title": "An algebraic specification language for organizational behavior of OOMAS", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yan Zhang", "Lejian Liao"], "abstract": "Organization-oriented multi-agent system (OOMAS) points out organizational behaviors for self-organization. Existing development methods of organizational behaviors depend on preestablished organization structures during the development phase. For this reason, OOMASs are inefficient for simulation of large-scale cliques of attackers in cyber. To solve this issues, we propose an specification language organizational behaviors to support reorganization from bottom-up way during the application phase. Based on theory of abstract data type (ADT), the behavioral functions are defined to support type description of organizational behaviors. We present abstract syntax of organizational behaviors for specification language. We explore the homomorphism and isomorphism between behavioral algebras for organizational behaviors to preserve relevances between them.", "doi": "10.1145/2975954.2975957", "arxiv_id": "https://doi.org/10.1145/2975954.2975957", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975954.2975957"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975954.2975957"}
{"title": "A model for systematic monitoring and debugging of starvation bugs in multicore software", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sara Abbaspour Asadollah", "Mehrdad Saadatmand", "Sigrid Eldh", "Daniel Sundmark", "Hans A. Hansson"], "abstract": "With the development of multicore hardware, concurrent, parallel and multicore software are becoming increasingly popular. Software companies are spending a huge amount of time and resources to nd and debug the bugs. Among all types of software bugs, concurrency bugs are also important and troublesome. This type of bugs is increasingly becoming an issue particularly due to the growing prevalence of multicore hardware. In this position paper, we propose a model for monitoring and debugging Starvation bugs as a type of concurrency bugs in multicore software. The model is composed into three phases: monitoring, detecting and debugging. The monitoring phase can support detecting phase by storing collected data from the system execution. The detecting phase can support debugging phase by comparing the stored data with starvation bug's properties, and the debugging phase can help in reproducing and removing the Starvation bug from multicore software. Our intention is that our model is the basis for developing tool(s) to enable solving Starvation bugs in software for multicore platforms.", "doi": "10.1145/2975954.2975958", "arxiv_id": "https://doi.org/10.1145/2975954.2975958", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975954.2975958"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975954.2975958"}
{"title": "A leader election based deadlock detection algorithm in distributed systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wei Lu", "Yong Yang", "Liqiang Wang", "Weiwei Xing", "Xiaoping Che"], "abstract": "Deadlock detection is an important and challenge work in distributed systems. Thing becomes more complex when multiple deadlock detection algorithm instances executing currently in the system. In this paper, we propose a leader election based deadlock detection algorithm in distributed system. Our algorithm aims to improve the performance in the condition of concurrent execution. In addition, our algorithm can provide a certain extent of fault tolerance after a current leader fails. We have proved the liveness and safety property of our algorithm. Simulation results show that our algorithm obtains an order of magnitude performance improvement on message complexity.", "doi": "10.1145/2975954.2975955", "arxiv_id": "https://doi.org/10.1145/2975954.2975955", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975954.2975955"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975954.2975955"}
{"title": "Dynamic cohesion measurement for distributed system", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wuxia Jin", "Ting Liu", "Yu Qu", "Jianlei Chi", "Di Cui", "Qinghua Zheng"], "abstract": "Instead of developing single-server software system for the powerful computers, the software is turning from large single-server to multi-server system such as distributed system. This change introduces a new challenge for the software quality measurement, since the current software analysis methods for single-server software could not observe and assess the correlation among the components on different nodes. In this paper, a new dynamic cohesion approach is proposed for distributed system. We extend Calling Network model for distributed system by differentiating methods of components deployed on different nodes. Two new cohesion metrics are proposed to describe the correlation at component level, by extending the cohesion metric of single-server software system. The experiments, conducted on a distributed systems-Netflix RSS Reader, present how to trace the various system functions accomplished on three nodes, how to abstract dynamic behaviors using our model among different nodes and how to evaluate the software cohesion on distributed system.", "doi": "10.1145/2975954.2975956", "arxiv_id": "https://doi.org/10.1145/2975954.2975956", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975954.2975956"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975954.2975956"}
{"title": "MD-ART: a test case generation method without test oracle problem", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhanwei Hui", "Song Huang"], "abstract": "Adaptive random testing (ART), as an improved random testing method, preserves the advantages of traditional random test method and overcomes the blindness of traditional random testing method. But it is usually not easy to validate the correctness of the output, except for some special test cases. In other words, the test oracle problem is unresolved. In this research, we introduced metamorphic testing (MT) and metamorphic distance into ART, which is called metamorphic distance based ART (MD-ART) to provide the test oracle. The results of primary experiment results show that MD-ART performs better than traditional MT and ART not only in test effectiveness but also in test efficiency and test coverage.", "doi": "10.1145/2975954.2975959", "arxiv_id": "https://doi.org/10.1145/2975954.2975959", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/2975954.2975959"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/2975954.2975959"}
{"title": "Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, ASE 2017, Urbana, IL, USA, October 30 - November 03, 2017", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Grigore Rosu", "Massimiliano Di Penta", "Tien N. Nguyen"], "abstract": null, "doi": null, "arxiv_id": "https://ieeexplore.ieee.org/xpl/conhome/8106906/proceeding", "pdf_urls": ["https://arxiv.org/pdf/https://ieeexplore.ieee.org/xpl/conhome/8106906/proceeding"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://ieeexplore.ieee.org/xpl/conhome/8106906/proceeding"}
{"title": "Cobra - an interactive static code analyzer", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gerard J. Holzmann"], "abstract": "Sadly we know that virtually all software of any significance has residual errors. Some of those errors can be traced back to requirements flaws or faulty design assumptions; others are just plain coding mistakes. Static analyzers have become quite good at spotting these types of errors, but they don't scale very well. If, for instance, you need to check a code base of a few million lines you better be prepared to wait for the result; sometimes hours. Eyeballing a large code base to find flaws is clearly not an option, so what is missing is a static analysis capability that can be used to answer common types of queries interactively, even for large code bases. I will describe the design and use of such a tool in this talk.", "doi": "10.1109/ase.2017.8115610", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115610", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115610"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115610"}
{"title": "Mining structures from massive text data: will it help software engineering?", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiawei Han"], "abstract": "The real-world big data are largely unstructured, interconnected text data. One of the grand challenges is to turn such massive unstructured text data into structured, actionable knowledge. We propose a text mining approach that requires only distant or minimal supervision but relies on massive text data. We show quality phrases can be mined from such massive text data, types can be extracted from massive text data with distant supervision, and entities/attributes/values can be discovered by meta-path directed pattern discovery. We show text-rich and structure-rich networks can be constructed from massive unstructured data. Finally, we speculate whether such a paradigm could be useful for turning massive software repositories into multi-dimensional structures to help searching and mining software repositories.", "doi": "10.1109/ase.2017.8115611", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115611", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115611"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115611"}
{"title": "Software engineering without borders", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Arie van Deursen"], "abstract": "DevOps approaches software engineering by advocating the removal of borders between development and operations. DevOps emphasizes operational resilience, continuous feedback from operations back to development, and rapid deployment of features developed. In this talk we will look at selected (automation) aspects related to DevOps, based on our collaborations with various industrial partners. For example, we will explore (automated) methods for analyzing log data to support deployments and monitor REST API integrations, (search-based) test input generation for reproducing crashes and testing complex database queries, and zero downtime database schema evolution and deployment. We will close by looking at borders beyond those between development and operations, in order to see whether there are other borders we need to remove in order to strengthen the impact of software engineering research.", "doi": "10.1109/ase.2017.8115612", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115612", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115612"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115612"}
{"title": "Systematically testing background services of mobile apps", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Li Lyna Zhang", "Chieh-Jan Mike Liang", "Yunxin Liu", "Enhong Chen"], "abstract": "Contrary to popular belief, mobile apps can spend a large fraction of time running \"hidden\" as background services. And, bugs in services can translate into crashes, energy depletion, device slow-down, etc. Unfortunately, without necessary testing tools, developers can only resort to telemetries from user devices in the wild. To this end, Snowdrop is a testing framework that systematically identifies and automates background services in Android apps. Snowdrop realizes a service-oriented approach that does not assume all inter-component communication messages are explicitly coded in the app bytecode. Furthermore, to improve the completeness of test inputs generated, Snowdrop infers field values by exploiting the similarity in how developers name variables. We evaluate Snowdrop by testing 848 commercially available mobile apps. Empirical results show that Snowdrop can achieve 20.91% more code path coverage than pathwise test input generators, and 64.11% more coverage than random test input generators.", "doi": "10.1109/ase.2017.8115613", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115613", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115613"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115613"}
{"title": "Crowd intelligence enhances automated mobile testing", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ke Mao", "Mark Harman", "Yue Jia"], "abstract": "We show that information extracted from crowd-based testing can enhance automated mobile testing. We introduce Polariz, which generates replicable test scripts from crowd-based testing, extracting cross-app `motif' events: automatically-inferred reusable higher-level event sequences composed of lower-level observed event actions. Our empirical study used 434 crowd workers from Mechanical Turk to perform 1,350 testing tasks on 9 popular Google Play apps, each with at least 1 million user installs. The findings reveal that the crowd was able to achieve 60.5% unique activity coverage and proved to be complementary to automated search-based testing in 5 out of the 9 subjects studied. Our leave-one-out evaluation demonstrates that coverage attainment can be improved (6 out of 9 cases, with no disimprovement on the remaining 3) by combining crowd-based and search-based testing.", "doi": "10.1109/ase.2017.8115614", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115614", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115614"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115614"}
{"title": "EHBDroid: beyond GUI testing for Android applications", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wei Song", "Xiangxing Qian", "Jeff Huang"], "abstract": "With the prevalence of Android-based mobile devices, automated testing for Android apps has received increasing attention. However, owing to the large variety of events that Android supports, test input generation is a challenging task. In this paper, we present a novel approach and an open source tool called EHBDroid for testing Android apps. In contrast to conventional GUI testing approaches, a key novelty of EHBDroid is that it does not generate events from the GUI, but directly invokes callbacks of event handlers. By doing so, EHBDroid can efficiently simulate a large number of events that are difficult to generate by traditional UI-based approaches. We have evaluated EHBDroid on a collection of 35 real-world large-scale Android apps and compared its performance with two state-of-the-art UI-based approaches, Monkey and Dynodroid. Our experimental results show that EHBDroid is significantly more effective and efficient than Monkey and Dynodroid: in a much shorter time, EHBDroid achieves as much as 22.3% higher statement coverage (11.1% on average) than the other two approaches, and found 12 bugs in these benchmarks, including 5 new bugs that the other two failed to find.", "doi": "10.1109/ase.2017.8115615", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115615", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115615"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115615"}
{"title": "Sketch-guided GUI test generation for mobile applications", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chucheng Zhang", "Haoliang Cheng", "Enyi Tang", "Xin Chen", "Lei Bu", "Xuandong Li"], "abstract": "Mobile applications with complex GUIs are very popular today. However, generating test cases for these applications is often tedious professional work. On the one hand, manually designing and writing elaborate GUI scripts requires expertise. On the other hand, generating GUI scripts with record and playback techniques usually depends on repetitive work that testers need to interact with the application over and over again, because only one path is recorded in an execution. Automatic GUI testing focuses on exploring combinations of GUI events. As the number of combinations is huge, it is still necessary to introduce a test interface for testers to reduce its search space. This paper presents a sketch-guided GUI test generation approach for testing mobile applications, which provides a simple but expressive interface for testers to specify their testing purposes. Testers just need to draw a few simple strokes on the screenshots. Then our approach translates the strokes to a testing model and initiates a model-based automatic GUI testing. We evaluate our sketch-guided approach on a few real-world Android applications collected from the literature. The results show that our approach can achieve higher coverage than existing automatic GUI testing techniques with just 10-minute sketching for an application.", "doi": "10.1109/ase.2017.8115616", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115616", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115616"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115616"}
{"title": "Saying 'hi!' is not enough: mining inputs for effective test generation", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Luca Della Toffola", "Cristian-Alexandru Staicu", "Michael Pradel"], "abstract": "Automatically generating unit tests is a powerful approach to exercise complex software. Unfortunately, current techniques often fail to provide relevant input values, such as strings that bypass domain-specific sanity checks. As a result, state-of-the-art techniques are effective for generic classes, such as collections, but less successful for domain-specific software. This paper presents TestMiner, the first technique for mining a corpus of existing tests for input values to be used by test generators for effectively testing software not in the corpus. The main idea is to extract literals from thousands of tests and to adapt information retrieval techniques to find values suitable for a particular domain. Evaluating the approach with 40 Java classes from 18 different projects shows that TestMiner improves test coverage by 21% over an existing test generator. The approach can be integrated into various test generators in a straightforward way, increasing their effectiveness on previously difficult-to-test classes.", "doi": "10.1109/ase.2017.8115617", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115617", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115617"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115617"}
{"title": "Learn&Fuzz: machine learning for input fuzzing", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Patrice Godefroid", "Hila Peleg", "Rishabh Singh"], "abstract": "Fuzzing consists of repeatedly testing an application with modified, or fuzzed, inputs with the goal of finding security vulnerabilities in input-parsing code. In this paper, we show how to automate the generation of an input grammar suitable for input fuzzing using sample inputs and neural-network-based statistical machine-learning techniques. We present a detailed case study with a complex input format, namely PDF, and a large complex security-critical parser for this format, namely, the PDF parser embedded in Microsoft's new Edge browser. We discuss and measure the tension between conflicting learning and fuzzing goals: learning wants to capture the structure of well-formed inputs, while fuzzing wants to break that structure in order to cover unexpected code paths and find bugs. We also present a new algorithm for this learn&fuzz challenge which uses a learnt input probability distribution to intelligently guide where to fuzz inputs.", "doi": "10.1109/ase.2017.8115618", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115618", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115618"], "github": ["https://github.com/m-zakeri/iust_deep_fuzz"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115618"}
{"title": "The impact of continuous integration on other software development practices: a large-scale empirical study", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yangyang Zhao", "Alexander Serebrenik", "Yuming Zhou", "Vladimir Filkov", "Bogdan Vasilescu"], "abstract": "Continuous Integration (CI) has become a disruptive innovation in software development: with proper tool support and adoption, positive effects have been demonstrated for pull request throughput and scaling up of project sizes. As any other innovation, adopting CI implies adapting existing practices in order to take full advantage of its potential, and \"best practices\" to that end have been proposed. Here we study the adaptation and evolution of code writing and submission, issue and pull request closing, and testing practices as TRAVIS CI is adopted by hundreds of established projects on GITHUB. To help essentialize the quantitative results, we also survey a sample of GITHUB developers about their experiences with adopting TRAVIS CI. Our findings suggest a more nuanced picture of how GITHUB teams are adapting to, and benefiting from, continuous integration technology than suggested by prior work.", "doi": "10.1109/ase.2017.8115619", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115619", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115619"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115619"}
{"title": "Perceived language complexity in GitHub issue discussions and their effect on issue resolution", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David Kavaler", "Sasha Sirovica", "Vincent J. Hellendoorn", "Raúl Aranovich", "Vladimir Filkov"], "abstract": "Modern software development is increasingly collaborative. Open Source Software (OSS) are the bellwether; they support dynamic teams, with tools for code sharing, communication, and issue tracking. The success of an OSS project is reliant on team communication. E.g., in issue discussions, individuals rely on rhetoric to argue their position, but also maintain technical relevancy. Rhetoric and technical language are on opposite ends of a language complexity spectrum: the former is stylistically natural; the latter is terse and concise. Issue discussions embody this duality, as developers use rhetoric to describe technical issues. The style mix in any discussion can define group culture and affect performance, e.g., issue resolution times may be longer if discussion is imprecise. Using GitHub, we studied issue discussions to understand whether project-specific language differences exist, and to what extent users conform to a language norm. We built project-specific and overall GitHub language models to study the effect of perceived language complexity on multiple responses. We find that experienced users conform to project-specific language norms, popular individuals use overall GitHub language rather than project-specific language, and conformance to project-specific language norms reduces issue resolution times. We also provide a tool to calculate project-specific perceived language complexity.", "doi": "10.1109/ase.2017.8115620", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115620", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115620"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115620"}
{"title": "Can automated pull requests encourage software developers to upgrade out-of-date dependencies?", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Samim Mirhosseini", "Chris Parnin"], "abstract": "Developers neglect to update legacy software dependencies, resulting in buggy and insecure software. One explanation for this neglect is the difficulty of constantly checking for the availability of new software updates, verifying their safety, and addressing any migration efforts needed when upgrading a dependency. Emerging tools attempt to address this problem by introducing automated pull requests and project badges to inform the developer of stale dependencies. To understand whether these tools actually help developers, we analyzed 7,470 GitHub projects that used these notification mechanisms to identify any change in upgrade behavior. Our results find that, on average, projects that use pull request notifications upgraded 1.6× as often as projects that did not use any tools. Badge notifications were slightly less effective: users upgraded 1.4× more frequently. Unfortunately, although pull request notifications are useful, developers are often overwhelmed by notifications: only a third of pull requests were actually merged. Through a survey, 62 developers indicated that their most significant concerns are breaking changes, understanding the implications of changes, and migration effort. The implications of our work suggests ways in which notifications can be improved to better align with developers' expectations and the need for new mechanisms to reduce notification fatigue and improve confidence in automated pull requests.", "doi": "10.1109/ase.2017.8115621", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115621", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115621"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115621"}
{"title": "Are developers aware of the architectural impact of their changes?", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Matheus Paixão", "Jens Krinke", "DongGyun Han", "Chaiyong Ragkhitwetsagul", "Mark Harman"], "abstract": "Although considered one of the most important decisions in a software development lifecycle, empirical evidence on how developers perform and perceive architectural changes is still scarce. Given the large implications of architectural decisions, we do not know whether developers are aware of their changes' impact on the software's architecture, whether awareness leads to better changes, and whether automatically making developers aware would prevent degradation. Therefore, we use code review data of 4 open source systems to investigate the intent and awareness of developers when performing changes. We extracted 8,900 reviews for which the commits are available. 2,152 of the commits have changes in their computed architectural metrics, and 338 present significant changes to the architecture. We manually inspected all reviews for commits with significant changes and found that only in 38% of the time developers are discussing the impact of their changes on the architectural structure, suggesting a lack of awareness. Finally, we observed that developers tend to be more aware of the architectural impact of their changes when the architectural structure is improved, suggesting that developers should be automatically made aware when their changes degrade the architectural structure.", "doi": "10.1109/ase.2017.8115622", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115622", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115622"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115622"}
{"title": "SentiCR: a customized sentiment analysis tool for code review interactions", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Toufique Ahmed", "Amiangshu Bosu", "Anindya Iqbal", "Shahram Rahimi"], "abstract": "Sentiment Analysis tools, developed for analyzing social media text or product reviews, work poorly on a Software Engineering (SE) dataset. Since prior studies have found developers expressing sentiments during various SE activities, there is a need for a customized sentiment analysis tool for the SE domain. On this goal, we manually labeled 2000 review comments to build a training dataset and used our dataset to evaluate seven popular sentiment analysis tools. The poor performances of the existing sentiment analysis tools motivated us to build SentiCR, a sentiment analysis tool especially designed for code review comments. We evaluated SentiCR using one hundred 10-fold cross-validations of eight supervised learning algorithms. We found a model, trained using the Gradient Boosting Tree (GBT) algorithm, providing the highest mean accuracy (83%), the highest mean precision (67.8%), and the highest mean recall (58.4%) in identifying negative review comments.", "doi": "10.1109/ase.2017.8115623", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115623", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115623"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115623"}
{"title": "Detecting fragile comments", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Inderjot Kaur Ratol", "Martin P. Robillard"], "abstract": "Refactoring is a common software development practice and many simple refactorings can be performed automatically by tools. Identifier renaming is a widely performed refactoring activity. With tool support, rename refactorings can rely on the program structure to ensure correctness of the code transformation. Unfortunately, the textual references to the renamed identifier present in the unstructured comment text cannot be formally detected through the syntax of the language, and are thus fragile with respect to identifier renaming. We designed a new rule-based approach to detect fragile comments. Our approach, called Fraco, takes into account the type of identifier, its morphology, the scope of the identifier and the location of comments. We evaluated the approach by comparing its precision and recall against hand-annotated benchmarks created for six target Java systems, and compared the results against the performance of Eclipse's automated in-comment identifier replacement feature. Fraco performed with near-optimal precision and recall on most components of our evaluation data set, and generally outperformed the baseline Eclipse feature. As part of our evaluation, we also noted that more than half of the total number of identifiers in our data set had fragile comments after renaming, which further motivates the need for research on automatic comment refactoring.", "doi": "10.1109/ase.2017.8115624", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115624", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115624"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115624"}
{"title": "Improving software text retrieval using conceptual knowledge in source code", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zeqi Lin", "Yanzhen Zou", "Junfeng Zhao", "Bing Xie"], "abstract": "A large software project usually has lots of various textual learning resources about its API, such as tutorials, mailing lists, user forums, etc. Text retrieval technology allows developers to search these API learning resources for related documents using free-text queries, but it suffers from the lexical gap between search queries and documents. In this paper, we propose a novel approach for improving the retrieval of API learning resources through leveraging software-specific conceptual knowledge in software source code. The basic idea behind this approach is that the semantic relatedness between queries and documents could be measured according to software-specific concepts involved in them, and software source code contains a large amount of software-specific conceptual knowledge. In detail, firstly we extract an API graph from software source code and use it as software-specific conceptual knowledge. Then we discover API entities involved in queries and documents, and infer semantic document relatedness through analyzing structural relationships between these API entities. We evaluate our approach in three popular open source software projects. Comparing to the state-of-the-art text retrieval approaches, our approach lead to at least 13.77% improvement with respect to mean average precision (MAP).", "doi": "10.1109/ase.2017.8115625", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115625", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115625"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115625"}
{"title": "Automatically generating commit messages from diffs using neural machine translation", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Siyuan Jiang", "Ameer Armaly", "Collin McMillan"], "abstract": "Commit messages are a valuable resource in comprehension of software evolution, since they provide a record of changes such as feature additions and bug repairs. Unfortunately, programmers often neglect to write good commit messages. Different techniques have been proposed to help programmers by automatically writing these messages. These techniques are effective at describing what changed, but are often verbose and lack context for understanding the rationale behind a change. In contrast, humans write messages that are short and summarize the high level rationale. In this paper, we adapt Neural Machine Translation (NMT) to automatically \"translate\" diffs into commit messages. We trained an NMT algorithm using a corpus of diffs and human-written commit messages from the top 1k Github projects. We designed a filter to help ensure that we only trained the algorithm on higher-quality commit messages. Our evaluation uncovered a pattern in which the messages we generate tend to be either very high or very low quality. Therefore, we created a quality-assurance filter to detect cases in which we are unable to produce good messages, and return a warning instead.", "doi": "10.1109/ase.2017.8115626", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115626", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115626"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115626"}
{"title": "Improving missing issue-commit link recovery using positive and unlabeled data", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yan Sun", "Celia Chen", "Qing Wang", "Barry W. Boehm"], "abstract": "Links between issue reports and corresponding fix commits are widely used in software maintenance. The quality of links directly affects maintenance costs. Currently, such links are mainly maintained by error-prone manual efforts, which may result in missing links. To tackle this problem, automatic link recovery approaches have been proposed by building traditional classifiers with positive and negative links. However, these traditional classifiers may not perform well due to the inherent characteristics of missing links. Positive links, which can be used to build link recovery model, are quite limited as the result of missing links. Since the construction of negative links depends on the number of positive links in many existing approaches, the available negative links also become restricted. In this paper, we point out that it is better to consider the missing link problem as a model learning problem by using positive and unlabeled data, rather than the construction of traditional classifier. We propose PULink, an approach that constructs the link recovery model with positive and unlabeled links. Our experiment results show that compared to existing state-of-the-art technologies built on traditional classifier, PULink can achieve competitive performance by utilizing only 70% positive links that are used in those approaches.", "doi": "10.1109/ase.2017.8115627", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115627", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115627"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115627"}
{"title": "APIBot: question answering bot for API documentation", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuan Tian", "Ferdian Thung", "Abhishek Sharma", "David Lo"], "abstract": "As the carrier of Application Programming Interfaces (APIs) knowledge, API documentation plays a crucial role in how developers learn and use an API. It is also a valuable information resource for answering API-related questions, especially when developers cannot find reliable answers to their questions online/offline. However, finding answers to API-related questions from API documentation might not be easy because one may have to manually go through multiple pages before reaching the relevant page, and then read and understand the information inside the relevant page to figure out the answers. To deal with this challenge, we develop APIBot, a bot that can answer API questions given API documentation as an input. APIBot is built on top of SiriusQA, the QA system from Sirius, a state of the art intelligent personal assistant. To make SiriusQA work well under software engineering scenario, we make several modifications over SiriusQA by injecting domain specific knowledge. We evaluate APIBot on 92 API questions, answers of which are known to be present in Java 8 documentation. Our experiment shows that APIBot can achieve a Hit@5 score of 0.706.", "doi": "10.1109/ase.2017.8115628", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115628", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115628"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115628"}
{"title": "Automatic summarization of API reviews", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gias Uddin", "Foutse Khomh"], "abstract": "With the proliferation of online developer forums as informal documentation, developers often share their opinions about the APIs they use. However, given the plethora of opinions available for an API in various online developer forums, it can be challenging for a developer to make informed decisions about the APIs. While automatic summarization of opinions have been explored for other domains (e.g., cameras, cars), we found little research that investigates the benefits of summaries of public API reviews. In this paper, we present two algorithms (statistical and aspect-based) to summarize opinions about APIs. To investigate the usefulness of the techniques, we developed, Opiner, an online opinion summarization engine that presents summaries of opinions using both our proposed techniques and existing six off-the-shelf techniques. We investigated the usefulness of Opiner using two case studies, both involving professional software engineers. We found that developers were interested to use our proposed summaries much more frequently than other summaries (daily vs once a year) and that while combined with Stack Overflow, Opiner helped developers to make the right decision with more accuracy and confidence and in less time.", "doi": "10.1109/ase.2017.8115629", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115629", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115629"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115629"}
{"title": "iCoq: regression proof selection for large-scale verification projects", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ahmet Çelik", "Karl Palmskog", "Milos Gligoric"], "abstract": "Proof assistants such as Coq are used to construct and check formal proofs in many large-scale verification projects. As proofs grow in number and size, the need for tool support to quickly find failing proofs after revising a project increases. We present a technique for large-scale regression proof selection, suitable for use in continuous integration services, e.g., Travis CI. We instantiate the technique in a tool dubbed ICOQ. ICOQ tracks fine-grained dependencies between Coq definitions, propositions, and proofs, and only checks those proofs affected by changes between two revisions. ICOQ additionally saves time by ignoring changes with no impact on semantics. We applied ICOQ to track dependencies across many revisions in several large Coq projects and measured the time savings compared to proof checking from scratch and when using Coq's timestamp-based toolchain for incremental checking. Our results show that proof checking with ICOQ is up to 10 times faster than the former and up to 3 times faster than the latter.", "doi": "10.1109/ase.2017.8115630", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115630", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115630"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115630"}
{"title": "More effective interpolations in software model checking", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Cong Tian", "Zhao Duan", "Zhenhua Duan", "C.-H. Luke Ong"], "abstract": "An approach to CEGAR-based model checking which has proved to be successful on large models employs Craig interpolation to efficiently construct parsimonious abstractions. Following this design, we introduce new applications, universal safety interpolant and existential error interpolant, of Craig interpolation that can systematically reduce the program state space to be explored for safety verification. Whenever the universal safety interpolant is implied by the current path, all paths emanating from that location are guaranteed to be safe. Dually whenever the existential error interpolant is implied by the current path, there is guaranteed to be an unsafe path from the location. We show how these interpolants are computed and applied in safety verification. We have implemented our approach in a tool named InterpChecker by building on an open source software model checker. Experiments on a large number of benchmark programs show that both the interpolations and the auxiliary optimization strategies are effective in improving scalability of software model checking.", "doi": "10.1109/ase.2017.8115631", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115631", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115631"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115631"}
{"title": "Proof-based coverage metrics for formal verification", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Elaheh Ghassabani", "Andrew Gacek", "Michael W. Whalen", "Mats Per Erik Heimdahl", "Lucas G. Wagner"], "abstract": "When using formal verification on critical software, an important question involves whether we have we specified enough properties for a given implementation model. To address this question, coverage metrics for property-based formal verification have been proposed. Existing metrics are usually based on mutation, where the implementation model is repeatedly modified and re-analyzed to determine whether mutant models are \"killed\" by the property set. These metrics tend to be very expensive to compute, as they involve many additional verification problems. This paper proposes an alternate family of metrics that can be computed using the recently introduced idea of Inductive Validity Cores (IVCs). IVCs determine a minimal set of model elements necessary to establish a proof. One of the proposed metrics is both rigorous and substantially cheaper to compute than mutation-based metrics. In addition, unlike the mutation-based techniques, the design elements marked as necessary by the metric are guaranteed to preserve provability. We demonstrate the metrics on a large corpus of examples.", "doi": "10.1109/ase.2017.8115632", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115632", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115632"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115632"}
{"title": "Model checker execution reports", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rodrigo Castaño", "Víctor A. Braberman", "Diego Garbervetsky", "Sebastián Uchitel"], "abstract": "Software model checking constitutes an undecidable problem and, as such, even an ideal tool will in some cases fail to give a conclusive answer. In practice, software model checkers fail often and usually do not provide any information on what was effectively checked. The purpose of this work is to provide a conceptual framing to extend software model checkers in a way that allows users to access information about incomplete checks. We characterize the information that model checkers themselves can provide, in terms of analyzed traces, i.e. sequences of statements, and safe canes, and present the notion of execution reports (ERs), which we also formalize. We instantiate these concepts for a family of techniques based on Abstract Reachability Trees and implement the approach using the software model checker CPAchecker. We evaluate our approach empirically and provide examples to illustrate the ERs produced and the information that can be extracted.", "doi": "10.1109/ase.2017.8115633", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115633", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115633"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115633"}
{"title": "Modular verification of interrupt-driven software", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chungha Sung", "Markus Kusano", "Chao Wang"], "abstract": "Interrupts have been widely used in safety-critical computer systems to handle outside stimuli and interact with the hardware, but reasoning about interrupt-driven software remains a difficult task. Although a number of static verification techniques have been proposed for interrupt-driven software, they often rely on constructing a monolithic verification model. Furthermore, they do not precisely capture the complete execution semantics of interrupts such as nested invocations of interrupt handlers. To overcome these limitations, we propose an abstract interpretation framework for static verification of interrupt-driven software that first analyzes each interrupt handler in isolation as if it were a sequential program, and then propagates the result to other interrupt handlers. This iterative process continues until results from all interrupt handlers reach a fixed point. Since our method never constructs the global model, it avoids the up-front blowup in model construction that hampers existing, non-modular, verification techniques. We have evaluated our method on 35 interrupt-driven applications with a total of 22,541 lines of code. Our results show the method is able to quickly and more accurately analyze the behavior of interrupts.", "doi": "10.1109/ase.2017.8115634", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115634", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115634"], "github": ["https://github.com/sch8906/intAbs"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115634"}
{"title": "BProVe: a formal verification framework for business process models", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Flavio Corradini", "Fabrizio Fornari", "Andrea Polini", "Barbara Re", "Francesco Tiezzi", "Andrea Vandin"], "abstract": "Business Process Modelling has acquired increasing relevance in software development. Available notations, such as BPMN, permit to describe activities of complex organisations. On the one hand, this shortens the communication gap between domain experts and IT specialists. On the other hand, this permits to clarify the characteristics of software systems introduced to provide automatic support for such activities. Nevertheless, the lack of formal semantics hinders the automatic verification of relevant properties. This paper presents a novel verification framework for BPMN 2.0, called BProVe. It is based on an operational semantics, implemented using MAUDE, devised to make the verification general and effective. A complete tool chain, based on the Eclipse modelling environment, allows for rigorous modelling and analysis of Business Processes. The approach has been validated using more than one thousand models available on a publicly accessible repository. Besides showing the performance of BProVe, this validation demonstrates its practical benefits in identifying correctness issues in real models.", "doi": "10.1109/ase.2017.8115635", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115635", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115635"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115635"}
{"title": "Static detection of asymptotic resource side-channel vulnerabilities in web applications", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jia Chen", "Oswaldo Olivo", "Isil Dillig", "Calvin Lin"], "abstract": "Web applications can leak confidential user information due to the presence of unintended side-channel vulnerabilities in code. One particularly subtle class of side-channel vulnerabilities arises due to resource usage imbalances along different execution paths of a program. Such side-channel vulnerabilities are especially severe if the resource usage imbalance is asymptotic. This paper formalizes the notion of asymptotic resource side-channels and presents a lightweight static analysis algorithm for automatically detecting them. Based on these ideas, we have developed a tool called SCANNER that detects resource-related side-channel vulnerabilities in PHP applications. SCANNER has found 18 zero-day security vulnerabilities in 10 different web applications and reports only 2 false positives. The vulnerabilities uncovered by SCANNER can be exploited using cross-site search attacks to extract various kinds of confidential information, such as a user's medications or purchase history.", "doi": "10.1109/ase.2017.8115636", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115636", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115636"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115636"}
{"title": "PAD: programming third-party web advertisement censorship", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Weihang Wang", "Yonghwi Kwon", "Yunhui Zheng", "Yousra Aafer", "I Luk Kim", "Wen-Chuan Lee", "Yingqi Liu", "Weijie Meng", "Xiangyu Zhang", "Patrick Eugster"], "abstract": "In the current online advertisement delivery, an ad slot on a publisher's website may go through multiple layers of bidding and reselling until the final ad content is delivered. The publishers have little control on the ads being displayed on their web pages. As a result, website visitors may suffer from unwanted ads such as malvertising, intrusive ads, and information disclosure ads. Unfortunately, the visitors often blame the publisher for their unpleasant experience and switch to competitor websites. In this paper, we propose a novel programming support system for ad delivery, called PAD, for publisher programmers, who specify their policies on regulating third-party ads shown on their websites. PAD features an expressive specification language and a novel persistent policy enforcement runtime that can self-install and self-protect throughout the entire ad delegation chain. It also provides an ad-specific memory protection scheme that prevents malvertising by corrupting malicious payloads. Our experiments show that PAD has negligible runtime overhead. It effectively suppresses a set of malvertising cases and unwanted ad behaviors reported in the real world, without affecting normal functionalities and regular ads.", "doi": "10.1109/ase.2017.8115637", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115637", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115637"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115637"}
{"title": "All about activity injection: threats, semantics, and detection", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sungho Lee", "Sungjae Hwang", "Sukyoung Ryu"], "abstract": "Android supports seamless user experience by maintaining activities from different apps in the same activity stack. While such close inter-app communication is essential in the Android framework, the powerful inter-app communication contains vulnerabilities that can inject malicious activities into a victim app's activity stack to hijack user interaction flows. In this paper, we demonstrate activity injection attacks with a simple malware, and formally specify the activity activation mechanism using operational semantics. Based on the operational semantics, we develop a static analysis tool, which analyzes Android apps to detect activity injection attacks. Our tool is fast enough to analyze real-world Android apps in 6 seconds on average, and our experiments found that 1,761 apps out of 129,756 real-world Android apps inject their activities into other apps' tasks.", "doi": "10.1109/ase.2017.8115638", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115638", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115638"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115638"}
{"title": "Detecting information flow by mutating input data", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Björn Mathis", "Vitalii Avdiienko", "Ezekiel O. Soremekun", "Marcel Böhme", "Andreas Zeller"], "abstract": "Analyzing information flow is central in assessing the security of applications. However, static and dynamic analyses of information flow are easily challenged by non-available or obscure code. We present a lightweight mutation-based analysis that systematically mutates dynamic values returned by sensitive sources to assess whether the mutation changes the values passed to sensitive sinks. If so, we found a flow between source and sink. In contrast to existing techniques, mutation-based flow analysis does not attempt to identify the specific path of the flow and is thus resilient to obfuscation. In its evaluation, our MUTAFLOW prototype for Android programs showed that mutation-based flow analysis is a lightweight yet effective complement to existing tools. Compared to the popular FlowDroid static analysis tool, MutaFlow requires less than 10% of source code lines but has similar accuracy; on 20 tested real-world apps, it is able to detect 75 flows that FlowDroid misses.", "doi": "10.1109/ase.2017.8115639", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115639", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115639"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115639"}
{"title": "Automatically assessing crashes from heap overflows", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Liang He", "Yan Cai", "Hong Hu", "Purui Su", "Zhenkai Liang", "Yi Yang", "Huafeng Huang", "Jia Yan", "Xiangkun Jia", "Dengguo Feng"], "abstract": "Heap overflow is one of the most widely exploited vulnerabilities, with a large number of heap overflow instances reported every year. It is important to decide whether a crash caused by heap overflow can be turned into an exploit. Efficient and effective assessment of exploitability of crashes facilitates to identify severe vulnerabilities and thus prioritize resources. In this paper, we propose the first metrics to assess heap overflow crashes based on both the attack aspect and the feasibility aspect. We further present HCSIFTER, a novel solution to automatically assess the exploitability of heap overflow instances under our metrics. Given a heap-based crash, HCSIFTER accurately detects heap overflows through dynamic execution without any source code or debugging information. Then it uses several novel methods to extract program execution information needed to quantify the severity of the heap overflow using our metrics. We have implemented a prototype HCSIFTER and applied it to assess nine programs with heap overflow vulnerabilities. HCSIFTER successfully reports that five heap overflow vulnerabilities are highly exploitable and two overflow vulnerabilities are unlikely exploitable. It also gave quantitatively assessments for other two programs. On average, it only takes about two minutes to assess one heap overflow crash. The evaluation result demonstrates both effectiveness and efficiency of HC Sifter.", "doi": "10.1109/ase.2017.8115640", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115640", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115640"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115640"}
{"title": "Learning to share: engineering adaptive decision-support for online social networks", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yasmin Rafiq", "Luke Dickens", "Alessandra Russo", "Arosha K. Bandara", "Mu Yang", "Avelie Stuart", "Mark Levine", "Gul Calikli", "Blaine A. Price", "Bashar Nuseibeh"], "abstract": "Some online social networks (OSNs) allow users to define friendship-groups as reusable shortcuts for sharing information with multiple contacts. Posting exclusively to a friendship-group gives some privacy control, while supporting communication with (and within) this group. However, recipients of such posts may want to reuse content for their own social advantage, and can bypass existing controls by copy-pasting into a new post; this cross-posting poses privacy risks. This paper presents a learning to share approach that enables the incorporation of more nuanced privacy controls into OSNs. Specifically, we propose a reusable, adaptive software architecture that uses rigorous runtime analysis to help OSN users to make informed decisions about suitable audiences for their posts. This is achieved by supporting dynamic formation of recipient-groups that benefit social interactions while reducing privacy risks. We exemplify the use of our approach in the context of Facebook.", "doi": "10.1109/ase.2017.8115641", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115641", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115641"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115641"}
{"title": "UI driven Android application reduction", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jianjun Huang", "Yousra Aafer", "David Mitchel Perry", "Xiangyu Zhang", "Chen Tian"], "abstract": "While smartphones and mobile apps have been an integral part of our life, modern mobile apps tend to contain a lot of rarely used functionalities. For example, applications contain advertisements and offer extra features such as recommended news stories in weather apps. While these functionalities are not essential to an app, they nonetheless consume power, CPU cycles and bandwidth. In this paper, we design a UI driven approach that allows customizing an Android app by removing its unwanted functionalities. In particular, our technique displays the UI and allows the user to select elements denoting functionalities that she wants to remove. Using this information, our technique automatically removes all the code elements related to the selected functionalities, including all the relevant background tasks. The underlying analysis is a type system, in which each code element is tagged with a type indicating if it should be removed. From the UI hints, our technique infers types for all other code elements and reduces the app accordingly. We implement a prototype and evaluate it on 10 real-world Android apps. The results show that our approach can accurately discover the removable code elements and lead to substantial resource savings in the reduced apps.", "doi": "10.1109/ase.2017.8115642", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115642", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115642"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115642"}
{"title": "SimplyDroid: efficient event sequence simplification for Android application", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bo Jiang", "Yuxuan Wu", "Teng Li", "W. K. Chan"], "abstract": "To ensure the quality of Android applications, many automatic test case generation techniques have been proposed. Among them, the Monkey fuzz testing tool and its variants are simple, effective and widely applicable. However, one major drawback of those Monkey tools is that they often generate many events in a failure-inducing input trace, which makes the follow-up debugging activities hard to apply. It is desirable to simplify or reduce the input event sequence while triggering the same failure. In this paper, we propose an efficient event trace representation and the SimplyDroid tool with three hierarchical delta-debugging algorithms each operating on this trace representation to simplify crash traces. We have evaluated SimplyDroid on a suite of real-life Android applications with 92 crash traces. The empirical result shows that our new algorithms in SimplyDroid are both efficient and effective in reducing these event traces.", "doi": "10.1109/ase.2017.8115643", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115643", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115643"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115643"}
{"title": "Automated cross-platform inconsistency detection for mobile apps", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mattia Fazzini", "Alessandro Orso"], "abstract": "Testing of Android apps is particularly challenging due to the fragmentation of the Android ecosystem in terms of both devices and operating system versions. Developers must in fact ensure not only that their apps behave as expected, but also that the apps' behavior is consistent across platforms. To support this task, we propose DiffDroid, a new technique that helps developers automatically find cross-platform inconsistencies (CPIs) in mobile apps. DiffDroid combines input generation and differential testing to compare the behavior of an app on different platforms and identify possible inconsistencies. Given an app, DiffDroid (1) generates test inputs for the app, (2) runs the app with these inputs on a reference device and builds a model of the app behavior, (3) runs the app with the same inputs on a set of other devices, and (4) compares the behavior of the app on these different devices with the model of its behavior on the reference device. We implemented DiFFDRoiD and performed an evaluation of our approach on 5 benchmarks and over 130 platforms. our results show that DiFFDRoiD can identify CPis on real apps efficiently and with a limited number of false positives. DiFFDRoiD and our experimental infrastructure are publicly available.", "doi": "10.1109/ase.2017.8115644", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115644", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115644"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115644"}
{"title": "In-memory fuzzing for binary code similarity analysis", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shuai Wang", "Dinghao Wu"], "abstract": "Detecting similar functions in binary executables serves as a foundation for many binary code analysis and reuse tasks. By far, recognizing similar components in binary code remains a challenge. Existing research employs either static or dynamic approaches to capture program syntax or semantics-level features for comparison. However, there exist multiple design limitations in previous work, which result in relatively high cost, low accuracy and scalability, and thus severely impede their practical use. In this paper, we present a novel method that leverages in-memory fuzzing for binary code similarity analysis. Our prototype tool IMF-SIM applies in-memory fuzzing to launch analysis towards every function and collect traces of different kinds of program behaviors. The similarity score of two behavior traces is computed according to their longest common subsequence. To compare two functions, a feature vector is generated, whose elements are the similarity scores of the behavior trace-level comparisons. We train a machine learning model through labeled feature vectors; later, for a given feature vector by comparing two functions, the trained model gives a final score, representing the similarity score of the two functions. We evaluate IMF-SIM against binaries compiled by different compilers, optimizations, and commonly-used obfuscation methods, in total over one thousand binary executables. Our evaluation shows that IMF-SIM notably outperforms existing tools with higher accuracy and broader application scopes.", "doi": "10.1109/ase.2017.8115645", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115645", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115645"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115645"}
{"title": "DSIbin: identifying dynamic data structures in C/C++ binaries", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Rupprecht", "Xi Chen", "David H. White", "Jan H. Boockmann", "Gerald Lüttgen", "Herbert Bos"], "abstract": "Reverse engineering binary code is notoriously difficult and, especially, understanding a binary's dynamic data structures. Existing data structure analyzers are limited wrt. program comprehension: they do not detect complex structures such as skip lists, or lists running through nodes of different types such as in the Linux kernel's cyclic doubly-linked list. They also do not reveal complex parent-child relationships between structures. The tool DSI remedies these shortcomings but requires source code, where type information on heap nodes is available. We present DSIbin, a combination of DSI and the type excavator Howard for the inspection of C/C++ binaries. While a naive combination already improves upon related work, its precision is limited because Howard's inferred types are often too coarse. To address this we auto-generate candidates of refined types based on speculative nested-struct detection and type merging; the plausibility of these hypotheses is then validated by DSI. We demonstrate via benchmarking that DSIbin detects data structures with high precision.", "doi": "10.1109/ase.2017.8115646", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115646", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115646"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115646"}
{"title": "Towards robust instruction-level trace alignment of binary code", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ulf Kargén", "Nahid Shahmehri"], "abstract": "Program trace alignment is the process of establishing a correspondence between dynamic instruction instances in executions of two semantically similar but syntactically different programs. In this paper we present what is, to the best of our knowledge, the first method capable of aligning realistically long execution traces of real programs. To maximize generality, our method works entirely on the machine code level, i.e. it does not require access to source code. Moreover, the method is based entirely on dynamic analysis, which avoids the many challenges associated with static analysis of binary code, and which additionally makes our approach inherently resilient to e.g. static code obfuscation. Therefore, we believe that our trace alignment method could prove to be a useful aid in many program analysis tasks, such as debugging, reverse-engineering, investigating plagiarism, and malware analysis. We empirically evaluate our method on 11 popular Linux programs, and show that it is capable of producing meaningful alignments in the presence of various code transformations such as optimization or obfuscation, and that it easily scales to traces with tens of millions of instructions.", "doi": "10.1109/ase.2017.8115647", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115647", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115647"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115647"}
{"title": "Testing intermediate representations for binary analysis", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Soomin Kim", "Markus Faerevaag", "Minkyu Jung", "Seungil Jung", "DongYeop Oh", "JongHyup Lee", "Sang Kil Cha"], "abstract": "Binary lifting, which is to translate a binary executable to a high-level intermediate representation, is a primary step in binary analysis. Despite its importance, there are only few existing approaches to testing the correctness of binary lifters. Furthermore, the existing approaches suffer from low test coverage, because they largely depend on random test case generation. In this paper, we present the design and implementation of the first systematic approach to testing binary lifters. We have evaluated the proposed system on 3 state-of-the-art binary lifters, and found 24 previously unknown semantic bugs. Our result demonstrates that writing a precise binary lifter is extremely difficult even for those heavily tested projects.", "doi": "10.1109/ase.2017.8115648", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115648", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115648"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115648"}
{"title": "Comprehensive failure characterization", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mitchell J. Gerrard", "Matthew B. Dwyer"], "abstract": "There is often more than one way to trigger a fault. Standard static and dynamic approaches focus on exhibiting a single witness for a failing execution. In this paper, we study the problem of computing a comprehensive characterization which safely bounds all failing program behavior while exhibiting a diversity of witnesses for those failures. This information can be used to facilitate software engineering tasks ranging from fault localization and repair to quantitative program analysis for reliability. Our approach combines the results of overapproximating and underapproximating static analyses in an alternating iterative framework to produce upper and lower bounds on the failing input space of a program, which we call a comprehensive failure characterization (CFC). We evaluated a prototype implementation of this alternating framework on a set of 168 C programs from the SV-COMP benchmarks, and the data indicate that it is possible to efficiently, accurately, and safely characterize failure spaces.", "doi": "10.1109/ase.2017.8115649", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115649", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115649"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115649"}
{"title": "TrEKer: tracing error propagation in operating system kernels", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nicolas Coppik", "Oliver Schwahn", "Stefan Winter", "Neeraj Suri"], "abstract": "Modern operating systems (OSs) consist of numerous interacting components, many of which are developed and maintained independently of one another. In monolithic systems, the boundaries of and interfaces between such components are not strictly enforced at runtime. Therefore, faults in individual components may directly affect other parts of the system in various ways. Software fault injection (SFI) is a testing technique to assess the resilience of a software system in the presence of faulty components. Unfortunately, SFI tests of OSs are inconclusive if they do not lead to observable failures, as corruptions of the internal software state may not be visible at its interfaces and, yet, affect the subsequent execution of the OS beyond the duration of the test. In this paper we present TrEKer, a fully automated approach for identifying how faulty OS components affect other parts of the system. TrEKer combines static and dynamic analyses to achieve efficient tracing on the granularity of memory accesses. We demonstrate TrEKer's ability to support SFI oracles by accurately tracing the effects of faults injected into three widely used Linux kernel modules.", "doi": "10.1109/ase.2017.8115650", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115650", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115650"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115650"}
{"title": "RuntimeSearch: Ctrl+F for a running program", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Matús Sulír", "Jaroslav Porubän"], "abstract": "  Developers often try to find occurrences of a certain term in a software\nsystem. Traditionally, a text search is limited to static source code files. In\nthis paper, we introduce a simple approach, RuntimeSearch, where the given term\nis searched in the values of all string expressions in a running program. When\na match is found, the program is paused and its runtime properties can be\nexplored with a traditional debugger. The feasibility and usefulness of\nRuntimeSearch is demonstrated on a medium-sized Java project.\n", "doi": "10.1109/ase.2017.8115651", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115651", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115651", "https://arxiv.org/pdf/1807.09679"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115651", "journal_ref": "Proceedings of the 32nd IEEE/ACM International Conference on\n  Automated Software Engineering (ASE), IEEE, 2017, pp. 388-393", "categories": "cs.SE cs.PL", "cited_by": 0}
{"title": "Mining implicit design templates for actionable code reuse", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yun Lin", "Guozhu Meng", "Yinxing Xue", "Zhenchang Xing", "Jun Sun", "Xin Peng", "Yang Liu", "Wenyun Zhao", "Jin Song Dong"], "abstract": "In this paper, we propose an approach to detecting project-specific recurring designs in code base and abstracting them into design templates as reuse opportunities. The mined templates allow programmers to make further customization for generating new code. The generated code involves the code skeleton of recurring design as well as the semi-implemented code bodies annotated with comments to remind programmers of necessary modification. We implemented our approach as an Eclipse plugin called MICoDe. We evaluated our approach with a reuse simulation experiment and a user study involving 16 participants. The results of our simulation experiment on 10 open source Java projects show that, to create a new similar feature with a design template, (1) on average 69% of the elements in the template can be reused and (2) on average 60% code of the new feature can be adopted from the template. Our user study further shows that, compared to the participants adopting the copy-paste-modify strategy, the ones using MICoDe are more effective to understand a big design picture and more efficient to accomplish the code reuse task.", "doi": "10.1109/ase.2017.8115652", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115652", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115652"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115652"}
{"title": "Exploring regular expression comprehension", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Carl Chapman", "Peipei Wang", "Kathryn T. Stolee"], "abstract": "The regular expression (regex) is a powerful tool employed in a large variety of software engineering tasks. However, prior work has shown that regexes can be very complex and that it could be difficult for developers to compose and understand them. This work seeks to identify code smells that impact comprehension. We conduct an empirical study on 42 pairs of behaviorally equivalent but syntactically different regexes using 180 participants and evaluate the understandability of various regex language features. We further analyze regexes in GitHub to find the community standards or the common usages of various features. We found that some regex expression representations are more understandable than others. For example, using a range (e.g., [0-9]) is often more understandable than a default character class (e.g., [\\d]). We also found that the DFA size of a regex significantly affects comprehension for the regexes studied. The larger the DFA of a regex (up to size eight), the more understandable it was. Finally, we identify smelly and non-smelly regex representations based on a combination of community standards and understandability metrics.", "doi": "10.1109/ase.2017.8115653", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115653", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115653"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115653"}
{"title": "Automatically assessing code understandability: how far are we?", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Simone Scalabrino", "Gabriele Bavota", "Christopher Vendome", "Mario Linares Vásquez", "Denys Poshyvanyk", "Rocco Oliveto"], "abstract": "Program understanding plays a pivotal role in software maintenance and evolution: a deep understanding of code is the stepping stone for most software-related activities, such as bug fixing or testing. Being able to measure the understandability of a piece of code might help in estimating the effort required for a maintenance activity, in comparing the quality of alternative implementations, or even in predicting bugs. Unfortunately, there are no existing metrics specifically designed to assess the understandability of a given code snippet. In this paper, we perform a first step in this direction, by studying the extent to which several types of metrics computed on code, documentation, and developers correlate with code understandability. To perform such an investigation we ran a study with 46 participants who were asked to understand eight code snippets each. We collected a total of 324 evaluations aiming at assessing the perceived understandability, the actual level of understanding, and the time needed to understand a code snippet. Our results demonstrate that none of the (existing and new) metrics we considered is able to capture code understandability, not even the ones assumed to assess quality attributes strongly related with it, such as code readability and complexity.", "doi": "10.1109/ase.2017.8115654", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115654", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115654"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115654"}
{"title": "Improved query reformulation for concept location using CodeRank and document structures", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Masudur Rahman", "Chanchal K. Roy"], "abstract": "During software maintenance, developers usually deal with a significant number of software change requests. As a part of this, they often formulate an initial query from the request texts, and then attempt to map the concepts discussed in the request to relevant source code locations in the software system (a.k.a., concept location). Unfortunately, studies suggest that they often perform poorly in choosing the right search terms for a change task. In this paper, we propose a novel technique-ACER-that takes an initial query, identifies appropriate search terms from the source code using a novel term weight-CodeRank, and then suggests effective reformulation to the initial query by exploiting the source document structures, query quality analysis and machine learning. Experiments with 1,675 baseline queries from eight subject systems report that our technique can improve 71% of the baseline queries which is highly promising. Comparison with five closely related existing techniques in query reformulation not only validates our empirical findings but also demonstrates the superiority of our technique.", "doi": "10.1109/ase.2017.8115655", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115655", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115655"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115655"}
{"title": "Understanding feature requests by leveraging fuzzy method and linguistic analysis", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lin Shi", "Celia Chen", "Qing Wang", "Shoubin Li", "Barry W. Boehm"], "abstract": "In open software development environment, a large number of feature requests with mixed quality are often posted by stakeholders and usually managed in issue tracking systems. Thoroughly understanding and analyzing the real intents that feature requests imply is a labor-intensive and challenging task. In this paper, we introduce an approach to understand feature requests automatically. We generate a set of fuzzy rules based on natural language processing techniques that classify each sentence in feature requests into a set of categories: Intent, Explanation, Benefit, Drawback, Example and Trivia. Consequently, the feature requests can be automatically structured based on the classification results. We conduct experiments on 2,112 sentences taken from 602 feature requests of nine popular open source projects. The results show that our method can reach a high performance on classifying sentences from feature requests. Moreover, when applying fuzzy rules on machine learning methods, the performance can be improved significantly.", "doi": "10.1109/ase.2017.8115656", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115656", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115656"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115656"}
{"title": "O2O service composition with social collaboration", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wenyi Qian", "Xin Peng", "Jun Sun", "Yijun Yu", "Bashar Nuseibeh", "Wenyun Zhao"], "abstract": "In Online-to-Offline (O2O) commerce, customer services may need to be composed from online and offline services. Such composition is challenging, as it requires effective selection of appropriate services that, in turn, support optimal combination of both online and offline services. In this paper, we address this challenge by proposing an approach to O2O service composition which combines offline route planning and social collaboration to optimize service selection. We frame general O2O service composition problems using timed automata and propose an optimization procedure that incorporates: (1) a Markov Chain Monte Carlo (MCMC) algorithm to stochastically select a concrete composite service, and (2) a model checking approach to searching for an optimal collaboration plan with the lowest cost given certain time constraint. Our procedure has been evaluated using the simulation of a rich scenario on effectiveness and scalability.", "doi": "10.1109/ase.2017.8115657", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115657", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115657"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115657"}
{"title": "Gremlin-ATL: a scalable model transformation framework", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gwendal Daniel", "Frédéric Jouault", "Gerson Sunyé", "Jordi Cabot"], "abstract": "Industrial use of Model Driven Engineering techniques has emphasized the need for efficiently store, access, and transform very large models. While scalable persistence frameworks, typically based on some kind of NoSQL database, have been proposed to solve the model storage issue, the same level of performance improvement has not been achieved for the model transformation problem. Existing model transformation tools (such as the well-known ATL) often require the input models to be loaded in memory prior to the start of the transformation and are not optimized to benefit from lazy-loading mechanisms, mainly due to their dependency on current low-level APIs offered by the most popular modeling frameworks nowadays. In this paper we present Gremlin-ATL, a scalable and efficient model-to-model transformation framework that translates ATL transformations into Gremlin, a query language supported by several NoSQL databases. With Gremlin-ATL, the transformation is computed within the database itself, bypassing the modeling framework limitations and improving its performance both in terms of execution time and memory consumption. Tool support is available online.", "doi": "10.1109/ase.2017.8115658", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115658", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115658"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115658"}
{"title": "Diagnosing assumption problems in safety-critical products", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mona Rahimi", "Wandi Xiong", "Jane Cleland-Huang", "Robyn R. Lutz"], "abstract": "Problems with the correctness and completeness of environmental assumptions contribute to many accidents in safety-critical systems. The problem is exacerbated when products are modified in new releases or in new products of a product line. In such cases existing sets of environmental assumptions are often carried forward without sufficiently rigorous analysis. This paper describes a new technique that exploits the traceability required by many certifying bodies to reason about the likelihood that environmental assumptions are omitted or incorrectly retained in new products. An analysis of over 150 examples of environmental assumptions in historical systems informs the approach. In an evaluation on three safety-related product lines the approach caught all but one of the assumption-related problems. It also provided clearly defined steps for mitigating the identified issues. The contribution of the work is to arm the safety analyst with useful information for assessing the validity of environmental assumptions for a new product.", "doi": "10.1109/ase.2017.8115659", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115659", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115659"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115659"}
{"title": "Software performance self-adaptation through efficient model predictive control", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Emilio Incerto", "Mirco Tribastone", "Catia Trubiani"], "abstract": "A key challenge in software systems that are exposed to runtime variabilities, such as workload fluctuations and service degradation, is to continuously meet performance requirements. In this paper we present an approach that allows performance self-adaptation using a system model based on queuing networks (QNs), a well-assessed formalism for software performance engineering. Software engineers can select the adaptation knobs of a QN (routing probabilities, service rates, and concurrency level) and we automatically derive a Model Predictive Control (MPC) formulation suitable to continuously configure the selected knobs and track the desired performance requirements. Previous MPC approaches have two main limitations: i) high computational cost of the optimization, due to nonlinearity of the models; ii) focus on long-run performance metrics only, due to the lack of tractable representations of the QN's time-course evolution. As a consequence, these limitations allow adaptations with coarse time granularities, neglecting the system's transient behavior. Our MPC adaptation strategy is efficient since it is based on mixed integer programming, which uses a compact representation of a QN with ordinary differential equations. An extensive evaluation on an implementation of a load balancer demonstrates the effectiveness of the adaptation and compares it with traditional methods based on probabilistic model checking.", "doi": "10.1109/ase.2017.8115660", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115660", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115660"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115660"}
{"title": "Transfer learning for performance modeling of configurable systems: an exploratory analysis", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pooyan Jamshidi", "Norbert Siegmund", "Miguel Velez", "Christian Kästner", "Akshay Patel", "Yuvraj Agarwal"], "abstract": "Modern software systems provide many configuration options which significantly influence their non-functional properties. To understand and predict the effect of configuration options, several sampling and learning strategies have been proposed, albeit often with significant cost to cover the highly dimensional configuration space. Recently, transfer learning has been applied to reduce the effort of constructing performance models by transferring knowledge about performance behavior across environments. While this line of research is promising to learn more accurate models at a lower cost, it is unclear why and when transfer learning works for performance modeling. To shed light on when it is beneficial to apply transfer learning, we conducted an empirical study on four popular software systems, varying software configurations and environmental conditions, such as hardware, workload, and software versions, to identify the key knowledge pieces that can be exploited for transfer learning. Our results show that in small environmental changes (e.g., homogeneous workload change), by applying a linear transformation to the performance model, we can understand the performance behavior of the target environment, while for severe environmental changes (e.g., drastic workload change) we can transfer only knowledge that makes sampling more efficient, e.g., by reducing the dimensionality of the configuration space.", "doi": "10.1109/ase.2017.8115661", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115661", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115661"], "github": ["https://github.com/pooyanjamshidi/ase17"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115661"}
{"title": "A comprehensive study of real-world numerical bug characteristics", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anthony Di Franco", "Hui Guo", "Cindy Rubio-González"], "abstract": "Numerical software is used in a wide variety of applications including safety-critical systems, which have stringent correctness requirements, and whose failures have catastrophic consequences that endanger human life. Numerical bugs are known to be particularly difficult to diagnose and fix, largely due to the use of approximate representations of numbers such as floating point. Understanding the characteristics of numerical bugs is the first step to combat them more effectively. In this paper, we present the first comprehensive study of real-world numerical bugs. Specifically, we identify and carefully examine 269 numerical bugs from five widely-used numerical software libraries: NumPy, SciPy, LAPACK, GNU Scientific Library, and Elemental. We propose a categorization of numerical bugs, and discuss their frequency, symptoms and fixes. Our study opens new directions in the areas of program analysis, testing, and automated program repair of numerical software, and provides a collection of real-world numerical bugs.", "doi": "10.1109/ase.2017.8115662", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115662", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115662"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115662"}
{"title": "A comprehensive study on real world concurrency bugs in Node.js", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jie Wang", "Wensheng Dou", "Yu Gao", "Chushu Gao", "Feng Qin", "Kang Yin", "Jun Wei"], "abstract": "Node.js becomes increasingly popular in building server-side JavaScript applications. It adopts an event-driven model, which supports asynchronous I/O and non-deterministic event processing. This asynchrony and non-determinism can introduce intricate concurrency bugs, and leads to unpredictable behaviors. An in-depth understanding of real world concurrency bugs in Node.js applications will significantly promote effective techniques in bug detection, testing and fixing for Node.js. In this paper, we present NodeCB, a comprehensive study on real world concurrency bugs in Node.js applications. Specifically, we have carefully studied 57 real bug cases from open-source Node.js applications, and have analyzed their bug characteristics, e.g., bug patterns and root causes, bug impacts, bug manifestation, and fix strategies. Through this study, we obtain several interesting findings, which may open up many new research directions in combating concurrency bugs in Node.js. For example, one finding is that two thirds of the bugs are caused by atomicity violation. However, due to lack of locks and transaction mechanism, Node.js cannot easily express and guarantee the atomic intention.", "doi": "10.1109/ase.2017.8115663", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115663", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115663"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115663"}
{"title": "Generating simpler AST edit scripts by considering copy-and-paste", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yoshiki Higo", "Akio Ohtani", "Shinji Kusumoto"], "abstract": "In software development, there are many situations in which developers need to understand given source code changes in detail. Until now, a variety of techniques have been proposed to support understanding source code changes. Tree-based differencing techniques are expected to have better understandability than text-based ones, which are widely used nowadays (e.g., diff in Unix). In this paper, we propose to consider copy-and-paste as a kind of editing action forming tree-based edit script, which is an editing sequence that transforms a tree to another one. Software developers often perform copy- and-paste when they are writing source code. Introducing copy- and-paste action into edit script contributes to not only making simpler (more easily understandable) edit scripts but also making edit scripts closer to developers' actual editing sequences. We conducted experiments on an open dataset. As a result, we confirmed that our technique made edit scripts shorter for 18% of the code changes with a little more computational time. For the other 82% code changes, our technique generated the same edit scripts as an existing technique. We also confirmed that our technique provided more helpful visualizations.", "doi": "10.1109/ase.2017.8115664", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115664", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115664"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115664"}
{"title": "Renaming and shifted code in structured merging: looking ahead for precision and performance", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Olaf Leßenich", "Sven Apel", "Christian Kästner", "Georg Seibt", "Janet Siegmund"], "abstract": "Diffing and merging of source-code artifacts is an essential task when integrating changes in software versions. While state-of-the-art line-based merge tools (e.g., git merge) are fast and independent of the programming language used, they have only a low precision. Recently, it has been shown that the precision of merging can be substantially improved by using a language-aware, structured approach that works on abstract syntax trees. But, precise structured merging is NP hard, especially, when considering the notoriously difficult scenarios of renamings and shifted code. To address these scenarios without compromising scalability, we propose a syntax-aware, heuristic optimization for structured merging that employs a lookahead mechanism during tree matching. The key idea is that renamings and shifted code are not arbitrarily distributed, but their occurrence follows patterns, which we address with a syntax-specific lookahead. Our experiments with 48 real-world open-source projects (4,878 merge scenarios with over 400 million lines of code) demonstrate that we can significantly improve matching precision in 28 percent of cases while maintaining performance.", "doi": "10.1109/ase.2017.8115665", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115665", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115665"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115665"}
{"title": "Semantics-assisted code review: an efficient toolchain and a user study", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Massimiliano Menarini", "Yan Yan", "William G. Griswold"], "abstract": "Code changes are often reviewed before they are deployed. Popular source control systems aid code review by presenting textual differences between old and new versions of the code, leaving developers with the difficult task of determining whether the differences actually produced the desired behavior. Fortunately, we can mine such information from code repositories. We propose aiding code review with inter-version semantic differential analysis. During review of a new commit, a developer is presented with summaries of both code differences and behavioral differences, which are expressed as diffs of likely invariants extracted by running the system's test cases. As a result, developers can more easily determine that the code changes produced the desired effect. We created an invariant-mining tool chain, Getty, to support our concept of semantically-assisted code review. To validate our approach, 1) we applied Getty to the commits of 6 popular open source projects, 2) we assessed the performance and cost of running Getty in different configurations, and 3) we performed a comparative user study with 18 developers. Our results demonstrate that semantically-assisted code review is feasible, effective, and that real programmers can leverage it to improve the quality of their reviews.", "doi": "10.1109/ase.2017.8115666", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115666", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115666"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115666"}
{"title": "Detecting unknown inconsistencies in web applications", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Frolin S. Ocariza Jr.", "Karthik Pattabiraman", "Ali Mesbah"], "abstract": "Although there has been increasing demand for more reliable web applications, JavaScript bugs abound in web applications. In response to this issue, researchers have proposed automated fault detection tools, which statically analyze the web application code to find bugs. While useful, these tools either only target a limited set of bugs based on predefined rules, or they do not detect bugs caused by cross-language interactions, which occur frequently in web application code. To address this problem, we present an anomaly-based inconsistency detection approach, implemented in a tool called HOLOCRON. The main novelty of our approach is that it does not look for hard-coded inconsistency classes. Instead, it applies subtree pattern matching to infer inconsistency classes and association rule mining to detect inconsistencies that occur both within a single language, and between two languages. We evaluated HOLOCRON, and it successfully detected 51 previously unreported inconsistencies - including 18 bugs and 33 code smells - in 12 web applications.", "doi": "10.1109/ase.2017.8115667", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115667", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115667"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115667"}
{"title": "Why and how JavaScript developers use linters", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kristín Fjóla Tómasdóttir", "Mauricio Finavaro Aniche", "Arie van Deursen"], "abstract": "Automatic static analysis tools help developers to automatically spot code issues in their software. They can be of extreme value in languages with dynamic characteristics, such as JavaScript, where developers can easily introduce mistakes which can go unnoticed for a long time, e.g. a simple syntactic or spelling mistake. Although research has already shown how developers perceive such tools for strongly-typed languages such as Java, little is known about their perceptions when it comes to dynamic languages. In this paper, we investigate what motivates and how developers make use of such tools in JavaScript projects. To that goal, we apply a qualitative research method to conduct and analyze a series of 15 interviews with developers responsible for the linter configuration in reputable OSS JavaScript projects that apply the most commonly used linter, ESLint. The results describe the benefits that developers obtain when using ESLint, the different ways one can configure the tool and prioritize its rules, and the existing challenges in applying linters in the real world. These results have direct implications for developers, tool makers, and researchers, such as tool improvements, and a research agenda that aims to increase our knowledge about the usefulness of such analyzers.", "doi": "10.1109/ase.2017.8115668", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115668", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115668"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115668"}
{"title": "Automatic testing of symbolic execution engines via program generation and differential testing", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Timotej Kapus", "Cristian Cadar"], "abstract": "Symbolic execution has attracted significant attention in recent years, with applications in software testing, security, networking and more. Symbolic execution tools, like CREST, KLEE, FuzzBALL, and Symbolic PathFinder, have enabled researchers and practitioners to experiment with new ideas, scale the technique to larger applications and apply it to new application domains. Therefore, the correctness of these tools is of critical importance. In this paper, we present our experience extending compiler testing techniques to find errors in both the concrete and symbolic execution components of symbolic execution engines. The approach used relies on a novel way to create program versions, in three different testing modes-concrete, single-path and multi-path-each exercising different features of symbolic execution engines. When combined with existing program generation techniques and appropriate oracles, this approach enables differential testing within a single symbolic execution engine. We have applied our approach to the KLEE, CREST and FuzzBALL symbolic execution engines, where it has discovered 20 different bugs exposing a variety of important errors having to do with the handling of structures, division, modulo, casting, vector instructions and more, as well as issues related to constraint solving, compiler optimisations and test input replay.", "doi": "10.1109/ase.2017.8115669", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115669", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115669"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115669"}
{"title": "Floating-point symbolic execution: a case study in n-version programming", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniel Liew", "Daniel Schemmel", "Cristian Cadar", "Alastair F. Donaldson", "Rafael Zähl", "Klaus Wehrle"], "abstract": "Symbolic execution is a well-known program analysis technique for testing software, which makes intensive use of constraint solvers. Recent support for floating-point constraint solving has made it feasible to support floating-point reasoning in symbolic execution tools. In this paper, we present the experience of two research teams that independently added floating-point support to KLEE, a popular symbolic execution engine. Since the two teams independently developed their extensions, this created the rare opportunity to conduct a rigorous comparison between the two implementations, essentially a modern case study on N-version programming. As part of our comparison, we report on the different design and implementation decisions taken by each team, and show their impact on a rigorously assembled and tested set of benchmarks, itself a contribution of the paper.", "doi": "10.1109/ase.2017.8115670", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115670", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115670"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115670"}
{"title": "Rethinking pointer reasoning in symbolic execution", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Emilio Coppa", "Daniele Cono D'Elia", "Camil Demetrescu"], "abstract": "Symbolic execution is a popular program analysis technique that allows seeking for bugs by reasoning over multiple alternative execution states at once. As the number of states to explore may grow exponentially, a symbolic executor may quickly run out of space. For instance, a memory access to a symbolic address may potentially reference the entire address space, leading to a combinatorial explosion of the possible resulting execution states. To cope with this issue, state-of-the-art executors concretize symbolic addresses that span memory intervals larger than some threshold. Unfortunately, this could result in missing interesting execution states, e.g., where a bug arises. In this paper we introduce MEMSIGHT, a new approach to symbolic memory that reduces the need for concretization, hence offering the opportunity for broader state explorations and more precise pointer reasoning. Rather than mapping address instances to data as previous tools do, our technique maps symbolic address expressions to data, maintaining the possible alternative states resulting from the memory referenced by a symbolic address in a compact, implicit form. A preliminary experimental investigation on prominent benchmarks from the DARPA Cyber Grand Challenge shows that MemSight enables the exploration of states unreachable by previous techniques.", "doi": "10.1109/ase.2017.8115671", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115671", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115671"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115671"}
{"title": "Leveraging abstract interpretation for efficient dynamic symbolic execution", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eman Alatawi", "Harald Søndergaard", "Tim Miller"], "abstract": "Dynamic Symbolic Execution (DSE) is a technique to automatically generate test inputs by executing a program with concrete and symbolic values simultaneously. A key challenge in DSE is scalability; executing all feasible program paths is not possible, owing to the potentially exponential or infinite number of paths. Loops are a main source of path explosion, in particular where the number of iterations depends on a program's input. Problems arise because DSE maintains symbolic values that capture only the dependencies on symbolic inputs. This ignores control dependencies, including loop dependencies that depend indirectly on the inputs. We propose a method to increase the coverage achieved by DSE in the presence of input-data dependent loops and loop dependent branches. We combine DSE with abstract interpretation to find indirect control dependencies, including loop and branch indirect dependencies. Preliminary results show that this results in better coverage, within considerably less time compared to standard DSE.", "doi": "10.1109/ase.2017.8115672", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115672", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115672"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115672"}
{"title": "Tortoise: interactive system configuration repair", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Aaron Weiss", "Arjun Guha", "Yuriy Brun"], "abstract": "  System configuration languages provide powerful abstractions that simplify\nmanaging large-scale, networked systems. Thousands of organizations now use\nconfiguration languages, such as Puppet. However, specifications written in\nconfiguration languages can have bugs and the shell remains the simplest way to\ndebug a misconfigured system. Unfortunately, it is unsafe to use the shell to\nfix problems when a system configuration language is in use: a fix applied from\nthe shell may cause the system to drift from the state specified by the\nconfiguration language. Thus, despite their advantages, configuration languages\nforce system administrators to give up the simplicity and familiarity of the\nshell.\n  This paper presents a synthesis-based technique that allows administrators to\nuse configuration languages and the shell in harmony. Administrators can fix\nerrors using the shell and the technique automatically repairs the higher-level\nspecification written in the configuration language. The approach (1) produces\nrepairs that are consistent with the fix made using the shell; (2) produces\nrepairs that are maintainable by minimizing edits made to the original\nspecification; (3) ranks and presents multiple repairs when relevant; and (4)\nsupports all shells the administrator may wish to use. We implement our\ntechnique for Puppet, a widely used system configuration language, and evaluate\nit on a suite of benchmarks under 42 repair scenarios. The top-ranked repair is\nselected by humans 76% of the time and the human-equivalent repair is ranked\n1.31 on average.\n", "doi": "10.1109/ase.2017.8115673", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115673", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115673", "https://arxiv.org/pdf/1709.05366"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115673", "journal_ref": "in Proceedings of the 32nd IEEE/ACM International Conference on\n  Automated Software Engineering (ASE), 2017, pp. 625-636", "categories": "cs.SE", "cited_by": 0}
{"title": "Contract-based program repair without the contracts", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Liushan Chen", "Yu Pei", "Carlo A. Furia"], "abstract": "Automated program repair (APR) is a promising approach to automatically fixing software bugs. Most APR techniques use tests to drive the repair process; this makes them readily applicable to realistic code bases, but also brings the risk of generating spurious repairs that overfit the available tests. Some techniques addressed the overfitting problem by targeting code using contracts (such as pre- and postconditions), which provide additional information helpful to characterize the states of correct and faulty computations; unfortunately, mainstream programming languages do not normally include contract annotations, which severely limits the applicability of such contract-based techniques. This paper presents JAID, a novel APR technique for Java programs, which is capable of constructing detailed state abstractions-similar to those employed by contract-based techniques-that are derived from regular Java code without any special annotations. Grounding the repair generation and validation processes on rich state abstractions mitigates the overfitting problem, and helps extend APR's applicability: in experiments with the DEFECTS4J benchmark, a prototype implementation of JAID produced genuinely correct repairs, equivalent to those written by programmers, for 25 bugs-improving over the state of the art of comparable Java APR techniques in the number and kinds of correct fixes.", "doi": "10.1109/ase.2017.8115674", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115674", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115674"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115674"}
{"title": "ELIXIR: effective object oriented program repair", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ripon K. Saha", "Yingjun Lyu", "Hiroaki Yoshida", "Mukul R. Prasad"], "abstract": "  This work is motivated by the pervasive use of method invocations in\nobject-oriented (OO) programs, and indeed their prevalence in patches of\nOO-program bugs. We propose a generate-and-validate repair technique, called\nELIXIR designed to be able to generate such patches. ELIXIR aggressively uses\nmethod calls, on par with local variables, fields, or constants, to construct\nmore expressive repair-expressions, that go into synthesizing patches. The\nensuing enlargement of the repair space, on account of the wider use of method\ncalls, is effectively tackled by using a machine-learnt model to rank concrete\nrepairs. The machine-learnt model relies on four features derived from the\nprogram context, i.e., the code surrounding the potential repair location, and\nthe bug report. We implement ELIXIR and evaluate it on two datasets, the\npopular Defects4J dataset and a new dataset Bugs.jar created by us, and against\n2 baseline versions of our technique, and 5 other techniques representing the\nstate of the art in program repair. Our evaluation shows that ELIXIR is able to\nincrease the number of correctly repaired bugs in Defects4J by 85% (from 14 to\n26) and by 57% in Bugs.jar (from 14 to 22), while also significantly\nout-performing other state-of-the-art repair techniques including ACS,\nHD-Repair, NOPOL, PAR, and jGenProg.\n", "doi": "10.1109/ase.2017.8115675", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115675", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115675", "https://arxiv.org/pdf/2112.10915"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115675", "journal_ref": "32nd IEEE/ACM International Conference on Automated Software\n  Engineering (ASE) 2017 Oct 30 (pp. 648-659). IEEE", "categories": "cs.SE", "cited_by": 0}
{"title": "Leveraging syntax-related code for automated program repair", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qi Xin", "Steven P. Reiss"], "abstract": "We present our automated program repair technique ssFix which leverages existing code (from a code database) that is syntax-related to the context of a bug to produce patches for its repair. Given a faulty program and a fault-exposing test suite, ssFix does fault localization to identify suspicious statements that are likely to be faulty. For each such statement, ssFix identifies a code chunk (or target chunk) including the statement and its local context. ssFix works on the target chunk to produce patches. To do so, it first performs syntactic code search to find candidate code chunks that are syntax-related, i.e., structurally similar and conceptually related, to the target chunk from a code database (or codebase) consisting of the local faulty program and an external code repository. ssFix assumes the correct fix to be contained in the candidate chunks, and it leverages each candidate chunk to produce patches for the target chunk. To do so, ssFix translates the candidate chunk by unifying the names used in the candidate chunk with those in the target chunk; matches the chunk components (expressions and statements) between the translated candidate chunk and the target chunk; and produces patches for the target chunk based on the syntactic differences that exist between the matched components and in the unmatched components. ssFix finally validates the patched programs generated against the test suite and reports the first one that passes the test suite. We evaluated ssFix on 357 bugs in the Defects4J bug dataset. Our results show that ssFix successfully repaired 20 bugs with valid patches generated and that it outperformed five other repair techniques for Java.", "doi": "10.1109/ase.2017.8115676", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115676", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115676"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115676"}
{"title": "Boosting complete-code tool for partial program", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hao Zhong", "Xiaoyin Wang"], "abstract": "To improve software quality, researchers and practitioners have proposed static analysis tools for various purposes (e.g., detecting bugs, anomalies, and vulnerabilities). Although many such tools are powerful, they typically need complete programs where all the code names (e.g., class names, method names) are resolved. In many scenarios, researchers have to analyze partial programs in bug fixes (the revised source files can be viewed as a partial program), tutorials, and code search results. As a partial program is a subset of a complete program, many code names in partial programs are unknown. As a result, despite their syntactical correctness, existing complete-code tools cannot analyze partial programs, and existing partial-code tools are limited in both their number and analysis capability. Instead of proposing another tool for analyzing partial programs, we propose a general approach, called GRAPA, that boosts existing tools for complete programs to analyze partial programs. Our major insight is that after unknown code names are resolved, tools for complete programs can analyze partial programs with minor modifications. In particular, GRAPA locates Java archive files to resolve unknown code names, and resolves the remaining unknown code names from resolved code names. To illustrate GRAPA, we implement a tool that leverages the state-of-the-art tool, WALA, to analyze Java partial programs. We thus implemented the first tool that is able to build system dependency graphs for partial programs, complementing existing tools. We conduct an evaluation on 8,198 partial-code commits from four popular open source projects. Our results show that GRAPA fully resolved unknown code names for 98.5% bug fixes, with an accuracy of 96.1% in total. Furthermore, our results show the significance of GRAPA's internal techniques, which provides insights on how to integrate with more complete-code tools to analyze partial programs.", "doi": "10.1109/ase.2017.8115677", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115677", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115677"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115677"}
{"title": "A language model for statements of software code", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yixiao Yang", "Yu Jiang", "Ming Gu", "Jiaguang Sun", "Jian Gao", "Han Liu"], "abstract": "Building language models for source code enables a large set of improvements on traditional software engineering tasks. One promising application is automatic code completion. State-of-the-art techniques capture code regularities at token level with lexical information. Such language models are more suitable for predicting short token sequences, but become less effective with respect to long statement level predictions. In this paper, we have proposed PCC to optimize the token-level based language modeling. Specifically, PCC introduced an intermediate representation (IR) for source code, which puts tokens into groups using lexeme and variable relative order. In this way, PCC is able to handle long token sequences, i.e., group sequences, to suggest a complete statement with the precise synthesizer. Further more, PCC employed a fuzzy matching technique which combined genetic and longest common subsequence algorithms to make the prediction more accurate. We have implemented a code completion plugin for Eclipse and evaluated it on open-source Java projects. The results have demonstrated the potential of PCC in generating precise long statement level predictions. In 30%-60% of the cases, it can correctly suggest the complete statement with only six candidates, and 40%-90% of the cases with ten candidates.", "doi": "10.1109/ase.2017.8115678", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115678", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115678"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115678"}
{"title": "Context-aware integrated development environment command recommender systems", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marko Gasparic", "Tural Gurbanov", "Francesco Ricci"], "abstract": "Integrated development environments (IDEs) are complex applications that integrate multiple tools for creating and manipulating software project artifacts. To improve users' knowledge and the effectiveness of usage of the available functionality, the inclusion of recommender systems into IDEs has been proposed. We present a novel IDE command recommendation algorithm that, by taking into account the contexts in which a developer works and in which different commands are usually executed, is able to provide relevant recommendations. We performed an empirical comparison of the proposed algorithm with state-of-the-art IDE command recommenders on a real-world data set. The algorithms were evaluated in terms of precision, recall, F1, k-tail, and with a new evaluation metric that is specifically measuring the usefulness of contextual recommendations. The experiments revealed that in terms of the contextual relevance and usefulness of recommendations the proposed algorithm outperforms existing algorithms.", "doi": "10.1109/ase.2017.8115679", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115679", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115679"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115679"}
{"title": "Predicting relevance of change recommendations", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Rolfsnes", "Leon Moonen", "David W. Binkley"], "abstract": "Software change recommendation seeks to suggest artifacts (e.g., files or methods) that are related to changes made by a developer, and thus identifies possible omissions or next steps. While one obvious challenge for recommender systems is to produce accurate recommendations, a complimentary challenge is to rank recommendations based on their relevance. In this paper, we address this challenge for recommendation systems that are based on evolutionary coupling. Such systems use targeted association-rule mining to identify relevant patterns in a software system's change history. Traditionally, this process involves ranking artifacts using interestingness measures such as confidence and support. However, these measures often fall short when used to assess recommendation relevance. We propose the use of random forest classification models to assess recommendation relevance. This approach improves on past use of various interestingness measures by learning from previous change recommendations. We empirically evaluate our approach on fourteen open source systems and two systems from our industry partners. Furthermore, we consider complimenting two mining algorithms: Co-Change and Tarmaq. The results find that random forest classification significantly outperforms previous approaches, receives lower Brier scores, and has superior trade-off between precision and recall. The results are consistent across software system and mining algorithm.", "doi": "10.1109/ase.2017.8115680", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115680", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115680"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115680"}
{"title": "AnswerBot: automated generation of answer summary to developersź technical questions", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bowen Xu", "Zhenchang Xing", "Xin Xia", "David Lo"], "abstract": "The prevalence of questions and answers on domain-specific Q&A sites like Stack Overflow constitutes a core knowledge asset for software engineering domain. Although search engines can return a list of questions relevant to a user query of some technical question, the abundance of relevant posts and the sheer amount of information in them makes it difficult for developers to digest them and find the most needed answers to their questions. In this work, we aim to help developers who want to quickly capture the key points of several answer posts relevant to a technical question before they read the details of the posts. We formulate our task as a query-focused multi-answer-posts summarization task for a given technical question. Our proposed approach AnswerBot contains three main steps : 1) relevant question retrieval, 2) useful answer paragraph selection, 3) diverse answer summary generation. To evaluate our approach, we build a repository of 228,817 Java questions and their corresponding answers from Stack Overflow. We conduct user studies with 100 randomly selected Java questions (not in the question repository) to evaluate the quality of the answer summaries generated by our approach, and the effectiveness of its relevant question retrieval and answer paragraph selection components. The user study results demonstrate that answer summaries generated by our approach are relevant, useful and diverse; moreover, the two components are able to effectively retrieve relevant questions and select salient answer paragraphs for summarization.", "doi": "10.1109/ase.2017.8115681", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115681", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115681"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115681"}
{"title": "Recommending crowdsourced software developers in consideration of skill improvement", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zizhe Wang", "Hailong Sun", "Yang Fu", "Luting Ye"], "abstract": "Finding suitable developers for a given task is critical and challenging for successful crowdsourcing software development. In practice, the development skills will be improved as developers accomplish more development tasks. Prior studies on crowdsourcing developer recommendation do not consider the changing of skills, which can underestimate developers' skills to fulfill a task. In this work, we first conducted an empirical study of the performance of 74 developers on Topcoder. With a difficulty-weighted algorithm, we re-compute the scores of each developer by eliminating the effect of task difficulty from the performance. We find out that the skill improvement of Topcoder developers can be fitted well with the negative exponential learning curve model. Second, we design a skill prediction method based on the learning curve. Then we propose a skill improvement aware framework for recommending developers for software development with crowdsourcing.", "doi": "10.1109/ase.2017.8115682", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115682", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115682"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115682"}
{"title": "The rise of the (modelling) bots: towards assisted modelling via social networks", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sara Pérez-Soler", "Esther Guerra", "Juan de Lara", "Francisco Jurado"], "abstract": "We are witnessing a rising role of mobile computing and social networks to perform all sorts of tasks. This way, social networks like Twitter or Telegram are used for leisure, and they frequently serve as a discussion media for work-related activities. In this paper, we propose taking advantage of social networks to enable the collaborative creation of models by groups of users. The process is assisted by modelling bots that orchestrate the collaboration and interpret the users' inputs (in natural language) to incrementally build a (meta-)model. The advantages of this modelling approach include ubiquity of use, automation, assistance, natural user interaction, traceability of design decisions, possibility to incorporate coordination protocols, and seamless integration with the user's normal daily usage of social networks. We present a prototype implementation called SOCIO, able to work over several social networks like Twitter and Telegram, and a preliminary evaluation showing promising results.", "doi": "10.1109/ase.2017.8115683", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115683", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115683"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115683"}
{"title": "UNDEAD: detecting and preventing deadlocks in production software", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jinpeng Zhou", "Sam Silvestro", "Hongyu Liu", "Yan Cai", "Tongping Liu"], "abstract": "Deadlocks are critical problems afflicting parallel applications, causing software to hang with no further progress. Existing detection tools suffer not only from significant recording performance overhead, but also from excessive memory and/or storage overhead. In addition, they may generate numerous false alarms. Subsequently, after problems have been reported, tremendous manual effort is required to confirm and fix these deadlocks. This paper designs a novel system, UnDead, that helps defeat deadlocks in production software. Different from existing detection tools, UnDead imposes negligible runtime performance overhead (less than 3 % on average) and small memory overhead (around 6%), without any storage consumption. After detection, UnDead automatically strengthens erroneous programs to prevent future occurrences of both existing and potential deadlocks, which is similar to the existing work-Dimmunix. However, UnDead exceeds Dimmunix with several orders of magnitude lower performance overhead, while eliminating numerous false positives. Extremely low runtime and memory overhead, convenience, and automatic prevention make UnDead an always-on detection tool, and a \"band-aid\" prevention system for production software.", "doi": "10.1109/ase.2017.8115684", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115684", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115684"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115684"}
{"title": "Promoting secondary orders of event pairs in randomized scheduling using a randomized stride", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mahmoud Abdelrasoul"], "abstract": "Because of the wide use of randomized scheduling in concurrency testing research, it is important to understand randomized scheduling and its limitations. This work analyzes how randomized scheduling discovers concurrency bugs by focusing on the probabilities of the two possible orders of a pair of events. Analysis shows that the disparity between probabilities can be large for programs that encounter a large number of events during execution. Because sets of ordered event pairs define conditions for discovering concurrency bugs, this disparity can make some concurrency bugs highly unlikely. The complementary nature of the two possible orders also indicates a potential trade-off between the probability of discovering frequently-occurring and infrequently-occurring concurrency bugs. To help address this trade-off in a more balanced way, randomized-stride scheduling is proposed, where scheduling granularity for each thread is adjusted using a randomized stride calculated based on thread length. With some assumptions, strides can be calculated to allow covering the least likely event pair orders. Experiments confirm the analysis results and also suggest that randomized-stride scheduling is more effective for discovering concurrency bugs compared to the original randomized scheduling implementation, and compared to other algorithms in recent literature.", "doi": "10.1109/ase.2017.8115685", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115685", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115685"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115685"}
{"title": "Parallel bug-finding in concurrent programs via reduced interleaving instances", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Truc L. Nguyen", "Peter Schrammel", "Bernd Fischer", "Salvatore La Torre", "Gennaro Parlato"], "abstract": "Concurrency poses a major challenge for program verification, but it can also offer an opportunity to scale when subproblems can be analysed in parallel. We exploit this opportunity here and use a parametrizable code-to-code translation to generate a set of simpler program instances, each capturing a reduced set of the original program's interleavings. These instances can then be checked independently in parallel. Our approach does not depend on the tool that is chosen for the final analysis, is compatible with weak memory models, and amplifies the effectiveness of existing tools, making them find bugs faster and with fewer resources. We use Lazy-CSeq as an off-the-shelf final verifier to demonstrate that our approach is able, already with a small number of cores, to find bugs in the hardest known concurrency benchmarks in a matter of minutes, whereas other dynamic and static tools fail to do so in hours.", "doi": "10.1109/ase.2017.8115686", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115686", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115686"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115686"}
{"title": "Understanding and overcoming parallelism bottlenecks in ForkJoin applications", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gustavo Pinto", "Anthony Canino", "Fernando Castor", "Guoqing Xu", "Yu David Liu"], "abstract": "ForkJoin framework is a widely used parallel programming framework upon which both core concurrency libraries and real-world applications are built. Beneath its simple and user-friendly APIs, ForkJoin is a sophisticated managed parallel runtime unfamiliar to many application programmers: the framework core is a work-stealing scheduler, handles fine-grained tasks, and sustains the pressure from automatic memory management. ForkJoin poses a unique gap in the compute stack between high-level software engineering and low-level system optimization. Understanding and bridging this gap is crucial for the future of parallelism support in JVM-supported applications. This paper describes a comprehensive study on parallelism bottlenecks in ForkJoin applications, with a unique focus on how they interact with underlying system-level features, such as work stealing and memory management. We identify 6 bottlenecks, and found that refactoring them can significantly improve performance and energy efficiency. Our field study includes an in-depth analysis of Akka — a real-world actor framework — and 30 additional open-source ForkJoin projects. We sent our patches to the developers of 15 projects, and 7 out of the 9 projects that replied to our patches have accepted them.", "doi": "10.1109/ase.2017.8115687", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115687", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115687"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115687"}
{"title": "Quick verification of concurrent programs by iteratively relaxed scheduling", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Patrick Metzler", "Habib Saissi", "Péter Bokor", "Neeraj Suri"], "abstract": "The most prominent advantage of software verification over testing is a rigorous check of every possible software behavior. However, large state spaces of concurrent systems, due to non-deterministic scheduling, result in a slow automated verification process. Therefore, verification introduces a large delay between completion and deployment of concurrent software. This paper introduces a novel iterative approach to verification of concurrent programs that drastically reduces this delay. By restricting the execution of concurrent programs to a small set of admissible schedules, verification complexity and time is drastically reduced. Iteratively adding admissible schedules after their verification eventually restores non-deterministic scheduling. Thereby, our framework allows to find a sweet spot between a low verification delay and sufficient execution time performance. Our evaluation of a prototype implementation on well-known benchmark programs shows that after verifying only few schedules of the program, execution time overhead is competitive to existing deterministic multi-threading frameworks.", "doi": "10.1109/ase.2017.8115688", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115688", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115688"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115688"}
{"title": "Automatic loop-invariant generation and refinement through selective sampling", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiaying Li", "Jun Sun", "Li Li", "Quang Loc Le", "Shang-Wei Lin"], "abstract": "Automatic loop-invariant generation is important in program analysis and verification. In this paper, we propose to generate loop-invariants automatically through learning and verification. Given a Hoare triple of a program containing a loop, we start with randomly testing the program, collect program states at run-time and categorize them based on whether they satisfy the invariant to be discovered. Next, classification techniques are employed to generate a candidate loop-invariant automatically. Afterwards, we refine the candidate through selective sampling so as to overcome the lack of sufficient test cases. Only after a candidate invariant cannot be improved further through selective sampling, we verify whether it can be used to prove the Hoare triple. If it cannot, the generated counterexamples are added as new tests and we repeat the above process. Furthermore, we show that by introducing a path-sensitive learning, i.e., partitioning the program states according to program locations they visit and classifying each partition separately, we are able to learn disjunctive loop-invariants. In order to evaluate our idea, a prototype tool has been developed and the experiment results show that our approach complements existing approaches.", "doi": "10.1109/ase.2017.8115689", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115689", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115689"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115689"}
{"title": "FiB: squeezing loop invariants by interpolation between Forward/Backward predicate transformers", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shang-Wei Lin", "Jun Sun", "Hao Xiao", "Yang Liu", "David Sanán", "Henri Hansen"], "abstract": "Loop invariant generation is a fundamental problem in program analysis and verification. In this work, we propose a new approach to automatically constructing inductive loop invariants. The key idea is to aggressively squeeze an inductive invariant based on Craig interpolants between forward and backward reachability analysis. We have evaluated our approach by a set of loop benchmarks, and experimental results show that our approach is promising.", "doi": "10.1109/ase.2017.8115690", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115690", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115690"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115690"}
{"title": "SymInfer: inferring program invariants using symbolic states", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["ThanhVu Nguyen", "Matthew B. Dwyer", "Willem Visser"], "abstract": "We introduce a new technique for inferring program invariants that uses symbolic states generated by symbolic execution. Symbolic states, which consist of path conditions and constraints on local variables, are a compact description of sets of concrete program states and they can be used for both invariant inference and invariant verification. Our technique uses a counterexample-based algorithm that creates concrete states from symbolic states, infers candidate invariants from concrete states, and then verifies or refutes candidate invariants using symbolic states. The refutation case produces concrete counterexamples that prevent spurious results and allow the technique to obtain more precise invariants. This process stops when the algorithm reaches a stable set of invariants. We present Symlnfer, a tool that implements these ideas to automatically generate invariants at arbitrary locations in a Java program. The tool obtains symbolic states from Symbolic PathFinder and uses existing algorithms to infer complex (potentially nonlinear) numerical invariants. Our preliminary results show that Symlnfer is effective in using symbolic states to generate precise and useful invariants for proving program safety and analyzing program runtime complexity. We also show that Symlnfer outperforms existing invariant generation systems.", "doi": "10.1109/ase.2017.8115691", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115691", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115691"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115691"}
{"title": "Parsimony: an IDE for example-guided synthesis of lexers and parsers", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alan Leung", "Sorin Lerner"], "abstract": "We present Parsimony, a programming-by-example development environment for synthesizing lexers and parsers by example. Parsimony provides a graphical interface in which the user presents examples simply by selecting and labeling sample text in a text editor. An underlying synthesis engine then constructs syntactic rules to solve the system of constraints induced by the supplied examples. Parsimony is more expressive and usable than prior programming-by-example systems for parsers in several ways: Parsimony can (1) synthesize lexer rules in addition to productions, (2) solve for much larger constraint systems over multiple examples, rather than handling examples one-at-a-time, and (3) infer much more complex sets of productions, such as entire algebraic expression grammars, by detecting instances of well-known grammar design patterns. The results of a controlled user study across 18 participants show that users are able to perform lexing and parsing tasks faster and with fewer mistakes when using Parsimony as compared to a traditional parsing workflow.", "doi": "10.1109/ase.2017.8115692", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115692", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115692"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115692"}
{"title": "Mining constraints for event-based monitoring in systems of systems", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Krismayer", "Rick Rabiser", "Paul Grünbacher"], "abstract": "The full behavior of software-intensive systems of systems (SoS) emerges during operation only. Runtime monitoring approaches have thus been proposed to detect deviations from the expected behavior. They commonly rely on temporal logic or domain-specific languages to formally define requirements, which are then checked by analyzing the stream of monitored events and event data. Some approaches also allow developers to generate constraints from declarative specifications of the expected behavior. However, independent of the approach, deep domain knowledge is required to specify the desired behavior. This knowledge is often not accessible in SoS environments with multiple development teams independently working on different, heterogeneous systems. In this New Ideas Paper we thus describe an approach that automatically mines constraints for runtime monitoring from event logs recorded in SoS. Our approach builds on ideas from specification mining, process mining, and machine learning to mine different types of constraints on event occurrence, event timing, and event data. The approach further presents the mined constraints to users in an existing constraint language and it ranks the constraints using different criteria. We demonstrate the feasibility of our approach by applying it to event logs from a real-world industrial SoS.", "doi": "10.1109/ase.2017.8115693", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115693", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115693"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115693"}
{"title": "Programming bots by synthesizing natural language expressions into API invocations", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shayan Zamanirad", "Boualem Benatallah", "Moshe Chai Barukh", "Fabio Casati", "Carlos Rodríguez"], "abstract": "At present, bots are still in their preliminary stages of development. Many are relatively simple, or developed ad-hoc for a very specific use-case. For this reason, they are typically programmed manually, or utilize machine-learning classifiers to interpret a fixed set of user utterances. In reality, real world conversations with humans require support for dynamically capturing users expressions. Moreover, bots will derive immeasurable value by programming them to invoke APIs for their results. Today, within the Web and Mobile development community, complex applications are being stringed together with a few lines of code — all made possible by APIs. Yet, developers today are not as empowered to program bots in much the same way. To overcome this, we introduce BotBase, a bot programming platform that dynamically synthesizes natural language user expressions into API invocations. Our solution is two faceted: Firstly, we construct an API knowledge graph to encode and evolve APIs; secondly, leveraging the above we apply techniques in NLP, ML and Entity Recognition to perform the required synthesis from natural language user expressions into API calls.", "doi": "10.1109/ase.2017.8115694", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115694", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115694"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115694"}
{"title": "Test suite parallelization in open-source projects: a study on its usage and impact", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jeanderson Cândido", "Luis Melo", "Marcelo d'Amorim"], "abstract": "Dealing with high testing costs remains an important problem in Software Engineering. Test suite parallelization is an important approach to address this problem. This paper reports our findings on the usage and impact of test suite parallelization in open-source projects. It provides recommendations to practitioners and tool developers to speed up test execution. Considering a set of 468 popular Java projects we analyzed, we found that 24% of the projects contain costly test suites but parallelization features still seem underutilized in practice - only 19.1% of costly projects use parallelization. The main reported reason for adoption resistance was the concern to deal with concurrency issues. Results suggest that, on average, developers prefer high predictability than high performance in running tests.", "doi": "10.1109/ase.2017.8115695", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115695", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115695"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115695"}
{"title": "Systematic reduction of GUI test sequences", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lin Cheng", "Zijiang Yang", "Chao Wang"], "abstract": "Graphic user interface (GUI) is an integral part of many software applications. However, GUI testing remains a challenging task. The main problem is to generate a set of high-quality test cases, i.e., sequences of user events to cover the often large input space. Since manually crafting event sequences is labor-intensive and automated testing tools often have poor performance, we propose a new GUI testing framework to efficiently generate progressively longer event sequences while avoiding redundant sequences. Our technique for identifying the redundancy among these sequences relies on statically checking a set of simple and syntactic-level conditions, whose reduction power matches and sometimes exceeds that of classic techniques based on partial order reduction. We have evaluated our method on 17 Java Swing applications. Our experimental results show the new technique, while being sound and systematic, can achieve more than 10X reduction in the number of test sequences compared to the state-of-the-art GUI testing tools.", "doi": "10.1109/ase.2017.8115696", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115696", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115696"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115696"}
{"title": "Automatically reducing tree-structured test inputs", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Satia Herfert", "Jibesh Patra", "Michael Pradel"], "abstract": "Reducing the test input given to a program while preserving some property of interest is important, e.g., to localize faults or to reduce test suites. The well-known delta debugging algorithm and its derivatives automate this task by repeatedly reducing a given input. Unfortunately, these approaches are limited to blindly removing parts of the input and cannot reduce the input by restructuring it. This paper presents the Generalized Tree Reduction (GTR) algorithm, an effective and efficient technique to reduce arbitrary test inputs that can be represented as a tree, such as program code, PDF files, and XML documents. The algorithm combines tree transformations with delta debugging and a greedy backtracking algorithm. To reduce the size of the considered search space, the approach automatically specializes the tree transformations applied by the algorithm based on examples of input trees. We evaluate GTR by reducing Python files that cause interpreter crashes, JavaScript files that cause browser inconsistencies, PDF documents with malicious content, and XML files used to tests an XML validator. The GTR algorithm reduces the trees of these files to 45.3%, 3.6%, 44.2%, and 1.3% of the original size, respectively, outperforming both delta debugging and another state-of-the-art algorithm.", "doi": "10.1109/ase.2017.8115697", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115697", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115697"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115697"}
{"title": "Synthetic data generation for statistical testing", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ghanem Soltana", "Mehrdad Sabetzadeh", "Lionel C. Briand"], "abstract": "Usage-based statistical testing employs knowledge about the actual or anticipated usage profile of the system under test for estimating system reliability. For many systems, usage-based statistical testing involves generating synthetic test data. Such data must possess the same statistical characteristics as the actual data that the system will process during operation. Synthetic test data must further satisfy any logical validity constraints that the actual data is subject to. Targeting data-intensive systems, we propose an approach for generating synthetic test data that is both statistically representative and logically valid. The approach works by first generating a data sample that meets the desired statistical characteristics, without taking into account the logical constraints. Subsequently, the approach tweaks the generated sample to fix any logical constraint violations. The tweaking process is iterative and continuously guided toward achieving the desired statistical characteristics. We report on a realistic evaluation of the approach, where we generate a synthetic population of citizens' records for testing a public administration IT system. Results suggest that our approach is scalable and capable of simultaneously fulfilling the statistical representativeness and logical validity requirements.", "doi": "10.1109/ase.2017.8115698", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115698", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115698"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115698"}
{"title": "SEALANT: a detection and visualization tool for inter-app security vulnerabilities in Android", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Youn Kyu Lee", "Peera Yoodee", "Arman Shahbazian", "Daye Nam", "Nenad Medvidovic"], "abstract": "Android's flexible communication model allows interactions among third-party apps, but it also leads to inter-app security vulnerabilities. Specifically, malicious apps can eavesdrop on interactions between other apps or exploit the functionality of those apps, which can expose a user's sensitive information to attackers. While the state-of-the-art tools have focused on detecting inter-app vulnerabilities in Android, they neither accurately analyze realistically large numbers of apps nor effectively deliver the identified issues to users. This paper presents SEALANT, a novel tool that combines static analysis and visualization techniques that, together, enable accurate identification of inter-app vulnerabilities as well as their systematic visualization. SEALANT statically analyzes architectural information of a given set of apps, infers vulnerable communication channels where inter-app attacks can be launched, and visualizes the identified information in a compositional representation. SEALANT has been demonstrated to accurately identify inter-app vulnerabilities from hundreds of real-world Android apps and to effectively deliver the identified information to users. (Demo Video: https://youtu.be/E4lLQonOdUw)", "doi": "10.1109/ase.2017.8115699", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115699", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115699"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115699"}
{"title": "Visualization support for requirements monitoring in systems of systems", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lisa Maria Kritzinger", "Thomas Krismayer", "Michael Vierhauser", "Rick Rabiser", "Paul Grünbacher"], "abstract": "Industrial software systems are often systems of systems (SoS) whose full behavior only emerges at runtime. The systems and their interactions thus need to be continuously monitored and checked during operation to determine compliance with requirements. Many requirements monitoring approaches have been proposed. However, only few of these come with tools that present and visualize monitoring results and details on requirements violations to end users such as industrial engineers. In this tool demo paper we present visualization capabilities we have been developing motivated by industrial scenarios. Our tool complements ReMinds, an existing requirements monitoring framework, which supports collecting, aggregating, and analyzing events and event data in architecturally heterogeneous SoS. Our visualizations support a `drill-down' scenario for monitoring and diagnosis: starting from a graphical status overview of the monitored systems and their relations, engineers can view trends and statistics about performed analyses and diagnose the root cause of problems by inspecting the events and event data that led to a specific violation. Initial industry feedback we received confirms the usefulness of our tool support. Demo video: https://youtu.be/iv7kWzeNkdk..", "doi": "10.1109/ase.2017.8115700", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115700", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115700"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115700"}
{"title": "A demonstration of simultaneous execution and editing in a development environment", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Steven P. Reiss", "Qi Xin"], "abstract": "We introduce a tool within the Code Bubbles development environment that allows for continuous execution as the programmer edits. The tool, SEEDE, shows both the intermediate and final results of execution in terms of variables, control flow, output, and graphics. These results are updated as the user edits. The user can explore the execution to find or fix bugs or use the intermediate values to help write appropriate code. A demonstration video is available at https://www.you-tube.com/watch?v=GpibSxX3Wlw.", "doi": "10.1109/ase.2017.8115701", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115701", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115701"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115701"}
{"title": "TREM: a tool for mining timed regular specifications from system traces", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lukas Schmidt", "Apurva Narayan", "Sebastian Fischmeister"], "abstract": "Software specifications are useful for software validation, model checking, runtime verification, debugging, monitoring, etc. In context of safety-critical real-time systems, temporal properties play an important role. However, temporal properties are rarely present due to the complexity and evolutionary nature of software systems. We propose Timed Regular Expression Mining (TREM) a hosted tool for specification mining using timed regular expressions (TREs). It is designed for easy and robust mining of dominant temporal properties. TREM uses an abstract structure of the property; the framework constructs a finite state machine to serve as an acceptor. TREM is scalable, easy to access/use, and platform independent specification mining framework. The tool is tested on industrial strength software system traces such as the QNX real-time operating system using traces with more than 1.5 Million entries. The tool demonstration video can be accessed here: youtu.be/cSd_aj3_LH8.", "doi": "10.1109/ase.2017.8115702", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115702", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115702"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115702"}
{"title": "ModelWriter: text and model-synchronized document engineering platform", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ferhat Erata", "Claire Gardent", "Bikash Gyawali", "Anastasia Shimorina", "Yvan Lussaud", "Bedir Tekinerdogan", "Geylani Kardas", "Anne Monceaux"], "abstract": "The ModelWriter platform provides a generic framework for automated traceability analysis. In this paper, we demonstrate how this framework can be used to trace the consistency and completeness of technical documents that consist of a set of System Installation Design Principles used by Airbus to ensure the correctness of aircraft system installation. We show in particular, how the platform allows the integration of two types of reasoning: reasoning about the meaning of text using semantic parsing and description logic theorem proving; and reasoning about document structure using first-order relational logic and finite model finding for traceability analysis.", "doi": "10.1109/ase.2017.8115703", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115703", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115703"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115703"}
{"title": "Incrementally slicing editable submodels", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christopher Pietsch", "Manuel Ohrndorf", "Udo Kelter", "Timo Kehrer"], "abstract": "Model slicers are tools which provide two services: (a) finding parts of interest in a model and (b) displaying these parts somehow or extract these parts as a new, autonomous model, which is referred to as slice or sub-model. This paper focuses on the creation of editable slices, which can be processed by model editors, analysis tools, model management tools etc. Slices are useful if, e.g., only a part of a large model shall be analyzed, compared or processed by time-consuming algorithms, or if sub-models shall be modified independently. We present a new generic incremental slicer which can slice models of arbitrary type and which creates slices which are consistent in the sense that they are editable by standard editors. It is built on top of a model differencing framework and does not require additional configuration data beyond those available in the differencing framework. The slicer can incrementally extend or reduce an existing slice if model elements shall be added or removed, even if the slice has been edited meanwhile. We demonstrate the usefulness of our slicer in several scenarios using a large UML model. A screencast of the demonstrated scenarios is provided at http://pi.informatik.uni-siegen.de/projects/SiLift/ase2017.", "doi": "10.1109/ase.2017.8115704", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115704", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115704"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115704"}
{"title": "DSSynth: an automated digital controller synthesis tool for physical plants", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alessandro Abate", "Iury Bessa", "Dario Cattaruzza", "Lennon C. Chaves", "Lucas C. Cordeiro", "Cristina David", "Pascal Kesseli", "Daniel Kroening", "Elizabeth Polgreen"], "abstract": "We present an automated MATLAB Toolbox, named DSSynth (Digital-System Synthesizer), to synthesize sound digital controllers for physical plants that are represented as linear timeinvariant systems with single input and output. In particular, DSSynth synthesizes digital controllers that are sound w.r.t. stability and safety specifications. DSSynth considers the complete range of approximations, including time discretization, quantization effects and finite-precision arithmetic (and its rounding errors). We demonstrate the practical value of this toolbox by automatically synthesizing stable and safe controllers for intricate physical plant models from the digital control literature. The resulting toolbox enables the application of program synthesis to real-world control engineering problems. A demonstration can be found at https://youtu.be_hLQslRcee8.", "doi": "10.1109/ase.2017.8115705", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115705", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115705"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115705"}
{"title": "A static analysis tool with optimizations for reachability determination", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuexing Wang", "Min Zhou", "Yu Jiang", "Xiaoyu Song", "Ming Gu", "Jiaguang Sun"], "abstract": "To reduce the false positives of static analysis, many tools collect path constraints and integrate SMT solvers to filter unreachable execution paths. However, the accumulated calling and computing of SMT solvers are time and resource consuming. This paper presents TsmartLW, an alternate static analysis tool in which we implement a path constraint solving engine to speed up reachability determination. Within the engine, typical types of constraint-patterns are firstly defined based on an empirical study of a large number of code repositories. For each pattern, a constraint solving algorithm is designed and implemented. For each program, the engine predicts the most suitable strategy and then applies the strategy to solve path constraints. The experimental results on some well-known benchmarks and real-world applications show that TsmartLW is faster than some state-of-the-art static analysis tools. For example, it is 1.32× faster than CPAchecker and our engine is 369× faster than SMT solvers in solving path constraints. The demo video is available at https://www.youtube.com/watch?v=5c3ARhFclHA&t=2s.", "doi": "10.1109/ase.2017.8115706", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115706", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115706"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115706"}
{"title": "CogniCrypt: supporting developers in using cryptography", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stefan Krüger", "Sarah Nadi", "Michael Reif", "Karim Ali", "Mira Mezini", "Eric Bodden", "Florian Göpfert", "Felix Günther", "Christian Weinert", "Daniel Demmler", "Ram Kamath"], "abstract": "Previous research suggests that developers often struggle using low-level cryptographic APIs and, as a result, produce insecure code. When asked, developers desire, among other things, more tool support to help them use such APIs. In this paper, we present CogniCrypt, a tool that supports developers with the use of cryptographic APIs. CogniCrypt assists the developer in two ways. First, for a number of common cryptographic tasks, CogniCrypt generates code that implements the respective task in a secure manner. Currently, CogniCrypt supports tasks such as data encryption, communication over secure channels, and long-term archiving. Second, CogniCrypt continuously runs static analyses in the background to ensure a secure integration of the generated code into the developer's workspace. This video demo showcases the main features of CogniCrypt: youtube.com/watch?v=JUq5mRHfAWY.", "doi": "10.1109/ase.2017.8115707", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115707", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115707"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115707"}
{"title": "BProVe: tool support for business process verification", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Flavio Corradini", "Fabrizio Fornari", "Andrea Polini", "Barbara Re", "Francesco Tiezzi", "Andrea Vandin"], "abstract": "This demo introduces BProVe, a tool supporting automated verification of Business Process models. BProVe analysis is based on a formal operational semantics defined for the BPMN 2.0 modelling language, and is provided as a freely accessible service that uses open standard formats as input data. Furthermore a plug-in for the Eclipse platform has been developed making available a tool chain supporting users in modelling and visualising, in a friendly manner, the results of the verification. Finally we have conducted a validation through more than one thousand models, showing the effectiveness of our verification tool in practice. (Demo video: https://youtu.be/iF5OM7vKtDA)", "doi": "10.1109/ase.2017.8115708", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115708", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115708"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115708"}
{"title": "taco: a tool to generate tensor algebra kernels", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fredrik Kjolstad", "Stephen Chou", "David Lugato", "Shoaib Kamil", "Saman P. Amarasinghe"], "abstract": "Tensor algebra is an important computational abstraction that is increasingly used in data analytics, machine learning, engineering, and the physical sciences. However, the number of tensor expressions is unbounded, which makes it hard to develop and optimize libraries. Furthermore, the tensors are often sparse (most components are zero), which means the code has to traverse compressed formats. To support programmers we have developed taco, a code generation tool that generates dense, sparse, and mixed kernels from tensor algebra expressions. This paper describes the taco web and command-line tools and discusses the benefits of a code generator over a traditional library. See also the demo video at tensor-compiler.org/ase2017.", "doi": "10.1109/ase.2017.8115709", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115709", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115709"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115709"}
{"title": "STARTS: STAtic regression test selection", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Owolabi Legunsen", "August Shi", "Darko Marinov"], "abstract": "Regression testing is an important part of software development, but it can be very time consuming. Regression test selection (RTS) aims to speed up regression testing by running only impacted tests-the subset of tests that can change behavior due to code changes. We present STARTS, a tool for STAtic Regression Test Selection. Unlike dynamic RTS, STARTS requires no code instrumentation or runtime information to find impacted tests; instead, STARTS uses only compile-time information. Specifically, STARTS builds a dependency graph of program types and finds, as impacted, tests that can reach some changed type in the transitive closure of the dependency graph. STARTS is a Maven plugin that can be easily integrated into any Maven-based Java project. We find that STARTS selects on average 35.2% of tests, leading to an end-to-end runtime that is on average 81.0% of running all the tests. A video demo of STARTS can be found at https://youtu.be/PCNtk8jphrM.", "doi": "10.1109/ase.2017.8115710", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115710", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115710"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115710"}
{"title": "EventFlowSlicer: a tool for generating realistic goal-driven GUI tests", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jonathan A. Saddler", "Myra B. Cohen"], "abstract": "Most automated testing techniques for graphical user interfaces (GUIs) produce test cases that are only concerned with covering the elements (widgets, menus, etc.) on the interface, or the underlying program code, with little consideration of test case semantics. This is effective for functional testing where the aim is to find as many faults as possible. However, when one wants to mimic a real user for evaluating usability, or when it is necessary to extensively test important end-user tasks of a system, or to generate examples of how to use an interface, this generation approach fails. Capture and replay techniques can be used, however there are often multiple ways to achieve a particular goal, and capturing all of these is usually too time consuming and unrealistic. Prior work on human performance regression testing introduced a constraint based method to filter test cases created by a functional test case generator, however that work did not capture the specifications, or directly generate only the required tests and considered only a single type of test goal. In this paper we present EventFlowSlicer, a tool that allows the GUI tester to specify and generate all realistic test cases relevant to achieve a stated goal. The user first captures relevant events on the interface, then adds constraints to provide restrictions on the task. An event flow graph is extracted containing only the widgets of interest for that goal. Next all test cases are generated for edges in the graph which respect the constraints. The test cases can then be replayed using a modified version of GUITAR. A video demonstration of EventFlowSlicer can be found at https://youtu.be/hw7WYz8WYVU.", "doi": "10.1109/ase.2017.8115711", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115711", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115711"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115711"}
{"title": "ANDROFLEET: testing WiFi peer-to-peer mobile apps in the large", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lakhdar Meftah", "María Gómez", "Romain Rouvoy", "Isabelle Chrisment"], "abstract": "WiFi P2P allows mobile apps to connect to each other via WiFi without an intermediate access point. This communication mode is widely used by mobile apps to support interactions with one or more devices simultaneously. However, testing such P2P apps remains a challenge for app developers as i) existing testing frameworks lack support for WiFi P2P, and ii) WiFi P2P testing fails to scale when considering a deployment on more than two devices. In this paper, we therefore propose an acceptance testing framework, named Androfleet, to automate testing of WiFi P2P mobile apps at scale. Beyond the capability of testing point-to-point interactions under various conditions, An-drofleet supports the deployment and the emulation of a fleet of mobile devices as part of an alpha testing phase in order to assess the robustness of a WiFi P2P app once deployed in the field. To validate Androfleet, we demonstrate the detection of failing black-box acceptance tests for WiFi P2P apps and we capture the conditions under which such a mobile app can correctly work in the field. The demo video of Androfleet is made available from https://youtu.be/gJ5_Ed7XL04.", "doi": "10.1109/ase.2017.8115712", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115712", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115712"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115712"}
{"title": "FEMIR: a tool for recommending framework extension examples", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Muhammad Asaduzzaman", "Chanchal K. Roy", "Kevin A. Schneider", "Daqing Hou"], "abstract": "Software frameworks enable developers to reuse existing well tested functionalities instead of taking the burden of implementing everything from scratch. However, to meet application specific requirements, the frameworks need to be customized via extension points. This is often done by passing a framework related object as an argument to an API call. To enable such customizations, the object can be created by extending a framework class, implementing an interface, or changing the properties of the object via API calls. However, it is both a common and non-trivial task to find all the details related to the customizations. In this paper, we present a tool, called FEMIR, that utilizes partial program analysis and graph mining technique to detect, group, and rank framework extension examples. The tool extends existing code completion infrastructure to inform developers about customization choices, enabling them to browse through extension points of a framework, and frequent usages of each point in terms of code examples. A video demo is made available at https://asaduzzamanparvez.wordpress.com/femir.", "doi": "10.1109/ase.2017.8115713", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115713", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115713"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115713"}
{"title": "TiQi: a natural language interface for querying software project data", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jinfeng Lin", "Yalin Liu", "Jin Guo", "Jane Cleland-Huang", "William Goss", "Wenchuang Liu", "Sugandha Lohar", "Natawut Monaikul", "Alexander Rasin"], "abstract": "Software projects produce large quantities of data such as feature requests, requirements, design artifacts, source code, tests, safety cases, release plans, and bug reports. If leveraged effectively, this data can be used to provide project intelligence that supports diverse software engineering activities such as release planning, impact analysis, and software analytics. However, project stakeholders often lack skills to formulate complex queries needed to retrieve, manipulate, and display the data in meaningful ways. To address these challenges we introduce TiQi, a natural language interface, which allows users to express software-related queries verbally or written in natural language. TiQi is a web-based tool. It visualizes available project data as a prompt to the user, accepts Natural Language (NL) queries, transforms those queries into SQL, and then executes the queries against a centralized or distributed database. Raw data is stored either directly in the database or retrieved dynamically at runtime from case tools and repositories such as Github and Jira. The transformed query is visualized back to the user as SQL and augmented UML, and raw data results are returned. Our tool demo can be found on YouTube at the following link:http://tinyurl.com/TIQIDemo.", "doi": "10.1109/ase.2017.8115714", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115714", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115714"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115714"}
{"title": "Opiner: an opinion search and summarization engine for APIs", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gias Uddin", "Foutse Khomh"], "abstract": "Opinions are key determinants to many of the activities related to software development. The perceptions of developers about an API, and the choices they make about whether and how they should use it, may, to a considerable degree, be conditioned upon how other developers see and evaluate the API. Given the plethora of APIs available for a given development task and the advent of developer forums as the media to share opinions about those APIs, it can be challenging for a developer to make informed decisions about an API to support the task. We introduce Opiner, our opinion search and summarization engine for API reviews. The server side of Opiner collects and summarizes opinions about APIs by crawling online developer forums and by associating the opinions found in the forum posts to the APIs discussed in the posts. The client side of Opiner is a Website that presents different summarized viewpoints of the opinions about the APIs in an online search engine. We evaluated Opiner by asking Industrial developers to select APIs for two development tasks. We found that developers were interested to use our proposed summaries of API reviews and that while combined with Stack Overflow, Opiner helped developers to make the right decision with more accuracy and confidence. The Opiner online search engine is available at: http://opiner.polymtl.ca. A video demo is available at: https://youtu.be/XAXpfmg5Lqs.", "doi": "10.1109/ase.2017.8115715", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115715", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115715"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115715"}
{"title": "Defaultification refactoring: a tool for automatically converting Java methods to default", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Raffi Khatchadourian", "Hidehiko Masuhara"], "abstract": "Enabling interfaces to declare (instance) method implementations, Java 8 default methods can be used as a substitute for the ubiquitous skeletal implementation software design pattern. Performing this transformation on legacy software manually, though, may be non-trivial. The refactoring requires analyzing complex type hierarchies, resolving multiple implementation inheritance issues, reconciling differences between class and interface methods, and analyzing tie-breakers (dispatch precedence) with overriding class methods. All of this is necessary to preserve type-correctness and confirm semantics preservation. We demonstrate an automated refactoring tool called MIGRATE Skeletal Implementation to Interface for transforming legacy Java code to use the new default construct. The tool, implemented as an Eclipse plug-in, is driven by an efficient, fully-automated, type constraint-based refactoring approach. It features an extensive rule set covering various corner-cases where default methods cannot be used. The resulting code is semantically equivalent to the original, more succinct, easier to comprehend, less complex, and exhibits increased modularity. A demonstration can be found at http://youtu.be/YZHIy0yePh8.", "doi": "10.1109/ase.2017.8115716", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115716", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115716"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115716"}
{"title": "Kobold: web usability as a service", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julián Grigera", "Alejandra Garrido", "Gustavo Rossi"], "abstract": "While Web applications have become pervasive in today's business, social interaction and information exchange, their usability is often deficient, even being a key factor for a website success. Usability problems repeat across websites, and many of them have been catalogued, but usability evaluation and repair still remains expensive. There are efforts from both the academy and industry to automate usability testing or to provide automatic statistics, but they rarely offer concrete solutions. These solutions appear as guidelines or patterns that developers can follow manually. This paper presents Kobold, a tool that detects usability problems from real user interaction (UI) events and repairs them automatically when possible, at least suggesting concrete solutions. By using the refactoring technique and its associated concept of bad smell, Kobold mines UI events to detect usability smells and applies usability refactorings on the client to correct them. The purpose of Kobold is to deliver usability advice and solutions as a service (SaaS) for developers, allowing them to respond to feedback of the real use of their applications and improve usability incrementally, even when there are no usability experts on the team. Kobold is available at: http://autorefactoring.lifia.info.unlp.edu.ar. A screencast is available at https://youtu.be/c-myYPMUh0Q", "doi": "10.1109/ase.2017.8115717", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115717", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115717"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115717"}
{"title": "IntPTI: automatic integer error repair with proper-type inference", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xi Cheng", "Min Zhou", "Xiaoyu Song", "Ming Gu", "Jiaguang Sun"], "abstract": "Integer errors in C/C++ are caused by arithmetic operations yielding results which are unrepresentable in certain type. They can lead to serious safety and security issues. Due to the complicated semantics of C/C++ integers, integer errors are widely harbored in real-world programs and it is error-prone to repair them even for experts. An automatic tool is desired to 1) automatically generate fixes which assist developers to correct the buggy code, and 2) provide sufficient hints to help developers review the generated fixes and better understand integer types in C/C++. In this paper, we present a tool IntPTI that implements the desired functionalities for C programs. IntPTI infers appropriate types for variables and expressions to eliminate representation issues, and then utilizes the derived types with fix patterns codified from the successful human-written patches. IntPTI provides a user-friendly web interface which allows users to review and manage the fixes. We evaluate IntPTI on 7 real-world projects and the results show its competitive repair accuracy and its scalability on large code bases. The demo video for IntPTI is available at: https://youtu.be/9Tgd4A_FgZM.", "doi": "10.1109/ase.2017.8115718", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115718", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115718"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115718"}
{"title": "Learning effective changes for software projects", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rahul Krishna"], "abstract": "The primary motivation of much of software analytics is decision making. How to make these decisions? Should one make decisions based on lessons that arise from within a particular project? Or should one generate these decisions from across multiple projects? This work is an attempt to answer these questions. Our work was motivated by a realization that much of the current generation software analytics tools focus primarily on prediction. Indeed prediction is a useful task, but it is usually followed by \"planning\" about what actions need to be taken. This research seeks to address the planning task by seeking methods that support actionable analytics by offering clear guidance on what to do. Specifically, we propose XTREE and BELLTREE algorithms for generating a set of actionable plans within and across projects. Each of these plans, if followed will improve the quality of the software project.", "doi": "10.1109/ase.2017.8115719", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115719", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115719"], "github": ["https://github.com/ai-se/xtree-plan"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115719"}
{"title": "Characterizing and taming non-deterministic bugs in JavaScript applications", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jie Wang"], "abstract": "JavaScript has become one of the most popular programming languages for both client-side and server-side applications. In JavaScript applications, events may be generated, triggered and consumed non-deterministically. Thus, JavaScript applications may suffer from non-deterministic bugs, when events are triggered and consumed in an unexpected order. In this proposal, we aim to characterize and combat non-deterministic bugs in JavaScript applications. Specifically, we first perform a comprehensive study about real-world non-deterministic bugs in server-side JavaScript applications. In order to facilitate bug diagnosis, we further propose approaches to isolate the necessary events that are responsible for the occurrence of a failure. We also plan to design new techniques in detecting non-deterministic bugs in JavaScript applications.", "doi": "10.1109/ase.2017.8115720", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115720", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115720"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115720"}
{"title": "Towards API-specific automatic program repair", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sebastian Nielebock"], "abstract": "The domain of Automatic Program Repair (APR) had many research contributions in recent years. So far, most approaches target fixing generic bugs in programs (e.g., off-by-one errors). Nevertheless, recent studies reveal that about 50% of real bugs require API-specific fixes (e.g., adding missing API method calls or correcting method ordering), for which existing APR approaches are not designed. In this paper, we address this problem and introduce the notion of an API-specific program repair mechanism. This mechanism detects erroneous code in a similar way to existing APR approaches. However, to fix such bugs, it uses API-specific information from the erroneous code to search for API usage patterns in other software, with which we could fix the bug. We provide first insights on the applicability of this mechanism and discuss upcoming research challenges.", "doi": "10.1109/ase.2017.8115721", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115721", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115721"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115721"}
{"title": "Managing software evolution through semantic history slicing", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yi Li"], "abstract": "Software change histories are results of incremental updates made by developers. As a side-effect of the software development process, version history is a surprisingly useful source of information for understanding, maintaining and reusing software. However, traditional commit-based sequential organization of version histories lacks semantic structure and thus are insufficient for many development tasks that require high-level, semantic understanding of program functionality, such as locating feature implementations and porting hot fixes. In this work, we propose to use well-organized unit tests as identifiers for corresponding software functionalities. We then present a family of automated techniques which analyze the semantics of historical changes and assist developers in many everyday practical settings. For validation, we evaluate our approaches on a benchmark of developer-annotated version history instances obtained from real-world open source software projects on GitHub.", "doi": "10.1109/ase.2017.8115722", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115722", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115722"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115722"}
{"title": "Towards the automatic classification of traceability links", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chris Mills"], "abstract": "A wide range of text-based artifacts contribute to software projects (e.g., source code, test cases, use cases, project requirements, interaction diagrams, etc.). Traceability Link Recovery (TLR) is the software task in which relevant documents in these various sets are linked to one another, uncovering information about the project that is not available when considering only the documents themselves. This information is helpful for enabling other tasks such as improving test coverage, impact analysis, and ensuring that system or regulatory requirements are met. However, while traceability links are useful, performing TLR manually is time consuming and fraught with error. Previous work has applied Information Retrieval (IR) and other techniques to reduce the human effort involved; however, that effort remains significant. In this research we seek to take the next step in reducing it by using machine learning (ML) classification models to predict whether a candidate link is valid or invalid without human oversight. Preliminary results show that this approach has promise for accurately recommending valid links; however, there are several challenges that still must be addressed in order to achieve a technique with high enough performance to consider it a viable, completely automated solution.", "doi": "10.1109/ase.2017.8115723", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115723", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115723"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115723"}
{"title": "Towards a software vulnerability prediction model using traceable code patterns and software metrics", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kazi Zakia Sultana"], "abstract": "Software security is an important aspect of ensuring software quality. The goal of this study is to help developers evaluate software security using traceable patterns and software metrics during development. The concept of traceable patterns is similar to design patterns but they can be automatically recognized and extracted from source code. If these patterns can better predict vulnerable code compared to traditional software metrics, they can be used in developing a vulnerability prediction model to classify code as vulnerable or not. By analyzing and comparing the performance of traceable patterns with metrics, we propose a vulnerability prediction model. This study explores the performance of some code patterns in vulnerability prediction and compares them with traditional software metrics. We use the findings to build an effective vulnerability prediction model. We evaluate security vulnerabilities reported for Apache Tomcat, Apache CXF and three stand-alone Java web applications. We use machine learning and statistical techniques for predicting vulnerabilities using traceable patterns and metrics as features. We found that patterns have a lower false negative rate and higher recall in detecting vulnerable code than the traditional software metrics.", "doi": "10.1109/ase.2017.8115724", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115724", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115724"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115724"}
{"title": "Towards search-based modelling and analysis of requirements and architecture decisions", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saheed A. Busari"], "abstract": "Many requirements engineering and software architecture decisions are complicated by uncertainty and multiple conflicting stakeholders objectives. Using quantitative decision models helps clarify these decisions and allows the use of multi-objective simulation optimisation techniques in analysing the impact of decisions on objectives. Existing requirements and architecture decision support methods that use quantitative decision models are limited by the difficulty in elaborating problem-specific decision models and/or lack integrated tool support for automated decision analysis under uncertainty. To address these problems and facilitate requirements and architecture decision analysis, this research proposes a novel modelling language and automated decision analysis technique, implemented in a tool called RADAR. The modelling language is a simplified version of quantitative AND/OR goal models used in requirements engineering and similar to feature models used in software product lines. This research involves developing the RADAR tool and evaluating the tool's applicability, usefulness and scalability on a set of real-world examples.", "doi": "10.1109/ase.2017.8115725", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115725", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115725"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115725"}
{"title": "Privacy-aware data-intensive applications", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michele Guerriero"], "abstract": "The rise of Big Data is leading to an increasing demand for data-intensive applications (DIAs), which, in many cases, are expected to process massive amounts of sensitive data. In this context, ensuring data privacy becomes paramount. While the way we design and develop DIAs has radically changed over the last few years in order to deal with Big Data, there has been relatively little effort to make such design privacy-aware. As a result, enforcing privacy policies in large-scale data processing is currently an open research problem. This thesis proposal makes one step towards this investigation: after identifying the dataflow model as the reference computational model for large-scale DIAs, (1) we propose a novel language for specifying privacy policies on dataflow applications along with (2) a dataflow rewriting mechanism to enforce such policies during DIA execution. Although a systematic evaluation still needs to be carried out, preliminary results are promising. We plan to implement our approach within a model-driven solution to ultimately simplify the design and development of privacy-aware DIAs, i.e. DIAs that ensure privacy policies at runtime.", "doi": "10.1109/ase.2017.8115726", "arxiv_id": "https://doi.org/10.1109/ASE.2017.8115726", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2017.8115726"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2017.8115726"}
{"title": "Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, September 3-7, 2018", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marianne Huchard", "Christian Kästner", "Gordon Fraser"], "abstract": "International audience", "doi": "10.1145/3238147", "arxiv_id": "https://doi.org/10.1145/3238147", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147"}
{"title": "Software heritage: collecting, preserving, and sharing all our source code (keynote)", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Roberto Di Cosmo"], "abstract": "Software Heritage is a non profit initiative whose ambitious goal is to collect, preserve and share the source code of all software ever written, with its full development history, building a universal source code software knowledge base. Software Heritage addresses a variety of needs: preserving our scientific and technological knowledge, enabling better software development and reuse for society and industry, fostering better science, and building an essential infrastructure for large scale, reproducible software studies. We have already collected over 4 billions unique source files from over 80 millions repositories, and organised them into a giant Merkle graph, with full deduplication across all repositories. This allows us to cope with the growth of collaborative software development, and provides a unique vantage point for observing its evolution. In this talk, we will highlight the new challenges and opportunities that Software Heritage brings up.", "doi": "10.1145/3238147.3241985", "arxiv_id": "https://doi.org/10.1145/3238147.3241985", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241985"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241985"}
{"title": "Automated requirements engineering challenges with examples from small unmanned aerial systems (keynote)", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jane Cleland-Huang"], "abstract": "Requirements Engineering includes various activities aimed at discovering, analyzing, validating, evolving, and managing software and systems requirements. Many of these activities are human facing, effort intensive, and sometimes error prone. They could benefit greatly from cutting edge advances in automation. However, the software engineering community has primarily focused on automating other aspects of the development process such as testing, code analytics, and mining software respositories. As a result, advances in software analytics have had superficial impact upon advancing the state of art and practice in the field of requirements engineering. Two primary inhibitors are the lack of publicly available datasets and poorly publicized industry-relevant open requirements analytic challenges. To empower the Automated Software Engineering community to tackle open Requirements Engineering challenges, the talk will describe the rapidly evolving landscape of requirements engineering, clearly articulate open challenges, draw upon examples from an ongoing, agile, safety-critical project in the domain of Unmanned Aerial Vehicles, and introduce Dronology as a new community dataset.", "doi": "10.1145/3238147.3241986", "arxiv_id": "https://doi.org/10.1145/3238147.3241986", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241986"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241986"}
{"title": "Implementation science for software engineering: bridging the gap between research and practice (keynote)", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lauren Herckis"], "abstract": "Software engineering research rarely impacts practitioners in the field. A desire to facilitate transfer alone is not sufficient to bridge the gap between research and practice. Fields from medicine to education have acknowledged a similar challenge over the past 25 years. An empirical approach to the translation of research into evidence-based practice has emerged from the resulting discussion. Implementation science has fundamentally changed the way that biomedical research is conducted, and has revolutionized the daily practice of doctors, social workers, epidemiologists, early childhood educators, and more. In this talk we will explore the methods, frameworks, and practices of implementation science and their application to novel disciplines, including software engineering research. We will close by proposing some directions for future software engineering research to facilitate transfer.", "doi": "10.1145/3238147.3264581", "arxiv_id": "https://doi.org/10.1145/3238147.3264581", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3264581"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3264581"}
{"title": "The need for context in software engineering (IEEE CS Harlan Mills award keynote)", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gail C. Murphy"], "abstract": "The development of a software system requires the orchestration of many different people using many different tools. Despite the need for a developer who is performing a task to understand the context in which that task is undertaken, the tools we imagine, build and provide to support software developers are typically isolated. Instead of the tools helping a developer work within the appropriate context, it is the developer who must bring the context to the tools. In this talk, I will argue that the lack of context in the software engineering tools we build limits the effectiveness of developers and of our software development practices.", "doi": "10.1145/3238147.3241987", "arxiv_id": "https://doi.org/10.1145/3238147.3241987", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241987"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241987"}
{"title": "On adopting linters to deal with performance concerns in Android apps", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sarra Habchi", "Xavier Blanc", "Romain Rouvoy"], "abstract": "With millions of applications (apps) distributed through mobile markets, engaging and retaining end-users challenge Android developers to deliver a nearly perfect user experience. As mobile apps run in resource-limited devices, performance is a critical criterion for the quality of experience. Therefore, developers are expected to pay much attention to limit performance bad practices. On the one hand, many studies already identified such performance bad practices and showed that they can heavily impact app performance. Hence, many static analysers, a.k.a. linters, have been proposed to detect and fix these bad practices. On the other hand, other studies have shown that Android developers tend to deal with performance reactively and they rarely build on linters to detect and fix performance bad practices. In this paper, we therefore perform a qualitative study to investigate this gap between research and development community. In particular, we performed interviews with 14 experienced Android developers to identify the perceived benefits and constraints of using linters to identify performance bad practices in Android apps. Our observations can have a direct impact on developers and the research community. Specifically, we describe why and how developers leverage static source code analysers to improve the performance of their apps. On top of that, we bring to light important challenges faced by developers when it comes to adopting static analysis for performance purposes.", "doi": "10.1145/3238147.3238197", "arxiv_id": "https://doi.org/10.1145/3238147.3238197", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238197"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238197"}
{"title": "PerfLearner: learning from bug reports to understand and generate performance test frames", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xue Han", "Tingting Yu", "David Lo"], "abstract": "Software performance is important for ensuring the quality of software products. Performance bugs, defined as programming errors that cause significant performance degradation, can lead to slow systems and poor user experience. While there has been some research on automated performance testing such as test case generation, the main idea is to select workload values to increase the program execution times. These techniques often assume the initial test cases have the right combination of input parameters and focus on evolving values of certain input parameters. However, such an assumption may not hold for highly configurable real-word applications, in which the combinations of input parameters can be very large. In this paper, we manually analyze 300 bug reports from three large open source projects - Apache HTTP Server, MySQL, and Mozilla Firefox. We found that 1) exposing performance bugs often requires combinations of multiple input parameters, and 2) certain input parameters are frequently involved in exposing performance bugs. Guided by these findings, we designed and evaluated an automated approach, PerfLearner, to extract execution commands and input parameters from descriptions of performance bug reports and use them to generate test frames for guiding actual performance test case generation.", "doi": "10.1145/3238147.3238204", "arxiv_id": "https://doi.org/10.1145/3238147.3238204", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238204"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238204"}
{"title": "AutoConfig: automatic configuration tuning for distributed message systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Liang Bao", "Xin Liu", "Ziheng Xu", "Baoyin Fang"], "abstract": "Distributed message systems (DMSs) serve as the communication backbone for many real-time streaming data processing applications. To support the vast diversity of such applications, DMSs provide a large number of parameters to configure. However, It overwhelms for most users to configure these parameters well for better performance. Although many automatic configuration approaches have been proposed to address this issue, critical challenges still remain: 1) to train a better and robust performance prediction model using a limited number of samples, and 2) to search for a high-dimensional parameter space efficiently within a time constraint. In this paper, we propose AutoConfig – an automatic configuration system that can optimize producer-side throughput on DMSs. AutoConfig constructs a novel comparison-based model (CBM) that is more robust that the prediction-based model (PBM) used by previous learning-based approaches. Furthermore, AutoConfig uses a weighted Latin hypercube sampling (wLHS) approach to select a set of samples that can provide a better coverage over the high-dimensional parameter space. wLHS allows AutoConfig to search for more promising configurations using the trained CBM. We have implemented AutoConfig on the Kafka platform, and evaluated it using eight different testing scenarios deployed on a public cloud. Experimental results show that our CBM can obtain better results than that of PBM under the same random forests based model. Furthermore, AutoConfig outperforms default configurations by 215.40% on average, and five state-of-the-art configuration algorithms by 7.21%-64.56%.", "doi": "10.1145/3238147.3238175", "arxiv_id": "https://doi.org/10.1145/3238147.3238175", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238175"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238175"}
{"title": "Is this class thread-safe? inferring documentation using graph-based learning", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andrew Habib", "Michael Pradel"], "abstract": "Thread-safe classes are pervasive in concurrent, object-oriented software. However, many classes lack documentation regarding their safety guarantees under multi-threaded usage. This lack of documentation forces developers who use a class in a concurrent program to either carefully inspect the implementation of the class, to conservatively synchronize all accesses to it, or to optimistically assume that the class is thread-safe. To overcome the lack of documentation, we present TSFinder, an approach to automatically classify classes as supposedly thread-safe or thread-unsafe. The key idea is to combine a lightweight static analysis that extracts a graph representation from classes with a graph-based classifier. After training the classifier with classes known to be thread-safe and thread-unsafe, it achieves an accuracy of 94.5% on previously unseen classes, enabling the approach to infer thread safety documentation with high confidence. The classifier takes about 3 seconds per class, i.e., it is efficient enough to infer documentation for many classes.", "doi": "10.1145/3238147.3238212", "arxiv_id": "https://doi.org/10.1145/3238147.3238212", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238212"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238212"}
{"title": "A large-scale study of test coverage evolution", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michael Hilton", "Jonathan Bell", "Darko Marinov"], "abstract": "Statement coverage is commonly used as a measure of test suite quality. Coverage is often used as a part of a code review process: if a patch decreases overall coverage, or is itself not covered, then the patch is scrutinized more closely. Traditional studies of how coverage changes with code evolution have examined the overall coverage of the entire program, and more recent work directly examines the coverage of patches (changed statements). We present an evaluation much larger than prior studies and moreover consider a new, important kind of change – coverage changes of unchanged statements. We present a large-scale evaluation of code coverage evolution over 7,816 builds of 47 projects written in popular languages including Java, Python, and Scala. We find that in large, mature projects, simply measuring the change to statement coverage does not capture the nuances of code evolution. Going beyond considering statement coverage as a simple ratio, we examine how the set of statements covered evolves between project revisions. We present and study new ways to assess the impact of a patch on a project's test suite quality that both separates coverage of the patch from coverage of the non-patch, and separates changes in coverage from changes in the set of statements covered.", "doi": "10.1145/3238147.3238183", "arxiv_id": "https://doi.org/10.1145/3238147.3238183", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238183"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238183"}
{"title": "Effectiveness and challenges in generating concurrent tests for thread-safe classes", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Valerio Terragni", "Mauro Pezzè"], "abstract": "Developing correct and efficient concurrent programs is difficult and error-prone, due to the complexity of thread synchronization. Often, developers alleviate such problem by relying on thread-safe classes, which encapsulate most synchronization-related challenges. Thus, testing such classes is crucial to ensure the reliability of the concurrency aspects of programs. Some recent techniques and corresponding tools tackle the problem of testing thread-safe classes by automatically generating concurrent tests. In this paper, we present a comprehensive study of the state-of-the-art techniques and an independent empirical evaluation of the publicly available tools. We conducted the study by executing all tools on the JaConTeBe benchmark that contains 47 well-documented concurrency faults. Our results show that 8 out of 47 faults (17%) were detected by at least one tool. By studying the issues of the tools and the generated tests, we derive insights to guide future research on improving the effectiveness of automated concurrent test generation.", "doi": "10.1145/3238147.3238224", "arxiv_id": "https://doi.org/10.1145/3238147.3238224", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238224"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238224"}
{"title": "Scalable incremental building with dynamic task dependencies", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gabriël Konat", "Sebastian Erdweg", "Eelco Visser"], "abstract": "Incremental build systems are essential for fast, reproducible software builds. Incremental build systems enable short feedback cycles when they capture dependencies precisely and selectively execute build tasks efficiently. A much overlooked feature of build systems is the expressiveness of the scripting language, which directly influences the maintainability of build scripts. In this paper, we present a new incremental build algorithm that allows build engineers to use a full-fledged programming language with explicit task invocation, value and file inspection facilities, and conditional and iterative language constructs. In contrast to prior work on incrementality for such programmable builds, our algorithm scales with the number of tasks affected by a change and is independent of the size of the software project being built. Specifically, our algorithm accepts a set of changed files, transitively detects and re-executes affected build tasks, but also accounts for new task dependencies discovered during building. We have evaluated the performance of our algorithm in a real-world case study and confirm its scalability.", "doi": "10.1145/3238147.3238196", "arxiv_id": "https://doi.org/10.1145/3238147.3238196", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238196"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238196"}
{"title": "Noise and heterogeneity in historical build data: an empirical study of Travis CI", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Keheliya Gallaba", "Christian Macho", "Martin Pinzger", "Shane McIntosh"], "abstract": "Automated builds, which may pass or fail, provide feedback to a development team about changes to the codebase. A passing build indicates that the change compiles cleanly and tests (continue to) pass. A failing (a.k.a., broken) build indicates that there are issues that require attention. Without a closer analysis of the nature of build outcome data, practitioners and researchers are likely to make two critical assumptions: (1) build results are not noisy; however, passing builds may contain failing or skipped jobs that are actively or passively ignored; and (2) builds are equal; however, builds vary in terms of the number of jobs and configurations. To investigate the degree to which these assumptions about build breakage hold, we perform an empirical study of 3.7 million build jobs spanning 1,276 open source projects. We find that: (1) 12% of passing builds have an actively ignored failure; (2) 9% of builds have a misleading or incorrect outcome on average; and (3) at least 44% of the broken builds contain passing jobs, i.e., the breakage is local to a subset of build variants. Like other software archives, build data is noisy and complex. Analysis of build data requires nuance.", "doi": "10.1145/3238147.3238171", "arxiv_id": "https://doi.org/10.1145/3238147.3238171", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238171"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238171"}
{"title": "Automated directed fairness testing", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sakshi Udeshi", "Pryanshu Arora", "Sudipta Chattopadhyay"], "abstract": "  Fairness is a critical trait in decision making. As machine-learning models\nare increasingly being used in sensitive application domains (e.g. education\nand employment) for decision making, it is crucial that the decisions computed\nby such models are free of unintended bias. But how can we automatically\nvalidate the fairness of arbitrary machine-learning models? For a given\nmachine-learning model and a set of sensitive input parameters, our AEQUITAS\napproach automatically discovers discriminatory inputs that highlight fairness\nviolation. At the core of AEQUITAS are three novel strategies to employ\nprobabilistic search over the input space with the objective of uncovering\nfairness violation. Our AEQUITAS approach leverages inherent robustness\nproperty in common machine-learning models to design and implement scalable\ntest generation methodologies. An appealing feature of our generated test\ninputs is that they can be systematically added to the training set of the\nunderlying model and improve its fairness. To this end, we design a fully\nautomated module that guarantees to improve the fairness of the underlying\nmodel.\n  We implemented AEQUITAS and we have evaluated it on six state-of-the-art\nclassifiers, including a classifier that was designed with fairness\nconstraints. We show that AEQUITAS effectively generates inputs to uncover\nfairness violation in all the subject classifiers and systematically improves\nthe fairness of the respective models using the generated test inputs. In our\nevaluation, AEQUITAS generates up to 70% discriminatory inputs (w.r.t. the\ntotal number of inputs generated) and leverages these inputs to improve the\nfairness up to 94%.\n", "doi": "10.1145/3238147.3238165", "arxiv_id": "https://doi.org/10.1145/3238147.3238165", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238165", "https://arxiv.org/pdf/1807.00468"], "github": ["https://github.com/sakshiudeshi/Aequitas"], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238165", "journal_ref": "Automated Directed Fairness Testing. In Proceedings of the 2018\n  33rd ACM/IEEE International Conference on Automated Software Engineering (ASE\n  18), September 3-7, 2018, Montpellier, France", "categories": "cs.LG cs.AI cs.SE stat.ML", "cited_by": 0}
{"title": "Concolic testing for deep neural networks", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Youcheng Sun", "Min Wu", "Wenjie Ruan", "Xiaowei Huang", "Marta Kwiatkowska", "Daniel Kroening"], "abstract": "Concolic testing combines program execution and symbolic analysis to explore the execution paths of a software program. This paper presents the first concolic testing approach for Deep Neural Networks (DNNs). More specifically, we formalise coverage criteria for DNNs that have been studied in the literature, and then develop a coherent method for performing concolic testing to increase test coverage. Our experimental results show the effectiveness of the concolic testing approach in both achieving high coverage and finding adversarial examples.", "doi": "10.1145/3238147.3238172", "arxiv_id": "https://doi.org/10.1145/3238147.3238172", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238172"], "github": ["https://github.com/TrustAI/DeepConcolic", "https://github.com/parthbhope/test"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238172"}
{"title": "DeepGauge: multi-granularity testing criteria for deep learning systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lei Ma", "Felix Juefei-Xu", "Fuyuan Zhang", "Jiyuan Sun", "Minhui Xue", "Bo Li", "Chunyang Chen", "Ting Su", "Li Li", "Yang Liu", "Jianjun Zhao", "Yadong Wang"], "abstract": "  Deep learning (DL) defines a new data-driven programming paradigm that\nconstructs the internal system logic of a crafted neuron network through a set\nof training data. We have seen wide adoption of DL in many safety-critical\nscenarios. However, a plethora of studies have shown that the state-of-the-art\nDL systems suffer from various vulnerabilities which can lead to severe\nconsequences when applied to real-world applications. Currently, the testing\nadequacy of a DL system is usually measured by the accuracy of test data.\nConsidering the limitation of accessible high quality test data, good accuracy\nperformance on test data can hardly provide confidence to the testing adequacy\nand generality of DL systems. Unlike traditional software systems that have\nclear and controllable logic and functionality, the lack of interpretability in\na DL system makes system analysis and defect detection difficult, which could\npotentially hinder its real-world deployment. In this paper, we propose\nDeepGauge, a set of multi-granularity testing criteria for DL systems, which\naims at rendering a multi-faceted portrayal of the testbed. The in-depth\nevaluation of our proposed testing criteria is demonstrated on two well-known\ndatasets, five DL systems, and with four state-of-the-art adversarial attack\ntechniques against DL. The potential usefulness of DeepGauge sheds light on the\nconstruction of more generic and robust DL systems.\n", "doi": "10.1145/3238147.3238202", "arxiv_id": "https://doi.org/10.1145/3238147.3238202", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238202", "https://arxiv.org/pdf/1803.07519"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238202", "journal_ref": "DeepGauge: Multi-Granularity Testing Criteria for Deep Learning\n  Systems. In Proceedings of the 33rd ACM/IEEE International Conference on\n  Automated Software Engineering (ASE 18), September 3-7, 2018, Montpellier,\n  France", "categories": "cs.SE cs.CR cs.LG stat.ML", "cited_by": 0}
{"title": "DeepRoad: GAN-based metamorphic testing and input validation framework for autonomous driving systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mengshi Zhang", "Yuqun Zhang", "Lingming Zhang", "Cong Liu", "Sarfraz Khurshid"], "abstract": "While Deep Neural Networks (DNNs) have established the fundamentals of image-based autonomous driving systems, they may exhibit erroneous behaviors and cause fatal accidents. To address the safety issues in autonomous driving systems, a recent set of testing techniques have been designed to automatically generate artificial driving scenes to enrich test suite, e.g., generating new input images transformed from the original ones. However, these techniques are insufficient due to two limitations: first, many such synthetic images often lack diversity of driving scenes, and hence compromise the resulting efficacy and reliability. Second, for machine-learning-based systems, a mismatch between training and application domain can dramatically degrade system accuracy, such that it is necessary to validate inputs for improving system robustness. In this paper, we propose DeepRoad, an unsupervised DNN-based framework for automatically testing the consistency of DNN-based autonomous driving systems and online validation. First, DeepRoad automatically synthesizes large amounts of diverse driving scenes without using image transformation rules (e.g. scale, shear and rotation). In particular, DeepRoad is able to produce driving scenes with various weather conditions (including those with rather extreme conditions) by applying Generative Adversarial Networks (GANs) along with the corresponding real-world weather scenes. Second, DeepRoad utilizes metamorphic testing techniques to check the consistency of such systems using synthetic images. Third, DeepRoad validates input images for DNN-based systems by measuring the distance of the input and training images using their VGGNet features. We implement DeepRoad to test three well-recognized DNN-based autonomous driving systems in Udacity self-driving car challenge. The experimental results demonstrate that DeepRoad can detect thousands of inconsistent behaviors for these systems, and effectively validate input images to potentially enhance the system robustness as well.", "doi": "10.1145/3238147.3238187", "arxiv_id": "https://doi.org/10.1145/3238147.3238187", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238187"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238187"}
{"title": "Testing autonomous cars for feature interaction failures using many-objective search", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Raja Ben Abdessalem", "Annibale Panichella", "Shiva Nejati", "Lionel C. Briand", "Thomas Stifter"], "abstract": "Complex systems such as autonomous cars are typically built as a composition of features that are independent units of functionality. Features tend to interact and impact one another's behavior in unknown ways. A challenge is to detect and manage feature interactions, in particular, those that violate system requirements, hence leading to failures. In this paper, we propose a technique to detect feature interaction failures by casting this problem into a search-based test generation problem. We define a set of hybrid test objectives (distance functions) that combine traditional coverage-based heuristics with new heuristics specifically aimed at revealing feature interaction failures. We develop a new search-based test generation algorithm, called FITEST, that is guided by our hybrid test objectives. FITEST extends recently proposed many-objective evolutionary algorithms to reduce the time required to compute fitness values. We evaluate our approach using two versions of an industrial self-driving system. Our results show that our hybrid test objectives are able to identify more than twice as many feature interaction failures as two baseline test objectives used in the software testing literature (i.e., coverage-based and failure-based test objectives). Further, the feedback from domain experts indicates that the detected feature interaction failures represent real faults in their systems that were not previously identified based on analysis of the system features and their requirements.", "doi": "10.1145/3238147.3238192", "arxiv_id": "https://doi.org/10.1145/3238147.3238192", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238192"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238192"}
{"title": "Tackling combinatorial explosion: a study of industrial needs and practices for analyzing highly configurable systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mukelabai Mukelabai", "Damir Nesic", "Salome Maro", "Thorsten Berger", "Jan-Philipp Steghöfer"], "abstract": "Highly configurable systems are complex pieces of software. To tackle this complexity, hundreds of dedicated analysis techniques have been conceived, many of which able to analyze system properties for all possible system configurations, as opposed to traditional, single-system analyses. Unfortunately, it is largely unknown whether these techniques are adopted in practice, whether they address actual needs, or what strategies practitioners actually apply to analyze highly configurable systems. We present a study of analysis practices and needs in industry. It relied on a survey with 27 practitioners engineering highly configurable systems and follow-up interviews with 15 of them, covering 18 different companies from eight countries. We confirm that typical properties considered in the literature (e.g., reliability) are relevant, that consistency between variability models and artifacts is critical, but that the majority of analyses for specifications of configuration options (a.k.a., variability model analysis) is not perceived as needed. We identified rather pragmatic analysis strategies, including practices to avoid the need for analysis. For instance, testing with experience-based sampling is the most commonly applied strategy, while systematic sampling is rarely applicable. We discuss analyses that are missing and synthesize our insights into suggestions for future research.", "doi": "10.1145/3238147.3238201", "arxiv_id": "https://doi.org/10.1145/3238147.3238201", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238201"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238201"}
{"title": "Understanding and detecting evolution-induced compatibility issues in Android apps", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dongjie He", "Lian Li", "Lei Wang", "Hengjie Zheng", "Guangwei Li", "Jingling Xue"], "abstract": "The frequent release of Android OS and its various versions bring many compatibility issues to Android Apps. This paper studies and addresses such evolution-induced compatibility problems. We conduct an extensive empirical study over 11 different Android versions and 4,936 Android Apps. Our study shows that there are drastic API changes between adjacent Android versions, with averagely 140.8 new types, 1,505.6 new methods, and 979.2 new fields being introduced in each release. However, the Android Support Library (provided by the Android OS) only supports less than 23% of the newly added methods, with much less support for new types and fields. As a result, 91.84% of Android Apps write additional code to support different OS versions. Furthermore, 88.65% of the supporting codes share a common pattern, which directly compares variable android.os.Build.VERSION.SDK_INT with a constant version number, to use an API of particular versions. Based on our findings, we develop a new tool called IctApiFinder, to detect incompatible API usages in Android applications. IctApiFinder effectively computes the OS versions on which an API may be invoked, using an inter-procedural data-flow analysis frame-work. It detects numerous incompatible API usages in 361 out of 1,425 Apps. Compared to Android Lint, IctApiFinder is sound and able to reduce the false positives by 82.1%. We have reported the issues to 13 Apps developers. At present, 5 of them have already been confirmed by the original developers and 3 of them have already been fixed.", "doi": "10.1145/3238147.3238185", "arxiv_id": "https://doi.org/10.1145/3238147.3238185", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238185"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238185"}
{"title": "Characterizing the natural language descriptions in software logging statements", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pinjia He", "Zhuangbin Chen", "Shilin He", "Michael R. Lyu"], "abstract": "Logging is a common programming practice of great importance in modern software development, because software logs have been widely used in various software maintenance tasks. To provide high-quality logs, developers need to design the description text in logging statements carefully. Inappropriate descriptions will slow down or even mislead the maintenance process, such as postmortem analysis. However, there is currently a lack of rigorous guide and specifications on developer logging behaviors, which makes the construction of description text in logging statements a challenging problem. To fill this significant gap, in this paper, we systematically study what developers log, with focus on the usage of natural language descriptions in logging statements. We obtain 6 valuable findings by conducting source code analysis on 10 Java projects and 7 C# projects, which contain 28,532,975 LOC and 115,159 logging statements in total. Furthermore, our study demonstrates the potential of automated description text generation for logging statements by obtaining up to 49.04 BLEU-4 score and 62.1 ROUGE-L score using a simple information retrieval method. To facilitate future research in this field, the datasets have been publicly released.", "doi": "10.1145/3238147.3238193", "arxiv_id": "https://doi.org/10.1145/3238147.3238193", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238193"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238193"}
{"title": "Assessing the type annotation burden", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["John-Paul Ore", "Sebastian G. Elbaum", "Carrick Detweiler", "Lambros Karkazis"], "abstract": "Type annotations provide a link between program variables and domain-specific types. When combined with a type system, these annotations can enable early fault detection. For type annotations to be cost-effective in practice, they need to be both accurate and affordable for developers. We lack, however, an understanding of how burdensome type annotation is for developers. Hence, this work explores three fundamental questions: 1) how accurately do developers make type annotations; 2) how long does a single annotation take; and, 3) if a system could automatically suggest a type annotation, how beneficial to accuracy are correct suggestions and how detrimental are incorrect suggestions? We present results of a study of 71 programmers using 20 random code artifacts that contain variables with physical unit types that must be annotated. Subjects choose a correct type annotation only 51% of the time and take an average of 136 seconds to make a single correct annotation. Our qualitative analysis reveals that variable names and reasoning over mathematical operations are the leading clues for type selection. We find that suggesting the correct type boosts accuracy to 73%, while making a poor suggestion decreases accuracy to 28%. We also explore what state-of-the-art automated type annotation systems can and cannot do to help developers with type annotations, and identify implications for tool developers.", "doi": "10.1145/3238147.3238173", "arxiv_id": "https://doi.org/10.1145/3238147.3238173", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238173"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238173"}
{"title": "Mining file histories: should we consider branches?", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir Kovalenko", "Fabio Palomba", "Alberto Bacchelli"], "abstract": "Modern distributed version control systems, such as Git, offer support for branching — the possibility to develop parts of software outside the master trunk. Consideration of the repository structure in Mining Software Repository (MSR) studies requires a thorough approach to mining, but there is no well-documented, widespread methodology regarding the handling of merge commits and branches. Moreover, there is still a lack of knowledge of the extent to which considering branches during MSR studies impacts the results of the studies. In this study, we set out to evaluate the importance of proper handling of branches when calculating file modification histories. We analyze over 1,400 Git repositories of four open source ecosystems and compute modification histories for over two million files, using two different algorithms. One algorithm only follows the first parent of each commit when traversing the repository, the other returns the full modification history of a file across all branches. We show that the two algorithms consistently deliver different results, but the scale of the difference varies across projects and ecosystems. Further, we evaluate the importance of accurate mining of file histories by comparing the performance of common techniques that rely on file modification history — reviewer recommendation, change recommendation, and defect prediction — for two algorithms of file history retrieval. We find that considering full file histories leads to an increase in the techniques' performance that is rather modest.", "doi": "10.1145/3238147.3238169", "arxiv_id": "https://doi.org/10.1145/3238147.3238169", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238169"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238169"}
{"title": "Tell them apart: distilling technology differences from crowd-scale comparison discussions", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yi Huang", "Chunyang Chen", "Zhenchang Xing", "Tian Lin", "Yang Liu"], "abstract": "Developers can use different technologies for many software development tasks in their work. However, when faced with several technologies with comparable functionalities, it is not easy for developers to select the most appropriate one, as comparisons among technologies are time-consuming by trial and error. Instead, developers can resort to expert articles, read official documents or ask questions in Q&A sites for technology comparison, but it is opportunistic to get a comprehensive comparison as online information is often fragmented or contradictory. To overcome these limitations, we propose the diffTech system that exploits the crowdsourced discussions from Stack Overflow, and assists technology comparison with an informative summary of different comparison aspects. We first build a large database of comparable software technologies by mining tags in Stack Overflow, and locate comparative sentences about comparable technologies with NLP methods. We further mine prominent comparison aspects by clustering similar comparative sentences and represent each cluster with its keywords. The evaluation demonstrates both the accuracy and usefulness of our model and we implement a practical website for public use.", "doi": "10.1145/3238147.3238208", "arxiv_id": "https://doi.org/10.1145/3238147.3238208", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238208"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238208"}
{"title": "ReScue: crafting regular expression DoS attacks", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuju Shen", "Yanyan Jiang", "Chang Xu", "Ping Yu", "Xiaoxing Ma", "Jian Lu"], "abstract": "Regular expression (regex) with modern extensions is one of the most popular string processing tools. However, poorly-designed regexes can yield exponentially many matching steps, and lead to regex Denial-of-Service (ReDoS) attacks under well-conceived string inputs. This paper presents ReScue, a three-phase gray-box analytical technique, to automatically generate ReDoS strings to highlight vulnerabilities of given regexes. ReScue systematically seeds (by a genetic search), incubates (by another genetic search), and finally pumps (by a regex-dedicated algorithm) for generating strings with maximized search time. We implemenmted the ReScue tool and evaluated it against 29,088 practical regexes in real-world projects. The evaluation results show that ReScue found 49% more attack strings compared with the best existing technique, and applying ReScue to popular GitHub projects discovered ten previously unknown ReDoS vulnerabilities.", "doi": "10.1145/3238147.3238159", "arxiv_id": "https://doi.org/10.1145/3238147.3238159", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238159"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238159"}
{"title": "TDroid: exposing app switching attacks in Android with control flow specialization", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jie Liu", "Diyu Wu", "Jingling Xue"], "abstract": "The Android multitasking mechanism can be plagued with app switching attacks, in which a malicious app replaces the legitimate top activity of the focused app with one of its own, thus mounting, e.g., phishing and denial-of-service attacks. Existing market-level defenses are still ineffective, as static analysis is fundamentally unable to reason about the intention of an app and dynamic analysis has low coverage.", "doi": "10.1145/3238147.3238188", "arxiv_id": "https://doi.org/10.1145/3238147.3238188", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238188"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238188"}
{"title": "Model-driven run-time enforcement of complex role-based access control policies", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ameni Ben Fadhel", "Domenico Bianculli", "Lionel C. Briand"], "abstract": "A Role-based Access Control (RBAC) mechanism prevents unauthorized users to perform an operation, according to authorization policies which are defined on the user’s role within an enterprise. Several models have been proposed to specify complex RBAC policies. However, existing approaches for policy enforcement do not fully support all the types of policies that can be expressed in these models, which hinders their adoption among practitioners. In this paper we propose a model-driven enforcement framework for complex policies captured by GemRBAC+CTX, a comprehensive RBAC model proposed in the literature. We reduce the problem of making an access decision to checking whether a system state (from an RBAC point of view), expressed as an instance of the GemRBAC+CTX model, satisfies the constraints corresponding to the RBAC policies to be enforced at run time. We provide enforcement algorithms for various types of access requests and events, and a prototype tool (MORRO) implementing them. We also show how to integrate MORRO into an industrial Web application. The evaluation results show the applicability of our approach on a industrial system and its scalability with respect to the various parameters characterizing an AC configuration.", "doi": "10.1145/3238147.3238167", "arxiv_id": "https://doi.org/10.1145/3238147.3238167", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238167"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238167"}
{"title": "ContractFuzzer: fuzzing smart contracts for vulnerability detection", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bo Jiang", "Ye Liu", "W. K. Chan"], "abstract": "Decentralized cryptocurrencies feature the use of blockchain to transfer values among peers on networks without central agency. Smart contracts are programs running on top of the blockchain consensus protocol to enable people make agreements while minimizing trusts. Millions of smart contracts have been deployed in various decentralized applications. The security vulnerabilities within those smart contracts pose significant threats to their applications. Indeed, many critical security vulnerabilities within smart contracts on Ethereum platform have caused huge financial losses to their users. In this work, we present ContractFuzzer, a novel fuzzer to test Ethereum smart contracts for security vulnerabilities. ContractFuzzer generates fuzzing inputs based on the ABI specifications of smart contracts, defines test oracles to detect security vulnerabilities, instruments the EVM to log smart contracts runtime behaviors, and analyzes these logs to report security vulnerabilities. Our fuzzing of 6991 smart contracts has flagged more than 459 vulnerabilities with high precision. In particular, our fuzzing tool successfully detects the vulnerability of the DAO contract that leads to USD 60 million loss and the vulnerabilities of Parity Wallet that have led to the loss of USD 30 million and the freezing of USD 150 million worth of Ether.", "doi": "10.1145/3238147.3238177", "arxiv_id": "https://doi.org/10.1145/3238147.3238177", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238177"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238177"}
{"title": "SEEDE: simultaneous execution and editing in a development environment", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Steven P. Reiss", "Qi Xin", "Jeff Huang"], "abstract": "We introduce a tool within the Code Bubbles development environment that allows for continuous execution as the programmer edits. The tool, SEEDE, shows both the intermediate and final results of execution in terms of variables, control and data flow, output, and graphics. These results are updated as the user edits. The tool can be used to help the user write new code or to find and fix bugs. The tool is explicitly designed to let the user quickly explore the execution of a method along with all the code it invokes, possibly while writing or modifying the code. The user can start continuous execution either at a breakpoint or for a test case. This paper describes the tool, its implementation, and its user interface. It presents an initial user study of the tool demonstrating its potential utility.", "doi": "10.1145/3238147.3238182", "arxiv_id": "https://doi.org/10.1145/3238147.3238182", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238182"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238182"}
{"title": "Effective API recommendation without historical software repositories", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaoyu Liu", "LiGuo Huang", "Vincent Ng"], "abstract": "It is time-consuming and labor-intensive to learn and locate the correct API for programming tasks. Thus, it is beneficial to perform API recommendation automatically. The graph-based statistical model has been shown to recommend top-10 API candidates effectively. It falls short, however, in accurately recommending an actual top-1 API. To address this weakness, we propose RecRank, an approach and tool that applies a novel ranking-based discriminative approach leveraging API usage path features to improve top-1 API recommendation. Empirical evaluation on a large corpus of (1385+8) open source projects shows that RecRank significantly improves top-1 API recommendation accuracy and mean reciprocal rank when compared to state-of-the-art API recommendation approaches.", "doi": "10.1145/3238147.3238216", "arxiv_id": "https://doi.org/10.1145/3238147.3238216", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238216"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238216"}
{"title": "API method recommendation without worrying about the task-API knowledge gap", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qiao Huang", "Xin Xia", "Zhenchang Xing", "David Lo", "Xinyu Wang"], "abstract": "Developers often need to search for appropriate APIs for their programming tasks. Although most libraries have API reference documentation, it is not easy to find appropriate APIs due to the lexical gap and knowledge gap between the natural language description of the programming task and the API description in API documentation. Here, the lexical gap refers to the fact that the same semantic meaning can be expressed by different words, and the knowledge gap refers to the fact that API documentation mainly describes API functionality and structure but lacks other types of information like concepts and purposes, which are usually the key information in the task description. In this paper, we propose an API recommendation approach named BIKER (Bi-Information source based KnowledgE Recommendation) to tackle these two gaps. To bridge the lexical gap, BIKER uses word embedding technique to calculate the similarity score between two text descriptions. Inspired by our survey findings that developers incorporate Stack Overflow posts and API documentation for bridging the knowledge gap, BIKER leverages Stack Overflow posts to extract candidate APIs for a program task, and ranks candidate APIs by considering the query's similarity with both Stack Overflow posts and API documentation. It also summarizes supplementary information (e.g., API description, code examples in Stack Overflow posts) for each API to help developers select the APIs that are most relevant to their tasks. Our evaluation with 413 API-related questions confirms the effectiveness of BIKER for both class- and method-level API recommendation, compared with state-of-the-art baselines. Our user study with 28 Java developers further demonstrates the practicality of BIKER for API search.", "doi": "10.1145/3238147.3238191", "arxiv_id": "https://doi.org/10.1145/3238147.3238191", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238191"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238191"}
{"title": "An automated approach to estimating code coverage measures via execution logs", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Boyuan Chen", "Jian Song", "Peng Xu", "Xing Hu", "Zhen Ming (Jack) Jiang"], "abstract": "Software testing is a widely used technique to ensure the quality of software systems. Code coverage measures are commonly used to evaluate and improve the existing test suites. Based on our industrial and open source studies, existing state-of-the-art code coverage tools are only used during unit and integration testing due to issues like engineering challenges, performance overhead, and incomplete results. To resolve these issues, in this paper we have proposed an automated approach, called LogCoCo, to estimating code coverage measures using the readily available execution logs. Using program analysis techniques, LogCoCo matches the execution logs with their corresponding code paths and estimates three different code coverage criteria: method coverage, statement coverage, and branch coverage. Case studies on one open source system (HBase) and five commercial systems from Baidu and systems show that: (1) the results of LogCoCo are highly accurate (> 96% in seven out of nine experiments) under a variety of testing activities (unit testing, integration testing, and benchmarking); and (2) the results of LogCoCo can be used to evaluate and improve the existing test suites. Our collaborators at Baidu are currently considering adopting LogCoCo and use it on a daily basis.", "doi": "10.1145/3238147.3238214", "arxiv_id": "https://doi.org/10.1145/3238147.3238214", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238214"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238214"}
{"title": "How many of all bugs do we find? a study of static bug detectors", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andrew Habib", "Michael Pradel"], "abstract": "Static bug detectors are becoming increasingly popular and are widely used by professional software developers. While most work on bug detectors focuses on whether they find bugs at all, and on how many false positives they report in addition to legitimate warnings, the inverse question is often neglected: How many of all real-world bugs do static bug detectors find? This paper addresses this question by studying the results of applying three widely used static bug detectors to an extended version of the Defects4J dataset that consists of 15 Java projects with 594 known bugs. To decide which of these bugs the tools detect, we use a novel methodology that combines an automatic analysis of warnings and bugs with a manual validation of each candidate of a detected bug. The results of the study show that: (i) static bug detectors find a non-negligible amount of all bugs, (ii) different tools are mostly complementary to each other, and (iii) current bug detectors miss the large majority of the studied bugs. A detailed analysis of bugs missed by the static detectors shows that some bugs could have been found by variants of the existing detectors, while others are domain-specific problems that do not match any existing bug pattern. These findings help potential users of such tools to assess their utility, motivate and outline directions for future work on static bug detection, and provide a basis for future comparisons of static bug detection with other bug finding techniques, such as manual and automated testing.", "doi": "10.1145/3238147.3238213", "arxiv_id": "https://doi.org/10.1145/3238147.3238213", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238213"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238213"}
{"title": "TRIMMER: application specialization for code debloating", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hashim Sharif", "Muhammad Abubakar", "Ashish Gehani", "Fareed Zaffar"], "abstract": "With the proliferation of new hardware architectures and ever-evolving user requirements, the software stack is becoming increasingly bloated. In practice, only a limited subset of the supported functionality is utilized in a particular usage context, thereby presenting an opportunity to eliminate unused features. In the past, program specialization has been proposed as a mechanism for enabling automatic software debloating. In this work, we show how existing program specialization techniques lack the analyses required for providing code simplification for real-world programs. We present an approach that uses stronger analysis techniques to take advantage of constant configuration data, thereby enabling more effective debloating. We developed Trimmer, an application specialization tool that leverages user-provided configuration data to specialize an application to its deployment context. The specialization process attempts to eliminate the application functionality that is unused in the user-defined context. Our evaluation demonstrates Trimmer can effectively reduce code bloat. For 13 applications spanning various domains, we observe a mean binary size reduction of 21% and a maximum reduction of 75%. We also show specialization reduces the surface for code-reuse attacks by reducing the number of exploitable gadgets. For the evaluated programs, we observe a 20% mean reduction in the total gadget count and a maximum reduction of 87%.", "doi": "10.1145/3238147.3238160", "arxiv_id": "https://doi.org/10.1145/3238147.3238160", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238160"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238160"}
{"title": "A unified lattice model and framework for purity analyses", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dominik Helm", "Florian Kübler", "Michael Eichberg", "Michael Reif", "Mira Mezini"], "abstract": "Analyzing methods in object-oriented programs whether they are side-effect free and also deterministic, i.e., mathematically pure, has been the target of extensive research. Identifying such methods helps to find code smells and security related issues, and also helps analyses detecting concurrency bugs. Pure methods are also used by formal verification approaches as the foundations for specifications and proving the pureness is necessary to ensure correct specifications. However, so far no common terminology exists which describes the purity of methods. Furthermore, some terms (e.g., pure or side-effect free) are also used inconsistently. Further, all current approaches only report selected purity information making them only suitable for a smaller subset of the potential use cases. In this paper, we present a fine-grained unified lattice model which puts the purity levels found in the literature into relation and which adds a new level that generalizes existing definitions. We have also implemented a scalable, modularized purity analysis which produces significantly more precise results for real-world programs than the best-performing related work. The analysis shows that all defined levels are found in real-world projects.", "doi": "10.1145/3238147.3238226", "arxiv_id": "https://doi.org/10.1145/3238147.3238226", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238226"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238226"}
{"title": "Control flow-guided SMT solving for program verification", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jianhui Chen", "Fei He"], "abstract": "Satisfiability modulo theories (SMT) solvers have been widely applied as the reasoning engine for diverse software analysis and verification technologies. The efficiency of the SMT solver has significant effects on the performance of these technologies. However, the current SMT solvers are designed for the general purpose of constraint solving. Many useful knowledge of programs cannot be utilized during the SMT solving. As a result, the SMT solver may spend a lot of effort to explore redundant search space. In this paper, we propose a novel approach for utilizing control-flow knowledge in SMT solving. With this technique, the search space can be considerably reduced and the efficiency of SMT solving is observably improved. We conducted extensive experiments on credible benchmarks, the results show orders of magnitude improvements of our approach.", "doi": "10.1145/3238147.3238218", "arxiv_id": "https://doi.org/10.1145/3238147.3238218", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238218"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238218"}
{"title": "PaMpeR: proof method recommendation system for Isabelle/HOL", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yutaka Nagashima", "Yilun He"], "abstract": "Deciding which sub-tool to use for a given proof state requires expertise specific to each interactive theorem prover (ITP). To mitigate this problem, we present PaMpeR, a proof method recommendation system for Isabelle/HOL. Given a proof state, PaMpeR recommends proof methods to discharge the proof goal and provides qualitative explanations as to why it suggests these methods. PaMpeR generates these recommendations based on existing hand-written proof corpora, thus transferring experienced users’ expertise to new users. Our evaluation shows that PaMpeR correctly predicts experienced users’ proof methods invocation especially when it comes to special purpose proof methods.", "doi": "10.1145/3238147.3238210", "arxiv_id": "https://doi.org/10.1145/3238147.3238210", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238210"], "github": ["https://github.com/data61/PSL"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238210"}
{"title": "Neural-machine-translation-based commit message generation: how far are we?", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhongxin Liu", "Xin Xia", "Ahmed E. Hassan", "David Lo", "Zhenchang Xing", "Xinyu Wang"], "abstract": "Commit messages can be regarded as the documentation of software changes. These messages describe the content and purposes of changes, hence are useful for program comprehension and software maintenance. However, due to the lack of time and direct motivation, commit messages sometimes are neglected by developers. To address this problem, Jiang et al. proposed an approach (we refer to it as NMT), which leverages a neural machine translation algorithm to automatically generate short commit messages from code. The reported performance of their approach is promising, however, they did not explore why their approach performs well. Thus, in this paper, we first perform an in-depth analysis of their experimental results. We find that (1) Most of the test diffs from which NMT can generate high-quality messages are similar to one or more training diffs at the token level. (2) About 16% of the commit messages in Jiang et al.'s dataset are noisy due to being automatically generated or due to them describing repetitive trivial changes. (3) The performance of NMT declines by a large amount after removing such noisy commit messages. In addition, NMT is complicated and time-consuming. Inspired by our first finding, we proposed a simpler and faster approach, named NNGen (Nearest Neighbor Generator), to generate concise commit messages using the nearest neighbor algorithm. Our experimental results show that NNGen is over 2,600 times faster than NMT, and outperforms NMT in terms of BLEU (an accuracy measure that is widely used to evaluate machine translation systems) by 21%. Finally, we also discuss some observations for the road ahead for automated commit message generation to inspire other researchers.", "doi": "10.1145/3238147.3238190", "arxiv_id": "https://doi.org/10.1145/3238147.3238190", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238190"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238190"}
{"title": "Deep learning based feature envy detection", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hui Liu", "Zhifeng Xu", "Yanzhen Zou"], "abstract": "Software refactoring is widely employed to improve software quality. A key step in software refactoring is to identify which part of the software should be refactored. To facilitate the identification, a number of approaches have been proposed to identify certain structures in the code (called code smells) that suggest the possibility of refactoring. Most of such approaches rely on manually designed heuristics to map manually selected source code metrics to predictions. However, it is challenging to manually select the best features, especially textual features. It is also difficult to manually construct the optimal heuristics. To this end, in this paper we propose a deep learning based novel approach to detecting feature envy, one of the most common code smells. The key insight is that deep neural networks and advanced deep learning techniques could automatically select features (especially textual features) of source code for feature envy detection, and could automatically build the complex mapping between such features and predictions. We also propose an automatic approach to generating labeled training data for the neural network based classifier, which does not require any human intervention. Evaluation results on open-source applications suggest that the proposed approach significantly improves the state-of-the-art in both detecting feature envy smells and recommending destinations for identified smelly methods.", "doi": "10.1145/3238147.3238166", "arxiv_id": "https://doi.org/10.1145/3238147.3238166", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238166"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238166"}
{"title": "Improving automatic source code summarization via deep reinforcement learning", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yao Wan", "Zhou Zhao", "Min Yang", "Guandong Xu", "Haochao Ying", "Jian Wu", "Philip S. Yu"], "abstract": "Code summarization provides a high level natural language description of the function performed by code, as it can benefit the software maintenance, code categorization and retrieval. To the best of our knowledge, most state-of-the-art approaches follow an encoder-decoder framework which encodes the code into a hidden space and then decode it into natural language space, suffering from two major drawbacks: a) Their encoders only consider the sequential content of code, ignoring the tree structure which is also critical for the task of code summarization; b) Their decoders are typically trained to predict the next word by maximizing the likelihood of next ground-truth word with previous ground-truth word given. However, it is expected to generate the entire sequence from scratch at test time. This discrepancy can cause an exposure bias issue, making the learnt decoder suboptimal. In this paper, we incorporate an abstract syntax tree structure as well as sequential content of code snippets into a deep reinforcement learning framework (i.e., actor-critic network). The actor network provides the confidence of predicting the next word according to current state. On the other hand, the critic network evaluates the reward value of all possible extensions of the current state and can provide global guidance for explorations. We employ an advantage reward composed of BLEU metric to train both networks. Comprehensive experiments on a real-world dataset show the effectiveness of our proposed model when compared with some state-of-the-art methods.", "doi": "10.1145/3238147.3238206", "arxiv_id": "https://doi.org/10.1145/3238147.3238206", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238206"], "github": ["https://github.com/mf1832146/tree-transformer", "https://github.com/mf1832146/tree_transformer_2.0"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238206"}
{"title": "Template-guided concolic testing via online learning", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sooyoung Cha", "Seonho Lee", "Hakjoo Oh"], "abstract": "We present template-guided concolic testing, a new technique for effectively reducing the search space in concolic testing. Addressing the path-explosion problem has been a significant challenge in concolic testing. Diverse search heuristics have been proposed to mitigate this problem but using search heuristics alone is not sufficient to substantially improve code coverage for real-world programs. The goal of this paper is to complement existing techniques and achieve higher coverage by exploiting templates in concolic testing. In our approach, a template is a partially symbolized input vector whose job is to reduce the search space. However, choosing a right set of templates is nontrivial and significantly affects the final performance of our approach. We present an algorithm that automatically learns useful templates online, based on data collected from previous runs of concolic testing. The experimental results with open-source programs show that our technique achieves greater branch coverage and finds bugs more effectively than conventional concolic testing.", "doi": "10.1145/3238147.3238227", "arxiv_id": "https://doi.org/10.1145/3238147.3238227", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238227"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238227"}
{"title": "Android testing via synthetic symbolic execution", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiang Gao", "Shin Hwei Tan", "Zhen Dong", "Abhik Roychoudhury"], "abstract": "Symbolic execution of Android applications is challenging as it involves either building a customized VM for Android or modeling the Android libraries. Since the Android Runtime evolves from one version to another, building a high-fidelity symbolic execution engine involves modeling the effect of the libraries and their evolved versions. Without simulating the behavior of Android libraries, path divergence may occur due to constraint loss when the symbolic values flow into Android framework and these values later affect the subsequent path taken. Previous works such as JPF-Android have relied on the modeling of execution environment such as libraries. In this work, we build a dynamic symbolic execution engine for Android apps, without any manual modeling of execution environment. Environment (or library) dependent control flow decisions in the application will trigger an on-demand program synthesis step to automatically deduce a representation of the library.This representation is refined on-the-fly by running the corresponding library multiple times.The overarching goal of the refinement is to enhance behavioral coverage and to alleviate the path divergence problem during symbolic execution. Moreover, our library synthesis can be made context-specific. Compared to traditional synthesis approaches which aim to synthesize the complete library code, our context-specific synthesis engine can generate more precise expressions for a given context. The evaluation of our dynamic symbolic execution engine, built on top of JDART, shows that the library models obtained from program synthesis are often more accurate than the semi-manual models in JPF-Android. Furthermore, our symbolic execution engine could reach more branch targets, as compared to using the JPF-Android models.", "doi": "10.1145/3238147.3238225", "arxiv_id": "https://doi.org/10.1145/3238147.3238225", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238225"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238225"}
{"title": "PARTI: a multi-interval theory solver for symbolic execution", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Oscar Soria Dustmann", "Klaus Wehrle", "Cristian Cadar"], "abstract": "Symbolic execution is an effective program analysis technique whose scalability largely depends on the ability to quickly solve large numbers of first-order logic queries. We propose an effective general technique for speeding up the solving of queries in the theory of arrays and bit-vectors with a specific structure, while otherwise falling back to a complete solver.", "doi": "10.1145/3238147.3238179", "arxiv_id": "https://doi.org/10.1145/3238147.3238179", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238179"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238179"}
{"title": "Client-specific equivalence checking", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Federico Mora", "Yi Li", "Julia Rubin", "Marsha Chechik"], "abstract": "Software is often built by integrating components created by different teams or even different organizations. With little understanding of changes in dependent components, it is challenging to maintain correctness and robustness of the entire system. In this paper, we investigate the effect of component changes on the behavior of their clients. We observe that changes in a component are often irrelevant to a particular client and thus can be adopted without any delays or negative effects. Following this observation, we formulate the notion of client-specific equivalence checking (CSE) and develop an automated technique optimized for checking such equivalence. We evaluate our technique on a set of benchmarks, including those from the existing literature on equivalence checking, and show its applicability and effectiveness.", "doi": "10.1145/3238147.3238178", "arxiv_id": "https://doi.org/10.1145/3238147.3238178", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238178"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238178"}
{"title": "Replay without recording of production bugs for service oriented applications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nipun Arora", "Jonathan Bell", "Franjo Ivancic", "Gail E. Kaiser", "Baishakhi Ray"], "abstract": "Short time-to-localize and time-to-fix for production bugs is extremely important for any 24x7 service-oriented application (SOA). Debugging buggy behavior in deployed applications is hard, as it requires careful reproduction of a similar environment and workload. Prior approaches for automatically reproducing production failures do not scale to large SOA systems. Our key insight is that for many failures in SOA systems (e.g., many semantic and performance bugs), a failure can automatically be reproduced solely by relaying network packets to replicas of suspect services, an insight that we validated through a manual study of 16 real bugs across five different systems. This paper presents Parikshan, an application monitoring framework that leverages user-space virtualization and network proxy technologies to provide a sandbox “debug” environment. In this “debug” environment, developers are free to attach debuggers and analysis tools without impacting performance or correctness of the production environment. In comparison to existing monitoring solutions that can slow down production applications, Parikshan allows application monitoring at significantly lower overhead.", "doi": "10.1145/3238147.3238186", "arxiv_id": "https://doi.org/10.1145/3238147.3238186", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238186"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238186"}
{"title": "Reducing interactive refactoring effort via clustering-based multi-objective search", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vahid Alizadeh", "Marouane Kessentini"], "abstract": "Refactoring is nowadays widely adopted in the industry because bad design decisions can be very costly and extremely risky. On the one hand, automated refactoring does not always lead to the desired design. On the other hand, manual refactoring is error-prone, time-consuming and not practical for radical changes. Thus, recent research trends in the field focused on integrating developers feedback into automated refactoring recommendations because developers understand the problem domain intuitively and may have a clear target design in mind. However, this interactive process can be repetitive, expensive, and tedious since developers must evaluate recommended refactorings, and adapt them to the targeted design especially in large systems where the number of possible strategies can grow exponentially. In this paper, we propose an interactive approach combining the use of multi-objective and unsupervised learning to reduce the developer's interaction effort when refactoring systems. We generate, first, using multi-objective search different possible refactoring strategies by finding a trade-off between several conflicting quality attributes. Then, an unsupervised learning algorithm clusters the different trade-off solutions, called the Pareto front, to guide the developers in selecting their region of interests and reduce the number of refactoring options to explore. The feedback from the developer, both at the cluster and solution levels, are used to automatically generate constraints to reduce the search space in the next iterations and focus on the region of developer preferences. We selected 14 active developers to manually evaluate the effectiveness our tool on 5 open source projects and one industrial system. The results show that the participants found their desired refactorings faster and more accurate than the current state of the art.", "doi": "10.1145/3238147.3238217", "arxiv_id": "https://doi.org/10.1145/3238147.3238217", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238217"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238217"}
{"title": "FairFuzz: a targeted mutation strategy for increasing greybox fuzz testing coverage", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Caroline Lemieux", "Koushik Sen"], "abstract": "In recent years, fuzz testing has proven itself to be one of the most effective techniques for finding correctness bugs and security vulnerabilities in practice. One particular fuzz testing tool, American Fuzzy Lop (AFL), has become popular thanks to its ease-of-use and bug-finding power. However, AFL remains limited in the bugs it can find since it simply does not cover large regions of code. If it does not cover parts of the code, it will not find bugs there. We propose a two-pronged approach to increase the coverage achieved by AFL. First, the approach automatically identifies branches exercised by few AFL-produced inputs (rare branches), which often guard code that is empirically hard to cover by naïvely mutating inputs. The second part of the approach is a novel mutation mask creation algorithm, which allows mutations to be biased towards producing inputs hitting a given rare branch. This mask is dynamically computed during fuzz testing and can be adapted to other testing targets. We implement this approach on top of AFL in a tool named FairFuzz. We conduct evaluation on real-world programs against state-of-the-art versions of AFL. We find that on these programs FairFuzz achieves high branch coverage at a faster rate that state-of-the-art versions of AFL. In addition, on programs with nested conditional structure, it achieves sustained increases in branch coverage after 24 hours (average 10.6% increase). In qualitative analysis, we find that FairFuzz has an increased capacity to automatically discover keywords.", "doi": "10.1145/3238147.3238176", "arxiv_id": "https://doi.org/10.1145/3238147.3238176", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238176"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238176"}
{"title": "Efficiently manifesting asynchronous programming errors in Android apps", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lingling Fan", "Ting Su", "Sen Chen", "Guozhu Meng", "Yang Liu", "Lihua Xu", "Geguang Pu"], "abstract": "Android, the #1 mobile app framework, enforces the single-GUI-thread model, in which a single UI thread manages GUI rendering and event dispatching. Due to this model, it is vital to avoid blocking the UI thread for responsiveness. One common practice is to offload long-running tasks into async threads. To achieve this, Android provides various async programming constructs, and leaves developers themselves to obey the rules implied by the model. However, as our study reveals, more than 25% apps violate these rules and introduce hard-to-detect, fail-stop errors, which we term as aysnc programming errors (APEs). To this end, this paper introduces APEChecker, a technique to automatically and efficiently manifest APEs. The key idea is to characterize APEs as specific fault patterns, and synergistically combine static analysis and dynamic UI exploration to detect and verify such errors. Among the 40 real-world Android apps, APEChecker unveils and processes 61 APEs, of which 51 are confirmed (83.6% hit rate). Specifically, APEChecker detects 3X more APEs than the state-of-art testing tools (Monkey, Sapienz and Stoat), and reduces testing time from half an hour to a few minutes. On a specific type of APEs, APEChecker confirms 5X more errors than the data race detection tool, EventRacer, with very few false alarms.", "doi": "10.1145/3238147.3238170", "arxiv_id": "https://doi.org/10.1145/3238147.3238170", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238170"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238170"}
{"title": "Expandable group identification in spreadsheets", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wensheng Dou", "Shi Han", "Liang Xu", "Dongmei Zhang", "Jun Wei"], "abstract": "Spreadsheets are widely used in various business tasks. Spreadsheet users may put similar data and computations by repeating a block of cells (a unit) in their spreadsheets. We name the unit and all its expanding ones as an expandable group. All units in an expandable group share the same or similar formats and semantics. As a data storage and management tool, expandable groups represent the fundamental structure in spreadsheets. However, existing spreadsheet systems do not recognize any expandable groups. Therefore, other spreadsheet analysis tools, e.g., data integration and fault detection, cannot utilize this structure of expandable groups to perform precise analysis. In this paper, we propose ExpCheck to automatically extract expandable groups in spreadsheets. We observe that continuous units that share the similar formats and semantics are likely to be an expandable group. Inspired by this, we inspect the format of each cell and its corresponding semantics, and further classify them into expandable groups according to their similarity. We evaluate ExpCheck on 120 spreadsheets randomly sampled from the EUSES and VEnron corpora. The experimental results show that ExpCheck is effective. ExpCheck successfully detect expandable groups with F1-measure of 73.1%, significantly outperforming the state-of-the-art techniques (F1-measure of 13.3%).", "doi": "10.1145/3238147.3238222", "arxiv_id": "https://doi.org/10.1145/3238147.3238222", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238222"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238222"}
{"title": "Break the dead end of dynamic slicing: localizing data and control omission bug", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yun Lin", "Jun Sun", "Lyly Tran", "Guangdong Bai", "Haijun Wang", "Jin Song Dong"], "abstract": "Dynamic slicing is a common way of identifying the root cause when a program fault is revealed. With the dynamic slicing technique, the programmers can follow data and control flow along the program execution trace to the root cause. However, the technique usually fails to work on omission bugs, i.e., the faults which are caused by missing executing some code. In many cases, dynamic slicing over-skips the root cause when an omission bug happens, leading the debugging process to a dead end. In this work, we conduct an empirical study on the omission bugs in the Defects4J bug repository. Our study shows that (1) omission bugs are prevalent (46.4%) among all the studied bugs; (2) there are repeating patterns on causes and fixes of the omission bugs; (3) the patterns of fixing omission bugs serve as a strong hint to break the slicing dead end. Based on our findings, we train a neural network model on the omission bugs in Defects4J repository to recommend where to approach when slicing can no long work. We conduct an experiment by applying our approach on 3193 mutated omission bugs which slicing fails to locate. The results show that our approach outperforms random benchmark on breaking the dead end and localizing the mutated omission bugs (63.8% over 2.8%).", "doi": "10.1145/3238147.3238163", "arxiv_id": "https://doi.org/10.1145/3238147.3238163", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238163"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238163"}
{"title": "A genetic algorithm for goal-conflict identification", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Renzo Degiovanni", "Facundo Molina", "Germán Regis", "Nazareno Aguirre"], "abstract": "Goal-conflict analysis has been widely used as an abstraction for risk analysis in goal-oriented requirements engineering approaches. In this context, where the expected behaviour of the system-to-be is captured in terms of domain properties and goals, identifying combinations of circumstances that may make the goals diverge, i.e., not to be satisfied as a whole, is of most importance. Various approaches have been proposed in order to automatically identify boundary conditions, i.e., formulas capturing goal-divergent situations, but they either apply only to some specific goal expressions, or are affected by scalability issues that make them applicable only to relatively small specifications. In this paper, we present a novel approach to automatically identify boundary conditions, using evolutionary computation. More precisely, we develop a genetic algorithm that, given the LTL formulation of the domain properties and the goals, it searches for formulas that capture divergences in the specification. We exploit a modern LTL satisfiability checker to successfully guide our genetic algorithm to the solutions. We assess our technique on a set of case studies, and show that our genetic algorithm is able to find boundary conditions that cannot be generated by related approaches, and is able to efficiently scale to LTL specifications that other approaches are unable to deal with.", "doi": "10.1145/3238147.3238220", "arxiv_id": "https://doi.org/10.1145/3238147.3238220", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238220"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238220"}
{"title": "Understanding and detecting callback compatibility issues for Android applications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Huaxun Huang", "Lili Wei", "Yepang Liu", "Shing-Chi Cheung"], "abstract": "The control flows of Android apps are largely driven by the protocols that govern how callback APIs are invoked in response to various events. When these callback APIs evolve along with the Android framework, the changes in their invocation protocols can induce unexpected control flows to existing Android apps, causing various compatibility issues. We refer to these issues as callback compatibility issues. While Android framework updates have received due attention, little is known about their impacts on app control flows and the callback compatibility issues thus induced. To bridge the gap, we examined Android documentations and conducted an empirical study on 100 real-world callback compatibility issues to investigate how these issues were induced by callback API evolutions. Based on our empirical findings, we propose a graph-based model to capture the control flow inconsistencies caused by API evolutions and devise a static analysis technique, Cider, to detect callback compatibility issues. Our evaluation of Cider on 20 popular open-source Android apps shows that Cider is effective. It detected 13 new callback compatibility issues in these apps, among which 12 issues were confirmed and 9 issues were fixed.", "doi": "10.1145/3238147.3238181", "arxiv_id": "https://doi.org/10.1145/3238147.3238181", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238181"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238181"}
{"title": "Detecting and summarizing GUI changes in evolving mobile apps", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kevin Moran", "Cody Watson", "John Hoskins", "George Purnell", "Denys Poshyvanyk"], "abstract": "Mobile applications have become a popular software development domain in recent years due in part to a large user base, capable hardware, and accessible platforms. However, mobile developers also face unique challenges, including pressure for frequent releases to keep pace with rapid platform evolution, hardware iteration, and user feedback. Due to this rapid pace of evolution, developers need automated support for documenting the changes made to their apps in order to aid in program comprehension. One of the more challenging types of changes to document in mobile apps are those made to the graphical user interface (GUI) due to its abstract, pixel-based representation. In this paper, we present a fully automated approach, called Gcat, for detecting and summarizing GUI changes during the evolution of mobile apps. Gcat leverages computer vision techniques and natural language generation to accurately and concisely summarize changes made to the GUI of a mobile app between successive commits or releases. We evaluate the performance of our approach in terms of its precision and recall in detecting GUI changes compared to developer specified changes, and investigate the utility of the generated change reports in a controlled user study. Our results indicate that Gcat is capable of accurately detecting and classifying GUI changes - outperforming developers - while providing useful documentation.", "doi": "10.1145/3238147.3238203", "arxiv_id": "https://doi.org/10.1145/3238147.3238203", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238203"], "github": ["https://github.com/beatngu13/visual-testing"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238203"}
{"title": "Empirically assessing opportunities for prefetching and caching in mobile apps", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yixue Zhao", "Paul Wat", "Marcelo Schmitt Laser", "Nenad Medvidovic"], "abstract": "Network latency in mobile software has a large impact on user experience, with potentially severe economic consequences. Prefetching and caching have been shown effective in reducing the latencies in browser-based systems. However, those techniques cannot be directly applied to the emerging domain of mobile apps because of the differences in network interactions. Moreover, there is a lack of research on prefetching and caching techniques that may be suitable for the mobile app domain, and it is not clear whether such techniques can be effective or whether they are even feasible. This paper takes the first step toward answering these questions by conducting a comprehensive study to understand the characteristics of HTTP requests in over 1,000 popular Android apps. Our work focuses on the prefetchability of requests using static program analysis techniques and cacheability of resulting responses. We find that there is a substantial opportunity to leverage prefetching and caching in mobile apps, but that suitable techniques must take into account the nature of apps' network interactions and idiosyncrasies such as untrustworthy HTTP header information. Our observations provide guidelines for developers to utilize prefetching and caching schemes in app development, and motivate future research in this area.", "doi": "10.1145/3238147.3238215", "arxiv_id": "https://doi.org/10.1145/3238147.3238215", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238215"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238215"}
{"title": "Safe stream-based programming with refinement types", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Benno Stein", "Lazaro Clapp", "Manu Sridharan", "Bor-Yuh Evan Chang"], "abstract": "  In stream-based programming, data sources are abstracted as a stream of\nvalues that can be manipulated via callback functions. Stream-based programming\nis exploding in popularity, as it provides a powerful and expressive paradigm\nfor handling asynchronous data sources in interactive software. However,\nhigh-level stream abstractions can also make it difficult for developers to\nreason about control- and data-flow relationships in their programs. This is\nparticularly impactful when asynchronous stream-based code interacts with\nthread-limited features such as UI frameworks that restrict UI access to a\nsingle thread, since the threading behavior of streaming constructs is often\nnon-intuitive and insufficiently documented.\n  In this paper, we present a type-based approach that can statically prove the\nthread-safety of UI accesses in stream-based software. Our key insight is that\nthe fluent APIs of stream-processing frameworks enable the tracking of threads\nvia type-refinement, making it possible to reason automatically about what\nthread a piece of code runs on -- a difficult problem in general.\n  We implement the system as an annotation-based Java typechecker for Android\nprograms built upon the popular ReactiveX framework and evaluate its efficacy\nby annotating and analyzing 8 open-source apps, where we find 33 instances of\nunsafe UI access while incurring an annotation burden of only one annotation\nper 186 source lines of code. We also report on our experience applying the\ntypechecker to two much larger apps from the Uber Technologies Inc. codebase,\nwhere it currently runs on every code change and blocks changes that introduce\npotential threading bugs.\n", "doi": "10.1145/3238147.3238174", "arxiv_id": "https://doi.org/10.1145/3238147.3238174", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238174", "https://arxiv.org/pdf/1808.02998"], "github": ["https://github.com/uber-research/RxThreadEffectChecker"], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238174", "journal_ref": "Proceedings of the 2018 33rd ACM/IEEE International Conference on\n  Automated Software Engineering", "categories": "cs.SE cs.PL", "cited_by": 0}
{"title": "Automated model repair for Alloy", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kaiyuan Wang", "Allison Sullivan", "Sarfraz Khurshid"], "abstract": "Automated program repair is an active research area. However, existing research focuses mostly on imperative code, e.g. in Java. In this paper, we study the problem of repairing declarative models in Alloy - a first order relational logic with transitive closure. We introduce ARepair, the first technique for repairing Alloy models. ARepair follows the spirit of traditional automated program repair techniques. Specifically, ARepair takes as input a faulty Alloy model and a test suite that contains some failing test, and outputs a repaired model that is correct with respect to the given tests. ARepair integrates ideas from mutation testing and program synthesis to provide an effective solution for repairing Alloy models. The experimental results show that ARepair can fix 28 out of 38 real-world faulty models we collected.", "doi": "10.1145/3238147.3238162", "arxiv_id": "https://doi.org/10.1145/3238147.3238162", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238162"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238162"}
{"title": "PFix: fixing concurrency bugs based on memory access patterns", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Huarui Lin", "Zan Wang", "Shuang Liu", "Jun Sun", "Dongdi Zhang", "Guangning Wei"], "abstract": "Concurrency bugs of a multi-threaded program may only manifest with certain scheduling, i.e., they are heisenbugs which are observed only from time to time if we execute the same program with the same input multiple times. They are notoriously hard to fix. In this work, we propose an approach to automatically fix concurrency bugs. Compared to previous approaches, our key idea is to systematically fix concurrency bugs by inferring locking policies from failure inducing memory-access patterns. That is, we automatically identify memory-access patterns which are correlated with the manifestation of the bug, and then conjecture what is the intended locking policy of the program. Afterwards, we fix the program by implementing the locking policy so that the failure inducing memory-access patterns are made impossible. We have implemented our approach in a toolkit called PFix which supports Java programs. We applied PFix to a set of 23 concurrency bugs and are able to automatically fix 19 of them. In comparison, Grail which is the state-of-the-art tool for fixing concurrency bugs in Java programs can only fix 3 of them correctly.", "doi": "10.1145/3238147.3238198", "arxiv_id": "https://doi.org/10.1145/3238147.3238198", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238198"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238198"}
{"title": "Generating reusable web components from mockups", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Bajammal", "Davood Mazinanian", "Ali Mesbah"], "abstract": "The transformation of a user interface mockup designed by a graphic designer to web components in the final app built by a web developer is often laborious, involving manual and time consuming steps. We propose an approach to automate this aspect of web development by generating reusable web components from a mockup. Our approach employs visual analysis of the mockup, and unsupervised learning of visual cues to create reusable web components (e.g., React components). We evaluated our approach, implemented in a tool called VizMoD, on five real-world web mockups, and assessed the transformations and generated components through comparison with web development experts. The results show that VizMOD achieves on average 94% precision and 75% recall in terms of agreement with the developers' assessment. Furthermore, the refactorings yielded 22% code reusability, on average.", "doi": "10.1145/3238147.3238194", "arxiv_id": "https://doi.org/10.1145/3238147.3238194", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238194"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238194"}
{"title": "Semantic crash bucketing", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rijnard van Tonder", "John Kotheimer", "Claire Le Goues"], "abstract": "Precise crash triage is important for automated dynamic testing tools, like fuzzers. At scale, fuzzers produce millions of crashing inputs. Fuzzers use heuristics, like stack hashes, to cut down on duplicate bug reports. These heuristics are fast, but often imprecise: even after deduplication, hundreds of uniquely reported crashes can still correspond to the same bug. Remaining crashes must be inspected manually, incurring considerable effort. In this paper we present Semantic Crash Bucketing, a generic method for precise crash bucketing using program transformation. Semantic Crash Bucketing maps crashing inputs to unique bugs as a function of changing a program (i.e., a semantic delta). We observe that a real bug fix precisely identifies crashes belonging to the same bug. Our insight is to approximate real bug fixes with lightweight program transformation to obtain the same level of precision. Our approach uses (a) patch templates and (b) semantic feedback from the program to automatically generate and apply approximate fixes for general bug classes. Our evaluation shows that approximate fixes are competitive with using true fixes for crash bucketing, and significantly outperforms built-in deduplication techniques for three state of the art fuzzers.", "doi": "10.1145/3238147.3238200", "arxiv_id": "https://doi.org/10.1145/3238147.3238200", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238200"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238200"}
{"title": "A symbolic model checking approach to the analysis of string and length constraints", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hung-En Wang", "Shih-Yu Chen", "Fang Yu", "Jie-Hong R. Jiang"], "abstract": "Strings with length constraints are prominent in software security analysis. Recent endeavors have made significant progress in developing constraint solvers for strings and integers. Most prior methods are based on deduction with inference rules or analysis using automata. The former may be inefficient when the constraints involve complex string manipulations such as language replacement; the latter may not be easily extended to handle length constraints and may be inadequate for counterexample generation due to approximation. Inspired by recent work on string analysis with logic circuit representation, we propose a new method for solving string with length constraints by an implicit representation of automata with length encoding. The length-encoded automata are of infinite states and can represent languages beyond regular expressions. By converting string and length constraints into a dependency graph of manipulations over length-encoded automata, a symbolic model checker for infinite state systems can be leveraged as an engine for the analysis of string and length constraints. Experiments show that our method has its unique capability of handling complex string and length constraints not solvable by existing methods.", "doi": "10.1145/3238147.3238189", "arxiv_id": "https://doi.org/10.1145/3238147.3238189", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238189"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238189"}
{"title": "Domain-independent multi-threaded software model checking", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dirk Beyer", "Karlheinz Friedberger"], "abstract": "Recent development of software aims at massively parallel execution, because of the trend to increase the number of processing units per CPU socket. But many approaches for program analysis are not designed to benefit from a multi-threaded execution and lack support to utilize multi-core computers. Rewriting existing algorithms is difficult and error-prone, and the design of new parallel algorithms also has limitations. An orthogonal problem is the granularity: computing each successor state in parallel seems too fine-grained, so the open question is to find the right structural level for parallel execution. We propose an elegant solution to these problems: Block summaries should be computed in parallel. Many successful approaches to software verification are based on summaries of control-flow blocks, large blocks, or function bodies. Block-abstraction memoization is a successful domain-independent approach for summary-based program analysis. We redesigned the verification approach of block-abstraction memoization starting from its original recursive definition, such that it can run in a parallel manner for utilizing the available computation resources without losing its advantages of being independent from a certain abstract domain. We present an implementation of our new approach for multi-core shared-memory machines. The experimental evaluation shows that our summary-based approach has no significant overhead compared to the existing sequential approach and that it has a significant speedup when using multi-threading.", "doi": "10.1145/3238147.3238195", "arxiv_id": "https://doi.org/10.1145/3238147.3238195", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238195"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238195"}
{"title": "Scheduling constraint based abstraction refinement for weak memory models", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Liangze Yin", "Wei Dong", "Wanwei Liu", "Ji Wang"], "abstract": "Scheduling constraint based abstraction refinement (SCAR) is one of the most efficient methods for verifying programs under sequential consistency (SC). However, most multi-processor architectures implement weak memory models (WMMs) in order to improve the performance of a program. Due to the nondeterministic execution of those memory operations by the same thread, the behavior of a program under WMMs is much more complex than that under SC, which significantly increases the verification complexity. This paper elegantly extends the SCAR method to WMMs such as TSO and PSO. To capture the order requirements of an abstraction counterexample under WMMs, we have enriched the event order graph (EOG) of a counterexample such that it is competent for both SC and WMMs. We have also proposed a unified EOG generation method which can always obtain a minimal EOG efficiently. Experimental results on a large set of multi-threaded C programs show promising results of our method. It significantly outperforms state-of-the-art tools, and the time and memory it required to verify a program under TSO and PSO are roughly comparable to that under SC.", "doi": "10.1145/3238147.3238223", "arxiv_id": "https://doi.org/10.1145/3238147.3238223", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238223"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238223"}
{"title": "Datalog-based scalable semantic diffing of concurrent programs", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chungha Sung", "Shuvendu K. Lahiri", "Constantin Enea", "Chao Wang"], "abstract": "When an evolving program is modified to address issues related to thread synchronization, there is a need to confirm the change is correct, i.e., it does not introduce unexpected behavior. However, manually comparing two programs to identify the semantic difference is labor intensive and error prone, whereas techniques based on model checking are computationally expensive. To fill the gap, we develop a fast and approximate static analysis for computing synchronization differences of two programs. The method is fast because, instead of relying on heavy-weight model checking techniques, it leverages a polynomial-time Datalog-based program analysis framework to compute differentiating data-flow edges, i.e., edges allowed by one program but not the other. Although approximation is used our method is sufficiently accurate due to careful design of the Datalog inference rules and iterative increase of the required data-flow edges for representing a difference. We have implemented our method and evaluated it on a large number of multithreaded C programs to confirm its ability to produce, often within seconds, the same differences obtained by human; in contrast, prior techniques based on model checking take minutes or even hours and thus can be 10x to 1000x slower.", "doi": "10.1145/3238147.3238211", "arxiv_id": "https://doi.org/10.1145/3238147.3238211", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238211"], "github": ["https://github.com/ChunghaSung/EC-Diff"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238211"}
{"title": "αDiff: cross-version binary code similarity detection with DNN", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bingchang Liu", "Wei Huo", "Chao Zhang", "Wenchao Li", "Feng Li", "Aihua Piao", "Wei Zou"], "abstract": "Binary code similarity detection (BCSD) has many applications, including patch analysis, plagiarism detection, malware detection, and vulnerability search etc. Existing solutions usually perform comparisons over specific syntactic features extracted from binary code, based on expert knowledge. They have either high performance overheads or low detection accuracy. Moreover, few solutions are suitable for detecting similarities between cross-version binaries, which may not only diverge in syntactic structures but also diverge slightly in semantics. In this paper, we propose a solution $\\alpha$ Diff, employing three semantic features, to address the cross-version BCSD challenge. It first extracts the intra-function feature of each binary function using a deep neural network (DNN). The DNN works directly on raw bytes of each function, rather than features (e.g., syntactic structures) provided by experts. $\\alpha$ Diff further analyzes the function call graph of each binary, which are relatively stable in cross-version binaries, and extracts the inter-function and inter-module features. Then, a distance is computed based on these three features and used for BCSD. We have implemented a prototype of $\\alpha$ Diff, and evaluated it on a dataset with about 2.5 million samples. The result shows that $\\alpha$ Diff outperforms state-of-the-art static solutions by over 10 percentages on average in different BCSD settings.", "doi": "10.1145/3238147.3238199", "arxiv_id": "https://doi.org/10.1145/3238147.3238199", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238199"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238199"}
{"title": "ClDiff: generating concise linked code differences", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kaifeng Huang", "Bihuan Chen", "Xin Peng", "Daihong Zhou", "Ying Wang", "Yang Liu", "Wenyun Zhao"], "abstract": "Analyzing and understanding source code changes is important in a variety of software maintenance tasks. To this end, many code differencing and code change summarization methods have been proposed. For some tasks (e.g. code review and software merging), however, those differencing methods generate too fine-grained a representation of code changes, and those summarization methods generate too coarse-grained a representation of code changes. Moreover, they do not consider the relationships among code changes. Therefore, the generated differences or summaries make it not easy to analyze and understand code changes in some software maintenance tasks. In this paper, we propose a code differencing approach, named ClDiff, to generate concise linked code differences whose granularity is in between the existing code differencing and code change summarization methods. The goal of ClDiff is to generate more easily understandable code differences. ClDiff takes source code files before and after changes as inputs, and consists of three steps. First, it pre-processes the source code files by pruning unchanged declarations from the parsed abstract syntax trees. Second, it generates concise code differences by grouping fine-grained code differences at or above the statement level and describing high-level changes in each group. Third, it links the related concise code differences according to five pre-defined links. Experiments with 12 Java projects (74,387 commits) and a human study with 10 participants have indicated the accuracy, conciseness, performance and usefulness of ClDiff.", "doi": "10.1145/3238147.3238219", "arxiv_id": "https://doi.org/10.1145/3238147.3238219", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238219"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238219"}
{"title": "Characterizing and identifying misexposed activities in Android applications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiwei Yan", "Xi Deng", "Ping Wang", "Tianyong Wu", "Jun Yan", "Jian Zhang"], "abstract": "Exported Activity (EA), a kind of activities in Android apps that can be launched by external components, is one of the most important inter-component communication (ICC) mechanisms to realize the interaction and cooperation among multiple apps. Existing works have pointed out that, once exposed, an activity will be vulnerable to malicious ICC attacks, such as permission leakage attack. Unfortunately, it is observed that a considerable number of activities in commercial apps are exposed inadvertently, while few works have studied the necessity and reasonability of such exposure. This work takes the first step to systematically study the exposing behavior of EAs through analyzing 13,873 Android apps. It utilizes the EA associated call relationships extracted from byte-code via data-flow analysis, as well as the launch conditions obtained from the manifest files, to guide the study on the usage and misexposure of EAs. The empirical findings are that the EA mechanism is widely adopted in development and the activities are liable to be misexposed due to the developers' misunderstanding or carelessness. Further study on subsets of apps selected according to different criteria indicates that the misexposed EAs have specific characteristics, which are manually summarized into six typical misuse patterns. As a consequence, ten heuristics are designed to decide whether an activity should be exposed or not and are implemented into an automatic tool called Mist. Experiments on the collected apps show that around one fifth EAs are unnecessarily exposed and there are more than one third EAs whose exposure may not be suggested.", "doi": "10.1145/3238147.3238164", "arxiv_id": "https://doi.org/10.1145/3238147.3238164", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238164"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238164"}
{"title": "A tale of two cities: how WebView induces bugs to Android applications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiajun Hu", "Lili Wei", "Yepang Liu", "Shing-Chi Cheung", "Huaxun Huang"], "abstract": "WebView is a widely used Android component that augments a native app with web browser capabilities. It eases the interactions between an app’s native code and web code. However, the interaction mechanism of WebView induces new types of bugs in Android apps. Understanding the characteristics and manifestation of these WebView-induced bugs (ωBugs for short) facilitates the correct usages of WebViews in Android apps. This motivates us to conduct the first empirical study on ωBugs based on those found in popular open-source Android apps. Our study identified the major root causes and consequences of ωBugs and made interesting observations that can be leveraged for detecting and diagnosing ωBugs. Based on the empirical study, we further propose an automated testing technique ωDroid to effectively expose ωBugs in Android apps. In our experiments, ωDroid successfully discovered 30 unique and previously-unknown ωBugs when applied to 146 open-source Android apps. We reported the 30 ωBugs to the corresponding app developers. Out of these 30 ωBugs, 14 were confirmed and 7 of them were fixed. This shows that ωDroid can effectively detect ωBugs that are of the developers’ concern.", "doi": "10.1145/3238147.3238180", "arxiv_id": "https://doi.org/10.1145/3238147.3238180", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238180"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238180"}
{"title": "Dual-force: understanding WebView malware via cross-language forced execution", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhenhao Tang", "Juan Zhai", "Minxue Pan", "Yousra Aafer", "Shiqing Ma", "Xiangyu Zhang", "Jianhua Zhao"], "abstract": "Modern Android malwares tend to use advanced techniques to cover their malicious behaviors. They usually feature multi-staged, condition-guarded and environment-specific payloads. An increasing number of them utilize WebView, particularly the two-way communications between Java and JavaScript, to evade detection and analysis of existing techniques. We propose Dual-Force, a forced execution technique which simultaneously forces both Java and JavaScript code of WebView applications to execute along various paths without requiring any environment setup or providing any inputs manually. As such, the hidden payloads of WebView malwares are forcefully exposed. The technique features a novel execution model that allows forced execution to suppress exceptions and continue execution. Experimental results show that Dual-Force precisely exposes malicious payload in 119 out of 150 WebView malwares. Compared to the state-of-the-art, Dual-Force can expose 23% more malicious behaviors.", "doi": "10.1145/3238147.3238221", "arxiv_id": "https://doi.org/10.1145/3238147.3238221", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238221"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238221"}
{"title": "Self-protection of Android systems from inter-component communication attacks", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mahmoud Hammad", "Joshua Garcia", "Sam Malek"], "abstract": "The current security mechanisms for Android apps, both static and dynamic analysis approaches, are insufficient for detection and prevention of the increasingly dynamic and sophisticated security attacks. Static analysis approaches suffer from false positives whereas dynamic analysis approaches suffer from false negatives. Moreover, they all lack the ability to efficiently analyze systems with incremental changes—such as adding/removing apps, granting/revoking permissions, and dynamic components’ communications. Each time the system changes, the entire analysis needs to be repeated, making the existing approaches inefficient for practical use. To mitigate their shortcomings, we have developed SALMA, a novel self-protecting Android software system that monitors itself and adapts its behavior at runtime to prevent a wide-range of security risks. SALMA maintains a precise architectural model, represented as a Multiple-Domain-Matrix, and incrementally and efficiently analyzes an Android system in response to incremental system changes. The maintained architecture is used to reason about the running Android system. Every time the system changes, SALMA determines (1) the impacted part of the system, and (2) the subset of the security analyses that need to be performed, thereby greatly improving the performance of the approach. Our experimental results on hundreds of real-world apps corroborate SALMA’s scalability and efficiency as well as its ability to detect and prevent security attacks at runtime with minimal disruption.", "doi": "10.1145/3238147.3238207", "arxiv_id": "https://doi.org/10.1145/3238147.3238207", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3238207"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3238207"}
{"title": "An empirical study of Android test generation tools in industrial cases", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wenyu Wang", "Dengfeng Li", "Wei Yang", "Yurui Cao", "Zhenwen Zhang", "Yuetang Deng", "Tao Xie"], "abstract": "User Interface (UI) testing is a popular approach to ensure the quality of mobile apps. Numerous test generation tools have been developed to support UI testing on mobile apps, especially for Android apps. Previous work evaluates and compares different test generation tools using only relatively simple open-source apps, while real-world industrial apps tend to have more complex functionalities and implementations. There is no direct comparison among test generation tools with regard to effectiveness and ease-of-use on these industrial apps. To address such limitation, we study existing state-of-the-art or state-of-the-practice test generation tools on 68 widely-used industrial apps. We directly compare the tools with regard to code coverage and fault-detection ability. According to our results, Monkey, a state-of-the-practice tool from Google, achieves the highest method coverage on 22 of 41 apps whose method coverage data can be obtained. Of all 68 apps under study, Monkey also achieves the highest activity coverage on 35 apps, while Stoat, a state-of-the-art tool, is able to trigger the highest number of unique crashes on 23 apps. By analyzing the experimental results, we provide suggestions for combining different test generation tools to achieve better performance. We also report our experience in applying these tools to industrial apps under study. Our study results give insights on how Android UI test generation tools could be improved to better handle complex industrial apps.", "doi": "10.1145/3238147.3240465", "arxiv_id": "https://doi.org/10.1145/3238147.3240465", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240465"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240465"}
{"title": "Achieving test automation with testers without coding skills: an industrial report", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Davrondzhon Gafurov", "Arne Erik Hurum", "Martin Markman"], "abstract": "We present a process driven test automation solution which enables delegating (part of) automation tasks from test automation engineer (expensive resource) to test analyst (non-developer, less expensive). In our approach, a test automation engineer implements test steps (or actions) which are executed automatically. Such automated test steps represent user actions in the system under test and specified by a natural language which is understandable by a non-technical person. Then, a test analyst with a domain knowledge organizes automated steps combined with test input to create an automated test case. It should be emphasized that the test analyst does not need to possess programming skills to create, modify or execute automated test cases. We refine benchmark test automation architecture to be better suitable for an effective separation and sharing of responsibilities between the test automation engineer (with coding skills) and test analyst (with a domain knowledge). In addition, we propose a metric to empirically estimate cooperation between test automation engineer and test analyst's works. The proposed automation solution has been defined based on our experience in the development and maintenance of Helsenorge, the national electronic health services in Norway which has had over one million of visits per month past year, and we still use it to automate the execution of regression tests.", "doi": "10.1145/3238147.3240463", "arxiv_id": "https://doi.org/10.1145/3238147.3240463", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240463"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240463"}
{"title": "Navigating the maze: the impact of configurability in bioinformatics software", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mikaela Cashman", "Myra B. Cohen", "Priya Ranjan", "Robert W. Cottingham"], "abstract": "The bioinformatics software domain contains thousands of applications for automating tasks such as the pairwise alignment of DNA sequences, building and reasoning about metabolic models or simulating growth of an organism. Its end users range from sophisticated developers to those with little computational experience. In response to their needs, developers provide many options to customize the way their algorithms are tuned. Yet there is little or no automated help for the user in determining the consequences or impact of the options they choose. In this paper we describe our experience working with configurable bioinformatics tools. We find limited documentation and help for combining and selecting options along with variation in both functionality and performance. We also find previously undetected faults. We summarize our findings with a set of lessons learned, and present a roadmap for creating automated techniques to interact with bioinformatics software. We believe these will generalize to other types of scientific software.", "doi": "10.1145/3238147.3240466", "arxiv_id": "https://doi.org/10.1145/3238147.3240466", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240466"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240466"}
{"title": "Automatically testing implementations of numerical abstract domains", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alexandra Bugariu", "Valentin Wüstholz", "Maria Christakis", "Peter Müller"], "abstract": "Static program analyses are routinely applied as the basis of code optimizations and to detect safety and security issues in software systems. For their results to be reliable, static analyses should be sound (i.e., should not produce false negatives) and precise (i.e., should report a low number of false positives). Even though it is possible to prove properties of the design of a static analysis, ensuring soundness and precision for its implementation is challenging. Complex algorithms and sophisticated optimizations make static analyzers difficult to implement and test. In this paper, we present an automatic technique to test, among other properties, the soundness and precision of abstract domains, the core of all static analyzers based on abstract interpretation. In order to cover a wide range of test data and input states, we construct inputs by applying sequences of abstract-domain operations to representative domain elements, and vary the operations through gray-box fuzzing. We use mathematical properties of abstract domains as test oracles. Our experimental evaluation demonstrates the effectiveness of our approach. We detected several previously unknown soundness and precision errors in widely-used abstract domains. Our experiments also show that our approach is more effective than dynamic symbolic execution and than fuzzing the test inputs directly.", "doi": "10.1145/3238147.3240464", "arxiv_id": "https://doi.org/10.1145/3238147.3240464", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240464"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240464"}
{"title": "Experiences applying automated architecture analysis tool suites", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ran Mo", "Will Snipes", "Yuanfang Cai", "Srini Ramaswamy", "Rick Kazman", "Martin Naedele"], "abstract": "In this paper, we report our experiences of applying three complementary automated software architecture analysis techniques, supported by a tool suite, called DV8, to 8 industrial projects within a large company. DV8 includes two state-of-the-art architecture-level maintainability metrics—Decoupling Level and Propagation Cost, an architecture flaw detection tool, and an architecture root detection tool. We collected development process data from the project teams as input to these tools, reported the results back to the practitioners, and followed up with telephone conferences and interviews. Our experiences revealed that the metrics scores, quantitative debt analysis, and architecture flaw visualization can effectively bridge the gap between management and development, help them decide if, when, and where to refactor. In particular, the metrics scores, compared against industrial benchmarks, faithfully reflected the practitioners' intuitions about the maintainability of their projects, and enabled them to better understand the maintainability relative to other projects internal to their company, and to other industrial products. The automatically detected architecture flaws and roots enabled the practitioners to precisely pinpoint, visualize, and quantify the “hotspots” within the systems that are responsible for high maintenance costs. Except for the two smallest projects for which both architecture metrics indicated high maintainability, all other projects are planning or have already begun refactorings to address the problems detected by our analyses. We are working on further automating the tool chain, and transforming the analysis suite into deployable services accessible by all projects within the company.", "doi": "10.1145/3238147.3240467", "arxiv_id": "https://doi.org/10.1145/3238147.3240467", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240467"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240467"}
{"title": "Continuous code quality: are we (really) doing that?", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Carmine Vassallo", "Fabio Palomba", "Alberto Bacchelli", "Harald C. Gall"], "abstract": "Continuous Integration (CI) is a software engineering practice where developers constantly integrate their changes to a project through an automated build process. The goal of CI is to provide developers with prompt feedback on several quality dimensions after each change. Indeed, previous studies provided empirical evidence on a positive association between properly following CI principles and source code quality. A core principle behind CI is Continuous Code Quality (also known as CCQ, which includes automated testing and automated code inspection) may appear simple and effective, yet we know little about its practical adoption. In this paper, we propose a preliminary empirical investigation aimed at understanding how rigorously practitioners follow CCQ. Our study reveals a strong dichotomy between theory and practice: developers do not perform continuous inspection but rather control for quality only at the end of a sprint and most of the times only on the release branch. Preprint [https://doi.org/10.5281/zenodo.1341036]. Data and Materials [http://doi.org/10.5281/zenodo.1341015].", "doi": "10.1145/3238147.3240729", "arxiv_id": "https://doi.org/10.1145/3238147.3240729", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240729"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240729"}
{"title": "RUDSEA: recommending updates of Dockerfiles via software environment analysis", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Foyzul Hassan", "Rodney Rodriguez", "Xiaoyin Wang"], "abstract": "Dockerfiles are configuration files of docker images which package all dependencies of a software to enable convenient software deployment and porting. In other words, dockerfiles list all environment assumptions of a software application's build and / or execution, so they need to be frequently updated when the environment assumptions change during fast software evolution. In this paper, we propose RUDSEA, a novel approach to recommend updates of dockerfiles to developers based on analyzing changes on software environment assumptions and their impacts. Our evaluation on 1,199 real-world instruction updates shows that RUDSEA can recommend correct update locations for 78.5% of the updates, and correct code changes for 44.1% of the updates.", "doi": "10.1145/3238147.3240470", "arxiv_id": "https://doi.org/10.1145/3238147.3240470", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240470"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240470"}
{"title": "Delta debugging microservice systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiang Zhou", "Xin Peng", "Tao Xie", "Jun Sun", "Wenhai Li", "Chao Ji", "Dan Ding"], "abstract": "Debugging microservice systems involves the deployment and manipulation of microservice systems on a containerized environment and faces unique challenges due to the high complexity and dynamism of microservices. To address these challenges, in this paper, we propose a debugging approach for microservice systems based on the delta debugging algorithm, which is to minimize failure-inducing deltas of circumstances (e.g., deployment, environmental configurations) for effective debugging. Our approach includes novel techniques for defining, deploying/manipulating, and executing deltas following the idea of delta debugging. In particular, to construct a (failing) circumstance space for delta debugging to minimize, our approach defines a set of dimensions that can affect the execution of microservice systems. Our experimental study on a medium-size microservice benchmark system shows that our approach can effectively identify failure-inducing deltas that help diagnose the root causes.", "doi": "10.1145/3238147.3240730", "arxiv_id": "https://doi.org/10.1145/3238147.3240730", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240730"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240730"}
{"title": "Personalized teammate recommendation for crowdsourced software developers", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Luting Ye", "Hailong Sun", "Xu Wang", "Jiaruijue Wang"], "abstract": "Most crowdsourced software development platforms adopt contest paradigm to solicit contributions from the community. To attain competitiveness in complex tasks, crowdsourced software developers often choose to work with others collaboratively. However, existing crowdsourcing platforms generally assume independent contributions from developers and do not provide effective support for team formation. Prior studies on team recommendation aim at optimizing task outcomes by recommending the most suitable team for a task instead of finding appropriate collaborators for a specific person. In this work, we are concerned with teammate recommendation for crowdsourcing developers. First, we present the results of an empirical study of Kaggle, which shows that developers'personal teammate preferences are mainly affected by three factors. Second, we give a collaboration willingness model to characterize developers' teammate preferences and formulate teammate recommendation as an optimization problem. Then we design a heuristic algorithm to find suitable teammates for a developer. Finally, we have conducted a set of experiments on a Kaggle dataset to evaluate the effectiveness of our approach.", "doi": "10.1145/3238147.3240472", "arxiv_id": "https://doi.org/10.1145/3238147.3240472", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240472"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240472"}
{"title": "S-gram: towards semantic-aware security auditing for Ethereum smart contracts", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Han Liu", "Chao Liu", "Wenqi Zhao", "Yu Jiang", "Jiaguang Sun"], "abstract": "Smart contracts, as a promising and powerful application on the Ethereum blockchain, have been growing rapidly in the past few years. Since they are highly vulnerable to different forms of attacks, their security becomes a top priority. However, existing security auditing techniques are either limited in fnding vulnerabilities (rely on pre-defned bug paterns) or very expensive (rely on program analysis), thus are insufcient for Ethereum.", "doi": "10.1145/3238147.3240728", "arxiv_id": "https://doi.org/10.1145/3238147.3240728", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240728"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240728"}
{"title": "An evolutionary approach for analyzing Alloy specifications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jianghao Wang", "Hamid Bagheri", "Myra B. Cohen"], "abstract": "Formal methods use mathematical notations and logical reasoning to precisely define a program's specifications, from which we can instantiate valid instances of a system. With these techniques we can perform a multitude of tasks to check system dependability. Despite the existence of many automated tools including ones considered lightweight, they still lack a strong adoption in practice. At the crux of this problem, is scalability and applicability to large real world applications. In this paper we show how to relax the completeness guarantee without much loss, since soundness is maintained. We have extended a popular lightweight analysis, Alloy, with a genetic algorithm. Our new tool, EvoAlloy, works at the level of finite relations generated by Kodkod and evolves the chromosomes based on the failed constraints. In a feasibility study we demonstrate that we can find solutions to a set of specifications beyond the scope where traditional Alloy fails. While small specifications take longer with EvoAlloy, the scalability means we can handle larger specifications. Our future vision is that when specifications are small we can maintain both soundness and completeness, but when this fails, EvoAlloy can switch to its genetic algorithm.", "doi": "10.1145/3238147.3240468", "arxiv_id": "https://doi.org/10.1145/3238147.3240468", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240468"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240468"}
{"title": "A neural framework for retrieval and summarization of source code", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qingying Chen", "Minghui Zhou"], "abstract": "Code retrieval and summarization are two tasks often employed by software developers to reuse code that spreads over online repositories. In this paper, we present a neural framework that allows bidirectional mapping between source code and natural language to improve these two tasks. Our framework, BVAE, is designed to have two Variational AutoEncoders (VAEs) to model bimodal data: C-VAE for source code and L-VAE for natural language. Both VAEs are trained jointly to reconstruct their input as much as possible with regularization that captures the closeness between the latent variables of code and description. BVAE could learn semantic vector representations for both code and description and generate completely new descriptions for arbitrary code snippets. We design two instance models of BVAE for retrieval and summarization tasks respectively and evaluate their performance on a benchmark which involves two programming languages: C# and SQL. Experiments demonstrate BVAE's potential on the two tasks.", "doi": "10.1145/3238147.3240471", "arxiv_id": "https://doi.org/10.1145/3238147.3240471", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240471"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240471"}
{"title": "An empirical investigation into learning bug-fixing patches in the wild via neural machine translation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michele Tufano", "Cody Watson", "Gabriele Bavota", "Massimiliano Di Penta", "Martin White", "Denys Poshyvanyk"], "abstract": "Millions of open-source projects with numerous bug fixes are available in code repositories. This proliferation of software development histories can be leveraged to learn how to fix common programming bugs. To explore such a potential, we perform an empirical study to assess the feasibility of using Neural Machine Translation techniques for learning bug-fixing patches for real defects. We mine millions of bug-fixes from the change histories of GitHub repositories to extract meaningful examples of such bug-fixes. Then, we abstract the buggy and corresponding fixed code, and use them to train an Encoder-Decoder model able to translate buggy code into its fixed version. Our model is able to fix hundreds of unique buggy methods in the wild. Overall, this model is capable of predicting fixed patches generated by developers in 9% of the cases.", "doi": "10.1145/3238147.3240732", "arxiv_id": "https://doi.org/10.1145/3238147.3240732", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240732"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240732"}
{"title": "Loop path reduction by state pruning", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jianxiong Gao", "Steven S. Lumetta"], "abstract": "Path explosion has been a problem for symbolic execution for a long time. The key to avoid path explosion is to limit the number of paths generated within loops while maintaining high code coverage. Full symbolic execution creates paths for every possible execution path. Frequently, paths within loops do not contribute to code coverage. Branches within loops may generate new states at every iteration. The path explosion problem created by loops often stops symbolic execution to reach deeper parts of the code.", "doi": "10.1145/3238147.3240731", "arxiv_id": "https://doi.org/10.1145/3238147.3240731", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240731"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240731"}
{"title": "node2defect: using network embedding to improve software defect prediction", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yu Qu", "Ting Liu", "Jianlei Chi", "Yangxu Jin", "Di Cui", "Ancheng He", "Qinghua Zheng"], "abstract": "Network measures have been proved to be useful in predicting software defects. Leveraging the dependency relationships between software modules, network measures can capture various structural features of software systems. However, existing studies have relied on user-defined network measures (e.g., degree statistics or centrality metrics), which are inflexible and require high computation cost, to describe the structural features. In this paper, we propose a new method called node2defect which uses a newly proposed network embedding technique, node2vec, to automatically learn to encode dependency network structure into low-dimensional vector spaces to improve software defect prediction. Specifically, we firstly construct a program's Class Dependency Network. Then node2vec is used to automatically learn structural features of the network. After that, we combine the learned features with traditional software engineering features, for accurate defect prediction. We evaluate our method on 15 open source programs. The experimental results show that in average, node2defect improves the state-of-the-art approach by 9.15% in terms of F-measure.", "doi": "10.1145/3238147.3240469", "arxiv_id": "https://doi.org/10.1145/3238147.3240469", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240469"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240469"}
{"title": "Towards automating disambiguation of regulations: using the wisdom of crowds", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Manasi Patwardhan", "Abhishek Sainani", "Richa Sharma", "Shirish Karande", "Smita Ghaisas"], "abstract": "Compliant software is a critical need of all modern businesses. Disambiguating regulations to derive requirements is therefore an important software engineering activity. Regulations however are ridden with ambiguities that make their comprehension a challenge, seemingly surmountable only by legal experts. Since legal experts' involvement in every project is expensive, approaches to automate the disambiguation need to be explored. These approaches however require a large amount of annotated data. Collecting data exclusively from experts is not a scalable and affordable solution. In this paper, we present the results of a crowd sourcing experiment to collect annotations on ambiguities in regulations from professional software engineers. We discuss an approach to automate the arduous and critical step of identifying ground truth labels by employing crowd consensus using Expectation Maximization (EM). We demonstrate that the annotations reaching a consensus match those of experts with an accuracy of 87%.", "doi": "10.1145/3238147.3240727", "arxiv_id": "https://doi.org/10.1145/3238147.3240727", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240727"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240727"}
{"title": "jStanley: placing a green thumb on Java collections", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rui Pereira", "Pedro Simão", "Jácome Cunha", "João Saraiva"], "abstract": "Software developers are more and more eager to understand their code’s energy performance. However, even with such knowledge it is di cult to know how to improve the code. Indeed, little tool support exists to understand the energy consumption pro le of a software system and to eventually (automatically) improve its code.", "doi": "10.1145/3238147.3240473", "arxiv_id": "https://doi.org/10.1145/3238147.3240473", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240473"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240473"}
{"title": "SRCIROR: a toolset for mutation testing of C source code and LLVM intermediate representation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Farah Hariri", "August Shi"], "abstract": "We present SRCIROR (pronounced “sorcerer“), a toolset for performing mutation testing at the levels of C/C++ source code (SRC) and the LLVM compiler intermediate representation (IR). At the SRC level, SRCIROR identifies program constructs for mutation by pattern-matching on the Clang AST. At the IR level, SRCIROR directly mutates the LLVM IR instructions through LLVM passes. Our implementation enables SRCIROR to (1) handle any program that Clang can handle, extending to large programs with a minimal overhead, and (2) have a small percentage of invalid mutants that do not compile. SRCIROR enables performing mutation testing using the same classes of mutation operators at both the SRC and IR levels, and it is easily extensible to support more operators. In addition, SRCIROR can collect coverage to generate mutants only for covered code elements. Our tool is publicly available on GitHub (https://github.com/TestingResearchIllinois/srciror). We evaluate SRCIROR on Coreutils subjects. Our evaluation shows interesting differences between SRC and IR, demonstrating the value of SRCIROR in enabling mutation testing research across different levels of code representation.", "doi": "10.1145/3238147.3240482", "arxiv_id": "https://doi.org/10.1145/3238147.3240482", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240482"], "github": ["https://github.com/TestingResearchIllinois/srciror"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240482"}
{"title": "Lightweight source code monitoring with Triggr", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alim Ozdemir", "Ayse Tosun", "Hakan Erdogmus", "Rui Abreu"], "abstract": "Existing tools for monitoring the quality of codebases modified by multiple developers tend to be centralized and inflexible. These tools increase the visibility of quality by producing effective reports and visualizations when a change is made to the codebase and triggering alerts when undesirable situations occur. However, their configuration is invariably both (a) centrally managed in that individual maintainers cannot define local rules to receive customized feedback when a change occurs in a specific part of the code in which they are particularly interested, and (b) coarse-grained in that analyses cannot be turned on and off below the file level. Triggr, the tool proposed in this paper, addresses these limitations by allowing distributed, customized, and fine-grained monitoring. It is a lightweight re-implementation of our previous tool, CodeAware, which adopts the same paradigm. The tool listens on a codebase's shared repository using an event-based approach, and can send alerts to subscribed developers based on rules defined locally by them. Triggr is open-source and available at https://github.com/lyzerk/Triggr. A demonstration video can be found at https://youtu.be/qQs9aDwXJjY.", "doi": "10.1145/3238147.3240486", "arxiv_id": "https://doi.org/10.1145/3238147.3240486", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240486"], "github": ["https://github.com/lyzerk/Triggr"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240486"}
{"title": "OCELOT: a search-based test-data generation tool for C", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Simone Scalabrino", "Giovanni Grano", "Dario Di Nucci", "Michele Guerra", "Andrea De Lucia", "Harald C. Gall", "Rocco Oliveto"], "abstract": "Automatically generating test cases plays an important role to reduce the time spent by developers during the testing phase. In last years, several approaches have been proposed to tackle such a problem: amongst others, search-based techniques have been shown to be particularly promising. In this paper we describe Ocelot, a search-based tool for the automatic generation of test cases in C. Ocelot allows practitioners to write skeletons of test cases for their programs and researchers to easily implement and experiment new approaches for automatic test-data generation. We show that Ocelot achieves a higher coverage compared to a competitive tool in 81% of the cases. Ocelot is publicly available to support both researchers and practitioners.", "doi": "10.1145/3238147.3240477", "arxiv_id": "https://doi.org/10.1145/3238147.3240477", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240477"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240477"}
{"title": "Live versioning of web applications through refactoring", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julián Grigera", "Juan Cruz Gardey", "Alejandra Garrido", "Gustavo Rossi"], "abstract": "Client-Side Web Refactorings (CSWRs) allow improving interaction aspects of web applications by applying changes to the user interface without altering the code base, even in production settings. However, developers are not always willing, or allowed to apply external adaptations to their applications' user interface. Besides, CSWRs do not guarantee improvements in all contexts, so it may be unwise to install them in a production version. We propose a tool that allows creating private versions of a running web application almost automatically. With this tool, developers or usability experts can combine CSWRs to create alternative versions of web applications, without requiring a cloned sandbox environment for each one. This yields many uses, such as quickly setting up user tests, showing live alternatives to Product Owners, or performing A/B testing. The tool is built on top of Kobold, a service that allows applying CSWRs to fix usability smells. The tool is available at https://bit.ly/2nhQ2MD. A screencast is available at https://youtu.be/LVc3BOtVP3I.", "doi": "10.1145/3238147.3240483", "arxiv_id": "https://doi.org/10.1145/3238147.3240483", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240483"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240483"}
{"title": "code_call_lens: raising the developer awareness of critical code", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andrea Janes", "Michael Mairegger", "Barbara Russo"], "abstract": "As a developer, it is often complex to foresee the impact of changes in source code on usage, e.g., it is time-consuming to find out all components that will be impacted by a change or estimate the impact on the usability of a failing piece of code. It is therefore hard to decide how much effort in quality assurance is justifiable to obtain the desired business goals. In this paper, to reduce the difficulty for developers to understand the importance of source code, we propose an automated way to provide this information to developers as they are working on a given piece of code. As a proof-of-concept, we developed a plug-in for Microsoft Visual Studio Code that informs about the importance of source code methods based on the frequency of usage by the end-users of the developed software. The plug-in aims to increase the awareness developers have about the importance of source code in an unobtrusive way, helping them to prioritize their effort to quality assurance, technical excellence, and usability. code_call_lens can be downloaded from GitHub at https://github.com/xxMUROxx/vscode.code_call_lens.", "doi": "10.1145/3238147.3240488", "arxiv_id": "https://doi.org/10.1145/3238147.3240488", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240488"], "github": ["https://github.com/xxMUROxx/vscode.code_call_lens"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240488"}
{"title": "Code2graph: automatic generation of static call graphs for Python source code", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gharib Gharibi", "Rashmi Tripathi", "Yugyung Lee"], "abstract": "A static call graph is an imperative prerequisite used in most interprocedural analyses and software comprehension tools. However, there is a lack of software tools that can automatically analyze the Python source-code and construct its static call graph. In this paper, we introduce a prototype Python tool, named code2graph, which automates the tasks of (1) analyzing the Python source-code and extracting its structure, (2) constructing static call graphs from the source code, and (3) generating a similarity matrix of all possible execution paths in the system. Our goal is twofold: First, assist the developers in understanding the overall structure of the system. Second, provide a stepping stone for further research that can utilize the tool in software searching and similarity detection applications. For example, clustering the execution paths into a logical workflow of the system would be applied to automate specific software tasks. Code2graph has been successfully used to generate static call graphs and similarity matrices of the paths for three popular open-source Deep Learning projects (TensorFlow, Keras, PyTorch). A tool demo is available at https://youtu.be/ecctePpcAKU.", "doi": "10.1145/3238147.3240484", "arxiv_id": "https://doi.org/10.1145/3238147.3240484", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240484"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240484"}
{"title": "The electrum analyzer: model checking relational first-order temporal specifications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julien Brunel", "David Chemouil", "Alcino Cunha", "Nuno Macedo"], "abstract": "This paper presents the Electrum Analyzer, a free-software tool to validate and perform model checking of Electrum specifications. Electrum is an extension of Alloy that enriches its relational logic with LTL operators, thus simplifying the specification of dynamic systems. The Analyzer supports both automatic bounded model checking, with an encoding into SAT, and unbounded model checking, with an encoding into SMV. Instance, or counter-example, traces are presented back to the user in a unified visualizer. Features to speed up model checking are offered, including a decomposed parallel solving strategy and the extraction of symbolic bounds. Source code: https://github.com/haslab/Electrum Video: https://youtu.be/FbjlpvjgMDA", "doi": "10.1145/3238147.3240475", "arxiv_id": "https://doi.org/10.1145/3238147.3240475", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240475"], "github": ["https://github.com/haslab/Electrum"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240475"}
{"title": "ESBMC 5.0: an industrial-strength C model checker", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mikhail Y. R. Gadelha", "Felipe R. Monteiro", "Jeremy Morse", "Lucas C. Cordeiro", "Bernd Fischer", "Denis A. Nicole"], "abstract": "ESBMC is a mature, permissively licensed open-source context-bounded model checker for the verification of single- and multithreaded C programs. It can verify both predefined safety properties (e.g., bounds check, pointer safety, overflow) and user-defined program assertions automatically. ESBMC provides C++ and Python APIs to access internal data structures, allowing inspection and extension at any stage of the verification process. We discuss improvements over previous versions of ESBMC, including the description of new front- and back-ends, IEEE floating-point support, and an improved k-induction algorithm. A demonstration is available at https://www.youtube.com/watch?v=YcJjXHlN1v8.", "doi": "10.1145/3238147.3240481", "arxiv_id": "https://doi.org/10.1145/3238147.3240481", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240481"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240481"}
{"title": "L-CMP: an automatic learning-based parameterized verification tool", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jialun Cao", "Yongjian Li", "Jun Pang"], "abstract": "This demo introduces L-CMP, an automatic learning-based parameterized verification tool. It can verify parameterized protocols by combining machine learning and model checking techniques. Given a parameterized protocol, L-CMP learns a set of auxiliary invariants and implements verification of the protocol using the invariants automatically. In particular, the learned auxiliary invariants are straightforward and readable. The experimental results show that L-CMP can successfully verify a number of cache coherence protocols, including the industrial-scale FLASH protocol. The video presentation of L-CMP is available at https://youtu.be/6Dl2HiiiS4E, and the source code can be downloaded at https://github.com/ArabelaTso/Learning-Based-ParaVerifer.", "doi": "10.1145/3238147.3240487", "arxiv_id": "https://doi.org/10.1145/3238147.3240487", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240487"], "github": ["https://github.com/ArabelaTso/Learning-Based-ParaVerifer"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240487"}
{"title": "VulSeeker: a semantic learning based vulnerability seeker for cross-platform binary", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jian Gao", "Xin Yang", "Ying Fu", "Yu Jiang", "Jiaguang Sun"], "abstract": "Code reuse improves software development efficiency, however, vulnerabilities can be introduced inadvertently. Many existing works compute the code similarity based on CFGs to determine whether a binary function contains a known vulnerability. Unfortunately, their performance in cross-platform binary search is challenged.", "doi": "10.1145/3238147.3240480", "arxiv_id": "https://doi.org/10.1145/3238147.3240480", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240480"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240480"}
{"title": "CPA-SymExec: efficient symbolic execution in CPAchecker", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dirk Beyer", "Thomas Lemberger"], "abstract": "We present CPA-SymExec, a tool for symbolic execution that is implemented in the open-source, configurable verification framework CPAchecker. Our implementation automatically detects which symbolic facts to track, in order to obtain a small set of constraints that are necessary to decide reachability of a program area of interest. CPA-SymExec is based on abstraction and counterexample-guided abstraction refinement (CEGAR), and uses a constraint-interpolation approach to detect symbolic facts. We show that our implementation can better mitigate the path-explosion problem than symbolic execution without abstraction, by comparing the performance to the state-of-the-art Klee-based symbolic-execution engine Symbiotic and to Klee itself. For the experiments we use two kinds of analysis tasks: one for finding an executable path to a specific location of interest (e.g., if a test vector is desired to show that a certain behavior occurs), and one for confirming that no executable path to a specific location exists (e.g., if it is desired to show that a certain behavior never occurs). CPA-SymExec is released under the Apache 2 license and available (inclusive source code) at https://cpachecker.sosy-lab.org. A demonstration video is available at https://youtu.be/qoBHtvPKtnw.", "doi": "10.1145/3238147.3240478", "arxiv_id": "https://doi.org/10.1145/3238147.3240478", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240478"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240478"}
{"title": "CANAL: a cache timing analysis framework via LLVM transformation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chungha Sung", "Brandon Paulsen", "Chao Wang"], "abstract": "A unified modeling framework for non-functional properties of a program is essential for research in software analysis and verification, since it reduces burdens on individual researchers to implement new approaches and compare existing approaches. We present CANAL, a framework that models the cache behaviors of a program by transforming its intermediate representation in the LLVM compiler. CANAL inserts auxiliary variables and instructions to allow standard verification tools to handle a new class of cache related properties, e.g., for computing the worst-case execution time and detecting side-channel leaks. We demonstrate the effectiveness of CANAL using three verification tools: KLEE, SMACK and Crab-llvm. We confirm the accuracy of our cache model by comparing with CPU cycle-accurate simulation results of GEM5.", "doi": "10.1145/3238147.3240485", "arxiv_id": "https://doi.org/10.1145/3238147.3240485", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240485"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240485"}
{"title": "Descartes: a PITest engine to detect pseudo-tested methods: tool demonstration", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Oscar Luis Vera-Pérez", "Martin Monperrus", "Benoit Baudry"], "abstract": "Descartes is a tool that implements extreme mutation operators and aims at finding pseudo-tested methods in Java projects. It leverages the efficient transformation and runtime features of PITest. The demonstration compares Descartes with Gregor, the default mutation engine provided by PITest, in a set of real open source projects. It considers the execution time, number of mutants created and the relationship between the mutation scores produced by both engines. It provides some insights on the main features exposed byDescartes.", "doi": "10.1145/3238147.3240474", "arxiv_id": "https://doi.org/10.1145/3238147.3240474", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240474", "https://arxiv.org/pdf/1811.03045"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240474", "journal_ref": "ACM/IEEE International Conference on Automated Software\n  Engineering, Tool demonstration track, 2018", "categories": "cs.SE", "cited_by": 0}
{"title": "DKVF: a framework for rapid prototyping and evaluating distributed key-value stores", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Roohitavaf", "Sandeep S. Kulkarni"], "abstract": "We present our framework DKVF that enables one to quickly prototype and evaluate new consistency protocols for key-value stores. DKVF is designed based on the separation of concerns in creating distributed data stores. This separation of concerns allows the designers of consistency protocols to only focus on the high-level consistency protocols which gives them the opportunity to quickly deploy a consistency protocol and evaluate its performance. Moreover, the loose coupling of the different components allows us to easily change different components (e.g. storage engine) of an implementation. We demonstrate DKVF by implementing four existing protocols --eventual consistency, COPS, GentleRain and CausalSpartan-- with it. The implementation of these protocols was very convenient with DKVF, as it only required to write a piece of code for the consistency component that is very close to the pseudocode of the original papers. Hence, it was possible to achieve this in just 1-2 days per protocol. DKVF also comes with a toolset that facilitates running clusters and performing experiments. Tutorial video: https://www.youtube.com/watch?v=MFJQzsJkwfc&list=PLErtSVEHsnBJvoQQI6iqGn61oNrUVVuST", "doi": "10.1145/3238147.3240476", "arxiv_id": "https://doi.org/10.1145/3238147.3240476", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240476"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240476"}
{"title": "DroidMate-2: a platform for Android test generation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nataniel P. Borges Jr.", "Jenny Hotzkow", "Andreas Zeller"], "abstract": "Android applications (apps) represent an ever increasing portion of the software market. Automated test input generators are the state of the art for testing and security analysis. We introduceDroidMate-2 (DM-2), a platform to easily assist both developers and researchers to customize, develop and test new test generators. DM-2 can be used without app instrumentation or operating system modifications, as a test generator on real devices and emulators for app testing or regression testing. Additionally, it provides sensitive resource monitoring or blocking capabilities through a lightweight app instrumentation, out-of-the-box statement coverage measurement through a fully-fledged app instrumentation and native experiment reproducibility. In our experiments we compared DM-2 against Droid-Bot, a state-of-the-art test generator by measuring statement coverage. Our results show that DM-2 reached 96% of its peak coverage in less than 2/3 of the time needed by Droid-Bot, allowing for better and more efficient tests. On short runs (5 minutes) DM-2 outperformed Droid-Bot by 7% while in longer runs (1 hour) this difference increases to 8%. ACM DL Artifact: https://www.doi.org/10.1145/3264864. For the details see: https://github.com/uds-se/droidmate/wiki/ASE-2018:-Data", "doi": "10.1145/3238147.3240479", "arxiv_id": "https://doi.org/10.1145/3238147.3240479", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3240479"], "github": ["https://github.com/uds-se/droidmate/wiki/ASE-2018:-Data"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3240479"}
{"title": "Assessing and evaluating functional suitability of software", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Philipp Haindl"], "abstract": "While formal task models allow definition and time-based assessment of user-interaction, they have not yet been used as a baseline for assessing the variability patterns of user interaction with software. Consequently, operationalizing these variability patterns enables us to evaluate how suitable the defined task-execution paths are for the user to achieve a predefined goal. Improvements of the software could thereby be evidence-based on knowledge of changes' effects on functional suitability for the user rather than on prospective or opinion-based usage scenarios. Following a design thinking approach tailored to software engineering, understanding and observing these variability patterns are mandatory steps for continuous user-centered improvement of software. In practice however, due to the absence of an operational quality model for functional suitability it is hardly possible to effectively put these operational measures into context and to derive concrete software improvement actions. Having operational suitability metrics is even more important for software engineers as it allows to increasingly focus development activities especially on functionality which has business value for the user.", "doi": "10.1145/3238147.3241531", "arxiv_id": "https://doi.org/10.1145/3238147.3241531", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241531"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241531"}
{"title": "Automatic mining of constraints for monitoring systems of systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Krismayer"], "abstract": "The behavior of complex software-intensive systems of systems often only fully emerges during operation, when all systems interact with each other and with their environment. Runtime monitoring approaches are thus used to detect deviations from the expected behavior, which is commonly defined by engineers, e.g., using temporal logic or domain-specific languages. However, the deep domain knowledge required to specify constraints is often not available during the development of systems of systems with multiple teams independently working on heterogeneous components. In this paper, we thus describe our ongoing PhD research to automatically mine constraints for runtime monitoring from recorded events. Our approach mines constraints on event occurrence, timing, data, and combinations of these properties. The approach further presents the mined constraints to users offering multiple ranking strategies and can also be used to support users in system evolution scenarios.", "doi": "10.1145/3238147.3241532", "arxiv_id": "https://doi.org/10.1145/3238147.3241532", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241532"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241532"}
{"title": "Towards automatic restrictification of CUDA kernel arguments", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rokiatou Diarra"], "abstract": "Many procedural languages, such as C and C++, have pointers. Pointers are powerful and convenient, but pointer aliasing still hinders compiler optimizations, despite several years of research on pointer aliasing analysis. Because alias analysis is a difficult task and results are not always accurate, the ISO C standard 99 has added a keyword, named restrict to allow the programmer to specify non-aliasing as an aid to the compiler's optimizer and to thereby possibly improve performance. The task of annotating pointers with the restrict keyword is still left to the programmer. This task is, in general, tedious and prone to errors especially since the C does not perform any verification to ensure that restrict keyword is not misplaced. In this paper we present a static analysis tool that (i) finds CUDA kernels call sites in which actual parameters do not alias; (ii) clones the kernels called at such sites; (iii) after performing an alias analysis in these kernels, adds the restrict keyword to their arguments; and (iv) replaces the original kernel call by a call to the optimized clone whenever possible.", "doi": "10.1145/3238147.3241533", "arxiv_id": "https://doi.org/10.1145/3238147.3241533", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241533"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241533"}
{"title": "A DSL for requirements in the context of a seamless approach", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Florian Galinier"], "abstract": "Reducing the lack of consistency between requirements and the system that should satisfy these requirements is one of the major issue in Requirement Engineering (RE). The objective of my thesis work is to propose a seamless approach, allowing users to express requirements, specifications and the system itself in a unique language. The purpose of formal approaches is to reduce inconsistency. However, most developers are not familiar with these approaches, and they are not often used outside the critical systems domain. Since we want that non-experts can also use our approach to validate systems in the early stage of their development, we propose a Domain Specific Language (DSL) that is: (i) close to natural language, and (ii) based on a formal semantics. Using Model-Driven Engineering (MDE), this language bridges the gap not only between the several stakeholders that can be involved in a project, considering their different backgrounds, but also between the requirements and the code.", "doi": "10.1145/3238147.3241538", "arxiv_id": "https://doi.org/10.1145/3238147.3241538", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241538"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241538"}
{"title": "A multi-objective framework for effective performance fault injection in distributed systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Luca Traini"], "abstract": "Modern distributed systems should be built to anticipate performance degradation. Often requests in these systems involve ten to thousands Remote Procedure Calls, each of which can be a source of performance degradation. The PhD programme presented here intends to address this issue by providing automated instruments to effectively drive performance fault injection in distributed systems. The envisioned approach exploits multi-objective search-based techniques to automatically find small combinations of tiny performance degradations induced by specific RPCs, which have significant impacts on the user-perceived performance. Automating the search of these events will improve the ability to inject performance issues in production in order to force developers to anticipate and mitigate them.", "doi": "10.1145/3238147.3241535", "arxiv_id": "https://doi.org/10.1145/3238147.3241535", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241535"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241535"}
{"title": "Top-down model-driven engineering of web services from extended OpenAPI models", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David Sferruzza"], "abstract": "Web services engineering is a crucial subject, because web services are often built to be used by other programs; thus they should have a good documentation targeting developers. Furthermore, when building a digital product, engineers need to build several programs that interact with a central instance of web services. OpenAPI, a popular industry standard, makes possible to document web services in order to quickly make a prototype of the product. It allows a top-down process where developers iterate to build an OpenAPI model that describes the web services they want, and then implement both the web services and the programs that will consume them. However, when doing such rapid prototyping, developers tend to either skip this design phase and implement web services right away, or stop updating the OpenAPI model when the product is released; in both cases they cannot take advantage of having an OpenAPI model aligned with the implementation. We show how OpenAPI can be extended to add implementation details inside models. These extensions link services to assemblies of components that describe computations. Hence a top-down development process that keeps model and implementation aligned. Moreover, this makes possible for developers to benefit from more support features while keeping the same flexibility.", "doi": "10.1145/3238147.3241536", "arxiv_id": "https://doi.org/10.1145/3238147.3241536", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241536"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241536"}
{"title": "Differential program analysis with fuzzing and symbolic execution", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yannic Noller"], "abstract": "Differential program analysis means to identify the behavioral divergences in one or multiple programs, and it can be classified into two categories: identify the behavioral divergences (1) between two program versions for the same input (aka regression analysis), and (2) for the same program with two different inputs (e.g, side-channel analysis). Most of the existent approaches for both subproblems try to solve it with single techniques, which suffer from its weaknesses like scalability issues or imprecision. This research proposes to combine two very strong techniques, namely fuzzing and symbolic execution to tackle these problems and provide scalable solutions for real-world applications. The proposed approaches will be implemented on top of state-of-the-art tools like AFL and Symbolic PathFinder to evaluate them against existent work.", "doi": "10.1145/3238147.3241537", "arxiv_id": "https://doi.org/10.1145/3238147.3241537", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241537"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241537"}
{"title": "Software engineering techniques applied to relational databases", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julien Delplanque"], "abstract": "Relational databases play a central role in software systems. As any software artefact they are subject to software engineering related problems. That apply even more when these databases hold behaviour in the form of stored functions, triggers, etc… The purpose of this article is to present a research plan to handle this problematic.", "doi": "10.1145/3238147.3241534", "arxiv_id": "https://doi.org/10.1145/3238147.3241534", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241534"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241534"}
{"title": "Automatically quantifying the impact of a change in systems (journal-first abstract)", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nada Almasri", "Luay Tahat", "Bogdan Korel"], "abstract": "Software maintenance is becoming more challenging with the increased complexity of the software and the frequently applied changes. Performing impact analysis before the actual implementation of a change is a crucial task during system maintenance. While many tools and techniques are available to measure the impact of a change at the code level, only a few research work is done to measure the impact of a change at an earlier stage in the development process. This work introduces an approach to measure the impact of a change at the model level.", "doi": "10.1145/3238147.3241984", "arxiv_id": "https://doi.org/10.1145/3238147.3241984", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241984"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241984"}
{"title": "Estimating the number of remaining links in traceability recovery (journal-first abstract)", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Davide Falessi", "Massimiliano Di Penta", "Gerardo Canfora", "Giovanni Cantone"], "abstract": "Although very important in software engineering, establishing traceability links between software artifacts is extremely tedious, error-prone, and it requires significant effort. Even when approaches for automated traceability recovery exist, these provide the requirements analyst with a, usually very long, ranked list of candidate links that needs to be manually inspected. In this paper we introduce an approach called Estimation of the Number of Remaining Links (ENRL) which aims at estimating, via Machine Learning (ML) classifiers, the number of remaining positive links in a ranked list of candidate traceability links produced by a Natural Language Processing techniques-based recovery approach. We have evaluated the accuracy of the ENRL approach by considering several ML classifiers and NLP techniques on three datasets from industry and academia, and concerning traceability links among different kinds of software artifacts including requirements, use cases, design documents, source code, and test cases. Results from our study indicate that: (i) specific estimation models are able to provide accurate estimates of the number of remaining positive links; (ii) the estimation accuracy depends on the choice of the NLP technique, and (iii) univariate estimation models outperform multivariate ones.", "doi": "10.1145/3238147.3241982", "arxiv_id": "https://doi.org/10.1145/3238147.3241982", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241982"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241982"}
{"title": "Bounded model checking of C++ programs based on the Qt cross-platform framework (journal-first abstract)", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Felipe R. Monteiro", "Mário A. P. Garcia", "Lucas C. Cordeiro", "Eddie Batista de Lima Filho"], "abstract": "This work proposes an abstraction of the Qt framework, named as Qt Operational Model (QtOM), which is integrated into two different verification approaches: explicit-state model checking and symbolic (bounded) model checking. The proposed methodology is the first one to formally verify Qt-based applications, which has the potential to devise new directions for software verification of portable code. The full version of this paper is published in Software Testing, Verification and Reliability, on 02 March 2017 and it is available at https://doi.org/10.1002/stvr.1632.", "doi": "10.1145/3238147.3241981", "arxiv_id": "https://doi.org/10.1145/3238147.3241981", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241981"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241981"}
{"title": "Understanding Semi-structured merge conflict characteristics in open-source Java projects (journal-first abstract)", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Paola R. G. Accioly", "Paulo Borba", "Guilherme Cavalcanti"], "abstract": "In a collaborative development environment, tasks are commonly assigned to developers working independent from each other. As a result, when trying to integrate these contributions, one might have to deal with conflicting changes. Such conflicts might be detected when merging contributions (merge conflicts), when building the system (build conflicts), or when running tests (semantic conflicts). Regarding such conflicts, previous studies show that they occur frequently, and impair developers’ productivity, as understanding and solving them is a demanding and tedious task that might introduce defects.", "doi": "10.1145/3238147.3241983", "arxiv_id": "https://doi.org/10.1145/3238147.3241983", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3238147.3241983"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3238147.3241983"}
{"title": "Proceedings of the 1st International Workshop on Machine Learning and Software Engineering in Symbiosis, MASES@ASE 2018, Montpellier, France, September 3, 2018", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gilles Perrouin", "Mathieu Acher", "Maxime Cordy", "Xavier Devroey"], "abstract": "Machine Learning (ML) can be used to analyze and classify large collections of graph-based information, e.g. images, location information, the structure of molecules and proteins, ... Graph kernels is one of the ML techniques typically used for such ...", "doi": "10.1145/3243127", "arxiv_id": "https://doi.org/10.1145/3243127", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243127"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243127"}
{"title": "Applying graph kernels to model-driven engineering problems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Robert Clarisó", "Jordi Cabot"], "abstract": "Machine Learning (ML) can be used to analyze and classify large collections of graph-based information, e.g. images, location information, the structure of molecules and proteins, ... Graph kernels is one of the ML techniques typically used for such tasks. In a software engineering context, models of a system such as structural or architectural diagrams can be viewed as labeled graphs. Thus, in this paper we propose to employ graph kernels for clustering software modeling artifacts. Among other benefits, this would improve the efficiency and usability of a variety of software modeling activities, e.g., design space exploration, testing or verification and validation.", "doi": "10.1145/3243127.3243128", "arxiv_id": "https://doi.org/10.1145/3243127.3243128", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243127.3243128"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243127.3243128"}
{"title": "Learning-based testing for autonomous systems using spatial and temporal requirements", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hojat Khosrowjerdi", "Karl Meinke"], "abstract": "Cooperating cyber-physical systems-of-systems (CO-CPS) such as vehicle platoons, robot teams or drone swarms usually have strict safety requirements on both spatial and temporal behavior. Learning-based testing is a combination of machine learning and model checking that has been successfully used for black-box requirements testing of cyber-physical systems-of-systems. We present an overview of research in progress to apply learning-based testing to evaluate spatio-temporal requirements on autonomous systems-of-systems through modeling and simulation.", "doi": "10.1145/3243127.3243129", "arxiv_id": "https://doi.org/10.1145/3243127.3243129", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243127.3243129"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243127.3243129"}
{"title": "Automatically assessing vulnerabilities discovered by compositional analysis", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saahil Ognawala", "Ricardo Nales Amato", "Alexander Pretschner", "Pooja Kulkarni"], "abstract": "Testing is the most widely employed method to find vulnerabilities in real-world software programs. Compositional analysis, based on symbolic execution, is an automated testing method to find vulnerabilities in medium- to large-scale programs consisting of many interacting components. However, existing compositional analysis frameworks do not assess the severity of reported vulnerabilities. In this paper, we present a framework to analyze vulnerabilities discovered by an existing compositional analysis tool and assign CVSS3 (Common Vulnerability Scoring System v3.0) scores to them, based on various heuristics such as interaction with related components, ease of reachability, complexity of design and likelihood of accepting unsanitized input. By analyzing vulnerabilities reported with CVSS3 scores in the past, we train simple machine learning models. By presenting our interactive framework to developers of popular open-source software and other security experts, we gather feedback on our trained models and further improve the features to increase the accuracy of our predictions. By providing qualitative (based on community feedback) and quantitative (based on prediction accuracy) evidence from 21 open-source programs, we show that our severity prediction framework can effectively assist developers with assessing vulnerabilities.", "doi": "10.1145/3243127.3243130", "arxiv_id": "https://doi.org/10.1145/3243127.3243130", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243127.3243130"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243127.3243130"}
{"title": "A deep learning approach to program similarity", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Niccolò Marastoni", "Roberto Giacobazzi", "Mila Dalla Preda"], "abstract": "In this work we tackle the problem of binary code similarity by using deep learning applied to binary code visualization techniques. Our idea is to represent binaries as images and then to investigate whether it is possible to recognize similar binaries by applying deep learning algorithms for image classification. In particular, we apply the proposed deep learning framework to a dataset of binary code variants obtained through code obfuscation. These binary variants exhibit similar behaviours while being syntactically different. Our results show that the problem of binary code recognition is strictly separated from simple image recognition problems. Moreover, the analysis of the results of the experiments conducted in this work lead us to the identification of interesting research challenges. For example, in order to use image recognition approaches to recognize similar binary code samples it is important to further investigate how to build a suitable mapping from executables to images.", "doi": "10.1145/3243127.3243131", "arxiv_id": "https://doi.org/10.1145/3243127.3243131", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243127.3243131"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243127.3243131"}
{"title": "A language-agnostic model for semantic source code labeling", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ben Gelman", "Bryan Hoyle", "Jessica Moore", "Joshua Saxe", "David Slater"], "abstract": "Code search and comprehension have become more difficult in recent years due to the rapid expansion of available source code. Current tools lack a way to label arbitrary code at scale while maintaining up-to-date representations of new programming languages, libraries, and functionalities. Comprehensive labeling of source code enables users to search for documents of interest and obtain a high-level understanding of their contents. We use Stack Overflow code snippets and their tags to train a language-agnostic, deep convolutional neural network to automatically predict semantic labels for source code documents. On Stack Overflow code snippets, we demonstrate a mean area under ROC of 0.957 over a long-tailed list of 4,508 tags. We also manually validate the model outputs on a diverse set of unlabeled source code documents retrieved from Github, and obtain a top-1 accuracy of 86.6%. This strongly indicates that the model successfully transfers its knowledge from Stack Overflow snippets to arbitrary source code documents.", "doi": "10.1145/3243127.3243132", "arxiv_id": "https://doi.org/10.1145/3243127.3243132", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243127.3243132"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243127.3243132"}
{"title": "Fast deployment and scoring of support vector machine models in CPU and GPU", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Oscar Castro-López", "Inés Fernando Vega López"], "abstract": "In this paper, we present an approach for the fast deployment and efficient scoring of Support Vector Machine (SVM) models. We developed a compiler for transforming a formal specification of a SVM and generating source code in different versions of the C/C++ language. This effectively automates the deployment of SVM models and its integration into the operational software for its use. The proposed compiler generates efficient code to deploy SVM models in CPUs (single or multi-core) and in Graphics Processing Units (GPUs) through NVIDIA's Computed Unified Device Architecture (CUDA). We also present an empirical evaluation of our compiler's targets scoring a SVM model with a linear kernel. In our experiments we score a real dataset in batch mode at different scales. The results show that our C CUDA implementation performs better as data scale increases and it is approximately 38 times faster than the single-core implementation using single precision floating-point values.", "doi": "10.1145/3243127.3243133", "arxiv_id": "https://doi.org/10.1145/3243127.3243133", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243127.3243133"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243127.3243133"}
{"title": "Proceedings of the 2nd International Workshop on Refactoring, IWoR@ASE 2018, Montpellier, France, September 4, 2018", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Ouni", "Marouane Kessentini", "Mel Ó Cinnéide"], "abstract": "Migrating to microservices is an error-prone process with deep pitfalls resulting in high costs for mistakes. Microservices is a relatively new architectural style, resulting in the lack of general guidelines for migrating monoliths towards ...", "doi": "10.1145/3242163", "arxiv_id": "https://doi.org/10.1145/3242163", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163"}
{"title": "Migrating towards microservices: migration and architecture smells", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andrés Carrasco", "Brent van Bladel", "Serge Demeyer"], "abstract": "Migrating to microservices is an error-prone process with deep pitfalls resulting in high costs for mistakes. Microservices is a relatively new architectural style, resulting in the lack of general guidelines for migrating monoliths towards microservices. We present 9 common pitfalls in terms of bad smells with their potential solutions. Using these bad smells, pitfalls can be identified and corrected in the migration process.", "doi": "10.1145/3242163.3242164", "arxiv_id": "https://doi.org/10.1145/3242163.3242164", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163.3242164"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163.3242164"}
{"title": "Support for architectural smell refactoring", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Luca Rizzi", "Francesca Arcelli Fontana", "Riccardo Roveda"], "abstract": "To preserve high quality of a project, it is necessary to perform many refactoring steps during the development and maintenance phases. Code refactoring received a great attention in the literature, often directed to the refactoring of code smells. While at the architectural level, architectural smells received less attention. One of the most common architectural smell which may affect many parts of a software application is the Cyclic Dependency smell. This position paper presents a tool prototype that suggests which path a developer could follow to remove Cyclic Dependency smells in Java applications. The tool has been developed as an extension of the Arcan tool for architectural smells detection. In this paper we describe how the tool identifies the path to follow for the refactoring of Cyclic Dependency on real projects. The tool has been thought only to suggest a possible refactoring approach which a developer could considerate to resolve Cyclic Dependency.", "doi": "10.1145/3242163.3242165", "arxiv_id": "https://doi.org/10.1145/3242163.3242165", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163.3242165"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163.3242165"}
{"title": "Architectural refactoring as a strategic tool in the evolution of a web-based SaaS product", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rory McTague", "Paddy Fagan"], "abstract": "Working in the highly agile world of Software As-A-Service (SaaS) enterprise software products, the authors describe their experience of the constant evolution in terms of continuous refactoring. This paper examines several of the key drivers for this refactoring, their impact on product architecture and code, as well as the factors that influence timing of such impacts. The drivers examined are speed to market and associated viability, cost, organisational productivity, market demands/changing technology trends, changing underlying technical services, increased scale and the associated necessity for increased agility, and changing regulatory frameworks.", "doi": "10.1145/3242163.3242166", "arxiv_id": "https://doi.org/10.1145/3242163.3242166", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163.3242166"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163.3242166"}
{"title": "A metamodel for the specification and verification of model refactoring actions", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Davide Arcelli", "Vittorio Cortellessa", "Daniele Di Pompeo"], "abstract": "Refactoring has become a valuable activity during the software development lifecycle, because it can be induced by different causes, like new requirements or quality improvement. In code-based development contexts this activity has been widely studied, whereas in model-driven ones, where models are first-class development entities, there are many issues yet to be tackled. In this paper we present a metamodel that supports the specification of pre- and post- conditions of model refactoring actions, and the automated derivation and verification of such conditions in specific modeling languages. Our work is aimed at helping users to implement refactoring actions in the adopted modelling language by providing an environment for guaranteeing the feasibility of refactoring actions. Our primary focus is on the definition of applicable sequences of refactoring actions, rather than on the user-driven step-by-step application of refactoring actions. As an example, we illustrate the applicability of our metamodel for UML models refactoring.", "doi": "10.1145/3242163.3242167", "arxiv_id": "https://doi.org/10.1145/3242163.3242167", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163.3242167"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163.3242167"}
{"title": "Test behaviour detection as a test refactoring safety", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Brent van Bladel", "Serge Demeyer"], "abstract": "When refactoring production code, software developers rely on an automated test suite as a safeguard. However, when refactoring the test suite itself, there is no such safeguard. Therefore, there is a need for tool support that can verify if a refactored test suite preserves its behaviour pre- and post-refactoring. In this work we present T-CORE (Test COde REfactoring tool); a tool that captures the behaviour of Java tests in the form of a Test Behaviour Tree. T-CORE allows developers to verify that the refactoring of a test suite has preserved the behaviour of the test.", "doi": "10.1145/3242163.3242168", "arxiv_id": "https://doi.org/10.1145/3242163.3242168", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163.3242168"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163.3242168"}
{"title": "An empirical investigation of how and why developers rename identifiers", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anthony Peruma", "Mohamed Wiem Mkaouer", "Michael John Decker", "Christian D. Newman"], "abstract": "Renaming is vital to software maintenance and evolution. Developers rename entities when their original names no longer fit their behavioral role within the program. This may happen if the entity's original name was of poor quality or if the system has evolved such that the original name needs to be updated to reflect some of this evolution. In the end, the reason for the rename ultimately falls under increasing understandability and comprehension. Because comprehension is so important, and identifiers are the primary way developers comprehend code, it is critical to understand empirically how and why identifier names evolve. Armed with an understanding of these two facets of identifier evolution, researchers will be able to train algorithms to recognize, recommend, or even automatically generate high-quality identifier names. We present an empirical study of how method, class and package identifier names evolve to better understand the motives of their evolution. The empirical validation involves a set of 524,113 rename refactorings, performed on 3,795 Java systems. In a nutshell, our findings demonstrate that most rename refactorings narrow the meaning of the identifiers for which they are applied. Further, we analyze commit messages to contextualize these renames.", "doi": "10.1145/3242163.3242169", "arxiv_id": "https://doi.org/10.1145/3242163.3242169", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163.3242169"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163.3242169"}
{"title": "A study on developer perception of transformation languages for refactoring", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christian D. Newman", "Mohamed Wiem Mkaouer", "Michael L. Collard", "Jonathan I. Maletic"], "abstract": "Although there is much research advancing state-of-art of program transformation tools, their application in industry source code change problems has not yet been gauged. In this context, the purpose of this paper is to better understand developer familiarity and comfort with these languages by conducting a survey. It poses, and answers, four research questions to understand how frequently source code transformation languages are applied to refactoring tasks, how well-known these languages are in industry, what developers think are obstacles to adoption, and what developer refactoring habits tell us about their current use, or underuse, of transformation languages. The results show that while source code transformation languages can fill a needed niche in refactoring, research must motivate their application. We provide explanations and insights based on data, aimed at the program transformation and refactoring communities, with a goal to motivate future research and ultimately improve industry adoption of transformation languages for refactoring tasks.", "doi": "10.1145/3242163.3242170", "arxiv_id": "https://doi.org/10.1145/3242163.3242170", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163.3242170"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163.3242170"}
{"title": "Automatic recommendation of move method refactorings using clustering ensembles", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Timofey Bryksin", "Evgenii Novozhilov", "Aleksei Shpilman"], "abstract": "In this paper, we are approaching the problem of automatic refactoring recommendation for object-oriented systems. An approach based on clustering ensembles is proposed, several heuristics to existing algorithms and to filtering and combining their results are discussed. Experimental validation of the proposed approach on an open source project is presented. The obtained preliminary results illustrate that the introduced approach could be successfully used to improve existing integrated development environments, providing developers with one more tool to reduce the complexity of their projects. The paper concludes with a discussion on the applicability of such automatic refactoring recommendation approaches to real-world software developed using common object-oriented techniques.", "doi": "10.1145/3242163.3242171", "arxiv_id": "https://doi.org/10.1145/3242163.3242171", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3242163.3242171"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3242163.3242171"}
{"title": "Proceedings of the 1st International Workshop on Advances in Mobile App Analysis, A-Mobile@ASE 2018, Montpellier, France, September 4, 2018", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Li Li", "Guozhu Meng", "Jacques Klein", "Sam Malek"], "abstract": "Android has rocketed to the top of the mobile market thanks in large part to its open source model. Vendors use Android for their devices for free, and companies make customizations to suit their needs. This has resulted in a myriad of configurations ...", "doi": "10.1145/3243218", "arxiv_id": "https://doi.org/10.1145/3243218", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243218"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243218"}
{"title": "Configurations in Android testing: they matter", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Emily Kowalczyk", "Myra B. Cohen", "Atif M. Memon"], "abstract": "Android has rocketed to the top of the mobile market thanks in large part to its open source model. Vendors use Android for their devices for free, and companies make customizations to suit their needs. This has resulted in a myriad of configurations that are extant in the user space today. In this paper, we show that differences in configurations, if ignored, can lead to differences in test outputs and code coverage. Consequently, researchers who develop new testing techniques and evaluate them on only one or two configurations are missing a necessary dimension in their experiments and developers who ignore this may release buggy software. In a large study on 18 apps across 88 configurations, we show that only one of the 18 apps studied showed no variation at all. The rest showed variation in either, or both, code coverage and test results. 15% of the 2,000 plus test cases across all of the apps vary, and some of the variation is subtle, i.e. not just a test crash. Our results suggest that configurations in Android testing do matter and that developers need to test using configuration-aware techniques.", "doi": "10.1145/3243218.3243219", "arxiv_id": "https://doi.org/10.1145/3243218.3243219", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243218.3243219"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243218.3243219"}
{"title": "SPEjs: a symbolic partial evaluator for JavaScript", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sümeyye Süslü", "Christoph Csallner"], "abstract": "Partial evaluation is widely performed statically, to perform a source to source transformation on a source program that yields a specialized source program. A key observation is that current partial evaluation schemes perform fast but relatively shallow static analyses. In this paper we propose to deepen the reach of such partial evaluation schemes by selectively adding local symbolic execution. Concretely, we describe the SPEjs symbolic partial evaluator for JavaScript that is built on Babel and the SMT solver Z3. To gauge the promise of this approach we compared SPEjs with Facebook's state-of-the-art partial evaluator Prepack. Our results on a set of micro benchmarks and Prepack's test suite indicate that, within Prepack's runtime budget, SPEjs was able to simplify additional expressions and therefore remove dead code branches that Prepack failed to remove, yielding smaller residual programs.", "doi": "10.1145/3243218.3243220", "arxiv_id": "https://doi.org/10.1145/3243218.3243220", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243218.3243220"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243218.3243220"}
{"title": "Exploring the effects of ad schemes on the performance cost of mobile phones", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Cuiyun Gao", "Jichuan Zeng", "Federica Sarro", "Michael R. Lyu", "Irwin King"], "abstract": "Advertising is an important revenue source for mobile app development, especially for free apps. However, ads also carry costs to users. Displaying ads can interfere user experience, and lead to less user retention and reduced earnings ultimately. Although there are recent studies devoted to directly mitigating ad costs, for example, by reducing the battery or memory consumed, comprehensive analysis on ad embedded schemes (e.g., ad sizes and ad providers) has rarely been conducted. In this paper, we focus on analyzing three types of performance cost, i.e., cost of memory/CPU, traffic, and battery. We explore 12 ad schemes used in 104 popular Android apps and compare their performance consumption. We show that the performance costs of the ad schemes we analyzed are significantly different. We also summarize the ad schemes that would generate low resource cost to users. Our summary is endorsed by 37 experienced app developers we surveyed.", "doi": "10.1145/3243218.3243221", "arxiv_id": "https://doi.org/10.1145/3243218.3243221", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243218.3243221"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243218.3243221"}
{"title": "Poking the bear: lessons learned from probing three Android malware datasets", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Aleieldin Salem", "Alexander Pretschner"], "abstract": "To counter the continuous threat posed by Android malware, we attempted to devise a novel method based on active learning. Nonetheless, evaluating our active learning based method on three different Android malware datasets resulted in performance discrepancies. In an attempt to explain such inconsistencies, we postulated research questions and designed corresponding experiments to answer them. The results of our experiments unveiled the reasons behind the struggles of our method and, more importantly, revealed some limitations with the current Android malware detection methods that, we fear, can be leveraged by malware authors to evade detection. In this paper, we share with the research community our research questions, experiments, and findings to instigate researchers to devise methods to tackle such limitations.", "doi": "10.1145/3243218.3243222", "arxiv_id": "https://doi.org/10.1145/3243218.3243222", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243218.3243222"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243218.3243222"}
{"title": "Repackman: a tool for automatic repackaging of Android apps", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Aleieldin Salem", "F. Franziska Paulus", "Alexander Pretschner"], "abstract": "Repackaging is a technique adopted by attackers to generate fake, malicious versions of legitimate Android apps, which undermines users’ trust in the Android ecosystem. Unfortunately, the process of releasing and evaluating anti-repackaging techniques is hindered by the difficulty of acquiring repackaged versions of legitimate apps that employ those techniques on demand. In this paper, we present Repackman, a tool to automatically repackage Android apps with arbitrary payloads. We evaluate the feasibility and reliability of the tool and furnish it upon request for the research community to generate repackaged apps on demand for research purposes.", "doi": "10.1145/3243218.3243224", "arxiv_id": "https://doi.org/10.1145/3243218.3243224", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243218.3243224"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243218.3243224"}
{"title": "AppSeer: discovering flawed interactions among Android components", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vincenzo Chiaramida", "Francesco Pinci", "Ugo A. Buy", "Rigel Gjomemo"], "abstract": "We identify several reliability issues arising from interactions between components of system-defined Android apps and components of third-party apps. These issues are generally caused by incorrect assumptions that system apps make about the behavior of third-party apps, resulting in significant vulnerabilities in system apps. For instance, it is possible for a third-party app to make many system applications to crash, including the Phone app used to make and receive phone calls, the Settings app used to configure a mobile device, and several other apps that expose a so-called started service. Our findings indicate that additional automated tools for integration testing and static analysis of Android apps are in order. Here we discuss AppSeer, a toolset that automatically detects vulnerabilities of system apps and third-party apps. Preliminary precision and recall results for AppSeer are quite encouraging.", "doi": "10.1145/3243218.3243225", "arxiv_id": "https://doi.org/10.1145/3243218.3243225", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3243218.3243225"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3243218.3243225"}
{"title": "34th IEEE/ACM International Conference on Automated Software Engineering, ASE 2019, San Diego, CA, USA, November 11-15, 2019", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": [], "abstract": null, "doi": null, "arxiv_id": "https://ieeexplore.ieee.org/xpl/conhome/8949433/proceeding", "pdf_urls": ["https://arxiv.org/pdf/https://ieeexplore.ieee.org/xpl/conhome/8949433/proceeding"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://ieeexplore.ieee.org/xpl/conhome/8949433/proceeding"}
{"title": "Assessing the Generalizability of Code2vec Token Embeddings", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hong Jin Kang", "Tegawendé F. Bissyandé", "David Lo"], "abstract": "Many Natural Language Processing (NLP) tasks, such as sentiment analysis or syntactic parsing, have benefited from the development of word embedding models. In particular, regardless of the training algorithms, the learned embeddings have often been shown to be generalizable to different NLP tasks. In contrast, despite recent momentum on word embeddings for source code, the literature lacks evidence of their generalizability beyond the example task they have been trained for. In this experience paper, we identify 3 potential downstream tasks, namely code comments generation, code authorship identification, and code clones detection, that source code token embedding models can be applied to. We empirically assess a recently proposed code token embedding model, namely code2vec's token embeddings. Code2vec was trained on the task of predicting method names, and while there is potential for using the vectors it learns on other tasks, it has not been explored in literature. Therefore, we fill this gap by focusing on its generalizability for the tasks we have identified. Eventually, we show that source code token embeddings cannot be readily leveraged for the downstream tasks. Our experiments even show that our attempts to use them do not result in any improvements over less sophisticated methods. We call for more research into effective and general use of code embeddings.", "doi": "10.1109/ase.2019.00011", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00011", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00011"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00011"}
{"title": "Multi-modal Attention Network Learning for Semantic Source Code Retrieval", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yao Wan", "Jingdong Shu", "Yulei Sui", "Guandong Xu", "Zhou Zhao", "Jian Wu", "Philip S. Yu"], "abstract": "Code retrieval techniques and tools have been playing a key role in facilitating software developers to retrieve existing code fragments from available open-source repositories given a user query (e.g., a short natural language text describing the functionality for retrieving a particular code snippet). Despite the existing efforts in improving the effectiveness of code retrieval, there are still two main issues hindering them from being used to accurately retrieve satisfiable code fragments from large-scale repositories when answering complicated queries. First, the existing approaches only consider shallow features of source code such as method names and code tokens, but ignoring structured features such as abstract syntax trees (ASTs) and control-flow graphs (CFGs) of source code, which contains rich and well-defined semantics of source code. Second, although the deep learning-based approach performs well on the representation of source code, it lacks the explainability, making it hard to interpret the retrieval results and almost impossible to understand which features of source code contribute more to the final results. To tackle the two aforementioned issues, this paper proposes MMAN, a novel Multi-Modal Attention Network for semantic source code retrieval. A comprehensive multi-modal representation is developed for representing unstructured and structured features of source code, with one LSTM for the sequential tokens of code, a Tree-LSTM for the AST of code and a GGNN (Gated Graph Neural Network) for the CFG of code. Furthermore, a multi-modal attention fusion layer is applied to assign weights to different parts of each modality of source code and then integrate them into a single hybrid representation. Comprehensive experiments and analysis on a large-scale real-world dataset show that our proposed model can accurately retrieve code snippets and outperforms the state-of-the-art methods.", "doi": "10.1109/ase.2019.00012", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00012", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00012"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00012"}
{"title": "Experience Paper: Search-Based Testing in Automated Driving Control Applications", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christoph Gladisch", "Thomas Heinz", "Christian Heinzemann", "Jens Oehlerking", "Anne von Vietinghoff", "Tim Pfitzer"], "abstract": "Automated test generation and evaluation in simulation environments is a key technology for verification of automated driving (AD) applications. Search-based testing (SBT) is an approach for automated test generation that leverages optimization to efficiently generate interesting concrete tests from abstract test descriptions. In this experience paper, we report on our observations after successfully applying SBT to AD control applications in several use cases with different characteristics. Based on our experiences, we derive a number of lessons learned that we consider important for the adoption of SBT methods and tools in industrial settings. The key lesson is that SBT finds relevant errors and provides valuable feedback to the developers, but requires tool support for writing specifications.", "doi": "10.1109/ase.2019.00013", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00013", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00013"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00013"}
{"title": "AutoFocus: Interpreting Attention-Based Neural Networks by Code Perturbation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nghi D. Q. Bui", "Yijun Yu", "Lingxiao Jiang"], "abstract": "Despite being adopted in software engineering tasks, deep neural networks are treated mostly as a black box due to the difficulty in interpreting how the networks infer the outputs from the inputs. To address this problem, we propose AutoFocus, an automated approach for rating and visualizing the importance of input elements based on their effects on the outputs of the networks. The approach is built on our hypotheses that (1) attention mechanisms incorporated into neural networks can generate discriminative scores for various input elements and (2) the discriminative scores reflect the effects of input elements on the outputs of the networks. This paper verifies the hypotheses by applying AutoFocus on the task of algorithm classification (i.e., given a program source code as input, determine the algorithm implemented by the program). AutoFocus identifies and perturbs code elements in a program systematically, and quantifies the effects of the perturbed elements on the network's classification results. Based on evaluation on more than 1000 programs for 10 different sorting algorithms, we observe that the attention scores are highly correlated to the effects of the perturbed code elements. Such a correlation provides a strong basis for the uses of attention scores to interpret the relations between code elements and the algorithm classification results of a neural network, and we believe that visualizing code elements in an input program ranked according to their attention scores can facilitate faster program comprehension with reduced code.", "doi": "10.1109/ase.2019.00014", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00014", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00014"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00014"}
{"title": "Test Transfer Across Mobile Apps Through Semantic Mapping", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jun-Wei Lin", "Reyhaneh Jabbarvand", "Sam Malek"], "abstract": "GUI-based testing has been primarily used to examine the functionality and usability of mobile apps. Despite the numerous GUI-based test input generation techniques proposed in the literature, these techniques are still limited by (1) lack of context-aware text inputs; (2) failing to generate expressive tests; and (3) absence of test oracles. To address these limitations, we propose CraftDroid, a framework that leverages information retrieval, along with static and dynamic analysis techniques, to extract the human knowledge from an existing test suite for one app and transfer the test cases and oracles to be used for testing other apps with the similar functionalities. Evaluation of CraftDroid on real-world commercial Android apps corroborates its effectiveness by achieving 73% precision and 90% recall on average for transferring both the GUI events and oracles. In addition, 75% of the attempted transfers successfully generated valid and feature-based tests for popular features among apps in the same category.", "doi": "10.1109/ase.2019.00015", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00015", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00015"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00015"}
{"title": "Test Migration Between Mobile Apps with Similar Functionality", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Farnaz Behrang", "Alessandro Orso"], "abstract": "The use of mobile apps is increasingly widespread, and much effort is put into testing these apps to make sure they behave as intended. To reduce this effort, and thus the overall cost of mobile app testing, we propose APPTESTMIGRATOR, a technique for migrating test cases between apps in the same category (e.g., banking apps). The intuition behind APPTESTMIGRATOR is that many apps share similarities in their functionality, and these similarities often result in conceptually similar user interfaces (through which that functionality is accessed). APPTESTMIGRATOR leverages these commonalities between user interfaces to migrate existing tests written for an app to another similar app. Specifically, given (1) a test case for an app (source app) and (2) a second app (target app), APPTESTMIGRATOR attempts to automatically transform the sequence of events and oracles in the test for the source app to events and oracles for the target app. We implemented APPTESTMIGRATOR for Android mobile apps and evaluated it on a set of randomly selected apps from the Google Play Store in four different categories. Our initial results are promising, support our intuition that test migration is possible, and motivate further research in this direction.", "doi": "10.1109/ase.2019.00016", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00016", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00016"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00016"}
{"title": "DaPanda: Detecting Aggressive Push Notifications in Android Apps", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tianming Liu", "Haoyu Wang", "Li Li", "Guangdong Bai", "Yao Guo", "Guoai Xu"], "abstract": "Mobile push notifications have been widely used in mobile platforms to deliver all sorts of information to app users. Although it offers great convenience for both app developers and mobile users, this feature was frequently reported to serve malicious and aggressive purposes, such as delivering annoying push notification advertisement. However, to the best of our knowledge, this problem has not been studied by our research community so far. To fill the void, this paper presents the first study to detect aggressive push notifications and further characterize them in the global mobile app ecosystem on a large scale. To this end, we first provide a taxonomy of mobile push notifications and identify the aggressive ones using a crowdsourcing-based method. Then we propose sc DaPanda, a novel hybrid approach, aiming at automatically detecting aggressive push notifications in Android apps. sc DaPanda leverages a guided testing approach to systematically trigger and record push notifications. By instrumenting the Android framework, sc DaPanda further collects all notification-relevant runtime information to flag the aggressive ones. Our experimental results show that sc DaPanda is capable of detecting different types of aggressive push notifications effectively in an automated way. By applying sc DaPanda to 20,000 Android apps from different app markets, it yields over 1,000 aggressive notifications, which have been further confirmed as true positives. Our in-depth analysis further reveals that aggressive notifications are prevalent across different markets and could be manifested in all the phases in the lifecycle of push notifications. It is hence urgent for our community to take actions to detect and mitigate apps involving aggressive push notifications.", "doi": "10.1109/ase.2019.00017", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00017", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00017"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00017"}
{"title": "Automatic Self-Validation for Code Coverage Profilers", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yibiao Yang", "Yanyan Jiang", "Zhiqiang Zuo", "Yang Wang", "Hao Sun", "Hongmin Lu", "Yuming Zhou", "Baowen Xu"], "abstract": "Code coverage as the primitive dynamic program behavior information, is widely adopted to facilitate a rich spectrum of software engineering tasks, such as testing, fuzzing, debugging, fault detection, reverse engineering, and program understanding. Thanks to the widespread applications, it is crucial to ensure the reliability of the code coverage profilers. Unfortunately, due to the lack of research attention and the existence of testing oracle problem, coverage profilers are far away from being tested sufficiently. Bugs are still regularly seen in the widely deployed profilers, like gcov and llvm-cov, along with gcc and llvm, respectively. This paper proposes Cod, an automated self-validator for effectively uncovering bugs in the coverage profilers. Starting from a test program (either from a compiler's test suite or generated randomly), Cod detects profiler bugs with zero false positive using a metamorphic relation in which the coverage statistics of that program and a mutated variant are bridged. We evaluated Cod over two of the most well-known code coverage profilers, namely gcov and llvm-cov. Within a four-month testing period, a total of 196 potential bugs (123 for gcov, 73 for llvm-cov) are found, among which 23 are confirmed by the developers.", "doi": "10.1109/ase.2019.00018", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00018", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00018"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00018"}
{"title": "Efficient Test Generation Guided by Field Coverage Criteria", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ariel Godio", "Valeria S. Bengolea", "Pablo Ponzio", "Nazareno Aguirre", "Marcelo Fabian Frias"], "abstract": "Field-exhaustive testing is a testing criterion suitable for object-oriented code over complex, heap-allocated, data structures. It requires test suites to contain enough test inputs to cover all feasible values for the object's fields within a certain scope (input-size bound). While previous work shows that field-exhaustive suites can be automatically generated, the generation technique required a formal specification of the inputs that can be subject to SAT-based analysis. Moreover, the restriction of producing all feasible values for inputs' fields makes test generation costly. In this paper, we deal with field coverage as testing criteria that measure the quality of a test suite in terms of coverage and mutation score, by examining to what extent the values of inputs' fields are covered. In particular, we consider field coverage in combination with test generation based on symbolic execution to produce underapproximations of field-exhaustive suites, using the Symbolic Pathfinder tool. To underapproximate these suites we use tranScoping, a technique that estimates characteristics of yet to be run analyses for large scopes, based on data obtained from analyses performed in small scopes. This provides us with a suitable condition to prematurely stop the symbolic execution. As we show, tranScoping different metrics regarding field coverage allows us to produce significantly smaller suites using a fraction of the generation time. All this while retaining the effectiveness of field exhaustive suites in terms of test suite quality.", "doi": "10.1109/ase.2019.00019", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00019", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00019"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00019"}
{"title": "A Qualitative Analysis of Android Taint-Analysis Results", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Linghui Luo", "Eric Bodden", "Johannes Späth"], "abstract": "In the past, researchers have developed a number of popular taint-analysis approaches, particularly in the context of Android applications. Numerous studies have shown that automated code analyses are adopted by developers only if they yield a good \"signal to noise ratio\", i.e., high precision. Many previous studies have reported analysis precision quantitatively, but this gives little insight into what can and should be done to increase precision further. To guide future research on increasing precision, we present a comprehensive study that evaluates static Android taint-analysis results on a qualitative level. To unravel the exact nature of taint flows, we have designed COVA, an analysis tool to compute partial path constraints that inform about the circumstances under which taint flows may actually occur in practice. We have conducted a qualitative study on the taint flows reported by FlowDroid in 1,022 real-world Android applications. Our results reveal several key findings: Many taint flows occur only under specific conditions, e.g., environment settings, user interaction, I/O. Taint analyses should consider the application context to discern such situations. COVA shows that few taint flows are guarded by multiple different kinds of conditions simultaneously, so tools that seek to confirm true positives dynamically can concentrate on one kind at a time, e.g., only simulating user interactions. Lastly, many false positives arise due to a too liberal source/sink configuration. Taint analyses must be more carefully configured, and their configuration could benefit from better tool assistance.", "doi": "10.1109/ase.2019.00020", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00020", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00020"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00020"}
{"title": "Goal-Driven Exploration for Android Applications", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Duling Lai", "Julia Rubin"], "abstract": "This paper proposes a solution for automated goal-driven exploration of Android applications - a scenario in which a user, e.g., a security auditor, needs to dynamically trigger the functionality of interest in an application, e.g., to check whether user-sensitive info is only sent to recognized third-party servers. As the auditor might need to check hundreds or even thousands of apps, manually exploring each app to trigger the desired behavior is too time-consuming to be feasible. Existing automated application exploration and testing techniques are of limited help in this scenario as well, as their goal is mostly to identify faults by systematically exploring different app paths, rather than swiftly navigating to the target functionality. The goal-driven application exploration approach proposed in this paper, called GoalExplorer, automatically generates an executable test script that directly triggers the functionality of interest. The core idea behind GoalExplorer is to first statically model the application's UI screens and transitions between these screens, producing a Screen Transition Graph (STG). Then, GoalExplorer uses the STG to guide the dynamic exploration of the application to the particular target of interest: an Android activity, API call, or a program statement. The results of our empirical evaluation on 93 benchmark applications and the 95 most popular GooglePlay applications show that the STG is substantially more accurate than other Android UI models and that GoalExplorer is able to trigger a target functionality much faster than existing application exploration techniques.", "doi": "10.1109/ase.2019.00021", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00021", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00021"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00021"}
{"title": "RANDR: Record and Replay for Android Applications via Targeted Runtime Instrumentation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Onur Sahin", "Assel Aliyeva", "Hariharan Mathavan", "Ayse K. Coskun", "Manuel Egele"], "abstract": "The ability to repeat the execution of a program is a fundamental requirement in many areas of computing from computer system evaluation to software engineering. Reproducing executions of mobile apps, in particular, has proven difficult under real-life scenarios due to multiple sources of external inputs and interactive nature of the apps. Previous works that provide record/replay functionality for mobile apps are restricted to particular input sources (e.g., touchscreen events) and present deployment challenges due to intrusive modifications to the underlying software stack. Moreover, due to their reliance on record and replay of device specific events, the recorded executions cannot be reliably reproduced across different platforms. In this paper, we present a new practical approach, RandR, for record and replay of Android applications. RandR captures and replays multiple sources of input (i.e., UI and network) without requiring source code (OS or app), administrative device privileges, or any special platform support. RandR achieves these qualities by instrumenting a select set of methods at runtime within an application's own sandbox. In addition, to enable portability of recorded executions across different platforms for replay, RandR contextualizes UI events as interactions with particular UI components (e.g., a button) as opposed to relying on platform specific features (e.g., screen coordinates). We demonstrate RandR's accurate cross-platform record and replay capabilities using over 30 real-world Android apps across a variety of platforms including emulators as well as commercial off-the-shelf mobile devices deployed in real life.", "doi": "10.1109/ase.2019.00022", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00022", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00022"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00022"}
{"title": "MalScan: Fast Market-Wide Mobile Malware Scanning by Social-Network Centrality Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yueming Wu", "Xiaodi Li", "Deqing Zou", "Wei Yang", "Xin Zhang", "Hai Jin"], "abstract": "Malware scanning of an app market is expected to be scalable and effective. However, existing approaches use either syntax-based features which can be evaded by transformation attacks or semantic-based features which are usually extracted by performing expensive program analysis. Therefor, in this paper, we propose a lightweight graph-based approach to perform Android malware detection. Instead of traditional heavyweight static analysis, we treat function call graphs of apps as social networks and perform social-network-based centrality analysis to represent the semantic features of the graphs. Our key insight is that centrality provides a succinct and fault-tolerant representation of graph semantics, especially for graphs with certain amount of inaccurate information (e.g., inaccurate call graphs). We implement a prototype system, MalScan, and evaluate it on datasets of 15,285 benign samples and 15,430 malicious samples. Experimental results show that MalScan is capable of detecting Android malware with up to 98% accuracy under one second which is more than 100 times faster than two state-of-the-art approaches, namely MaMaDroid and Drebin. We also demonstrate the feasibility of MalScan on market-wide malware scanning by performing a statistical study on over 3 million apps. Finally, in a corpus of dataset collected from Google-Play app market, MalScan is able to identify 18 zero-day malware including malware samples that can evade detection of existing tools.", "doi": "10.1109/ase.2019.00023", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00023", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00023"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00023"}
{"title": "Discovering, Explaining and Summarizing Controversial Discussions in Community Q&A Sites", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaoxue Ren", "Zhenchang Xing", "Xin Xia", "Guoqiang Li", "Jianling Sun"], "abstract": "Developers often look for solutions to programming problems in community Q&A sites like Stack Overflow. Due to the crowdsourcing nature of these Q&A sites, many user-provided answers are wrong, less optimal or out-of-date. Relying on community-curated quality indicators (e.g., accepted answer, answer vote) cannot reliably identify these answer problems. Such problematic answers are often criticized by other users. However, these critiques are not readily discoverable when reading the posts. In this paper, we consider the answers being criticized and their critique posts as controversial discussions in community Q&A sites. To help developers notice such controversial discussions and make more informed choices of appropriate solutions, we design an automatic open information extraction approach for systematically discovering and summarizing the controversies in Stack Overflow and exploiting official API documentation to assist the understanding of the discovered controversies. We apply our approach to millions of java/android-tagged Stack overflow questions and answers and discover a large scale of controversial discussions in Stack Overflow. Our manual evaluation confirms that the extracted controversy information is of high accuracy. A user study with 18 developers demonstrates the usefulness of our generated controversy summaries in helping developers avoid the controversial answers and choose more appropriate solutions to programming questions.", "doi": "10.1109/ase.2019.00024", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00024", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00024"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00024"}
{"title": "Automating App Review Response Generation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Cuiyun Gao", "Jichuan Zeng", "Xin Xia", "David Lo", "Michael R. Lyu", "Irwin King"], "abstract": "Previous studies showed that replying to a user review usually has a positive effect on the rating that is given by the user to the app. For example, Hassan et al. found that responding to a review increases the chances of a user updating their given rating by up to six times compared to not responding. To alleviate the labor burden in replying to the bulk of user reviews, developers usually adopt a template-based strategy where the templates can express appreciation for using the app or mention the company email address for users to follow up. However, reading a large number of user reviews every day is not an easy task for developers. Thus, there is a need for more automation to help developers respond to user reviews. Addressing the aforementioned need, in this work we propose a novel approach RRGen that automatically generates review responses by learning knowledge relations between reviews and their responses. RRGen explicitly incorporates review attributes, such as user rating and review length, and learns the relations between reviews and corresponding responses in a supervised way from the available training data. Experiments on 58 apps and 309,246 review-response pairs highlight that RRGen outperforms the baselines by at least 67.4% in terms of BLEU-4 (an accuracy measure that is widely used to evaluate dialogue response generation systems). Qualitative analysis also confirms the effectiveness of RRGen in generating relevant and accurate responses.", "doi": "10.1109/ase.2019.00025", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00025", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00025"], "github": ["https://github.com/ReMine-Lab/RRGen"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00025"}
{"title": "Automatic Generation of Pull Request Descriptions", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhongxin Liu", "Xin Xia", "Christoph Treude", "David Lo", "Shanping Li"], "abstract": "Enabled by the pull-based development model, developers can easily contribute to a project through pull requests (PRs). When creating a PR, developers can add a free-form description to describe what changes are made in this PR and/or why. Such a description is helpful for reviewers and other developers to gain a quick understanding of the PR without touching the details and may reduce the possibility of the PR being ignored or rejected. However, developers sometimes neglect to write descriptions for PRs. For example, in our collected dataset with over 333K PRs, more than 34% of the PR descriptions are empty. To alleviate this problem, we propose an approach to automatically generate PR descriptions based on the commit messages and the added source code comments in the PRs. We regard this problem as a text summarization problem and solve it using a novel sequence-to-sequence model. To cope with out-of-vocabulary words in software artifacts and bridge the gap between the training loss function of the sequence-to-sequence model and the evaluation metric ROUGE, which has been shown to correspond to human evaluation, we integrate the pointer generator and directly optimize for ROUGE using reinforcement learning and a special loss function. We build a dataset with over 41K PRs and evaluate our approach on this dataset through ROUGE and a human evaluation. Our evaluation results show that our approach outperforms two baselines by significant margins.", "doi": "10.1109/ase.2019.00026", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00026", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00026"], "github": ["https://github.com/Tbabm/PRSummarizer"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00026"}
{"title": "Systematically Covering Input Structure", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nikolas Havrikov", "Andreas Zeller"], "abstract": "Grammar-based testing uses a given grammar to produce syntactically valid inputs. To cover program features, it is necessary to also cover input features—say, all URL variants for a URL parser. Our k-path algorithm for grammar production systematically covers syntactic elements as well as their combinations. In our evaluation, we show that this results in a significantly higher code coverage than state of the art.", "doi": "10.1109/ase.2019.00027", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00027", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00027"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00027"}
{"title": "SEGATE: Unveiling Semantic Inconsistencies between Code and Specification of String Inputs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Devika Sondhi", "Rahul Purandare"], "abstract": "Automated testing techniques are often assessed on coverage based metrics. However, despite giving good coverage, the test cases may miss the gap between functional specification and the code implementation. This gap may be subtle in nature, arising due to the absence of logical checks, either in the implementation or in the specification, resulting in inconsistencies in the input definition. The inconsistencies may be prevalent especially for structured inputs, commonly specified using string-based data types. Our study on defects reported over popular libraries reveals that such gaps may not be limited to input validation checks. We propose a test generation technique for structured string inputs where we infer inconsistencies in input definition to expose semantic gaps in the method under test and the method specification. We assess this technique using our tool SEGATE, Semantic Gap Tester. SEGATE uses static analysis and automaton modeling to infer the gap and generate test cases. On our benchmark dataset, comprising of defects reported in 15 popular open-source libraries, written in Java, SEGATE was able to generate tests to expose 80% of the defects.", "doi": "10.1109/ase.2019.00028", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00028", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00028"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00028"}
{"title": "Detecting Error-Handling Bugs without Error Specification Input", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhouyang Jia", "Shanshan Li", "Tingting Yu", "Xiangke Liao", "Ji Wang", "Xiaodong Liu", "Yunhuai Liu"], "abstract": "Most software systems frequently encounter errors when interacting with their environments. When errors occur, error-handling code must execute flawlessly to facilitate system recovery. Implementing correct error handling is repetitive but non-trivial, and developers often inadvertently introduce bugs into error-handling code. Existing tools require correct error specifications to detect error-handling bugs. Manually generating error specifications is error-prone and tedious, while automatically mining error specifications is hard to achieve a satisfying accuracy. In this paper, we propose EH-Miner, a novel and practical tool that can automatically detect error-handling bugs without the need for error specifications. Given a function, EH-Miner mines its error-handling rules when the function is frequently checked by an equivalent condition, and handled by the same action. We applied EH-Miner to 117 applications across 15 software domains. EH-Miner mined error-handling rules with the precision of 91.1% and the recall of 46.9%. We reported 142 bugs to developers, and 106 bugs had been confirmed and fixed at the time of writing. We further applied EH-Miner to Linux kernel, and reported 68 bugs for kernel-4.17, of which 42 had been confirmed or fixed.", "doi": "10.1109/ase.2019.00029", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00029", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00029"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00029"}
{"title": "Grading-Based Test Suite Augmentation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jonathan Osei-Owusu", "Angello Astorga", "Liia Butler", "Tao Xie", "Geoffrey Challen"], "abstract": "Enrollment in introductory programming (CS1) courses continues to surge and hundreds of CS1 students can produce thousands of submissions for a single problem, all requiring timely and accurate grading. One way that instructors can efficiently grade is to construct a custom instructor test suite that compares a student submission to a reference solution over randomly generated or hand-crafted inputs. However, such test suite is often insufficient, causing incorrect submissions to be marked as correct. To address this issue, we propose the Grasa (GRAding-based test Suite Augmentation) approach consisting of two techniques. Grasa first detects and clusters incorrect submissions by approximating their behavioral equivalence to each other. To augment the existing instructor test suite, Grasa generates a minimal set of additional tests that help detect the incorrect submissions. We evaluate our Grasa approach on a dataset of CS1 student submissions for three programming problems. Our preliminary results show that Grasa can effectively identify incorrect student submissions and minimally augment the instructor test suite.", "doi": "10.1109/ase.2019.00030", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00030", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00030"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00030"}
{"title": "Emotions Extracted from Text vs. True Emotions-An Empirical Evaluation in SE Context", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yi Wang"], "abstract": "Emotion awareness research in SE context has been growing in recent years. Currently, researchers often rely on textual communication records to extract emotion states using natural language processing techniques. However, how well these extracted emotion states reflect people's real emotions has not been thoroughly investigated. In this paper, we report a multi-level, longitudinal empirical study with 82 individual members in 27 project teams. We collected their self-reported retrospective emotion states on a weekly basis during their year-long projects and also extracted corresponding emotions from the textual communication records. We then model and compare the dynamics of these two types of emotions using multiple statistical and time series analysis methods. Our analyses yield a rich set of findings. The most important one is that the dynamics of emotions extracted using text-based algorithms often do not well reflect the dynamics of self-reported retrospective emotions. Besides, the extracted emotions match self-reported retrospective emotions better at the team-level. Our results also suggest that individual personalities and the team's emotion display norms significantly impact the match/mismatch. Our results should warn the research community about the limitations and challenges of applying text-based emotion recognition tools in SE research.", "doi": "10.1109/ase.2019.00031", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00031", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00031"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00031"}
{"title": "Learning from Examples to Find Fully Qualified Names of API Elements in Code Snippets", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["C. M. Khaled Saifullah", "Muhammad Asaduzzaman", "Chanchal K. Roy"], "abstract": "Developers often reuse code snippets from online forums, such as Stack Overflow, to learn API usages of software frameworks or libraries. These code snippets often contain ambiguous undeclared external references. Such external references make it difficult to learn and use those APIs correctly. In particular, reusing code snippets containing such ambiguous undeclared external references requires significant manual efforts and expertise to resolve them. Manually resolving fully qualified names (FQN) of API elements is a non-trivial task. In this paper, we propose a novel context-sensitive technique, called COSTER, to resolve FQNs of API elements in such code snippets. The proposed technique collects locally specific source code elements as well as globally related tokens as the context of FQNs, calculates likelihood scores, and builds an occurrence likelihood dictionary (OLD). Given an API element as a query, COSTER captures the context of the query API element, matches that with the FQNs of API elements stored in the OLD, and rank those matched FQNs leveraging three different scores: likelihood, context similarity, and name similarity scores. Evaluation with more than 600K code examples collected from GitHub and two different Stack Overflow datasets shows that our proposed technique improves precision by 4-6% and recall by 3-22% compared to state-of-the-art techniques. The proposed technique significantly reduces the training time compared to the StatType, a state-of-the-art technique, without sacrificing accuracy. Extensive analyses on results demonstrate the robustness of the proposed technique.", "doi": "10.1109/ase.2019.00032", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00032", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00032"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00032"}
{"title": "Inferring Program Transformations From Singular Examples via Big Code", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiajun Jiang", "Luyao Ren", "Yingfei Xiong", "Lingming Zhang"], "abstract": "Inferring program transformations from concrete program changes has many potential uses, such as applying systematic program edits, refactoring, and automated program repair. Existing work for inferring program transformations usually rely on statistical information over a potentially large set of program-change examples. However, in many practical scenarios we do not have such a large set of program-change examples. In this paper, we address the challenge of inferring a program transformation from one single example. Our core insight is that \"big code\" can provide effective guide for the generalization of a concrete change into a program transformation, i.e., code elements appearing in many files are general and should not be abstracted away. We first propose a framework for transformation inference, where programs are represented as hypergraphs to enable fine-grained generalization of transformations. We then design a transformation inference approach, GENPAT, that infers a program transformation based on code context and statistics from a big code corpus. We have evaluated GENPAT under two distinct application scenarios, systematic editing and program repair. The evaluation on systematic editing shows that GENPAT significantly outperforms a state-of-the-art approach, SYDIT, with up to 5.5x correctly transformed cases. The evaluation on program repair suggests that GENPAT has the potential to be integrated in advanced program repair tools-GENPAT successfully repaired 19 real-world bugs in the Defects4J benchmark by simply applying transformations inferred from existing patches, where 4 bugs have never been repaired by any existing technique. Overall, the evaluation results suggest that GENPAT is effective for transformation inference and can potentially be adopted for many different applications.", "doi": "10.1109/ase.2019.00033", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00033", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00033"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00033"}
{"title": "Performance-Boosting Sparsification of the IFDS Algorithm with Applications to Taint Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dongjie He", "Haofeng Li", "Lei Wang", "Haining Meng", "Hengjie Zheng", "Jie Liu", "Shuangwei Hu", "Lian Li", "Jingling Xue"], "abstract": "The IFDS algorithm can be compute-and memoryintensive for some large programs, often running for a long time (more than expected) or terminating prematurely after some time and/or memory budgets have been exhausted. In the latter case, the corresponding IFDS data-flow analyses may suffer from false negatives and/or false positives. To improve this, we introduce a sparse alternative to the traditional IFDS algorithm. Instead of propagating the data-flow facts across all the program points along the program’s (interprocedural) control flow graph, we propagate every data-flow fact directly to its next possible use points along its own sparse control flow graph constructed on the fly, thus reducing significantly both the time and memory requirements incurred by the traditional IFDS algorithm. In our evaluation, we compare FLOWDROID, a taint analysis performed by using the traditional IFDS algorithm, with our sparse incarnation, SPARSEDROID, on a set of 40 Android apps selected. For the time budget (5 hours) and memory budget (220GB) allocated per app, SPARSEDROID can run every app to completion but FLOWDROID terminates prematurely for 9 apps, resulting in an average speedup of 22.0x. This implies that when used as a market-level vetting tool, SPARSEDROID can finish analyzing these 40 apps in 2.13 hours (by issuing 228 leak warnings) while FLOWDROID manages to analyze only 30 apps in the same time period (by issuing only 147 leak warnings).", "doi": "10.1109/ase.2019.00034", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00034", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00034"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00034"}
{"title": "Characterizing Android App Signing Issues", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haoyu Wang", "Hongxuan Liu", "Xusheng Xiao", "Guozhu Meng", "Yao Guo"], "abstract": "In the app releasing process, Android requires all apps to be digitally signed with a certificate before distribution. Android uses this certificate to identify the author and ensure the integrity of an app. However, a number of signature issues have been reported recently, threatening the security and privacy of Android apps. In this paper, we present the first large-scale systematic measurement study on issues related to Android app signatures. We first create a taxonomy covering four types of app signing issues (21 anti-patterns in total), including vulnerabilities, potential attacks, release bugs and compatibility issues. Then we developed an automated tool to characterize signature-related issues in over 5 million app items (3 million distinct apks) crawled from Google Play and 24 alternative Android app markets. Our empirical findings suggest that although Google has introduced apk-level signing schemes (V2 and V3) to overcome some of the known security issues, more than 93% of the apps still use only the JAR signing scheme (V1), which poses great security threats. Besides, we also revealed that 7% to 45% of the apps in the 25 studied markets have been found containing at least one signing issue, while a large number of apps have been exposed to security vulnerabilities, attacks and compatibility issues. Among them a considerable number of apps we identified are popular apps with millions of downloads. Finally, our evolution analysis suggested that most of the issues were not mitigated after a considerable amount of time across markets. The results shed light on the emergency for detecting and repairing the app signing issues.", "doi": "10.1109/ase.2019.00035", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00035", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00035"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00035"}
{"title": "OAUTHLINT: An Empirical Study on OAuth Bugs in Android Applications", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tamjid Al Rahat", "Yu Feng", "Yuan Tian"], "abstract": "Mobile developers use OAuth APIs to implement Single-Sign-On services. However, the OAuth protocol was originally designed for the authorization for third-party websites not to authenticate users in third-party mobile apps. As a result, it is challenging for developers to correctly implement mobile OAuth securely. These vulnerabilities due to the misunderstanding of OAuth and inexperience of developers could lead to data leakage and account breach. In this paper, we perform an empirical study on the usage of OAuth APIs in Android applications and their security implications. In particular, we develop OAUTHLINT, that incorporates a query-driven static analysis to automatically check programs on the Google Play marketplace. OAUTHLINT takes as input an anti-protocol that encodes a vulnerable pattern extracted from the OAuth specifications and a program P. Our tool then generates a counter-example if the anti-protocol can match a trace of Ps possible executions. To evaluate the effectiveness of our approach, we perform a systematic study on 600+ popular apps which have more than 10 millions of downloads. The evaluation shows that 101 (32%) out of 316 applications that use OAuth APIs make at least one security mistake.", "doi": "10.1109/ase.2019.00036", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00036", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00036"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00036"}
{"title": "History-Guided Configuration Diversification for Compiler Test-Program Generation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Junjie Chen", "Guancheng Wang", "Dan Hao", "Yingfei Xiong", "Hongyu Zhang", "Lu Zhang"], "abstract": "Compilers, like other software systems, contain bugs, and compiler testing is the most widely-used way to assure compiler quality. A critical task of compiler testing is to generate test programs that could effectively and efficiently discover bugs. Though we can configure test generators such as Csmith to control the features of the generated programs, it is not clear what test configuration is effective. In particular, an effective test configuration needs to generate test programs that are bug-revealing, i.e., likely to trigger bugs, and diverse, i.e., able to discover different types of bugs. It is not easy to satisfy both properties. In this paper, we propose a novel test-program generation approach, called HiCOND, which utilizes historical data for configuration diversification to solve this challenge. HiCOND first infers the range for each option in a test configuration where bug-revealing test programs are more likely to be generated based on historical data. Then, it identifies a set of test configurations that can lead to diverse test programs through a search method (particle swarm optimization). Finally, based on the set of test configurations for compiler testing, HiCOND generates test programs, which are likely to be bug-revealing and diverse. We have conducted experiments on two popular compilers GCC and LLVM, and the results confirm the effectiveness of our approach. For example, HiCOND detects 75.00%, 133.33%, and 145.00% more bugs than the three existing approaches, respectively. Moreover, HiCOND has been successfully applied to actual compiler testing in a global IT company and detected 11 bugs during the practical evaluation.", "doi": "10.1109/ase.2019.00037", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00037", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00037"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00037"}
{"title": "ReduKtor: How We Stopped Worrying About Bugs in Kotlin Compiler", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniil Stepanov", "Marat Akhin", "Mikhail A. Belyaev"], "abstract": "Bug localization is well-known to be a difficult problem in software engineering, and specifically in compiler development, where it is beneficial to reduce the input program to a minimal reproducing example; this technique is more commonly known as delta debugging. What additionally contributes to the problem is that every new programming language has its own unique quirks and foibles, making it near impossible to reuse existing tools and approaches with full efficiency. In this experience paper we tackle the delta debugging problem w.r.t. Kotlin, a relatively new programming language from JetBrains. Our approach is based on a novel combination of program slicing, hierarchical delta debugging and Kotlin-specific transformations, which are synergistic to each other. We implemented it in a prototype called ReduKtor and did extensive evaluation on both synthetic and real Kotlin programs; we also compared its performance with classic delta debugging techniques. The evaluation results support the practical usability of our approach to Kotlin delta debugging and also shows the importance of using both language-agnostic and language-specific techniques to achieve best reduction efficiency and performance.", "doi": "10.1109/ase.2019.00038", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00038", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00038"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00038"}
{"title": "Targeted Example Generation for Compilation Errors", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Umair Z. Ahmed", "Renuka Sindhgatta", "Nisheeth Srivastava", "Amey Karkare"], "abstract": "We present TEGCER, an automated feedback tool for novice programmers. TEGCER uses supervised classification to match compilation errors in new code submissions with relevant pre-existing errors, submitted by other students before. The dense neural network used to perform this classification task is trained on 15000+ error-repair code examples. The proposed model yields a test set classification Pred@3 accuracy of 97.7% across 212 error category labels. Using this model as its base, TEGCER presents students with the closest relevant examples of solutions for their specific error on demand. A large scale (N>230) usability study shows that students who use TEGCER are able to resolve errors more than 25% faster on average than students being assisted by human tutors.", "doi": "10.1109/ase.2019.00039", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00039", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00039"], "github": ["https://github.com/umairzahmed/tegcer"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00039"}
{"title": "Understanding Exception-Related Bugs in Large-Scale Cloud Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haicheng Chen", "Wensheng Dou", "Yanyan Jiang", "Feng Qin"], "abstract": "Exception mechanism is widely used in cloud systems. This is mainly because it separates the error handling code from main business logic. However, the huge space of potential error conditions and the sophisticated logic of cloud systems present a big hurdle to the correct use of exception mechanism. As a result, mistakes in the exception use may lead to severe consequences, such as system downtime and data loss. To address this issue, the communities direly need a better understanding of the exception-related bugs, i.e., eBugs, which are caused by the incorrect use of exception mechanism, in cloud systems. In this paper, we present a comprehensive study on 210 eBugs from six widely-deployed cloud systems, including Cassandra, HBase, HDFS, Hadoop MapReduce, YARN, and ZooKeeper. For all the studied eBugs, we analyze their triggering conditions, root causes, bug impacts, and their relations. To the best of our knowledge, this is the first study on eBugs in cloud systems, and the first one that focuses on triggering conditions. We find that eBugs are severe in cloud systems: 74% of our studied eBugs affect system availability or integrity. Luckily, exposing eBugs through testing is possible: 54% of the eBugs are triggered by non-semantic conditions, such as network errors; 40% of the eBugs can be triggered by simulating the triggering conditions at simple system states. Furthermore, we find that the triggering conditions are useful for detecting eBugs. Based on such relevant findings, we build a static analysis tool, called DIET, and apply it to the latest versions of the studied systems. Our results show that DIET reports 31 bugs and bad practices, and 23 of them are confirmed by the developers as \"previously-unknown\" ones.", "doi": "10.1109/ase.2019.00040", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00040", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00040"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00040"}
{"title": "iFeedback: Exploiting User Feedback for Real-Time Issue Detection in Large-Scale Online Service Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wujie Zheng", "Haochuan Lu", "Yangfan Zhou", "Jianming Liang", "Haibing Zheng", "Yuetang Deng"], "abstract": "Large-scale online systems are complex, fast-evolving, and hardly bug-free despite the testing efforts. Backend system monitoring cannot detect many types of issues, such as UI related bugs, bugs with small impact on backend system indicators, or errors from third-party co-operating systems, etc. However, users are good informers of such issues: They will provide their feedback for any types of issues. This experience paper discusses our design of iFeedback, a tool to perform real-time issue detection based on user feedback texts. Unlike traditional approaches that analyze user feedback with computation-intensive natural language processing algorithms, iFeedback is focusing on fast issue detection, which can serve as a system life-condition monitor. In particular, iFeedback extracts word combination-based indicators from feedback texts. This allows iFeedback to perform fast system anomaly detection with sophisticated machine learning algorithms. iFeedback then further summarizes the texts with an aim to effectively present the anomaly to the developers for root cause analysis. We present our representative experiences in successfully applying iFeedback in tens of large-scale production online service systems in ten months.", "doi": "10.1109/ase.2019.00041", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00041", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00041"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00041"}
{"title": "Continuous Incident Triage for Large-Scale Online Service Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Junjie Chen", "Xiaoting He", "Qingwei Lin", "Hongyu Zhang", "Dan Hao", "Feng Gao", "Zhangwei Xu", "Yingnong Dang", "Dongmei Zhang"], "abstract": "In recent years, online service systems have become increasingly popular. Incidents of these systems could cause significant economic loss and customer dissatisfaction. Incident triage, which is the process of assigning a new incident to the responsible team, is vitally important for quick recovery of the affected service. Our industry experience shows that in practice, incident triage is not conducted only once in the beginning, but is a continuous process, in which engineers from different teams have to discuss intensively among themselves about an incident, and continuously refine the incident-triage result until the correct assignment is reached. In particular, our empirical study on 8 real online service systems shows that the percentage of incidents that were reassigned ranges from 5.43% to 68.26% and the number of discussion items before achieving the correct assignment is up to 11.32 on average. To improve the existing incident triage process, in this paper, we propose DeepCT, a Deep learning based approach to automated Continuous incident Triage. DeepCT incorporates a novel GRU-based (Gated Recurrent Unit) model with an attention-based mask strategy and a revised loss function, which can incrementally learn knowledge from discussions and update incident-triage results. Using DeepCT, the correct incident assignment can be achieved with fewer discussions. We conducted an extensive evaluation of DeepCT on 14 large-scale online service systems in Microsoft. The results show that DeepCT is able to achieve more accurate and efficient incident triage, e.g., the average accuracy identifying the responsible team precisely is 0.641~0.729 with the number of discussion items increasing from 1 to 5. Also, DeepCT statistically significantly outperforms the state-of-the-art bug triage approach.", "doi": "10.1109/ase.2019.00042", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00042", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00042"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00042"}
{"title": "Apricot: A Weight-Adaptation Approach to Fixing Deep Learning Models", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hao Zhang", "W. K. Chan"], "abstract": "A deep learning (DL) model is inherently imprecise. To address this problem, existing techniques retrain a DL model over a larger training dataset or with the help of fault injected models or using the insight of failing test cases in a DL model. In this paper, we present Apricot, a novel weight-adaptation approach to fixing DL models iteratively. Our key observation is that if the deep learning architecture of a DL model is trained over many different subsets of the original training dataset, the weights in the resultant reduced DL model (rDLM) can provide insights on the adjustment direction and magnitude of the weights in the original DL model to handle the test cases that the original DL model misclassifies. Apricot generates a set of such reduced DL models from the original DL model. In each iteration, for each failing test case experienced by the input DL model (iDLM), Apricot adjusts each weight of this iDLM toward the average weight of these rDLMs correctly classifying the test case and/or away from that of these rDLMs misclassifying the same test case, followed by training the weight-adjusted iDLM over the original training dataset to generate a new iDLM for the next iteration. The experiment using five state-of-the-art DL models shows that Apricot can increase the test accuracy of these models by 0.87%-1.55% with an average of 1.08%. The experiment also reveals the complementary nature of these rDLMs in Apricot.", "doi": "10.1109/ase.2019.00043", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00043", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00043"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00043"}
{"title": "Re-Factoring Based Program Repair Applied to Programming Assignments", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yang Hu", "Umair Z. Ahmed", "Sergey Mechtaev", "Ben Leong", "Abhik Roychoudhury"], "abstract": "Automated program repair has been used to provide feedback for incorrect student programming assignments, since program repair captures the code modification needed to make a given buggy program pass a given test-suite. Existing student feedback generation techniques are limited because they either require manual effort in the form of providing an error model, or require a large number of correct student submissions to learn from, or suffer from lack of scalability and accuracy. In this work, we propose a fully automated approach for generating student program repairs in real-time. This is achieved by first re-factoring all available correct solutions to semantically equivalent solutions. Given an incorrect program, we match the program with the closest matching refactored program based on its control flow structure. Subsequently, we infer the input-output specifications of the incorrect program's basic blocks from the executions of the correct program's aligned basic blocks. Finally, these specifications are used to modify the blocks of the incorrect program via search-based synthesis. Our dataset consists of almost 1,800 real-life incorrect Python program submissions from 361 students for an introductory programming course at a large public university. Our experimental results suggest that our method is more effective and efficient than recently proposed feedback generation approaches. About 30% of the patches produced by our tool Refactory are smaller than those produced by the state-of-art tool Clara, and can be produced given fewer correct solutions (often a single correct solution) and in a shorter time. We opine that our method is applicable not only to programming assignments, and could be seen as a general-purpose program repair method that can achieve good results with just a single correct reference solution.", "doi": "10.1109/ase.2019.00044", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00044", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00044"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00044"}
{"title": "InFix: Automatically Repairing Novice Program Inputs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Madeline Endres", "Georgios Sakkas", "Benjamin Cosman", "Ranjit Jhala", "Westley Weimer"], "abstract": "This paper presents InFix, a technique for automatically fixing erroneous program inputs for novice programmers. Unlike comparable existing approaches for automatic debugging and maintenance tasks, InFix repairs input data rather than source code, does not require test cases, and does not require special annotations. Instead, we take advantage of patterns commonly used by novice programmers to automatically create helpful, high quality input repairs. InFix iteratively applies error-message based templates and random mutations based on insights about the debugging behavior of novices. This paper presents an implementation of InFix for Python. We evaluate on 29,995 unique scenarios with input-related errors collected from four years of data from Python Tutor, a free online programming tutoring environment. Our results generalize and scale; compared to previous work, we consider an order of magnitude more unique programs. Overall, InFix is able to repair 94.5% of deterministic input errors. We also present the results of a human study with 97 participants. Surprisingly, this simple approach produces high quality repairs; humans judged the output of InFix to be equally helpful and within 4% of the quality of human-generated repairs.", "doi": "10.1109/ase.2019.00045", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00045", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00045"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00045"}
{"title": "Understanding Automatically-Generated Patches Through Symbolic Invariant Differences", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Padraic Cashin", "Carianne Martinez", "Westley Weimer", "Stephanie Forrest"], "abstract": "Developer trust is a major barrier to the deployment of automatically-generated patches. Understanding the effect of a patch is a key element of that trust. We find that differences in sets of formal invariants characterize patch differences and that implication-based distances in invariant space characterize patch similarities. When one patch is similar to another it often contains the same changes as well as additional behavior; this pattern is well-captured by logical implication. We can measure differences using a theorem prover to verify implications between invariants implied by separate programs. Although effective, theorem provers are computationally intensive; we find that string distance is an efficient heuristic for implication-based distance measurements. We propose to use distances between patches to construct a hierarchy highlighting patch similarities. We evaluated this approach on over 300 patches and found that it correctly categorizes programs into semantically similar clusters. Clustering programs reduces human effort by reducing the number of semantically distinct patches that must be considered by over 50%, thus reducing the time required to establish trust in automatically generated repairs.", "doi": "10.1109/ase.2019.00046", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00046", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00046"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00046"}
{"title": "Regexes are Hard: Decision-Making, Difficulties, and Risks in Programming Regular Expressions", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Louis G. Michael IV", "James Donohue", "James C. Davis", "Dongyoon Lee", "Francisco Servant"], "abstract": "Regular expressions (regexes) are a powerful mechanism for solving string-matching problems. They are supported by all modern programming languages, and have been estimated to appear in more than a third of Python and JavaScript projects. Yet existing studies have focused mostly on one aspect of regex programming: readability. We know little about how developers perceive and program regexes, nor the difficulties that they face. In this paper, we provide the first study of the regex development cycle, with a focus on (1) how developers make decisions throughout the process, (2) what difficulties they face, and (3) how aware they are about serious risks involved in programming regexes. We took a mixed-methods approach, surveying 279 professional developers from a diversity of backgrounds (including top tech firms) for a high-level perspective, and interviewing 17 developers to learn the details about the difficulties that they face and the solutions that they prefer. In brief, regexes are hard. Not only are they hard to read, our participants said that they are hard to search for, hard to validate, and hard to document. They are also hard to master: the majority of our studied developers were unaware of critical security risks that can occur when using regexes, and those who knew of the risks did not deal with them in effective manners. Our findings provide multiple implications for future work, including semantic regex search engines for regex reuse and improved input generators for regex validation.", "doi": "10.1109/ase.2019.00047", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00047", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00047"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00047"}
{"title": "Testing Regex Generalizability And Its Implications: A Large-Scale Many-Language Measurement Study", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["James C. Davis", "Daniel Moyer", "Ayaan M. Kazerouni", "Dongyoon Lee"], "abstract": "The regular expression (regex) practices of software engineers affect the maintainability, correctness, and security of their software applications. Empirical research has described characteristics like the distribution of regex feature usage, the structural complexity of regexes, and worst-case regex match behaviors. But researchers have not critically examined the methodology they follow to extract regexes, and findings to date are typically generalized from regexes written in only 1-2 programming languages. This is an incomplete foundation. Generalizing existing research depends on validating two hypotheses: (1) Various regex extraction methodologies yield similar results, and (2) Regex characteristics are similar across programming languages. To test these hypotheses, we defined eight regex metrics to capture the dimensions of regex representation, string language diversity, and worst-case match complexity. We report that the two competing regex extraction methodologies yield comparable corpuses, suggesting that simpler regex extraction techniques will still yield sound corpuses. But in comparing regexes across programming languages, we found significant differences in some characteristics by programming language. Our findings have bearing on future empirical methodology, as the programming language should be considered, and generalizability will not be assured. Our measurements on a corpus of 537,806 regexes can guide data-driven designs of a new generation of regex tools and regex engines.", "doi": "10.1109/ase.2019.00048", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00048", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00048"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00048"}
{"title": "Accurate String Constraints Solution Counting with Weighted Automata", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Elena Sherman", "Andrew Harris"], "abstract": "As an important extension of symbolic execution (SE), probabilistic symbolic execution (PSE) computes execution probabilities of program paths. Using this information, PSE can prioritize path exploration strategies. To calculate the probability of a path PSE relies on solution counting approaches for the path constraint. The correctness of a solution counting approach depends on the methodology used to count solutions and whether a path constraint maintains a one-to-one relation with program input values. This work focuses on the latter aspect of the solution counting correctness for string constraints. In general, maintaining a one-to-one relation is not always possible, especially in the presence of non-linear constraints. To deal with this issue, researchers that work on PSE for numerical domains either analyze programs with linear constraints, or develop novel techniques to handle solution counting of non-linear constraints. For the string domain, however, previous work on PSE mainly focuses on efficient and accurate solution counting for automata-based string models and has not investigated whether a one-to-one relationship between the strings encoded by automata and input string values is preserved. In this work we demonstrate that traditional automata-based string models fail to maintain one-to-one relations and propose to use the weighted automata model, which preserves the one-to-one relation between the path constraint it encodes and the input string values. We use this model to implement a string constraint solver and show its correctness on a set of non-trivial synthetic benchmarks. We also present an empirical evaluation of traditional and proposed automata solvers on real-world string constraints. The evaluations show that while being less efficient than traditional automata models, the weighted automata model maintains correct solution counts.", "doi": "10.1109/ase.2019.00049", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00049", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00049"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00049"}
{"title": "Subformula Caching for Model Counting and Quantitative Program Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["William Eiers", "Seemanta Saha", "Tegan Brennan", "Tevfik Bultan"], "abstract": "Quantitative program analysis is an emerging area with applications to software reliability, quantitative information flow, side-channel detection and attack synthesis. Most quantitative program analysis techniques rely on model counting constraint solvers, which are typically the bottleneck for scalability. Although the effectiveness of formula caching in expediting expensive model-counting queries has been demonstrated in prior work, our key insight is that many subformulas are shared across non-identical constraints generated during program analyses. This has not been utilized by prior formula caching approaches. In this paper we present a subformula caching framework and integrate it into a model counting constraint solver. We experimentally evaluate its effectiveness under three quantitative program analysis scenarios: 1) model counting constraints generated by symbolic execution, 2) reliability analysis using probabilistic symbolic execution, 3) adaptive attack synthesis for side-channels. Our experimental results demonstrate that our subformula caching approach significantly improves the performance of quantitative program analysis.", "doi": "10.1109/ase.2019.00050", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00050", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00050"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00050"}
{"title": "ACTGAN: Automatic Configuration Tuning for Software Systems with Generative Adversarial Networks", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Liang Bao", "Xin Liu", "Fangzheng Wang", "Baoyin Fang"], "abstract": "Complex software systems often provide a large number of parameters so that users can configure them for their specific application scenarios. However, configuration tuning requires a deep understanding of the software system, far beyond the abilities of typical system users. To address this issue, many existing approaches focus on exploring and learning good performance estimation models. The accuracy of such models often suffers when the number of available samples is small, a thorny challenge under a given tuning-time constraint. By contrast, we hypothesize that good configurations often share certain hidden structures. Therefore, instead of trying to improve the performance estimation of a given configuration, we focus on capturing the hidden structures of good configurations and utilizing such learned structure to generate potentially better configurations. We propose ACTGAN to achieve this goal. We have implemented and evaluated ACTGAN using 17 workloads with eight different software systems. Experimental results show that ACTGAN outperforms default configurations by 76.22% on average, and six state-of-the-art configuration tuning algorithms by 6.58%-64.56%. Furthermore, the ACTGAN-generated configurations are often better than those used in training and show certain features consisting with domain knowledge, both of which supports our hypothesis.", "doi": "10.1109/ase.2019.00051", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00051", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00051"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00051"}
{"title": "V2: Fast Detection of Configuration Drift in Python", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eric Horton", "Chris Parnin"], "abstract": "Code snippets are prevalent, but are hard to reuse because they often lack an accompanying environment configuration. Most are not actively maintained, allowing for drift between the most recent possible configuration and the code snippet as the snippet becomes out-of-date over time. Recent work has identified the problem of validating and detecting out-of-date code snippets as the most important consideration for code reuse. However, determining if a snippet is correct, but simply out-of-date, is a non-trivial task. In the best case, breaking changes are well documented, allowing developers to manually determine when a code snippet contains an out-of-date API usage. In the worst case, determining if and when a breaking change was made requires an exhaustive search through previous dependency versions. We present V2, a strategy for determining if a code snippet is out-of-date by detecting discrete instances of configuration drift, where the snippet uses an API which has since undergone a breaking change. Each instance of configuration drift is classified by a failure encountered during validation and a configuration patch, consisting of dependency version changes, which fixes the underlying fault. V2 uses feedback-directed search to explore the possible configuration space for a code snippet, reducing the number of potential environment configurations that need to be validated. When run on a corpus of public Python snippets from prior research, V2 identifies 248 instances of configuration drift.", "doi": "10.1109/ase.2019.00052", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00052", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00052"], "github": ["https://github.com/v2-project/v2"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00052"}
{"title": "Feature-Interaction Aware Configuration Prioritization for Configurable Code", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Son Nguyen", "Hoan Nguyen", "Ngoc M. Tran", "Hieu Tran", "Tien N. Nguyen"], "abstract": "Unexpected interactions among features induce most bugs in a configurable software system. Exhaustively analyzing all the exponential number of possible configurations is prohibitively costly. Thus, various sampling techniques have been proposed to systematically narrow down the exponential number of legal configurations to be analyzed. Since analyzing all selected configurations can require a huge amount of effort, fault-based configuration prioritization, that helps detect faults earlier, can yield practical benefits in quality assurance. In this paper, we propose CoPro, a novel formulation of feature-interaction bugs via common program entities enabled/disabled by the features. Leveraging from that, we develop an efficient feature-interaction-aware configuration prioritization technique for a configurable system by ranking the configurations according to their total number of potential bugs. We conducted several experiments to evaluate CoPro on the ability to detect configuration-related bugs in a public benchmark. We found that CoPro outperforms the state-of-the-art configuration prioritization techniques when we add them on advanced sampling algorithms. In 78% of the cases, CoPro ranks the buggy configurations at the top 3 positions in the resulting list. Interestingly, CoPro is able to detect 17 not-yet-discovered feature-interaction bugs.", "doi": "10.1109/ase.2019.00053", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00053", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00053"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00053"}
{"title": "Combining Spectrum-Based Fault Localization and Statistical Debugging: An Empirical Study", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiajun Jiang", "Ran Wang", "Yingfei Xiong", "Xiangping Chen", "Lu Zhang"], "abstract": "Program debugging is a time-consuming task, and researchers have proposed different kinds of automatic fault localization techniques to mitigate the burden of manual debugging. Among these techniques, two popular families are spectrum-based fault localization (SBFL) and statistical debugging (SD), both localizing faults by collecting statistical information at runtime. Though the ideas are similar, the two families have been developed independently and their combinations have not been systematically explored. In this paper we perform a systematical empirical study on the combination of SBFL and SD. We first build a unified model of the two techniques, and systematically explore four types of variations, different predicates, different risk evaluation formulas, different granularities of data collection, and different methods of combining suspicious scores. Our study leads to several findings. First, most of the effectiveness of the combined approach contributed by a simple type of predicates: branch conditions. Second, the risk evaluation formulas of SBFL significantly outperform that of SD. Third, fine-grained data collection significantly outperforms coarse-grained data collection with a little extra execution overhead. Fourth, a linear combination of SBFL and SD predicates outperforms both individual approaches. According to our empirical study, we propose a new fault localization approach, PREDFL (Predicate-based Fault Localization), with the best configuration for each dimension under the unified model. Then, we explore its complementarity to existing techniques by integrating PREDFL with a state-of-the-art fault localization framework. The experimental results show that PREDFL can further improve the effectiveness of state-of-the-art fault localization techniques. More concretely, integrating PREDFL results in an up to 20.8% improvement w.r.t the faults successfully located at Top-1, which reveals that PREDFL complements existing techniques.", "doi": "10.1109/ase.2019.00054", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00054", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00054"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00054"}
{"title": "SCMiner: Localizing System-Level Concurrency Faults from Large System Call Traces", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tarannum Shaila Zaman", "Xue Han", "Tingting Yu"], "abstract": "Localizing concurrency faults that occur in production is hard because, (1) detailed field data, such as user input, file content and interleaving schedule, may not be available to developers to reproduce the failure; (2) it is often impractical to assume the availability of multiple failing executions to localize the faults using existing techniques; (3) it is challenging to search for buggy locations in an application given limited runtime data; and, (4) concurrency failures at the system level often involve multiple processes or event handlers (e.g., software signals), which can not be handled by existing tools for diagnosing intra-process(thread-level) failures. To address these problems, we present SCMiner, a practical online bug diagnosis tool to help developers understand how a system-level concurrency fault happens based on the logs collected by the default system audit tools. SCMiner achieves online bug diagnosis to obviate the need for offline bug reproduction. SCMiner does not require code instrumentation on the production system or rely on the assumption of the availability of multiple failing executions. Specifically, after the system call traces are collected, SCMiner uses data mining and statistical anomaly detection techniques to identify the failure-inducing system call sequences. It then maps each abnormal sequence to specific application functions. We have conducted an empirical study on 19 real-world benchmarks. The results show that SCMiner is both effective and efficient at localizing system-level concurrency faults.", "doi": "10.1109/ase.2019.00055", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00055", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00055"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00055"}
{"title": "Root Cause Localization for Unreproducible Builds via Causality Analysis Over System Call Tracing", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhilei Ren", "Changlin Liu", "Xusheng Xiao", "He Jiang", "Tao Xie"], "abstract": "Localization of the root causes for unreproducible builds during software maintenance is an important yet challenging task, primarily due to limited runtime traces from build processes and high diversity of build environments. To address these challenges, in this paper, we propose RepTrace, a framework that leverages the uniform interfaces of system call tracing for monitoring executed build commands in diverse build environments and identifies the root causes for unreproducible builds by analyzing the system call traces of the executed build commands. Specifically, from the collected system call traces, RepTrace performs causality analysis to build a dependency graph starting from an inconsistent build artifact (across two builds) via two types of dependencies: read/write dependencies among processes and parent/child process dependencies, and searches the graph to find the processes that result in the inconsistencies. To address the challenges of massive noisy dependencies and uncertain parent/child dependencies, RepTrace includes two novel techniques: (1) using differential analysis on multiple builds to reduce the search space of read/write dependencies, and (2) computing similarity of the runtime values to filter out noisy parent/child process dependencies. The evaluation results of RepTrace over a set of real-world software packages show that RepTrace effectively finds not only the root cause commands responsible for the unreproducible builds, but also the files to patch for addressing the unreproducible issues. Among its Top-10 identified commands and files, RepTrace achieves high accuracy rate of 90.00% and 90.56% in identifying the root causes, respectively.", "doi": "10.1109/ase.2019.00056", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00056", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00056"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00056"}
{"title": "Mutation Analysis for Coq", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ahmet Çelik", "Karl Palmskog", "Marinela Parovic", "Emilio Jesús Gallego Arias", "Milos Gligoric"], "abstract": "Mutation analysis, which introduces artificial defects into software systems, is the basis of mutation testing, a technique widely applied to evaluate and enhance the quality of test suites. However, despite the deep analogy between tests and formal proofs, mutation analysis has seldom been considered in the context of deductive verification. We propose mutation proving, a technique for analyzing verification projects that use proof assistants. We implemented our technique for the Coq proof assistant in a tool dubbed mCoq. mCoq applies a set of mutation operators to Coq definitions of functions and datatypes, inspired by operators previously proposed for functional programming languages. mCoq then checks proofs of lemmas affected by operator application. To make our technique feasible in practice, we implemented several optimizations in mCoq such as parallel proof checking. We applied mCoq to several medium and large scale Coq projects, and recorded whether proofs passed or failed when applying different mutation operators. We then qualitatively analyzed the mutants, finding many instances of incomplete specifications. For our evaluation, we made several improvements to serialization of Coq files and even discovered a notable bug in Coq itself, all acknowledged by developers. We believe mCoq can be useful both to proof engineers for improving the quality of their verification projects and to researchers for evaluating proof engineering techniques.", "doi": "10.1109/ase.2019.00057", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00057", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00057"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00057"}
{"title": "Verifying Arithmetic in Cryptographic C Programs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiaxiang Liu", "Xiaomu Shi", "Ming-Hsien Tsai", "Bow-Yaw Wang", "Bo-Yin Yang"], "abstract": "Cryptographic primitives are ubiquitous for modern security. The correctness of their implementations is crucial to resist malicious attacks. Typical arithmetic computation of these C programs contains large numbers of non-linear operations, hence is challenging existing automatic C verification tools. We present an automated approach to verify cryptographic C programs. Our approach successfully verifies C implementations of various arithmetic operations used in NIST P-224, P-256, P-521 and Curve25519 in OpenSSL. During verification, we expose a bug and a few anomalies that have been existing for a long time. They have been reported to and confirmed by the OpenSSL community. Our results establish the functional correctness of these C implementations for the first time.", "doi": "10.1109/ase.2019.00058", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00058", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00058"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00058"}
{"title": "Model Checking Embedded Control Software using OS-in-the-Loop CEGAR", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dongwoo Kim", "Yunja Choi"], "abstract": "Verification of multitasking embedded software requires taking into account its underlying operating system w.r.t. its scheduling policy and handling of task priorities in order to achieve a higher degree of accuracy. However, such comprehensive verification of multitasking embedded software together with its underlying operating system is very costly and impractical. To reduce the verification cost while achieving the desired accuracy, we propose a variant of CEGAR, named OiL-CEGAR (OS-in-the-Loop Counterexample-Guided Abstraction Refinement), where a composition of a formal OS model and an abstracted application program is used for comprehensive verification and is successively refined using the counterexamples generated from the composition model. The refinement process utilizes the scheduling information in the counterexample, which acts as a mini-OS to check the executability of the counterexample trace on the concrete program. Our experiments using a prototype implementation of OiL-CEGAR show that OiL-CEGAR greatly improves the accuracy and efficiency of property checking in this domain. It automatically removed all false alarms and accomplished property checking within an average of 476 seconds over a set of multitasking programs, whereas model checking using existing approaches over the same set of programs either showed an accuracy of under 11.1% or was unable to finish the verification due to timeout.", "doi": "10.1109/ase.2019.00059", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00059", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00059"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00059"}
{"title": "Get Rid of Inline Assembly through Verification-Oriented Lifting", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Frédéric Recoules", "Sébastien Bardin", "Richard Bonichon", "Laurent Mounier", "Marie-Laure Potet"], "abstract": "Formal methods for software development have made great strides in the last two decades, to the point that their application in safety-critical embedded software is an undeniable success. Their extension to non-critical software is one of the notable forthcoming challenges. For example, C programmers regularly use inline assembly for low-level optimizations and system primitives. This usually results in rendering state-of-the-art formal analyzers developed for C ineffective. We thus propose TINA, the first automated, generic, verification-friendly and trustworthy lifting technique turning inline assembly into semantically equivalent C code amenable to verification, in order to take advantage of existing C analyzers. Extensive experiments on real-world code (including GMP and ffmpeg) show the feasibility and benefits of TINA.", "doi": "10.1109/ase.2019.00060", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00060", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00060"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00060"}
{"title": "CodeKernel: A Graph Kernel Based Approach to the Selection of API Usage Examples", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaodong Gu", "Hongyu Zhang", "Sunghun Kim"], "abstract": "Developers often want to find out how to use a certain API (e.g., FileReader.read in JDK library). API usage examples are very helpful in this regard. Over the years, many automated methods have been proposed to generate code examples by clustering and summarizing relevant code snippets extracted from a code corpus. These approaches simplify source code as method invocation sequences or feature vectors. Such simplifications only model partial aspects of the code and tend to yield inaccurate examples. We propose CodeKernel, a graph kernel based approach to the selection of API usage examples. Instead of approximating source code as method invocation sequences or feature vectors, CodeKernel represents source code as object usage graphs. Then, it clusters graphs by embedding them into a continuous space using a graph kernel. Finally, it outputs code examples by selecting a representative graph from each cluster using designed ranking metrics. Our empirical evaluation shows that CodeKernel selects more accurate code examples than the related work (MUSE and eXoaDocs). A user study involving 25 developers in a multinational company also confirms the usefulness of CodeKernel in selecting API usage examples.", "doi": "10.1109/ase.2019.00061", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00061", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00061"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00061"}
{"title": "Machine Learning Based Recommendation of Method Names: How Far are We", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lin Jiang", "Hui Liu", "He Jiang"], "abstract": "High quality method names are critical for the readability and maintainability of programs. However, constructing concise and consistent method names is often challenging, especially for inexperienced developers. To this end, advanced machine learning techniques have been recently leveraged to recommend method names automatically for given method bodies/implementation. Recent large-scale evaluations also suggest that such approaches are accurate. However, little is known about where and why such approaches work or don't work. To figure out the state of the art as well as the rationale for the success/failure, in this paper we conduct an empirical study on the state-of-the-art approach code2vec. We assess code2vec on a new dataset with more realistic settings. Our evaluation results suggest that although switching to new dataset does not significantly influence the performance, more realistic settings do significantly reduce the performance of code2vec. Further analysis on the successfully recommended method names also reveals the following findings: 1) around half (48.3%) of the accepted recommendations are made on getter/setter methods; 2) a large portion (19.2%) of the successfully recommended method names could be copied from the given bodies. To further validate its usefulness, we ask developers to manually score the difficulty in naming methods they developed. Code2vec is then applied to such manually scored methods to evaluate how often it works in need. Our evaluation results suggest that code2vec rarely works when it is really needed. Finally, to intuitively reveal the state of the art and to investigate the possibility of designing simple and straightforward alternative approaches, we propose a heuristics based approach to recommending method names. Evaluation results on large-scale dataset suggest that this simple heuristics-based approach significantly outperforms the state-of-the-art machine learning based approach, improving precision and recall by 65.25% and 22.45%, respectively. The comparison suggests that machine learning based recommendation of method names may still have a long way to go.", "doi": "10.1109/ase.2019.00062", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00062", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00062"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00062"}
{"title": "MARBLE: Mining for Boilerplate Code to Identify API Usability Problems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daye Nam", "Amber Horvath", "Andrew Macvean", "Brad A. Myers", "Bogdan Vasilescu"], "abstract": "Designing usable APIs is critical to developers' productivity and software quality, but is quite difficult. One of the challenges is that anticipating API usability barriers and real-world usage is difficult, due to a lack of automated approaches to mine usability data at scale. In this paper, we focus on one particular grievance that developers repeatedly express in online discussions about APIs: \"boilerplate code.\" We investigate what properties make code count as boilerplate, the reasons for boilerplate, and how programmers can reduce the need for it. We then present MARBLE, a novel approach to automatically mine boilerplate code candidates from API client code repositories. MARBLE adapts existing techniques, including an API usage mining algorithm, an AST comparison algorithm, and a graph partitioning algorithm. We evaluate MARBLE with 13 Java APIs, and show that our approach successfully identifies both already-known and new API-related boilerplate code instances.", "doi": "10.1109/ase.2019.00063", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00063", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00063"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00063"}
{"title": "DIRE: A Neural Approach to Decompiled Identifier Naming", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jeremy Lacomis", "Pengcheng Yin", "Edward J. Schwartz", "Miltiadis Allamanis", "Claire Le Goues", "Graham Neubig", "Bogdan Vasilescu"], "abstract": "The decompiler is one of the most common tools for examining binaries without corresponding source code. It transforms binaries into high-level code, reversing the compilation process. Decompilers can reconstruct much of the information that is lost during the compilation process (e.g., structure and type information). Unfortunately, they do not reconstruct semantically meaningful variable names, which are known to increase code understandability. We propose the Decompiled Identifier Renaming Engine (DIRE), a novel probabilistic technique for variable name recovery that uses both lexical and structural information recovered by the decompiler. We also present a technique for generating corpora suitable for training and evaluating models of decompiled code renaming, which we use to create a corpus of 164,632 unique x86-64 binaries generated from C projects mined from GitHub. Our results show that on this corpus DIRE can predict variable names identical to the names in the original source code up to 74.3% of the time.", "doi": "10.1109/ase.2019.00064", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00064", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00064"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00064"}
{"title": "Accurate Modeling of Performance Histories for Evolving Software Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stefan Mühlbauer", "Sven Apel", "Norbert Siegmund"], "abstract": "Learning from the history of a software system's performance behavior does not only help discovering and locating performance bugs, but also identifying evolutionary performance patterns and general trends, such as when technical debt accumulates. Exhaustive regression testing is usually impractical, because rigorous performance benchmarking requires executing a realistic workload per revision, which results in large execution times. In this paper, we propose a novel active revision sampling approach, which aims at tracking and understanding a system's performance history by approximating the performance behavior of a software system across all of its revisions. In a nutshell, we iteratively sample and measure the performance of specific revisions that help us building an exact performance-evolution model, and we use Gaussian Process models to assess in which revision ranges our model is most uncertain with the goal to sample further revisions for measurement. We have conducted an empirical analysis of the evolutionary performance behavior modeled as a time series of the histories of six real-world software systems. Our evaluation demonstrates that Gaussian Process models are able to accurately estimate the performance-evolution history of real-world software systems with only few measurements and to reveal interesting behaviors and trends.", "doi": "10.1109/ase.2019.00065", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00065", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00065"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00065"}
{"title": "An Industrial Experience Report on Performance-Aware Refactoring on a Database-Centric Web Application", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Boyuan Chen", "Zhen Ming Jiang", "Paul Matos", "Michael Lacaria"], "abstract": "Modern web applications rely heavily on databases to query and update information. To ease the development efforts, Object Relational Mapping (ORM) frameworks provide an abstraction for developers to manage databases by writing in the same Object-Oriented programming languages. Prior studies have shown that there are various types of performance issues caused by inefficient accesses to databases via different ORM frameworks (e.g., Hibernate and ActiveRecord). However, it is not clear whether the reported performance anti-patterns (common performance issues) can be generalizable across various frameworks. In particular, there is no study focusing on detecting performance issues for applications written in PHP, which is the choice of programming languages for the majority (79%) of web applications. In this experience paper, we detail our process on conducting performance-aware refactoring of an industrial web application written in Laravel, the most popular web framework in PHP. We have derived a complete catalog of 17 performance anti-patterns based on prior research and our experimentation. We have found that some of the reported anti-patterns and refactoring techniques are framework or programming language specific, whereas others are general. The performance impact of the anti-pattern instances are highly dependent on the actual usage context (workload and database settings). When communicating the performance differences before and after refactoring, the results of the complex statistical analysis may be sometimes confusing. Instead, developers usually prefer more intuitive measures like percentage improvement. Experiments show that our refactoring techniques can reduce the response time up to 93.0% and 93.4% for the industrial and the open source application under various scenarios.", "doi": "10.1109/ase.2019.00066", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00066", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00066"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00066"}
{"title": "How Do API Selections Affect the Runtime Performance of Data Analytics Tasks?", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yida Tao", "Shan Tang", "Yepang Liu", "Zhiwu Xu", "Shengchao Qin"], "abstract": "As data volume and complexity grow at an unprecedented rate, the performance of data analytics programs is becoming a major concern for developers. We observed that developers sometimes use alternative data analytics APIs to improve program runtime performance while preserving functional equivalence. However, little is known on the characteristics and performance attributes of alternative data analytics APIs. In this paper, we propose a novel approach to extracting alternative implementations that invoke different data analytics APIs to solve the same tasks. A key appeal of our approach is that it exploits the comparative structures in Stack Overflow discussions to discover programming alternatives. We show that our approach is promising, as 86% of the extracted code pairs were validated as true alternative implementations. In over 20% of these pairs, the faster implementation was reported to achieve a 10x or more speedup over its slower alternative. We hope that our study offers a new perspective of API recommendation and motivates future research on optimizing data analytics programs.", "doi": "10.1109/ase.2019.00067", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00067", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00067"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00067"}
{"title": "An Experience Report of Generating Load Tests Using Log-Recovered Workloads at Varying Granularities of User Behaviour", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jinfu Chen", "Weiyi Shang", "Ahmed E. Hassan", "Yong Wang", "Jiangbin Lin"], "abstract": "Designing field-representative load tests is an essential step for the quality assurance of large-scale systems. Practitioners may capture user behaviour at different levels of granularity. A coarse-grained load test may miss detailed user behaviour, leading to a non-representative load test; while an extremely fine-grained load test would simply replay user actions step by step, leading to load tests that are costly to develop, execute and maintain. Workload recovery is at core of these load tests. Prior research often captures the workload as the frequency of user actions. However, there exists much valuable information in the context and sequences of user actions. Such richer information would ensure that the load tests that leverage such workloads are more field-representative. In this experience paper, we study the use of different granularities of user behaviour, i.e., basic user actions, basic user actions with contextual information and user action sequences with contextual information, when recovering workloads for use in the load testing of large-scale systems. We propose three approaches that are based on the three granularities of user behaviour and evaluate our approaches on four subject systems, namely Apache James, OpenMRS, Google Borg, and an ultra-large-scale industrial system (SA) from Alibaba. Our results show that our approach that is based on user action sequences with contextual information outperforms the other two approaches and can generate more representative load tests with similar throughput and CPU usage to the original field workload (i.e., mostly statistically insignificant or with small/trivial effect sizes). Such representative load tests are generated only based on a small number of clusters of users, leading to a low cost of conducting/maintaining such tests. Finally, we demonstrate that our approaches can detect injected users in the original field workloads with high precision and recall. Our paper demonstrates the importance of user action sequences with contextual information in the workload recovery of large-scale systems.", "doi": "10.1109/ase.2019.00068", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00068", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00068"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00068"}
{"title": "Demystifying Application Performance Management Libraries for Android", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yutian Tang", "Xian Zhan", "Hao Zhou", "Xiapu Luo", "Zhou Xu", "Yajin Zhou", "Qiben Yan"], "abstract": "Since the performance issues of apps can influence users' experience, developers leverage application performance management (APM) tools to locate the potential performance bottleneck of their apps. Unfortunately, most developers do not understand how APMs monitor their apps during the runtime and whether these APMs have any limitations. In this paper, we demystify APMs by inspecting 25 widely-used APMs that target on Android apps. We first report how these APMs implement 8 key functions as well as their limitations. Then, we conduct a large-scale empirical study on 500,000 Android apps from Google Play to explore the usage of APMs. This study has some interesting observations about existing APMs for Android, including 1) some APMs still use deprecated permissions and approaches so that they may not always work properly; 2) some app developers use APMs to collect users' privacy information.", "doi": "10.1109/ase.2019.00069", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00069", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00069"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00069"}
{"title": "Predicting Licenses for Changed Source Code", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaoyu Liu", "LiGuo Huang", "Jidong Ge", "Vincent Ng"], "abstract": "Open source software licenses regulate the circumstances under which software can be redistributed, reused and modified. Ensuring license compatibility and preventing license restriction conflicts among source code during software changes are the key to protect their commercial use. However, selecting the appropriate licenses for software changes requires lots of experience and manual effort that involve examining, assimilating and comparing various licenses as well as understanding their relationships with software changes. Worse still, there is no state-of-the-art methodology to provide this capability. Motivated by this observation, we propose in this paper Automatic License Prediction (ALP), a novel learning-based method and tool for predicting licenses as software changes. An extensive evaluation of ALP on predicting licenses in 700 open source projects demonstrate its effectiveness: ALP can achieve not only a high overall prediction accuracy (92.5% in micro F1 score) but also high accuracies across all license types.", "doi": "10.1109/ase.2019.00070", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00070", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00070"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00070"}
{"title": "Empirical Evaluation of the Impact of Class Overlap on Software Defect Prediction", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lina Gong", "Shujuan Jiang", "Rongcun Wang", "Li Jiang"], "abstract": "Software defect prediction (SDP) utilizes the learning models to detect the defective modules in project, and their performance depends on the quality of training data. The previous researches mainly focus on the quality problems of class imbalance and feature redundancy. However, training data often contains some instances that belong to different class but have similar values on features, and this leads to class overlap to affect the quality of training data. Our goal is to investigate the impact of class overlap on software defect prediction. At the same time, we propose an improved K-Means clustering cleaning approach (IKMCCA) to solve both the class overlap and class imbalance problems. Specifically, we check whether K-Means clustering cleaning approach (KMCCA) or neighborhood cleaning learning (NCL) or IKMCCA is feasible to improve defect detection performance for two cases (i) within-project defect prediction (WPDP) (ii) cross-project defect prediction (CPDP). To have an objective estimate of class overlap, we carry out our investigations on 28 open source projects, and compare the performance of state-of-the-art learning models for the above-mentioned cases by using IKMCCA or KMCCA or NCL VS. without cleaning data. The experimental results make clear that learning models obtain significantly better performance in terms of balance, Recall and AUC for both WPDP and CPDP when the overlapping instances are removed. Moreover, it is better to consider both class overlap and class imbalance.", "doi": "10.1109/ase.2019.00071", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00071", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00071"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00071"}
{"title": "Combining Program Analysis and Statistical Language Model for Code Statement Completion", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Son Van Nguyen", "Tien N. Nguyen", "Yi Li", "Shaohua Wang"], "abstract": "Automatic code completion helps improve developers' productivity in their programming tasks. A program contains instructions expressed via code statements, which are considered as the basic units of program execution. In this paper, we introduce AutoSC, which combines program analysis and the principle of software naturalness to fill in a partially completed statement. AutoSC benefits from the strengths of both directions, in which the completed code statement is both frequent and valid. AutoSC is first trained on a large code corpus to derive the templates of candidate statements. Then, it uses program analysis to validate and concretize the templates into syntactically and type-valid candidate statements. Finally, these candidates are ranked by using a language model trained on the lexical form of the source code in the code corpus. Our empirical evaluation on the large datasets of real-world projects shows that AutoSC achieves 38.9-41.3% top-1 accuracy and 48.2-50.1% top-5 accuracy in statement completion. It also outperforms a state-of-the-art approach from 9X-69X in top-1 accuracy.", "doi": "10.1109/ase.2019.00072", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00072", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00072"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00072"}
{"title": "MAP-Coverage: A Novel Coverage Criterion for Testing Thread-Safe Classes", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zan Wang", "Yingquan Zhao", "Shuang Liu", "Jun Sun", "Xiang Chen", "Huarui Lin"], "abstract": "Concurrent programs must be thoroughly tested, as concurrency bugs are notoriously hard to detect. Code coverage criteria can be used to quantify the richness of a test suite (e.g., whether a program has been tested sufficiently) or provide practical guidelines on test case generation (e.g., as objective functions used in program fuzzing engines). Traditional code coverage criteria are, however, designed for sequential programs and thus ineffective for concurrent programs. In this work, we introduce a novel code coverage criterion for testing thread-safe classes called MAP-coverage (short for memory-access patterns). The motivation is that concurrency bugs are often correlated with certain memory-access patterns, and thus it is desirable to comprehensively cover all memory-access patterns. Furthermore, we propose a testing method for maximizing MAP-coverage. Our method has been implemented as a self-contained toolkit, and the experimental results on 20 benchmark programs show that our toolkit outperforms existing testing methods. Lastly, we show empirically that there exists positive correlation between MAP-coverage and the effectiveness of a set of test executions.", "doi": "10.1109/ase.2019.00073", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00073", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00073"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00073"}
{"title": "Automating Non-Blocking Synchronization In Concurrent Data Abstractions", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiange Zhang", "Qing Yi", "Damian Dechev"], "abstract": "This paper investigates using compiler technology to automatically convert sequential C++ data abstractions, e.g., queues, stacks, maps, and trees, to concurrent lock-free implementations. By automatically tailoring a number of state-of-the-practice synchronization methods to the underlying sequential implementations of different data structures, our automatically synchronized code can attain performance competitive to that of manually-written concurrent data structures by experts and much better performance than heavier-weight support by software transactional memory (STM).", "doi": "10.1109/ase.2019.00074", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00074", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00074"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00074"}
{"title": "Automating CUDA Synchronization via Program Transformation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mingyuan Wu", "Lingming Zhang", "Cong Liu", "Shin Hwei Tan", "Yuqun Zhang"], "abstract": "While CUDA has been the most popular parallel computing platform and programming model for general purpose GPU computing, CUDA synchronization undergoes significant challenges for GPU programmers due to its intricate parallel computing mechanism and coding practices. In this paper, we propose AuCS, the first general framework to automate synchronization for CUDA kernel functions. AuCS transforms the original LLVM-level CUDA program control flow graph in a semantic-preserving manner for exploring the possible barrier function locations. Accordingly, AuCS develops mechanisms to correctly place barrier functions for automating synchronization in multiple erroneous (challenging-to-be-detected) synchronization scenarios, including data race, barrier divergence, and redundant barrier functions. To evaluate the effectiveness and efficiency of AuCS, we conduct an extensive set of experiments and the results demonstrate that AuCS can automate 20 out of 24 erroneous synchronization scenarios.", "doi": "10.1109/ase.2019.00075", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00075", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00075"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00075"}
{"title": "Efficient Transaction-Based Deterministic Replay for Multi-threaded Programs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ernest Bota Pobee", "Xiupei Mei", "Wing Kwong Chan"], "abstract": "Existing deterministic replay techniques propose strategies which attempt to reduce record log sizes and achieve successful replay. However, these techniques still generate large logs and achieve replay only under certain conditions. We propose a solution based on the division of the sequence of events of each thread into sequential blocks called transactions. Our insight is that there are usually few to no atomicity violations among transactions reported during a program execution. We present TPLAY, a novel deterministic replay technique which records thread access interleavings on shared memory locations at the transactional level. TPLAY also generates an artificial pair of interleavings when an atomicity violation is reported on a transaction. We present an experiment using the Splash2x extension of the PARSEC benchmark suite. Experimental results indicate that TPLAY experiences a 13-fold improvement in record log sizes and achieves a higher replay probability in comparison to existing work.", "doi": "10.1109/ase.2019.00076", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00076", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00076"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00076"}
{"title": "Wuji: Automatic Online Combat Game Testing Using Evolutionary Deep Reinforcement Learning", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yan Zheng", "Changjie Fan", "Xiaofei Xie", "Ting Su", "Lei Ma", "Jianye Hao", "Zhaopeng Meng", "Yang Liu", "Ruimin Shen", "Yingfeng Chen"], "abstract": "Game testing has been long recognized as a notoriously challenging task, which mainly relies on manual playing and scripting based testing in game industry. Even until recently, automated game testing still remains to be largely untouched niche. A key challenge is that game testing often requires to play the game as a sequential decision process. A bug may only be triggered until completing certain difficult intermediate tasks, which requires a certain level of intelligence. The recent success of deep reinforcement learning (DRL) sheds light on advancing automated game testing, without human competitive intelligent support. However, the existing DRLs mostly focus on winning the game rather than game testing. To bridge the gap, in this paper, we first perform an in-depth analysis of 1349 real bugs from four real-world commercial game products. Based on this, we propose four oracles to support automated game testing, and further propose Wuji, an on-the-fly game testing framework, which leverages evolutionary algorithms, DRL and multi-objective optimization to perform automatic game testing. Wuji balances between winning the game and exploring the space of the game. Winning the game allows the agent to make progress in the game, while space exploration increases the possibility of discovering bugs. We conduct a large-scale evaluation on a simple game and two popular commercial games. The results demonstrate the effectiveness of Wuji in exploring space and detecting bugs. Moreover, Wuji found 3 previously unknown bugs, which have been confirmed by the developers, in the commercial games.", "doi": "10.1109/ase.2019.00077", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00077", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00077"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00077"}
{"title": "A Study of Oracle Approximations in Testing Deep Learning Libraries", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mahdi Nejadgholi", "Jinqiu Yang"], "abstract": "Due to the increasing popularity of deep learning (DL) applications, testing DL libraries is becoming more and more important. Different from testing general software, for which output is often asserted definitely (e.g., an output is compared with an oracle for equality), testing deep learning libraries often requires to perform oracle approximations, i.e., the output is allowed to be within a restricted range of the oracle. However, oracle approximation practices have not been studied in prior empirical work that focuses on traditional testing practices. The prevalence, common practices, maintenance and evolution challenges of oracle approximations remain unknown in literature. In this work, we study oracle approximation assertions implemented to test four popular DL libraries. Our study shows that there exists a non-negligible portion of assertions that leverage oracle approximation in the test cases of DL libraries. Also, we identify the common sources of oracles on which oracle approximations are being performed through a comprehensive manual study. Moreover, we find that developers frequently modify code related to oracle approximations, i.e., using a different approximation API, modifying the oracle or the output from the code under test, and using a different approximation threshold. Last, we performed an in-depth study to understand the reasons behind the evolution of oracle approximation assertions. Our findings reveal important maintenance challenges that developers may face when maintaining oracle approximation practices as code evolves in DL libraries.", "doi": "10.1109/ase.2019.00078", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00078", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00078"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00078"}
{"title": "Property Inference for Deep Neural Networks", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Divya Gopinath", "Hayes Converse", "Corina S. Pasareanu", "Ankur Taly"], "abstract": "We present techniques for automatically inferring formal properties of feed-forward neural networks. We observe that a significant part (if not all) of the logic of feed forward networks is captured in the activation status (on or off) of its neurons. We propose to extract patterns based on neuron decisions as preconditions that imply certain desirable output property e.g., the prediction being a certain class. We present techniques to extract input properties, encoding convex predicates on the input space that imply given output properties and layer properties, representing network properties captured in the hidden layers that imply the desired output behavior. We apply our techniques on networks for the MNIST and ACASXU applications. Our experiments highlight the use of the inferred properties in a variety of tasks, such as explaining predictions, providing robustness guarantees, simplifying proofs, and network distillation.", "doi": "10.1109/ase.2019.00079", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00079", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00079"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00079"}
{"title": "An Empirical Study Towards Characterizing Deep Learning Development and Deployment Across Different Frameworks and Platforms", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qianyu Guo", "Sen Chen", "Xiaofei Xie", "Lei Ma", "Qiang Hu", "Hongtao Liu", "Yang Liu", "Jianjun Zhao", "Xiaohong Li"], "abstract": "Deep Learning (DL) has recently achieved tremendous success. A variety of DL frameworks and platforms play a key role to catalyze such progress. However, the differences in architecture designs and implementations of existing frameworks and platforms bring new challenges for DL software development and deployment. Till now, there is no study on how various mainstream frameworks and platforms influence both DL software development and deployment in practice. To fill this gap, we take the first step towards understanding how the most widely-used DL frameworks and platforms support the DL software development and deployment. We conduct a systematic study on these frameworks and platforms by using two types of DNN architectures and three popular datasets. (1) For development process, we investigate the prediction accuracy under the same runtime training configuration or same model weights/biases. We also study the adversarial robustness of trained models by leveraging the existing adversarial attack techniques. The experimental results show that the computing differences across frameworks could result in an obvious prediction accuracy decline, which should draw the attention of DL developers. (2) For deployment process, we investigate the prediction accuracy and performance (refers to time cost and memory consumption) when the trained models are migrated/quantized from PC to real mobile devices and web browsers. The DL platform study unveils that the migration and quantization still suffer from compatibility and reliability issues. Meanwhile, we find several DL software bugs by using the results as a benchmark. We further validate the results through bug confirmation from stakeholders and industrial positive feedback to highlight the implications of our study. Through our study, we summarize practical guidelines, identify challenges and pinpoint new research directions, such as understanding the characteristics of DL frameworks and platforms, avoiding compatibility and reliability issues, detecting DL software bugs, and reducing time cost and memory consumption towards developing and deploying high quality DL systems effectively.", "doi": "10.1109/ase.2019.00080", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00080", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00080"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00080"}
{"title": "RefBot: Intelligent Software Refactoring Bot", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vahid Alizadeh", "Mohamed Amine Ouali", "Marouane Kessentini", "Meriem Chater"], "abstract": "The adoption of refactoring techniques for continuous integration received much less attention from the research community comparing to root-canal refactoring to fix the quality issues in the whole system. Several recent empirical studies show that developers, in practice, are applying refactoring incrementally when they are fixing bugs or adding new features. There is an urgent need for refactoring tools that can support continuous integration and some recent development processes such as DevOps that are based on rapid releases. Furthermore, several studies show that manual refactoring is expensive and existing automated refactoring tools are challenging to configure and integrate into the development pipelines with significant disruption cost. In this paper, we propose, for the first time, an intelligent software refactoring bot, called RefBot. Integrated into the version control system (e.g. GitHub), our bot continuously monitors the software repository, and it is triggered by any \"open\" or \"merge\" action on pull requests. The bot analyzes the files changed during that pull request to identify refactoring opportunities using a set of quality attributes then it will find the best sequence of refactorings to fix the quality issues if any. The bot recommends all these refactorings through an automatically generated pull-request. The developer can review the recommendations and their impacts in a detailed report and select the code changes that he wants to keep or ignore. After this review, the developer can close and approve the merge of the bot's pull request. We quantitatively and qualitatively evaluated the performance and effectiveness of RefBot by a survey conducted with experienced developers who used the bot on both open source and industry projects.", "doi": "10.1109/ase.2019.00081", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00081", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00081"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00081"}
{"title": "Automated Refactoring to Reactive Programming", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mirko Köhler", "Guido Salvaneschi"], "abstract": "Reactive programming languages and libraries, such as ReactiveX, have been shown to significantly improve software design and have seen important industrial adoption over the last years. Asynchronous applications - which are notoriously error-prone to implement and to maintain - greatly benefit from reactive programming because they can be defined in a declarative style, which improves code clarity and extensibility. In this paper, we tackle the problem of refactoring existing software that has been designed with traditional abstractions for asynchronous programming. We propose 2Rx, a refactoring approach to automatically convert asynchronous code to reactive programming. Our evaluation on top-starred GitHub projects shows that 2Rx is effective with the most common asynchronous constructs, covering 12.7% of projects with asynchronous computations, and it can provide a refactoring for 91.7% of their occurrences.", "doi": "10.1109/ase.2019.00082", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00082", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00082"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00082"}
{"title": "Empirical Study of Programming to an Interface", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Benoît Verhaeghe", "Christopher P. Fuhrman", "Latifa Guerrouj", "Nicolas Anquetil", "Stéphane Ducasse"], "abstract": "A popular recommendation to programmers in object-oriented software is to \"program to an interface, not an implementation\" (PTI). Expected benefits include increased simplicity from abstraction, decreased dependency on implementations, and higher flexibility. Yet, interfaces must be immutable, excessive class hierarchies can be a form of complexity, and \"speculative generality\" is a known code smell. To advance the empirical knowledge of PTI, we conducted an empirical investigation that involves 126 Java projects on GitHub, aiming to measuring the decreased dependency benefits (in terms of cochange).", "doi": "10.1109/ase.2019.00083", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00083", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00083"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00083"}
{"title": "Statistical Log Differencing", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lingfeng Bao", "Nimrod Busany", "David Lo", "Shahar Maoz"], "abstract": "Recent works have considered the problem of log differencing: given two or more system's execution logs, output a model of their differences. Log differencing has potential applications in software evolution, testing, and security. In this paper we present statistical log differencing, which accounts for frequencies of behaviors found in the logs. We present two algorithms, s2KDiff for differencing two logs, and snKDiff, for differencing of many logs at once, both presenting their results over a single inferred model. A unique aspect of our algorithms is their use of statistical hypothesis testing: we let the engineer control the sensitivity of the analysis by setting the target distance between probabilities and the statistical significance value, and report only (and all) the statistically significant differences. Our evaluation shows the effectiveness of our work in terms of soundness, completeness, and performance. It also demonstrates its effectiveness compared to previous work via a user-study and its potential applications via a case study using real-world logs.", "doi": "10.1109/ase.2019.00084", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00084", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00084"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00084"}
{"title": "Logzip: Extracting Hidden Structures via Iterative Clustering for Log Compression", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jinyang Liu", "Jieming Zhu", "Shilin He", "Pinjia He", "Zibin Zheng", "Michael R. Lyu"], "abstract": "System logs record detailed runtime information of software systems and are used as the main data source for many tasks around software engineering. As modern software systems are evolving into large scale and complex structures, logs have become one type of fast-growing big data in industry. In particular, such logs often need to be stored for a long time in practice (e.g., a year), in order to analyze recurrent problems or track security issues. However, archiving logs consumes a large amount of storage space and computing resources, which in turn incurs high operational cost. Data compression is essential to reduce the cost of log storage. Traditional compression tools (e.g., gzip) work well for general texts, but are not tailed for system logs. In this paper, we propose a novel and effective log compression method, namely logzip. Logzip is capable of extracting hidden structures from raw logs via fast iterative clustering and further generating coherent intermediate representations that allow for more effective compression. We evaluate logzip on five large log datasets of different system types, with a total of 63.6 GB in size. The results show that logzip can save about half of the storage space on average over traditional compression tools. Meanwhile, the design of logzip is highly parallel and only incurs negligible overhead. In addition, we share our industrial experience of applying logzip to Huawei's real products.", "doi": "10.1109/ase.2019.00085", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00085", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00085"], "github": ["https://github.com/logpai/logzip"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00085"}
{"title": "Code-First Model-Driven Engineering: On the Agile Adoption of MDE Tooling", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Artur Boronat"], "abstract": "Domain models are the most important asset in widely accepted software development approaches, like Domain-Driven Design (DDD), yet those models are still implicitly represented in programs. Model-Driven Engineering (MDE) regards those models as representable entities that are amenable to automated analysis and processing, facilitating quality assurance while increasing productivity in software development processes. Although this connection is not new, very few approaches facilitate adoption of MDE tooling without compromising existing value, their data. Moreover, switching to MDE tooling usually involves re-engineering core parts of an application, hindering backward compatibility and, thereby, continuous integration, while requiring an up-front investment in training in specialized modeling frameworks. In those approaches that overcome the previous problem, there is no clear indication - from a quantitative point of view - of the extent to which adopting state-of-the-art MDE practices and tooling is feasible or advantageous. In this work, we advocate a code-first approach to modeling through an approach for applying MDE techniques and tools to existing object-oriented software applications that fully preserves the semantics of the original application, which need not be modified. Our approach consists both of a semi-automated method for specifying explicit view models out of existing object-oriented applications and of a conservative extension mechanism that enables the use of such view models at run time, where view model queries are resolved on demand and view model updates are propagated incrementally to the original application. This mechanism enables an iterative, flexible application of MDE tooling to software applications, where metamodels and models do not exist explicitly. An evaluation of this extension mechanism, implemented for Java applications and for view models atop the Eclipse Modeling Framework (EMF), has been conducted with an industry-targeted benchmark for decision support systems, analyzing performance and scalability of the synchronization mechanism. Backward propagation of large updates over very large views is instant.", "doi": "10.1109/ase.2019.00086", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00086", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00086"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00086"}
{"title": "Size and Accuracy in Model Inference", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nimrod Busany", "Shahar Maoz", "Yehonatan Yulazari"], "abstract": "Many works infer finite-state models from execution logs. Large models are more accurate but also more difficult to present and understand. Small models are easier to present and understand but are less accurate. In this work we investigate the tradeoff between model size and accuracy in the context of the classic k-Tails model inference algorithm. First, we define mk-Tails, a generalization of k-Tails from one to many parameters, which enables fine-grained control over the tradeoff. Second, we extend mk-Tails with a reduction based on past-equivalence, which effectively reduces the size of the model without decreasing its accuracy. We implemented our work and evaluated its performance and effectiveness on real-world logs as well as on models and generated logs from the literature.", "doi": "10.1109/ase.2019.00087", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00087", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00087"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00087"}
{"title": "Debreach: Mitigating Compression Side Channels via Static Analysis and Transformation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Brandon Paulsen", "Chungha Sung", "Peter A. H. Peterson", "Chao Wang"], "abstract": "Compression is an emerging source of exploitable side-channel leakage that threatens data security, particularly in web applications where compression is indispensable for performance reasons. Current approaches to mitigating compression side channels have drawbacks in that they either degrade compression ratio drastically or require too much effort from developers to be widely adopted. To bridge the gap, we develop Debreach, a static analysis and program transformation based approach to mitigating compression side channels. Debreach consists of two steps. First, it uses taint analysis to soundly identify flows of sensitive data in the program and uses code instrumentation to annotate data before feeding them to the compressor. Second, it enhances the compressor to exploit the freedom to not compress of standard compression protocols, thus removing the dependency between sensitive data and the size of the compressor's output. Since Debreach automatically instruments applications and does not change the compression protocols, it has the advantage of being non-disruptive and compatible with existing systems. We have evaluated Debreach on a set of web server applications written in PHP. Our experiments show that, while ensuring leakage-freedom, Debreach can achieve significantly higher compression performance than state-of-the-art approaches.", "doi": "10.1109/ase.2019.00088", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00088", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00088"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00088"}
{"title": "Fine-Grain Memory Object Representation in Symbolic Execution", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Nowack"], "abstract": "Dynamic Symbolic Execution (DSE) has seen rising popularity as it allows to check applications for behaviours such as error patterns automatically. One of its biggest challenges is the state space explosion problem: DSE tries to evaluate all possible execution paths of an application. For every path, it needs to represent the allocated memory and its accesses. Even though different approaches have been proposed to mitigate the state space explosion problem, DSE still needs to represent a multitude of states in parallel to analyse them. If too many states are present, they cannot fit into memory, and DSE needs to terminate them prematurely or store them on disc intermediately. With a more efficient representation of allocated memory, DSE can handle more states simultaneously, improving its performance. In this work, we introduce an enhanced, fine-grain and efficient representation of memory that mimics the allocations of tested applications. We tested Coreutils using three different search strategies with our implementation on top of the symbolic execution engine KLEE. We achieve a significant reduction of the memory consumption of states by up to 99.06% (mean DFS: 2%, BFS: 51%, Cov.: 49%), allowing to represent more states in memory more efficiently. The total execution time is reduced by up to 97.81% (mean DFS: 9%, BFS: 7%, Cov.:4%)—a speedup of 49x in comparison to baseline KLEE.", "doi": "10.1109/ase.2019.00089", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00089", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00089"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00089"}
{"title": "RENN: Efficient Reverse Execution with Neural-Network-Assisted Alias Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dongliang Mu", "Wenbo Guo", "Alejandro Cuevas", "Yueqi Chen", "Jinxuan Gai", "Xinyu Xing", "Bing Mao", "Chengyu Song"], "abstract": "Reverse execution and coredump analysis have long been used to diagnose the root cause of software crashes. Each of these techniques, however, face inherent challenges, such as insufficient capability when handling memory aliases. Recent works have used hypothesis testing to address this drawback, albeit with high computational complexity, making them impractical for real world applications. To address this issue, we propose a new deep neural architecture, which could significantly improve memory alias resolution. At the high level, our approach employs a recurrent neural network (RNN) to learn the binary code pattern pertaining to memory accesses. It then infers the memory region accessed by memory references. Since memory references to different regions naturally indicate a non-alias relationship, our neural architecture can greatly reduce the burden of doing hypothesis testing to track down non-alias relation in binary code. Different from previous researches that have utilized deep learning for other binary analysis tasks, the neural network proposed in this work is fundamentally novel. Instead of simply using off-the-shelf neural networks, we designed a new recurrent neural architecture that could capture the data dependency between machine code segments. To demonstrate the utility of our deep neural architecture, we implement it as RENN, a neural network-assisted reverse execution system. We utilize this tool to analyze software crashes corresponding to 40 memory corruption vulnerabilities from the real world. Our experiments show that RENN can significantly improve the efficiency of locating the root cause for the crashes. Compared to a state-of-the-art technique, RENN has 36.25% faster execution time on average, detects an average of 21.35% more non-alias pairs, and successfully identified the root cause of 12.5% more cases.", "doi": "10.1109/ase.2019.00090", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00090", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00090"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00090"}
{"title": "Batch Alias Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jyothi Vedurada", "V. Krishna Nandivada"], "abstract": "Many program-analysis based tools require precise points-to/alias information only for some program variables. To meet this requirement efficiently, there have been many works on demand-driven analyses that perform only the work necessary to compute the points-to or alias information on the requested variables (queries). However, these demand-driven analyses can be very expensive when applied on large systems where the number of queries can be significant. Such a blow-up in analysis time is unacceptable in cases where scalability with real-time constraints is crucial; for example, when program analysis tools are plugged into an IDE (Integrated Development Environment). In this paper, we propose schemes to improve the scalability of demand-driven analyses without compromising on precision. Our work is based on novel ideas for eliminating irrelevant and redundant data-flow paths for the given queries. We introduce the idea of batch analysis, which can answer multiple given queries in batch mode. Batch analysis suits the environments with strict time constraints, where the queries come in batch. We present a batch alias analysis framework that can be used to speed up given demand-driven alias analysis. To show the effectiveness of this framework, we use two demand-driven alias analyses (1) the existing best performing demand-driven alias analysis tool for race-detection clients and (2) an optimized version thereof that avoids irrelevant computation. Our evaluations on a simulated data-race client, and on a recent program-understanding tool, show that batch analysis leads to significant performance gains, along with minor gains in precision.", "doi": "10.1109/ase.2019.00091", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00091", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00091"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00091"}
{"title": "Improving the Decision-Making Process of Self-Adaptive Systems by Accounting for Tactic Volatility", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jeffrey Palmerino", "Qi Yu", "Travis Desell", "Daniel E. Krutz"], "abstract": "When self-adaptive systems encounter changes withintheir surrounding environments, they enacttacticsto performnecessary adaptations. For example, a self-adaptive cloud-basedsystem may have a tactic that initiates additional computingresources when response time thresholds are surpassed, or theremay be a tactic to activate a specific security measure when anintrusion is detected. In real-world environments, these tacticsfrequently experiencetactic volatilitywhich is variable behaviorduring the execution of the tactic.Unfortunately, current self-adaptive approaches do not accountfor tactic volatility in their decision-making processes, and merelyassume that tactics do not experience volatility. This limitationcreates uncertainty in the decision-making process and mayadversely impact the system's ability to effectively and efficientlyadapt. Additionally, many processes do not properly account forvolatility that may effect the system's Service Level Agreement(SLA). This can limit the system's ability to act proactively, especially when utilizing tactics that contain latency.To address the challenge of sufficiently accounting for tacticvolatility, we propose aTactic Volatility Aware(TVA) solution.Using Multiple Regression Analysis (MRA), TVA enables self-adaptive systems to accurately estimate the cost and timerequired to execute tactics. TVA also utilizesAutoregressiveIntegrated Moving Average(ARIMA) for time series forecasting, allowing the system to proactively maintain specifications.", "doi": "10.1109/ase.2019.00092", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00092", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00092"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00092"}
{"title": "Learning-Guided Network Fuzzing for Testing Cyber-Physical System Defences", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuqi Chen", "Christopher M. Poskitt", "Jun Sun", "Sridhar Adepu", "Fan Zhang"], "abstract": "  The threat of attack faced by cyber-physical systems (CPSs), especially when\nthey play a critical role in automating public infrastructure, has motivated\nresearch into a wide variety of attack defence mechanisms. Assessing their\neffectiveness is challenging, however, as realistic sets of attacks to test\nthem against are not always available. In this paper, we propose smart fuzzing,\nan automated, machine learning guided technique for systematically finding\n'test suites' of CPS network attacks, without requiring any knowledge of the\nsystem's control programs or physical processes. Our approach uses predictive\nmachine learning models and metaheuristic search algorithms to guide the\nfuzzing of actuators so as to drive the CPS into different unsafe physical\nstates. We demonstrate the efficacy of smart fuzzing by implementing it for two\nreal-world CPS testbeds---a water purification plant and a water distribution\nsystem---finding attacks that drive them into 27 different unsafe states\ninvolving water flow, pressure, and tank levels, including six that were not\ncovered by an established attack benchmark. Finally, we use our approach to\ntest the effectiveness of an invariant-based defence system for the water\ntreatment plant, finding two attacks that were not detected by its physical\ninvariant checks, highlighting a potential weakness that could be exploited in\ncertain conditions.\n", "doi": "10.1109/ase.2019.00093", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00093", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00093", "https://arxiv.org/pdf/1909.05410"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00093", "journal_ref": "In Proc. IEEE/ACM International Conference on Automated Software\n  Engineering (ASE 2019), pages 962-973. IEEE, 2019", "categories": "cs.CR", "cited_by": 0}
{"title": "Cautious Adaptation of Defiant Components", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Paulo Henrique M. Maia", "Lucas Vieira", "Matheus Lima Chagas", "Yijun Yu", "Andrea Zisman", "Bashar Nuseibeh"], "abstract": "Systems-of-systems are formed by the composition of independently created software components. These components are designed to satisfy their individual requirements, rather than the global requirements of the systems-of-systems. We refer to components that cannot be adapted to meet both individual and global requirements as \"defiant\" components. In this paper, we propose a \"cautious\" adaptation approach which supports changing the behaviour of such defiant components under exceptional conditions to satisfy global requirements, while continuing to guarantee the satisfaction of the components' individual requirements. The approach represents both normal and exceptional conditions as scenarios; models the behaviour of exceptional conditions as wrappers implemented using an aspect-oriented technique; and deals with both single and multiple instances of defiant components with different precedence order at runtime. We evaluated an implementation of the approach using drones and boats for an organ delivery application conceived by our industrial partners, in which we assess how the proposed approach help achieve the system-of-systems' global requirements while accommodating increased complexity of hybrid aspects such as multiplicity, precedence ordering, openness and heterogeneity.", "doi": "10.1109/ase.2019.00094", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00094", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00094"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00094"}
{"title": "Active Hotspot: An Issue-Oriented Model to Monitor Software Evolution and Degradation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qiong Feng", "Yuanfang Cai", "Rick Kazman", "Di Cui", "Ting Liu", "Hongzhou Fang"], "abstract": "Architecture degradation has a strong negative impact on software quality and can result in significant losses. Severe software degradation does not happen overnight. Software evolves continuously, through numerous issues, fixing bugs and adding new features, and architecture flaws emerge quietly and largely unnoticed until they grow in scope and significance when the system becomes difficult to maintain. Developers are largely unaware of these flaws or the accumulating debt as they are focused on their immediate tasks of address individual issues. As a consequence, the cumulative impacts of their activities, as they affect the architecture, go unnoticed. To detect these problems early and prevent them from accumulating into severe ones we propose to monitor software evolution by tracking the interactions among files revised to address issues. In particular, we propose and show how we can automatically detect active hotspots, to reveal architecture problems. We have studied hundreds of hotspots along the evolution timelines of 21 open source projects and showed that there exist just a few dominating active hotspots per project at any given time. Moreover, these dominating active hotspots persist over long time periods, and thus deserve special attention. Compared with state-of-the-art design and code smell detection tools we report that, using active hotspots, it is possible to detect signs of software degradation both earlier and more precisely.", "doi": "10.1109/ase.2019.00095", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00095", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00095"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00095"}
{"title": "Automated Trainability Evaluation for Smart Software Functions", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ilias Gerostathopoulos", "Stefan Kugele", "Christoph Segler", "Tomás Bures", "Alois C. Knoll"], "abstract": "More and more software-intensive systems employ machine learning and runtime optimization to improve their functionality by providing advanced features (e. g. personal driving assistants or recommendation engines). Such systems incorporate a number of smart software functions (SSFs) which gradually learn and adapt to the users' preferences. A key property of SSFs is their ability to learn based on data resulting from the interaction with the user (implicit and explicit feedback)-which we call trainability. Newly developed and enhanced features in a SSF must be evaluated based on their effect on the trainability of the system. Despite recent approaches for continuous deployment of machine learning systems, trainability evaluation is not yet part of continuous integration and deployment (CID) pipelines. In this paper, we describe the different facets of trainability for the development of SSFs. We also present our approach for automated trainability evaluation within an automotive CID framework which proposes to use automated quality gates for the continuous evaluation of machine learning models. The results from our indicative evaluation based on real data from eight BMW cars highlight the importance of continuous and rigorous trainability evaluation in the development of SSFs.", "doi": "10.1109/ase.2019.00096", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00096", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00096"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00096"}
{"title": "The Impact of Structure on Software Merging: Semistructured Versus Structured Merge", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Guilherme Cavalcanti", "Paulo Borba", "Georg Seibt", "Sven Apel"], "abstract": "Merge conflicts often occur when developers concurrently change the same code artifacts. While state of practice unstructured merge tools (e.g Git merge) try to automatically resolve merge conflicts based on textual similarity, semistructured and structured merge tools try to go further by exploiting the syntactic structure and semantics of the artifacts involved. Although there is evidence that semistructured merge has significant advantages over unstructured merge, and that structured merge reports significantly fewer conflicts than unstructured merge, it is unknown how semistructured merge compares with structured merge. To help developers decide which kind of tool to use, we compare semistructured and structured merge in an empirical study by reproducing more than 40,000 merge scenarios from more than 500 projects. In particular, we assess how often the two merge strategies report different results, we identify conflicts incorrectly reported by one but not by the other (false positives), and conflicts correctly reported by one but missed by the other (false negatives). Our results show that semistructured and structured merge differ in 24% of the scenarios with conflicts. Semistructured merge reports more false positives, whereas structured merge has more false negatives. Finally, we found that adapting a semistructured merge tool to resolve a particular kind of conflict makes semistructured and structured merge even closer.", "doi": "10.1109/ase.2019.00097", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00097", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00097"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00097"}
{"title": "Semistructured Merge in JavaScript Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alberto Trindade Tavares", "Paulo Borba", "Guilherme Cavalcanti", "Sérgio Soares"], "abstract": "Industry widely uses unstructured merge tools that rely on textual analysis to detect and resolve conflicts between code contributions. Semistructured merge tools go further by partially exploring the syntactic structure of code artifacts, and, as a consequence, obtaining significant merge accuracy gains for Java-like languages. To understand whether semistructured merge and the observed gains generalize to other kinds of languages, we implement two semistructured merge tools for JavaScript, and compare them to an unstructured tool. We find that current semistructured merge algorithms and frameworks are not directly applicable for scripting languages like JavaScript. By adapting the algorithms, and studying 10,345 merge scenarios from 50 JavaScript projects on GitHub, we find evidence that our JavaScript tools report fewer spurious conflicts than unstructured merge, without compromising the correctness of the merging process. The gains, however, are much smaller than the ones observed for Java-like languages, suggesting that semistructured merge advantages might be limited for languages that allow both commutative and non-commutative declarations at the same syntactic level.", "doi": "10.1109/ase.2019.00098", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00098", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00098"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00098"}
{"title": "CLCDSA: Cross Language Code Clone Detection using Syntactical Features and API Documentation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kawser Wazed Nafi", "Tonny Shekha Kar", "Banani Roy", "Chanchal K. Roy", "Kevin A. Schneider"], "abstract": "Software clones are detrimental to software maintenance and evolution and as a result many clone detectors have been proposed. These tools target clone detection in software applications written in a single programming language. However, a software application may be written in different languages for different platforms to improve the application's platform compatibility and adoption by users of different platforms. Cross language clones (CLCs) introduce additional challenges when maintaining multi-platform applications and would likely go undetected using existing tools. In this paper, we propose CLCDSA, a cross language clone detector which can detect CLCs without extensive processing of the source code and without the need to generate an intermediate representation. The proposed CLCDSA model analyzes different syntactic features of source code across different programming languages to detect CLCs. To support large scale clone detection, the CLCDSA model uses an action filter based on cross language API call similarity to discard non-potential clones. The design methodology of CLCDSA is two-fold: (a) it detects CLCs on the fly by comparing the similarity of features, and (b) it uses a deep neural network based feature vector learning model to learn the features and detect CLCs. Early evaluation of the model observed an average precision, recall and F-measure score of 0.55, 0.86, and 0.64 respectively for the first phase and 0.61, 0.93, and 0.71 respectively for the second phase which indicates that CLCDSA outperforms all available models in detecting cross language clones.", "doi": "10.1109/ase.2019.00099", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00099", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00099"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00099"}
{"title": "B2SFinder: Detecting Open-Source Software Reuse in COTS Software", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Muyue Feng", "Zimu Yuan", "Feng Li", "Gu Ban", "Shiyang Wang", "Qian Tang", "He Su", "Chendong Yu", "Jiahuan Xu", "Aihua Piao", "Jingling Xue", "Wei Huo"], "abstract": "COTS software products are developed extensively on top of OSS projects, resulting in OSS reuse vulnerabilities. To detect such vulnerabilities, finding OSS reuses in COTS software has become imperative. While scalable to tens of thousands of OSS projects, existing binary-to-source matching approaches are severely imprecise in analyzing COTS software products, since they support only a limited number of code features, compute matching scores only approximately in measuring OSS reuses, and neglect the code structures in OSS projects. We introduce a novel binary-to-source matching approach, called B2SFINDER, to address these limitations. First of all, B2SFINDER can reason about seven kinds of code featuresthat are traceable in both binary and source code. In order to compute matching scores precisely, B2SFINDER employs a weighted feature matching algorithm that combines three matching methods (for dealing with different code features) with two importance-weighting methods (for computing the weight of an instance of a code feature in a given COTS software application based on its specificity and occurrence frequency). Finally, B2SFINDER identifies different types of code reusesbased on matching scores and code structures of OSS projects. We have implemented B2SFINDER using an optimized datastructure. We have evaluated B2SFINDERusing 21991 binaries from 1000 popular COTS software products and 2189 candidateOSS projects. Our experimental results show that B2SFINDER is not only precise but also scalable. Compared with the state ofthe art, B2SFINDER has successfully found up to 2.15x as many reuse cases in 53.85 seconds per binary file on average. We also discuss how B2SFINDER can be leveraged in detecting OSS reusevulnerabilities in practice.", "doi": "10.1109/ase.2019.00100", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00100", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00100"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00100"}
{"title": "CoRA: Decomposing and Describing Tangled Code Changes for Reviewer", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Min Wang", "Zeqi Lin", "Yanzhen Zou", "Bing Xie"], "abstract": "Code review is an important mechanism for code quality assurance both in open source software and industrial software. Reviewers usually suffer from numerous, tangled and loosely related code changes that are bundled in a single commit, which makes code review very difficult. In this paper, we propose CoRA (Code Review Assistant), an automatic approach to decompose a commit into different parts and generate concise descriptions for reviewers. More specifically, CoRA can decompose a commit into independent parts (e.g., bug fixing, new feature adding, or refactoring) by code dependency analysis and tree-based similar-code detection, then identify the most important code changes in each part based on the PageRank algorithm and heuristic rules. As a result, CoRA can generate a concise description for each part of the commit. We evaluate our approach in seven open source software projects and 50 code commits. The results indicate that CoRA can improve the accuracy of decomposing code changes by 6.3% over the state-ofart practice. At the same time, CoRA can identify the important part from the fine-grained code changes with a mean average precision (MAP) of 87.7%. We also conduct a human study with eight participants to evaluate the performance and usefulness of CoRA, the user feedback indicates that CoRA can effectively help reviewers.", "doi": "10.1109/ase.2019.00101", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00101", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00101"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00101"}
{"title": "A Quantitative Analysis Framework for Recurrent Neural Network", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaoning Du", "Xiaofei Xie", "Yi Li", "Lei Ma", "Yang Liu", "Jianjun Zhao"], "abstract": "Recurrent neural network (RNN) has achieved great success in processing sequential inputs for applications such as automatic speech recognition, natural language processing and machine translation. However, quality and reliability issues of RNNs make them vulnerable to adversarial attacks and hinder their deployment in real-world applications. In this paper, we propose a quantitative analysis framework - DeepStellar - to pave the way for effective quality and security analysis of software systems powered by RNNs. DeepStellar is generic to handle various RNN architectures, including LSTM and GRU, scalable to work on industrial-grade RNN models, and extensible to develop customized analyzers and tools. We demonstrated that, with DeepStellar, users are able to design efficient test generation tools, and develop effective adversarial sample detectors. We tested the developed applications on three real RNN models, including speech recognition and image classification. DeepStellar outperforms existing approaches three hundred times in generating defect-triggering tests and achieves 97% accuracy in detecting adversarial attacks. A video demonstration which shows the main features of DeepStellar is available at: https://sites.google.com/view/deepstellar/tool-demo.", "doi": "10.1109/ase.2019.00102", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00102", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00102"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00102"}
{"title": "LIRAT: Layout and Image Recognition Driving Automated Mobile Testing of Cross-Platform", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shengcheng Yu", "Chunrong Fang", "Yang Feng", "Wenyuan Zhao", "Zhenyu Chen"], "abstract": "The fragmentation issue spreads over multiple mobile platforms such as Android, iOS, mobile web, and WeChat, which hinders test scripts from running across platforms. To reduce the cost of adapting scripts for various platforms, some existing tools apply conventional computer vision techniques to replay the same script on multiple platforms. However, because these solutions can hardly identify dynamic or similar widgets. It becomes difficult for engineers to apply them in practice. In this paper, we present an image-driven tool, namely LIRAT, to record and replay test scripts cross platforms, solving the problem of test script cross-platform replay for the first time. LIRAT records screenshots and layouts of the widgets, and leverages image understanding techniques to locate them in the replay process. Based on accurate widget localization, LIRAT supports replaying test scripts across devices and platforms. We employed LIRAT to replay 25 scripts from 5 application across 8 Android devices and 2 iOS devices. The results show that LIRAT can replay 88% scripts on Android platforms and 60% on iOS platforms. The demo can be found at: https: //github.com/YSC9848/LIRAT", "doi": "10.1109/ase.2019.00103", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00103", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00103"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00103"}
{"title": "Humanoid: A Deep Learning-Based Approach to Automated Black-box Android App Testing", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuanchun Li", "Ziyue Yang", "Yao Guo", "Xiangqun Chen"], "abstract": "Automated input generators must constantly choose which UI element to interact with and how to interact with it, in order to achieve high coverage with a limited time budget. Currently, most black-box input generators adopt pseudo-random or brute-force searching strategies, which may take very long to find the correct combination of inputs that can drive the app into new and important states. We propose Humanoid, an automated black-box Android app testing tool based on deep learning. The key technique behind Humanoid is a deep neural network model that can learn how human users choose actions based on an app's GUI from human interaction traces. The learned model can then be used to guide test input generation to achieve higher coverage. Experiments on both open-source apps and market apps demonstrate that Humanoid is able to reach higher coverage, and faster as well, than the state-of-the-art test input generators. Humanoid is open-sourced at https://github.com/yzygitzh/Humanoid and a demo video can be found at https://youtu.be/PDRxDrkyORs.", "doi": "10.1109/ase.2019.00104", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00104", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00104"], "github": ["https://github.com/yzygitzh/Humanoid"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00104"}
{"title": "TestCov: Robust Test-Suite Execution and Coverage Measurement", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dirk Beyer", "Thomas Lemberger"], "abstract": "We present TestCov, a tool for robust test-suite execution and test-coverage measurement on C programs. TestCov executes program tests in isolated containers to ensure system integrity and reliable resource control. The tool provides coverage statistics per test and for the whole test suite. TestCov uses the simple, XML -based exchange format for test-suite specifications that was established as standard by Test-Comp. TestCov has been successfully used in Test-Comp '19 to execute almost 9 million tests on 1720 different programs. The source code of TestCov is released under the open-source license Apache 2.0 and available at https://gitlab.com/sosy-lab/software/test-suite-validator. A full artifact, including a demonstration video, is available at https://doi.org/10.5281/zenodo.3418726.", "doi": "10.1109/ase.2019.00105", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00105", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00105"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00105"}
{"title": "VisFuzz: Understanding and Intervening Fuzzing with Interactive Visualization", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chijin Zhou", "Mingzhe Wang", "Jie Liang", "Zhe Liu", "Chengnian Sun", "Yu Jiang"], "abstract": "Fuzzing is widely used for vulnerability detection. One of the challenges for an efficient fuzzing is covering code guarded by constraints such as the magic number and nested conditions. Recently, academia has partially addressed the challenge via whitebox methods. However, high-level constraints such as array sorts, virtual function invocations, and tree set queries are yet to be handled. To meet this end, we present VisFuzz, an interactive tool for better understanding and intervening fuzzing process via real-time visualization. It extracts call graph and control flow graph from source code, maps each function and basic block to the line of source code and tracks real-time execution statistics with detail constraint contexts. With VisFuzz, test engineers first locate blocking constraints and then learn its semantic context, which helps to craft targeted inputs or update test drivers. Preliminary evaluations are conducted on four real-world programs in Google fuzzer-test-suite. Given additional 15 minutes to understand and intervene the state of fuzzing, the intervened fuzzing outperform the original pure AFL fuzzing, and the path coverage improvements range from 10.84% to 150.58%, equally fuzzed by for 12 hours.", "doi": "10.1109/ase.2019.00106", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00106", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00106"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00106"}
{"title": "Developer Reputation Estimator (DRE)", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sadika Amreen", "Andrey Karnauch", "Audris Mockus"], "abstract": "Evidence shows that developer reputation is extremely important when accepting pull requests or resolving reported issues. It is particularly salient in Free/Libre Open Source Software since the developers are distributed around the world, do not work for the same organization and, in most cases, never meet face to face. The existing solutions to expose developer reputation tend to be forge specific (GitHub), focus on activity instead of impact, do not leverage social or technical networks, and do not correct often misspelled developer identities. We aim to remedy this by amalgamating data from all public Git repositories, measuring the impact of developer work, expose developer's collaborators, and correct notoriously problematic developer identity data. We leverage World of Code (WoC), a collection of an almost complete (and continuously updated) set of Git repositories by first allowing developers to select which of the 34 million(M) Git commit author IDs belong to them and then generating their profiles by treating the selected collection of IDs as that single developer. As a side-effect, these selections serve as a training set for a supervised learning algorithm that merges multiple identity strings belonging to a single individual. As we evaluate the tool and the proposed impact measure, we expect to build on these findings to develop reputation badges that could be associated with pull requests and commits so developers could easier trust and prioritize them.", "doi": "10.1109/ase.2019.00107", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00107", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00107"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00107"}
{"title": "CocoQa: Question Answering for Coding Conventions Over Knowledge Graphs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tianjiao Du", "Junming Cao", "Qinyue Wu", "Wei Li", "Beijun Shen", "Yuting Chen"], "abstract": "Coding convention plays an important role in guaranteeing software quality. However, coding conventions are usually informally presented and inconvenient for programmers to use. In this paper, we present CocoQa, a system that answers programmer's questions about coding conventions. CocoQa answers questions by querying a knowledge graph for coding conventions. It employs 1) a subgraph matching algorithm that parses the question into a SPARQL query, and 2) a machine comprehension algorithm that uses an end-to-end neural network to detect answers from searched paragraphs. We have implemented CocoQa, and evaluated it on a coding convention QA dataset. The results show that CocoQa can answer questions about coding conventions precisely. In particular, CocoQa can achieve a precision of 82.92% and a recall of 91.10%. Repository: https://github.com/14dtj/CocoQa/ Video: https://youtu.be/VQaXi1WydAU.", "doi": "10.1109/ase.2019.00108", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00108", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00108"], "github": ["https://github.com/14dtj/CocoQa/"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00108"}
{"title": "MutAPK: Source-Codeless Mutant Generation for Android Apps", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Camilo Andrés Escobar-Velasquez", "Michael Osorio-Riaño", "Mario Linares-Vásquez"], "abstract": "The amount of Android application is having a tremendous increasing trend, exerting pressure over practitioners and researchers around application quality, frequent releases, and quick fixing of bugs. This pressure leads practitioners to make usage of automated approaches based on using source-code as input. Nevertheless, third-party services are not able to use these approaches due to privacy factors. In this paper we present MutAPK, an open source mutation testing tool that enables the usage of APK as input for this task. MutAPK generates mutants without the need of having access to source code, because the mutations are done in an intermediate representation of the code (i.e., SMALI) that does not require compilation. MutAPK is publicly available at GitHub: https://bit.ly/2KYvgP9 VIDEO: https://bit.ly/2WOjiyy", "doi": "10.1109/ase.2019.00109", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00109", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00109"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00109"}
{"title": "SWAN_ASSIST: Semi-Automated Detection of Code-Specific, Security-Relevant Methods", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Goran Piskachev", "Lisa Nguyen Quang Do", "Oshando Johnson", "Eric Bodden"], "abstract": "To detect specific types of bugs and vulnerabilities, static analysis tools must be correctly configured with security-relevant methods (SRM), e.g., sources, sinks, sanitizers and authentication methods-usually a very labour-intensive and error-prone process. This work presents the semi-automated tool SWAN_ASSIST, which aids the configuration with an IntelliJ plugin based on active machine learning. It integrates our novel automated machine-learning approach SWAN, which identifies and classifies Java SRM. SWAN_ASSIST further integrates user feedback through iterative learning. SWAN_ASSIST aids developers by asking them to classify at each point in time exactly those methods whose classification best impact the classification result. Our experiments show that SWAN_ASSIST classifies SRM with a high precision, and requires a relatively low effort from the user. A video demo of SWAN_ASSIST can be found at https://youtu.be/fSyD3V6EQOY. The source code is available at https://github.com/secure-software-engineering/swan.", "doi": "10.1109/ase.2019.00110", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00110", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00110"], "github": ["https://github.com/secure-software-engineering/swan"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00110"}
{"title": "Sip4J: Statically Inferring Access Permission Contracts for Parallelising Sequential Java Programs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ayesha Sadiq", "Li Li", "Yuan-Fang Li", "Ijaz Ahmed", "Sea Ling"], "abstract": "This paper presents Sip4J, a fully automated, scalable and effective tool to automatically generate access permission contracts for a sequential Java program. The access permission contracts, which represent the dependency of code blocks, have been frequently used to enable concurrent execution of sequential programs. Those permission contracts, unfortunately, need to be manually created by programmers, which is known to be time-consuming, laborious and error-prone. To mitigate those manual efforts, Sip4J performs inter-procedural static analysis of Java source code to automatically extract the implicit dependencies in the program and subsequently leverages them to automatically generate access permission contracts, following the Design by Contract principle. The inferred specifications are then used to identify the concurrent (immutable) methods in the program. Experimental results further show that Sip4J is useful and effective towards generating access permission contracts for sequential Java programs. The implementation of Sip4J has been published as an open-sourced project at https://github.com/Sip4J/Sip4J and a demo video of Sip4J can be found at https://youtu.be/RjMTIxlhHTg.", "doi": "10.1109/ase.2019.00111", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00111", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00111"], "github": ["https://github.com/Sip4J/Sip4J"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00111"}
{"title": "Visual Analytics for Concurrent Java Executions", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Cyrille Artho", "Monali Pande", "Qiyi Tang"], "abstract": "Analyzing executions of concurrent software is very difficult. Even if a trace is available, such traces are very hard to read and interpret. A textual trace contains a lot of data, most of which is not relevant to the issue at hand. Past visualization attempts either do not show concurrent behavior, or result in a view that is overwhelming for the user. We provide a visual analytics tool, VA4JVM, for error traces produced by either the Java Virtual Machine, or by Java Pathfinder. Its key features are a layout that spatially associates events with threads, a zoom function, and the ability to filter event data in various ways. We show in examples how filtering and zooming in can highlight a problem without having to read lengthy textual data.", "doi": "10.1109/ase.2019.00112", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00112", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00112"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00112"}
{"title": "NeuralVis: Visualizing and Interpreting Deep Learning Models", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xufan Zhang", "Ziyue Yin", "Yang Feng", "Qingkai Shi", "Jia Liu", "Zhenyu Chen"], "abstract": "Deep Neural Network(DNN) techniques have been prevalent in software engineering. They are employed to facilitate various software engineering tasks and embedded into many software applications. However, because DNNs are built upon a rich data-driven programming paradigm that employs plenty of labeled data to train a set of neurons to construct the internal system logic, analyzing and understanding their behaviors becomes a difficult task for software engineers. In this paper, we present an instance-based visualization tool for DNN, namely NeuralVis, to support software engineers in visualizing and interpreting deep learning models. NeuralVis is designed for: 1). visualizing the structure of DNN models, i.e., neurons, layers, as well as connections; 2). visualizing the data transformation process; 3). integrating existing adversarial attack algorithms for test input generation; 4). comparing intermediate layers' outputs of different inputs. To demonstrate the effectiveness of NeuralVis, we design a task-based user study involving ten participants on two classic DNN models, i.e., LeNet and VGG-12. The result shows NeuralVis can assist engineers in identifying critical features that determine the prediction results. Video: https://youtu.be/solkJri4Z44", "doi": "10.1109/ase.2019.00113", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00113", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00113"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00113"}
{"title": "Kotless: A Serverless Framework for Kotlin", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladislav Tankov", "Yaroslav Golubev", "Timofey Bryksin"], "abstract": "Recent trends in Web development demonstrate an increased interest in serverless applications, i.e. applications that utilize computational resources provided by cloud services on demand instead of requiring traditional server management. This approach enables better resource management while being scalable, reliable, and cost-effective. However, it comes with a number of organizational and technical difficulties which stem from the interaction between the application and the cloud infrastructure, for example, having to set up a recurring task of reuploading updated files. In this paper, we present Kotless — a Kotlin Serverless Framework. Kotless is a cloud-agnostic toolkit that solves these problems by interweaving the deployed application into the cloud infrastructure and automatically generating the necessary deployment code. This relieves developers from having to spend their time integrating and managing their applications instead of developing them. Kotless has proven its capabilities and has been used to develop several serverless applications already in production. Its source code is available at https://github.com/JetBrains/kotless, a tool demo can be found at https://www.youtube.com/watch?v=IMSakPNl3TY.", "doi": "10.1109/ase.2019.00114", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00114", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00114"], "github": ["https://github.com/JetBrains/kotless"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00114"}
{"title": "FogWorkflowSim: An Automated Simulation Toolkit for Workflow Performance Evaluation in Fog Computing", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiao Liu", "Lingmin Fan", "Jia Xu", "Xuejun Li", "Lina Gong", "John C. Grundy", "Yun Yang"], "abstract": "Workflow underlies most process automation software, such as those for product lines, business processes, and scientific computing. However, current Cloud Computing based workflow systems cannot support real-time applications due to network latency, which limits their application in many IoT systems such as smart healthcare and smart traffic. Fog Computing extends the Cloud by providing virtualized computing resources close to the End Devices so that the response time of accessing computing resources can be reduced significantly. However, how to most effectively manage heterogeneous resources and different computing tasks in the Fog is a big challenge. In this paper, we introduce \"FogWorkflowSim\" an efficient and extensible toolkit for automatically evaluating resource and task management strategies in Fog Computing with simulated user-defined workflow applications. Specifically, FogWorkflowSim is able to: 1) automatically set up a simulated Fog Computing environment for workflow applications; 2) automatically execute user submitted workflow applications; 3) automatically evaluate and compare the performance of different computation offloading and task scheduling strategies with three basic performance metrics, including time, energy and cost. FogWorkflowSim can serve as an effective experimental platform for researchers in Fog based workflow systems as well as practitioners interested in adopting Fog Computing and workflow systems for their new software projects. (Demo video: https://youtu.be/AsMovcuSkx8)", "doi": "10.1109/ase.2019.00115", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00115", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00115"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00115"}
{"title": "PraPR: Practical Program Repair via Bytecode Mutation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Ghanbari", "Lingming Zhang"], "abstract": "Automated program repair (APR) is one of the recent advances in automated software engineering aiming for reducing the burden of debugging by suggesting high-quality patches that either directly fix the bugs, or help the programmers in the course of manual debugging. We believe scalability, applicability, and accurate patch validation are the main design objectives for a practical APR technique. In this paper, we present PraPR, our implementation of a practical APR technique that operates at the level of JVM bytecode. We discuss design decisions made in the development of PraPR, and argue that the technique is a viable baseline toward attaining aforementioned objectives. Our experimental results show that: (1) PraPR can fix more bugs than state-of-the-art APR techniques and can be over 10X faster, (2) state-of-the-art APR techniques suffer from dataset overfitting, while the simplistic template-based PraPR performs more consistently on different datasets, and (3) PraPR can fix bugs for other JVM languages, such as Kotlin. PraPR is publicly available at https://github.com/prapr/prapr.", "doi": "10.1109/ase.2019.00116", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00116", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00116"], "github": ["https://github.com/prapr/prapr"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00116"}
{"title": "SPrinter: A Static Checker for Finding Smart Pointer Errors in C++ Programs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xutong Ma", "Jiwei Yan", "Yaqi Li", "Jun Yan", "Jian Zhang"], "abstract": "Smart pointers are widely used to prevent memory errors in modern C++ code. However, improper usage of smart pointers may also lead to common memory errors, which makes the code not as safe as expected. To avoid smart pointer errors as early as possible, we present a coding style checker to detect possible bad smart pointer usages during compile time, and notify programmers about bug-prone behaviors. The evaluation indicates that the currently available state-of-the-art static code checkers can only detect 25 out of 116 manually inserted errors, while our tool can detect all these errors. And we also found 521 bugs among 8 open source projects with only 4 false positives.", "doi": "10.1109/ase.2019.00117", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00117", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00117"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00117"}
{"title": "FPChecker: Detecting Floating-Point Exceptions in GPU Applications", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ignacio Laguna"], "abstract": "Floating-point arithmetic is widely used in applications from several fields including scientific computing, machine learning, graphics, and finance. Many of these applications are rapidly adopting the use of GPUs to speedup computations. GPUs, however, have limited support to detect floating-point exceptions, which hinders the development of reliable applications in GPU-based systems. We present FPCHECKER, the first tool to automatically detect floating-point exceptions in GPU applications. FPCHECKER uses the clang/LLVM compiler to instrument GPU kernels and to detect exceptions at runtime. Once an exception is detected, it reports to the programmer the code location of the exception as well as other useful information. The programmer can then use this report to avoid the exception, e.g., by modifying the application algorithm or changing the input. We present the design of FPCHECKER, an evaluation of the overhead of the tool, and a real-world case scenario on which the tool is used to identify a hidden exception. The slowdown of FPCHECKER is moderate and the code is publicly available as open source.", "doi": "10.1109/ase.2019.00118", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00118", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00118"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00118"}
{"title": "Pangolin: An SFL-Based Toolset for Feature Localization", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bruno Castro", "Alexandre Perez", "Rui Abreu"], "abstract": "Pinpointing the location where a given unit of functionality-or feature-was implemented is a demanding and time-consuming task, yet prevalent in most software maintenance or evolution efforts. To that extent, we present PANGOLIN, an Eclipse plugin that helps developers identifying features among the source code. It borrows Spectrum-based Fault Localization techniques from the software diagnosis research field by framing feature localization as a diagnostic problem. PANGOLIN prompts users to label system executions based on feature involvement, and subsequently presents its spectrum-based feature localization analysis to users with the aid of a color-coded, hierarchic, and navigable visualization which was shown to be effective at conveying diagnostic information to users. Our evaluation shows that PANGOLIN accurately pinpoints feature implementations and is resilient to misclassifications by users. The tool can be downloaded at https://tqrg.github.io/pangolin/.", "doi": "10.1109/ase.2019.00119", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00119", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00119"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00119"}
{"title": "SiMPOSE - Configurable N-Way Program Merging Strategies for Superimposition-Based Analysis of Variant-Rich Software", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dennis Reuling", "Udo Kelter", "Sebastian Ruland", "Malte Lochau"], "abstract": "Modern software often exists in many different, yet similar versions and/or variants, usually derived from a common code base (e.g., via clone-and-own). In the context of product-line engineering, family-based analysis has shown very promising potential for improving efficiency in applying quality-assurance techniques to variant-rich software, as compared to a variant-by-variant approach. Unfortunately, these strategies rely on a product-line representation superimposing all program variants in a syntactically well-formed, semantically sound and variant-preserving manner, which is manually hard to obtain in practice. We demonstrate the SiMPOSE methodology for automatically generating superimpositions of N given program versions and/or variants facilitating family-based analysis of variant-rich software. SiMPOSE is based on a novel N-way model-merging technique operating at the level of control-flow automata (CFA) representations of C programs. CFAs constitute a unified program abstraction utilized by many recent software-analysis tools. We illustrate different merging strategies supported by SiMPOSE, namely variant-by-variant, N-way merging, incremental 2-way merging, and partition-based N/2-way merging, and demonstrate how SiMPOSE can be used to systematically compare their impact on efficiency and effectiveness of family-based unit-test generation. The SiMPOSE tool, the demonstration of its usage as well as related artifacts and documentation can be found at http://pi.informatik.uni-siegen.de/projects/variance/simpose.", "doi": "10.1109/ase.2019.00120", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00120", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00120"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00120"}
{"title": "VeriAbs : Verification by Abstraction and Test Generation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Afzal", "Asia A", "Avriti Chauhan", "Bharti Chimdyalwar", "Priyanka Darke", "Advaita Datar", "Shrawan Kumar", "R. Venkatesh"], "abstract": "Verification of programs continues to be a challenge and no single known technique succeeds on all programs. In this paper we present VeriAbs, a reachability verifier for C programs that incorporates a portfolio of techniques implemented as four strategies, where each strategy is a set of techniques applied in a specific sequence. It selects a strategy based on the kind of loops in the program. We analysed the effectiveness of the implemented strategies on the 3831 verification tasks from the ReachSafety category of the 8th International Competition on Software Verification (SV-COMP) 2019 and found that although classic techniques - explicit state model checking and bounded model checking, succeed on a majority of the programs, a wide range of further techniques are required to analyse the rest. A screencast of the tool is available at https://youtu.be/Hzh3PPiODwk.", "doi": "10.1109/ase.2019.00121", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00121", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00121"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00121"}
{"title": "SGUARD: A Feature-Based Clustering Tool for Effective Spreadsheet Defect Detection", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Da Li", "Huiyan Wang", "Chang Xu", "Ruiqing Zhang", "Shing-Chi Cheung", "Xiaoxing Ma"], "abstract": "Spreadsheets are widely used but subject to various defects. In this paper, we present SGUARD to effectively detect spreadsheet defects. SGUARD learns spreadsheet features to cluster cells with similar computational semantics, and then refines these clusters to recognize anomalous cells as defects. SGUARD well balances the trade-off between the precision (87.8%) and recall rate (71.9%) in the defect detection, and achieves an F-measure of 0.79, exceeding existing spreadsheet defect detection techniques. We introduce the SGUARD implementation and its usage by a video presentation (https://youtu.be/gNPmMvQVf5Q), and provide its public download repository (https://github.com/sheetguard/sguard).", "doi": "10.1109/ase.2019.00122", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00122", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00122"], "github": ["https://github.com/sheetguard/sguard"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00122"}
{"title": "PeASS: A Tool for Identifying Performance Changes at Code Level", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David Georg Reichelt", "Stefan Kühne", "Wilhelm Hasselbring"], "abstract": "We present PeASS (Performance Analysis of Software System versions), a tool for detecting performance changes at source code level that occur between different code versions. By using PeASS, it is possible to identify performance regressions that happened in the past to fix them. PeASS measures the performance of unit tests in different source code versions. To achieve statistic rigor, measurements are repeated and analyzed using an agnostic t-test. To execute a minimal amount of tests, PeASS uses a regression test selection. We evaluate PeASS on a selection of Apache Commons projects and show that 81% of all unit test covered performance changes can be found by PeASS. A video presentation is available at https://www.youtube.com/watch?v=RORFEGSCh6Y and PeASS can be downloaded from https://github.com/DaGeRe/peass.", "doi": "10.1109/ase.2019.00123", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00123", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00123"], "github": ["https://github.com/DaGeRe/peass"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00123"}
{"title": "VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bernd Fischer", "Salvatore La Torre", "Gennaro Parlato"], "abstract": "Swarm-based verification methods split a verification problem into a large number of independent simpler tasks and so exploit the availability of large numbers of cores to speed up verification. Lazy-CSeq is a BMC-based bug-finding tool for C programs using POSIX threads that is based on sequentialization. Here we present the tool VeriSmart 2.0, which extends Lazy-CSeq with a swarm-based bug-finding method. The key idea of this approach is to constrain the interleaving such that context switches can only happen within selected tiles (more specifically, contiguous code segments within the individual threads). This under-approximates the program's behaviours, with the number and size of tiles as additional parameters, which allows us to vary the complexity of the tasks. Overall, this significantly improves peak memory consumption and (wall-clock) analysis time.", "doi": "10.1109/ase.2019.00124", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00124", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00124"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00124"}
{"title": "CONVUL: An Effective Tool for Detecting Concurrency Vulnerabilities", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ruijie Meng", "Biyun Zhu", "Hao Yun", "Haicheng Li", "Yan Cai", "Zijiang Yang"], "abstract": "Concurrency vulnerabilities are extremely harmful and can be frequently exploited to launch severe attacks. Due to the non-determinism of multithreaded executions, it is very difficult to detect them. Recently, data race detectors and techniques based on maximal casual model have been applied to detect concurrency vulnerabilities. However, the former are ineffective and the latter report many false negatives. In this paper, we present CONVUL, an effective tool for concurrency vulnerability detection. CONVUL is based on exchangeable events, and adopts novel algorithms to detect three major kinds of concurrency vulnerabilities. In our experiments, CONVUL detected 9 of 10 known vulnerabilities, while other tools only detected at most 2 out of these 10 vulnerabilities. The 10 vulnerabilities are available at https://github.com/mryancai/ConVul.", "doi": "10.1109/ase.2019.00125", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00125", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00125"], "github": ["https://github.com/mryancai/ConVul"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00125"}
{"title": "DeepMutation++: A Mutation Testing Framework for Deep Learning Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qiang Hu", "Lei Ma", "Xiaofei Xie", "Bing Yu", "Yang Liu", "Jianjun Zhao"], "abstract": "Deep neural networks (DNNs) are increasingly expanding their real-world applications across domains, e.g., image processing, speech recognition and natural language processing. However, there is still limited tool support for DNN testing in terms of test data quality and model robustness. In this paper, we introduce a mutation testing-based tool for DNNs, DeepMutation++, which facilitates the DNN quality evaluation, supporting both feed-forward neural networks (FNNs) and stateful recurrent neural networks (RNNs). It not only enables to statically analyze the robustness of a DNN model against the input as a whole, but also allows to identify the vulnerable segments of a sequential input (e.g. audio input) by runtime analysis. It is worth noting that DeepMutation++ specially features the support of RNNs mutation testing. The tool demo video can be found on the project website https://sites.google.com/view/deepmutationpp.", "doi": "10.1109/ase.2019.00126", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00126", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00126"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00126"}
{"title": "Coverage-Guided Fuzzing for Feedforward Neural Networks", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaofei Xie", "Hongxu Chen", "Yi Li", "Lei Ma", "Yang Liu", "Jianjun Zhao"], "abstract": "Deep neural network (DNN) has been widely applied to safety-critical scenarios such as autonomous vehicle, security surveillance, and cyber-physical control systems. Yet, the incorrect behaviors of DNNs can lead to severe accidents and tremendous losses due to hidden defects. In this paper, we present DeepHunter, a general-purpose fuzzing framework for detecting defects of DNNs. DeepHunter is inspired by traditional grey-box fuzzing and aims to increase the overall test coverage by applying adaptive heuristics according to runtime feedback. Specifically, DeepHunter provides a series of seed selection strategies, metamorphic mutation strategies, and testing criteria customized to DNN testing; all these components support multiple built-in configurations which are easy to extend. We evaluated DeepHunter on two popular datasets and the results demonstrate the effectiveness of DeepHunter in achieving coverage increase and detecting real defects. A video demonstration which showcases the main features of DeepHunter can be found at https://youtu.be/s5DfLErcgrc.", "doi": "10.1109/ase.2019.00127", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00127", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00127"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00127"}
{"title": "Prema: A Tool for Precise Requirements Editing, Modeling and Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yihao Huang", "Jincao Feng", "Hanyue Zheng", "Jiayi Zhu", "Shang Wang", "Siyuan Jiang", "Weikai Miao", "Geguang Pu"], "abstract": "We present Prema, a tool for Precise Requirement Editing, Modeling and Analysis. It can be used in various fields for describing precise requirements using formal notations and performing rigorous analysis. By parsing the requirements written in formal modeling language, Prema is able to get a model which aptly depicts the requirements. It also provides different rigorous verification and validation techniques to check whether the requirements meet users' expectation and find potential errors. We show that our tool can provide a unified environment for writing and verifying requirements without using tools that are not well inter-related. For experimental demonstration, we use the requirements of the automatic train protection (ATP) system of CASCO signal co. LTD., the largest railway signal control system manufacturer of China. The code of the tool cannot be released here because the project is commercially confidential. However, a demonstration video of the tool is available at https://youtu.be/BX0yv8pRMWs.", "doi": "10.1109/ase.2019.00128", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00128", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00128"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00128"}
{"title": "TsmartGP: A Tool for Finding Memory Defects with Pointer Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuexing Wang", "Guang Chen", "Min Zhou", "Ming Gu", "Jiaguang Sun"], "abstract": "Precise pointer analysis is desired since it is a core technique to find memory defects. There are several dimensions of pointer analysis precision, flow sensitivity, context sensitivity, field sensitivity and path sensitivity. For static analysis tools utilizing pointer analysis, considering all dimensions is difficult because the trade-off between precision and efficiency should be balanced. This paper presents TsmartGP, a static analysis tool for finding memory defects in C programs with a precise and efficient pointer analysis. The pointer analysis algorithm is flow, context, field, and quasi path sensitive. Control flow automatons are the key structures for our analysis to be flow sensitive. Function summaries are applied to get context information and elements of aggregate structures are handled to improve precision. Path conditions are used to filter unreachable paths. For efficiency, a multi-entry mechanism is proposed. Utilizing the pointer analysis algorithm, we implement a checker in TsmartGP to find uninitialized pointer errors in 13 real-world applications. Cppcheck and Clang Static Analyzer are chosen for comparison. The experimental results show that TsmartGP can find more errors while its accuracy is also higher than Cppcheck and Clang Static Analyzer.", "doi": "10.1109/ase.2019.00129", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00129", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00129"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00129"}
{"title": "Ares: Inferring Error Specifications through Static Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chi Li", "Min Zhou", "Zuxing Gu", "Ming Gu", "Hongyu Zhang"], "abstract": "Misuse of APIs happens frequently due to misunderstanding of API semantics and lack of documentation. An important category of API-related defects is the error handling defects, which may result in security and reliability flaws. These defects can be detected with the help of static program analysis, provided that error specifications are known. The error specification of an API function indicates how the function can fail. Writing error specifications manually is time-consuming and tedious. Therefore, automatic inferring the error specification from API usage code is preferred. In this paper, we present Ares, a tool for automatic inferring error specifications for C code through static analysis. We employ multiple heuristics to identify error handling blocks and infer error specifications by analyzing the corresponding condition logic. Ares is evaluated on 19 real world projects, and the results reveal that Ares outperforms the state-of-the-art tool APEx by 37% in precision. Ares can also identify more error specifications than APEx. Moreover, the specifications inferred from Ares help find dozens of API-related bugs in well-known projects such as OpenSSL, among them 10 bugs are confirmed by developers. Video: https://youtu.be/nf1QnFAmu8Q. Repository: https://github.com/lc3412/Ares.", "doi": "10.1109/ase.2019.00130", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00130", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00130"], "github": ["https://github.com/lc3412/Ares"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00130"}
{"title": "PMExec: An Execution Engine of Partial UML-RT Models", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mojtaba Bagherzadeh", "Karim Jahed", "Nafiseh Kahani", "Juergen Dingel"], "abstract": "This paper presents PMExec, a tool that supports the execution of partial UML-RT models. To this end, the tool implements the following steps: static analysis, automatic refinement, and input-driven execution. The static analysis that respects the execution semantics of UML-RT models is used to detect problematic model elements, i.e., elements that cause problems during execution due to the partiality. Then, the models are refined automatically using model transformation techniques, which mostly add decision points where missing information can be supplied. Third, the refined models are executed, and when the execution reaches the decision points, input required to continue the execution is obtained either interactively or from a script that captures how to deal with partial elements. We have evaluated PMExec using several use-cases that show that the static analysis, refinement, and application of user input can be carried out with reasonable performance, and that the overhead of approach is manageable. https://youtu.be/BRKsselcMnc Note: Interested readers can refer to [1] for a thorough discussion and evaluation of this work.", "doi": "10.1109/ase.2019.00131", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00131", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00131"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00131"}
{"title": "mCUTE: A Model-Level Concolic Unit Testing Engine for UML State Machines", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Reza Ahmadi", "Karim Jahed", "Juergen Dingel"], "abstract": "Model Driven Engineering (MDE) techniques raise the level of abstraction at which developers construct software. However, modern cyber-physical systems are becoming more prevalent and complex and hence software models that represent the structure and behavior of such systems still tend to be large and complex. These models may have numerous if not infinite possible behaviors, with complex communications between their components. Appropriate software testing techniques to generate test cases with high coverage rate to put these systems to test at the model-level (without the need to understand the underlying code generator or refer to the generated code) are therefore important. Concolic testing, a hybrid testing technique that benefits from both concrete and symbolic execution, gains a high execution coverage and is used extensively in the industry for program testing but not for software models. In this paper, we present a novel technique and its tool mCUTE1, an open source 2 model-level concolic testing engine. We describe the implementation of our tool in the context of Papyrus-RT, an open source Model Driven Engineering (MDE) tool based on UML-RT, and report the results of validating our tool using a set of benchmark models.", "doi": "10.1109/ase.2019.00132", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00132", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00132"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00132"}
{"title": "Manticore: A User-Friendly Symbolic Execution Framework for Binaries and Smart Contracts", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mark Mossberg", "Felipe Manzano", "Eric Hennenfent", "Alex Groce", "Gustavo Grieco", "Josselin Feist", "Trent Brunson", "Artem Dinaburg"], "abstract": "An effective way to maximize code coverage in software tests is through dynamic symbolic execution—a technique that uses constraint solving to systematically explore a program's state space. We introduce an open-source dynamic symbolic execution framework called Manticore for analyzing binaries and Ethereum smart contracts. Manticore's flexible architecture allows it to support both traditional and exotic execution environments, and its API allows users to customize their analysis. Here, we discuss Manticore's architecture and demonstrate the capabilities we have used to find bugs and verify the correctness of code for our commercial clients.", "doi": "10.1109/ase.2019.00133", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00133", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00133"], "github": ["https://github.com/trailofbits/manticore"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00133"}
{"title": "BuRRiTo: A Framework to Extract, Specify, Verify and Analyze Business Rules", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pavan Kumar Chittimalli", "Kritika Anand", "Shrishti Pradhan", "Sayandeep Mitra", "Chandan Prakash", "Rohit Shere", "Ravindra Naik"], "abstract": "An enterprise system operates business by providing various services that are guided by set of certain business rules (BR) and constraints. These BR are usually written using plain Natural Language in operating procedures, terms and conditions, and other documents or in source code of legacy enterprise systems. For implementing the BR in a software system, expressing them as UML use-case specifications, or preparing for Merger & Acquisition (M&A) activity, analysts manually interpret the documents or try to identify constraints from the source code, leading to potential discrepancies and ambiguities. These issues in the software system can be resolved only after testing, which is a very tedious and expensive activity. To minimize such errors and efforts, we propose BuRRiTo framework consisting of automatic extraction of BR by mining documents and source code, ability to clean them of various anomalies like inconsistency, redundancies, conflicts, etc. and able to analyze the functional gaps present and performing semantic querying and searching.", "doi": "10.1109/ase.2019.00134", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00134", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00134"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00134"}
{"title": "XRaSE: Towards Virtually Tangible Software using Augmented Reality", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rohit Mehra", "Vibhu Saujanya Sharma", "Vikrant Kaulgud", "Sanjay Podder"], "abstract": "Software engineering has seen much progress in recent past including introduction of new methodologies, new paradigms for software teams, and from smaller monolithic applications to complex, intricate, and distributed software applications. However, the way we represent, discuss, and collaborate on software applications throughout the software development life cycle is still primarily using the source code, textual representations, or charts on 2D computer screens - the confines of which have long limited how we visualize and comprehend software systems. In this paper, we present XRaSE, a novel prototype implementation that leverages augmented reality to visualize a software application as a virtually tangible entity. This immersive approach is aimed at making activities like application comprehension, architecture analysis, knowledge communication, and analysis of a software's dynamic aspects, more intuitive, richer and collaborative.", "doi": "10.1109/ase.2019.00135", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00135", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00135"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00135"}
{"title": "MuSC: A Tool for Mutation Testing of Ethereum Smart Contract", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zixin Li", "Haoran Wu", "Jiehui Xu", "Xingya Wang", "Lingming Zhang", "Zhenyu Chen"], "abstract": "The smart contract cannot be modified when it has been deployed on a blockchain. Therefore, it must be given thorough test before its being deployed. Mutation testing is considered as a practical test methodology to evaluate the adequacy of software testing. In this paper, we introduce MuSC, a mutation testing tool for Ethereum Smart Contract (ESC). It can generate numerous mutants at a fast speed and supports the automatic operations such as creating test nets, deploying and executing tests. Specially, MuSC implements a set of novel mutation operators w.r.t ESC programming language, Solidity. Therefore, it can expose the defects of smart contracts to a certain degree. The demonstration video of MuSC is available at https: //youtu.be/3KBKXJPVjbQ, and the source code can be downloaded at https://github.com/belikout/MuSC-Tool-Demo-repo.", "doi": "10.1109/ase.2019.00136", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00136", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00136"], "github": ["https://github.com/belikout/MuSC-Tool-Demo-repo"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00136"}
{"title": "Lancer: Your Code Tell Me What You Need", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shufan Zhou", "Beijun Shen", "Hao Zhong"], "abstract": "Programming is typically a difficult and repetitive task. Programmers encounter endless problems during programming, and they often need to write similar code over and over again. To prevent programmers from reinventing wheels thus increase their productivity, we propose a context-aware code-to-code recommendation tool named Lancer. With the support of a Library-Sensitive Language Model (LSLM) and the BERT model, Lancer is able to automatically analyze the intention of the incomplete code and recommend relevant and reusable code samples in real-time. A video demonstration of Lancer can be found at https://youtu.be/tO9nhqZY35g. Lancer is open source and the code is available at https://github.com/sfzhou5678/Lancer.", "doi": "10.1109/ase.2019.00137", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00137", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00137"], "github": ["https://github.com/sfzhou5678/Lancer"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00137"}
{"title": "PHANTA: Diversified Test Code Quality Measurement for Modern Software Development", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Susumu Tokumoto", "Kuniharu Takayama"], "abstract": "Test code is becoming more essential to the modern software development process. However, practitioners often pay inadequate attention to key aspects of test code quality, such as bug detectability, maintainability and speed. Existing tools also typically report a single test code quality measure, such as code coverage, rather than a diversified set of metrics. To measure and visualize quality of test code in a comprehensive fashion, we developed an integrated test code analysis tool called Phanta. In this show case, we posit that the enhancement of test code quality is key to modernizing software development, and show how Phanta's techniques measure the quality using mutation analysis, test code clone detection, and so on. Further, we present an industrial case study where Phanta was applied to analyze test code in a real Fujitsu project, and share lessons learned from the case study.", "doi": "10.1109/ase.2019.00138", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00138", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00138"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00138"}
{"title": "Test Automation and Its Limitations: A Case Study", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ahyoung Sung", "Sangjun Kim", "Yangsu Kim", "Younggun Jang", "Jongin Kim"], "abstract": "Modern embedded systems are increasingly complex and contain multiple software layers from BSP (Board Support Packages) to OS to middleware to AI (Artificial Intelligence) algorithms like perception and voice recognition. Integrations of inter-layer and intra-layer in embedded systems provide dedicated services such as taking a picture or movie-streaming. Accordingly, it gets more complicated to find out the root cause of a system failure. This industrial proposal describes a difficulty of testing embedded systems, and presents a case study in terms of integration testing.", "doi": "10.1109/ase.2019.00139", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00139", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00139"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00139"}
{"title": "PTracer: A Linux Kernel Patch Trace Bot", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yang Wen", "Jicheng Cao", "Shengyu Cheng"], "abstract": "We present PTracer, a Linux kernel patch trace bot based on an improved PatchNet. PTracer continuously monitors new patches in the git repository of the mainline Linux kernel, filters out unconcerned ones, classifies the rest as bug-fixing or non bug-fixing patches, and reports bug-fixing patches to the kernel experts of commercial operating systems. We use the patches in February 2019 of the mainline Linux kernel to perform the test. As a result, PTracer recommended 151 patches to CGEL kernel experts out of 5,142, and 102 of which were accepted. PTracer has been successfully applied to a commercial operating system and has the advantages of improving software quality and saving labor cost.", "doi": "10.1109/ase.2019.00140", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00140", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00140"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00140"}
{"title": "Trusted Software Supply Chain", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kapil Singi", "R. P. Jagadeesh Chandra Bose", "Sanjay Podder", "Adam P. Burden"], "abstract": "Modern software delivery happens in a geographically distributed environment and resembles like a supply chain – consists of various participants, involves various phases, needs adherence to multiple regulations and needs to maintain artifacts' integrity throughout the delivery phases. This shift in software development brings along with it several challenges ranging from communication of information/knowledge, coordination and control of teams, activities adhering to goals and policies and artifacts adhering to quality, visibility, and management. %Software development processes to be transparent, verifiable, compliant, and accountable thereby increasing software's trustworthiness. With the dispersion of centralized control over software delivery to autonomous delivery organizations, the variety of processes and tools used turns transparency into opacity as autonomous teams use different software processes, tools, and metrics, leading to issues like ineffective compliance monitoring, friction prone coordination, and lack of provenance, and thereby trust. In this paper, we present a delivery governance framework based on distributed ledger technology that uses a notion of 'software telemetry' to record data from disparate delivery partners and enables compliance monitoring and adherence, provenance and traceability, transparency, and thereby trust.", "doi": "10.1109/ase.2019.00141", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00141", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00141"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00141"}
{"title": "A Journey Towards Providing Intelligence and Actionable Insights to Development Teams in Software Delivery", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vibhu Saujanya Sharma", "Rohit Mehra", "Sanjay Podder", "Adam P. Burden"], "abstract": "For delivering high-quality artifacts within the budget and on schedule, software delivery teams ideally should have a holistic and in-process view of the current health and future trajectory of the project. However, such insights need to be at the right level of granularity and need to be derived typically from a heterogeneous project environment, in a way that helps development team members with their tasks at hand. Due to client mandates, software delivery project environments employ many disparate tools and teams tend to be distributed, thus making the relevant information retrieval, insight generation, and developer intelligence augmentation process fairly complex. In this paper, we discuss our journey in this area spanning across facets like software project modelling and new development metrics, studying developer priorities, adoption of new metrics, and different approaches of developer intelligence augmentation. Finally, we present our exploration of new immersive technologies for human-centered software engineering.", "doi": "10.1109/ase.2019.00142", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00142", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00142"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00142"}
{"title": "Better Development of Safety Critical Systems: Chinese High Speed Railway System Development Experience Report", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["ZhiWei Wu", "Jing Liu", "Xiang Chen"], "abstract": "Ensure the correctness of safety critical systems play a key role in the worldwide software engineering. Over the past years we have been helping CASCO Signal Ltd which is the Chinese biggest high speed railway company to develop high speed railway safety critical software. We have also contributed specific methods for developing better safety critical software, including a search-based model-driven software development approach which uses SysML diagram refinement method to construct SysML model and SAT solver to check the model. This talk aims at sharing the challenge of developing high speed railway safety critical system, what we learn from develop a safety critical software with a Chinese high speed railway company, and we use ZC subsystem as a case study to show the systematic model-driven safety critical software development method.", "doi": "10.1109/ase.2019.00143", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00143", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00143"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00143"}
{"title": "Improving Collaboration Efficiency in Fork-Based Development", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shurui Zhou"], "abstract": "Fork-based development is a lightweight mechanism that allows developers to collaborate with or without explicit coordination. Although it is easy to use and popular, when developers each create their own fork and develop independently, their contributions are usually not easily visible to others. When the number of forks grows, it becomes very difficult to maintain an overview of what happens in individual forks, which would lead to additional problems and inefficient practices: lost contributions, redundant development, fragmented communities, and so on. Facing the problems mentioned above, we developed two complementary strategies: (1) Identifying existing best practices and suggesting evidence-based interventions for projects that are inefficient; (2) designing new interventions that could improve the awareness of a community using fork-based development, and help developers to detect redundant development to reduce unnecessary effort.", "doi": "10.1109/ase.2019.00144", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00144", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00144"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00144"}
{"title": "Inference of Properties from Requirements and Automation of Their Formal Verification", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marina Reich"], "abstract": "Over the past decades, various techniques for the application of formal program analysis of software for embedded systems have been proposed. However, the application of formal methods for software verification is still limited in practise. It is acknowledged that the task of formally stating requirements by specifying the formal properties is a major hindrance. The verification step itself has its shortcoming in its scalability and its limitation to predefined proof tactics in case of automated theorem proving (ATP). These constraints are reduced today by the interaction of the user with the theorem prover (TP) during the execution of the proof. However, this is difficult for non-experts. The objectives of the presented PhD project are the automated inference of declarative property specifications from example data specified by the engineer for a function under development and their automated verification on abstract model level and on code level. We propose the meta-model for Scenario Modeling Language (SML) that allows to specify example data. For the automated property generation we are motivated by Inductive Logic Programming (ILP) techniques for first-order logic in pure mathematics. We propose modifications to its algorithm that allow to process the information that is incorporated in the meta-model of SML. However, this technique is expected to produce too many uninteresting properties. To turn this weakness into strength, our approach proposes to tailor the algorithm towards selection of the right properties that facilitate the automation of the proof. Automated property generation and less user interaction with the prover will leverage formal verification as it will relieve the engineer in the specification as well as in proofing tasks.", "doi": "10.1109/ase.2019.00145", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00145", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00145"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00145"}
{"title": "Generating Tests to Analyse Dynamically-Typed Programs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stephan Lukasczyk"], "abstract": "The increasing popularity of dynamically-typed programming languages, such as JavaScript or Python, requires specific support methods for developers to avoid pitfalls arising from the dynamic nature of these languages. Static analyses are frequently used but the dynamic type systems limit their applicability. Dynamic analyses, in contrast, depend on the execution of the code under analysis, and thus depend on the quality of existing tests. This quality of the test suite can be improved by the use of automated test generation but automated test generation for dynamically-typed programming languages itself is hard due to the lack of type information in the programs. The limitations of each of these approaches will be overcome by iteratively combining test generation with static and dynamic analysis techniques for dynamically-typed programs.", "doi": "10.1109/ase.2019.00146", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00146", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00146"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00146"}
{"title": "Improving Patch Quality by Enhancing Key Components of Automatic Program Repair", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mauricio Soto"], "abstract": "The error repair process in software systems is, historically, a resource-consuming task that relies heavily in developer manual effort. Automatic program repair approaches enable the repair of software with minimum human interaction, therefore, mitigating the burden from developers. However, a problem automatically generated patches commonly suffer is generating low-quality patches (which overfit to one program specification, thus not generalizing to an independent oracle evaluation). This work proposes a set of mechanisms to increase the quality of plausible patches including an analysis of test suite behavior and their key characteristics for automatic program repair, analyzing developer behavior to inform the mutation operator selection distribution, and a study of patch diversity as a means to create consolidated higher quality fixes.", "doi": "10.1109/ase.2019.00147", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00147", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00147"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00147"}
{"title": "Automatic Generation of Graphical User Interface Prototypes from Unrestricted Natural Language Requirements", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kristian Kolthoff"], "abstract": "High-fidelity GUI prototyping provides a meaningful manner for illustrating the developers' understanding of the requirements formulated by the customer and can be used for productive discussions and clarification of requirements and expectations. However, high-fidelity prototypes are time-consuming and expensive to develop. Furthermore, the interpretation of requirements expressed in informal natural language is often error-prone due to ambiguities and misunderstandings. In this dissertation project, we will develop a methodology based on Natural Language Processing (NLP) for supporting GUI prototyping by automatically translating Natural Language Requirements (NLR) into a formal Domain-Specific Language (DSL) describing the GUI and its navigational schema. The generated DSL can be further translated into corresponding target platform prototypes and directly provided to the user for inspection. Most related systems stop after generating artifacts, however, we introduce an intelligent and automatic interaction mechanism that allows users to provide natural language feedback on generated prototypes in an iterative fashion, which accordingly will be translated into respective prototype changes.", "doi": "10.1109/ase.2019.00148", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00148", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00148"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00148"}
{"title": "Automatically Repairing Binary Programs Using Adapter Synthesis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vaibhav Sharma"], "abstract": "Bugs in commercial software and third-party components are an undesirable and expensive phenomenon. Such software is usually released to users only in binary form. The lack of source code renders users of such software dependent on their software vendors for repairs of bugs. Such dependence is even more harmful if the bugs introduce new vulnerabilities in the software. Automatically repairing security and functionality bugs in binary code increases software robustness without any developer effort. In this research, we propose development of a binary program repair tool that uses existing bug-free fragments of code to repair buggy code.", "doi": "10.1109/ase.2019.00149", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00149", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00149"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00149"}
{"title": "Tackling Build Failures in Continuous Integration", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Foyzul Hassan"], "abstract": "In popular continuous integration(CI) practice, coding is followed by building, integration and system testing, pre-release inspection, and deploying artifacts. This can reduce integration risk and speed up the development process. But large number of CI build failures may interrupt the normal software development process. So, the failures need to be analyzed and fixed quickly. Although various automated program repair techniques have great potential to resolve software failures, the existing techniques mostly focus on repairing source code. So, those techniques cannot directly help resolve software build failures. Apart from that, a special challenge to fix build failures in CI environment is that the failures are often involved with both source code and build scripts. This paper outlines promising preliminary work towards automatic build repair in CI environment that involves both source code and build script. As the first step, we conducted an empirical study on software build failures and build fix patterns. Based on the findings of the empirical study, we developed an approach that can automatically fix build errors involving build scripts. We plan to extend this repair approach considering both source code and build script. Moreover, we plan to quantify our automatic fixes by user study and comparison between fixes generated by our approach and actual fixes.", "doi": "10.1109/ase.2019.00150", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00150", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00150"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00150"}
{"title": "Enabling Continuous Improvement of a Continuous Integration Process", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Carmine Vassallo"], "abstract": "Continuous Integration (CI) is a widely-adopted software engineering practice. Despite its undisputed benefits, like higher software quality and improved developer productivity, mastering CI is not easy. Among the several barriers when transitioning to CI, developers need to face a new type of software failures (i.e., build failures) that requires them to understand complex build logs. Even when a team has successfully introduced a CI culture, living up to its principles and improving the CI practice are also challenging. In my research, I want to provide developers with the right support for establishing CI and the proper recommendations for continuously improving their CI process.", "doi": "10.1109/ase.2019.00151", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00151", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00151"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00151"}
{"title": "Retrieve and Refine: Exemplar-Based Neural Comment Generation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bolin Wei"], "abstract": "Code comment generation is a crucial task in the field of automatic software development. Most previous neural comment generation systems used an encoder-decoder neural network and encoded only information from source code as input. Software reuse is common in software development. However, this feature has not been introduced to existing systems. Inspired by the traditional IR-based approaches, we propose to use the existing comments of similar source code as exemplars to guide the comment generation process. Based on an open source search engine, we first retrieve a similar code and treat its comment as an exemplar. Then we applied a seq2seq neural network to conduct an exemplar-based comment generation. We evaluate our approach on a large-scale Java corpus, and experimental results demonstrate that our model significantly outperforms the state-of-the-art methods.", "doi": "10.1109/ase.2019.00152", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00152", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00152"], "github": ["https://github.com/Gompyn/re2com-opensource"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00152"}
{"title": "API Design Implications of Boilerplate Client Code", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daye Nam"], "abstract": "Designing usable APIs is critical to developers' productivity and software quality but is quite difficult. In this paper, I focus on \"boilerplate\" code, sections of code that have to be included in many places with little or no alteration, which many experts in API design have said can be an indicator of API usability problems. I investigate what properties make code count as boilerplate, and present a novel approach to automatically mine boilerplate code from a large set of client code. The technique combines an existing API usage mining algorithm, with novel filters using AST comparison and graph partitioning. With boilerplate candidates identified by the technique, I discuss how this technique could help API designers in reviewing their design decisions and identifying usability issues.", "doi": "10.1109/ase.2019.00153", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00153", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00153"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00153"}
{"title": "Compile-Time Detection of Machine Image Sniping", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Kellogg"], "abstract": "Machine image sniping is a difficult-to-detect security vulnerability in cloud computing code. When programmatically initializing a machine, a developer specifies a machine image (operating system and file system). The developer should restrict the search to only those machine images which their organization controls: otherwise, an attacker can insert a similarly-named malicious image into the public database, where it might be selected instead of the image the developer intended. We present a lightweight type and effect system that detects requests to a cloud provider that are vulnerable to an image sniping attack, or proves that no vulnerable request exists in a codebase. We prototyped our type system for Java programs that initialize Amazon Web Services machines, and evaluated it on more than 500 codebases, detecting 14 vulnerable requests with only 3 false positives.", "doi": "10.1109/ase.2019.00154", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00154", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00154"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00154"}
{"title": "An Image-Inspired and CNN-Based Android Malware Detection Approach", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xusheng Xiao"], "abstract": "Abstract-Until 2017, Android smartphones occupied approximately 87% of the smartphone market. The vast market also promotes the development of Android malware. Nowadays, the number of malware targeting Android devices found daily is more than 38,000. With the rapid progress of mobile application programming and anti-reverse-engineering techniques, it is harder to detect all kinds of malware. To address challenges in existing detection techniques, such as data obfuscation and limited code coverage, we propose a detection approach that directly learns features of malware from Dalvik bytecode based on deep learning technique (CNN). The average detection time of our model is0.22 seconds, which is much lower than other existing detection approaches. In the meantime, the overall accuracy of our model achieves over 93%.", "doi": "10.1109/ase.2019.00155", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00155", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00155"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00155"}
{"title": "Toward Practical Automatic Program Repair", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Ghanbari"], "abstract": "Automated program repair (APR) reduces the burden of debugging by directly suggesting likely fixes for the bugs. We believe scalability, applicability, and accurate patch validation are among the main challenges for building practical APR techniques that the researchers in this area are dealing with. In this paper, we describe the steps that we are taking toward addressing these challenges.", "doi": "10.1109/ase.2019.00156", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00156", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00156"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00156"}
{"title": "User Preference Aware Multimedia Pricing Model using Game Theory and Prospect Theory for Wireless Communications", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Krishna Murthy Kattiyan Ramamoorthy"], "abstract": "Providing user satisfaction is a major concern for on-demand multimedia service providers and Internet carriers in Wireless Communications. Traditionally, user satisfaction was measured objectively in terms of throughput and latency. Nowadays the user satisfaction is measured using subjective metrices such as Quality of Experience (QoE). Recently, Smart Media Pricing (SMP) was conceptualized to price the QoE rather than the binary data traffic in multimedia services. In this research, we have leveraged the SMP concept to chalk up a QoE-sensitive multimedia pricing framework to allot price, based on the user preference and multimedia quality achieved by the customer. We begin by defining the utility equations for the provider-carrier and the customer. Then we translate the profit maximizing interplay between the parties into a two-stage Stackelberg game. We model the user personal preference using Prelec weighting function which follows the postulates Prospect Theory (PT). An algorithm has been developed to implement the proposed pricing scheme and determine the Nash Equilibrium. Finally, the proposed smart pricing scheme was tested against the traditional pricing method and simulation results indicate a significant boost in the utility achieved by the mobile customers.", "doi": "10.1109/ase.2019.00157", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00157", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00157"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00157"}
{"title": "An Approach for Investigating Emotion Dynamics in Software Development", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Krishna Prasad Neupane"], "abstract": "Emotion awareness is critical to interpersonal communication, including that in software development. The SE community has studied emotion in software development using isolated emotion states but it has not considered the dynamic nature of emotion. To investigate the emotion dynamics, SE community needs an effective approach. In this paper, we propose such an approach which can automatically collect project teams' communication records, identify the emotions and their intensities in them, model the emotion dynamics into time series, and provide efficient data management. We demonstrate that this approach can provide end-to-end support for various emotion awareness research and practices through automated data collection, modeling, storage, analysis, and presentation using the IPython's project data on GitHub.", "doi": "10.1109/ase.2019.00158", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00158", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00158"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00158"}
{"title": "Verifying Determinism in Sequential Programs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rashmi Mudduluru"], "abstract": "A nondeterministic program is difficult to test and debug. Nondeterminism occurs even in sequential programs: for example, iterating over the elements of a hash table can result in diverging test results. We have created a type system that can express whether a computation is deterministic, nondeterministic, or ordernondeterministic (like a set). While state-of-the-art nondeterminism detection tools unsoundly rely on observing run-time output, our approach soundly verifies determinism at compile time. Our implementation found previously-unknown nondeterminism errors in a 24,000 line program that had been heavily vetted by its developers.", "doi": "10.1109/ase.2019.00159", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00159", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00159"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00159"}
{"title": "Empirical Study of Python Call Graph", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Li Yu"], "abstract": "In recent years, the extensive application of the Python language has made its analysis work more and more valuable. Many static analysis algorithms need to rely on the construction of call graphs. In this paper, we did a comparative empirical analysis of several widely used Python static call graph tools both quantitatively and qualitatively. Experiments show that the existing Python static call graph tools have a large difference in the construction effectiveness, and there is still room for improvement.", "doi": "10.1109/ase.2019.00160", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00160", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00160"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00160"}
{"title": "Crowdsourced Report Generation via Bug Screenshot Understanding", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shengcheng Yu"], "abstract": "Quality control is a challenge of crowdsourcing, especially in software testing. As some unprofessional workers involved, low-quality yieldings may hinder crowdsourced testing from satisfying requesters' requirements. Therefore, it is in demand to assist crowdworkers to raise bug report quality. In this paper, we propose a novel auxiliary method, namely CroReG, to generate crowdsourcing bug reports by analyzing bug screenshots uploaded by crowdworkers with image understanding techniques. The preliminary experiment results show that CroReG can effectively generate bug reports containing accurate screenshot captions and providing positive guidance for crowdworkers.", "doi": "10.1109/ase.2019.00161", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00161", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00161"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00161"}
{"title": "Boosting Neural Commit Message Generation with Code Semantic Analysis", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shuyao Jiang"], "abstract": "It has been long suggested that commit messages can greatly facilitate code comprehension. However, developers may not write good commit messages in practice. Neural machine translation (NMT) has been suggested to automatically generate commit messages. Despite the efforts in improving NMT algorithms, the quality of the generated commit messages is not yet satisfactory. This paper, instead of improving NMT algorithms, suggests that proper preprocessing of code changes into concise inputs is quite critical to train NMT. We approach it with semantic analysis of code changes. We collect a real-world dataset with 50k+ commits of popular Java projects, and verify our idea with comprehensive experiments. The results show that preprocessing inputs with code semantic analysis can improve NMT significantly. This work sheds light to how to apply existing DNNs designed by the machine learning community, e.g., NMT models, to complete software engineering tasks.", "doi": "10.1109/ase.2019.00162", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00162", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00162"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00162"}
{"title": "Towards Comprehensible Representation of Controllers using Machine Learning", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gargi Balasubramaniam"], "abstract": "From the point of view of a software engineer, having safe and optimal controllers for real life systems like cyber physical systems is a crucial requirement before deployment. Given the mathematical model of these systems along with their specifications, model checkers can be used to synthesize controllers for them. The given work proposes novel approaches for making controller analysis easier by using machine learning to represent the controllers synthesized by model checkers in a succinct manner, while also incorporating the domain knowledge of the system. It also proposes the implementation of a visualization tool which will be integrated into existing model checkers. A lucid controller representation along with a tool to visualize it will help the software engineer debug and monitor the system much more efficiently.", "doi": "10.1109/ase.2019.00163", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00163", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00163"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00163"}
{"title": "A Machine Learning Based Approach to Identify SQL Injection Vulnerabilities", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kevin Zhang"], "abstract": "This paper presents a machine learning classifier designed to identify SQL injection vulnerabilities in PHP code. Both classical and deep learning based machine learning algorithms were used to train and evaluate classifier models using input validation and sanitization features extracted from source code files. On ten-fold cross validations a model trained using Convolutional Neural Network(CNN) achieved the highest precision (95.4%), while a model based on Multilayer Perceptron(MLP) achieved the highest recall (63.7%) and the highest f-measure (0.746).", "doi": "10.1109/ase.2019.00164", "arxiv_id": "https://doi.org/10.1109/ASE.2019.00164", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE.2019.00164"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE.2019.00164"}
{"title": "35th IEEE/ACM International Conference on Automated Software Engineering, ASE 2020, Melbourne, Australia, September 21-25, 2020", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": [], "abstract": null, "doi": "10.1145/3324884", "arxiv_id": "https://doi.org/10.1145/3324884", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884"}
{"title": "Safety and Robustness for Deep Learning with Provable Guarantees", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marta Kwiatkowska"], "abstract": "Computing systems are becoming ever more complex, with decisions increasingly often based on deep learning components. A wide variety of applications are being developed, many of them safety-critical, such as self-driving cars and medical diagnosis. Since deep learning is unstable with respect to adversarial perturbations, there is a need for rigorous software development methodologies that encompass machine learning components. This lecture will describe progress with developing automated verification and testing techniques for deep neural networks to ensure safety and robustness of their decisions with respect to bounded input perturbations. The techniques exploit Lipschitz continuity of the networks and aim to approximate, for a given set of inputs, the reachable set of network outputs in terms of lower and upper bounds, in anytime manner, with provable guarantees. We develop novel algorithms based on feature-guided search, games, global optimisation and Bayesian methods, and evaluate them on state-of-the-art networks. The lecture will conclude with an overview of the challenges in this field.", "doi": "10.1145/3324884.3418901", "arxiv_id": "https://doi.org/10.1145/3324884.3418901", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418901"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418901"}
{"title": "Is Software Engineering Research Addressing Software Engineering Problems? (Keynote)", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gail C. Murphy"], "abstract": "Brian Randell described software engineering as \"the multi-person development of multi-version programs\". David Parnas expressed that this \"pithy phrase implies everything that differentiates software engineering from other programming\" (Parnas, 2011). How does current software engineering research compare against this definition? Is there too much focus currently on research into problems and techniques more associated with programming than software engineering? Are there opportunities to use Randell's description of software engineering to guide the community to new research directions? In this extended abstract, I motivate the keynote, which explores these questions and discusses how a consideration of the development streams used by multiple individuals to produce multiple versions of software opens up new avenues for impactful software engineering research.", "doi": "10.1145/3324884.3417103", "arxiv_id": "https://doi.org/10.1145/3324884.3417103", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3417103"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3417103"}
{"title": "Accelerating All-SAT Computation with Short Blocking Clauses", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yueling Zhang", "Geguang Pu", "Jun Sun"], "abstract": "The All-SAT (All-SATisfiable) problem focuses on finding all satisfiable assignments of a given propositional formula, whose applications include model checking, automata construction, and logic minimization. A typical ALL-SAT solver is normally based on iteratively computing satisfiable assignments of the given formula. In this work, we introduce BASolver, a backbone-based All-SAT solver for propositional formulas. Compared to the existing approaches, BASolver generates shorter blocking clauses by removing backbone variables from the partial assignments and the blocking clauses. We compare BASolver with 4 existing ALL-SAT solvers, namely MBlocking, BC, BDD, and NBC. Experimental results indicate that although finding all the backbone variables consumes additional computing time, BASolver is still more efficient than the existing solvers because of the shorter blocking clauses and the backbone variables used in it.", "doi": "10.1145/3324884.3416569", "arxiv_id": "https://doi.org/10.1145/3324884.3416569", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416569"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416569"}
{"title": "A Predictive Analysis for Detecting Deadlock in MPI Programs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yu Huang", "Benjamin Ogles", "Eric Mercer"], "abstract": "A common problem in MPI programs is deadlock: when two or more processes are blocked indefinitely due to a circular communication dependency. Automatically detecting deadlock is difficult due to its schedule-dependent nature. This paper presents a predictive analysis for single-path MPI programs that observes a single program execution and then determines whether any other feasible schedule of the program can lead to a deadlock. The analysis works by identifying problematic communication patterns in a dependency graph to form a set of deadlock candidates. The deadlock candidates are filtered by an abstract machine and ultimately tested for reachability by an SMT solver with an efficient encoding for deadlock. This approach quickly yields a set of high probability deadlock candidates useful for reasoning about complex codes and yields higher performance overall in many cases compared to other state-of-the-art analyses. The analysis is sound and complete for single-path MPI programs on a given input.", "doi": "10.1145/3324884.3416588", "arxiv_id": "https://doi.org/10.1145/3324884.3416588", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416588"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416588"}
{"title": "Learning to Handle Exceptions", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jian Zhang", "Xu Wang", "Hongyu Zhang", "Hailong Sun", "Yanjun Pu", "Xudong Liu"], "abstract": "Exception handling is an important built-in feature of many modern programming languages such as Java. It allows developers to deal with abnormal or unexpected conditions that may occur at runtime in advance by using try-catch blocks. Missing or improper implementation of exception handling can cause catastrophic consequences such as system crash. However, previous studies reveal that developers are unwilling or feel it hard to adopt exception handling mechanism, and tend to ignore it until a system failure forces them to do so. To help developers with exception handling, existing work produces recommendations such as code examples and exception types, which still requires developers to localize the try blocks and modify the catch block code to fit the context. In this paper, we propose a novel neural approach to automated exception handling, which can predict locations of try blocks and automatically generate the complete catch blocks. We collect a large number of Java methods from GitHub and conduct experiments to evaluate our approach. The evaluation results, including quantitative measurement and human evaluation, show that our approach is highly effective and outperforms all baselines. Our work makes one step further towards automated exception handling.", "doi": "10.1145/3324884.3416568", "arxiv_id": "https://doi.org/10.1145/3324884.3416568", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416568"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416568"}
{"title": "BUILDFAST: History-Aware Build Outcome Prediction for Fast Feedback and Reduced Cost in Continuous Integration", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bihuan Chen", "Linlin Chen", "Chen Zhang", "Xin Peng"], "abstract": "Long build times in continuous integration (CI) can greatly increase the cost in human and computing resources, and thus become a common barrier faced by software organizations adopting CI. Build outcome prediction has been proposed as one of the remedies to reduce such cost. However, the state-of-the-art approaches have a poor prediction performance for failed builds, and are not designed for practical usage scenarios. To address the problems, we first conduct an empirical study on 2,590,917 builds to characterize build times in realworld projects, and a survey with 75 developers to understand their perceptions about build outcome prediction. Then, motivated by our study and survey results, we propose a new history-aware approach, named BUILDFAST, to predict CI build outcomes cost-efficiently and practically. We develop multiple failure-specific features from closely related historical builds via analyzing build logs and changed files, and propose an adaptive prediction model to switch between two models based on the build outcome of the previous build. We investigate a practical online usage scenario of BUILDFAST, where builds are predicted in chronological order, and measure the benefit from correct predictions and the cost from incorrect predictions. Our experiments on 20 projects have shown that BUILDFAST improved the state-of-the-art by 47.5% in F1-score for failed builds.", "doi": "10.1145/3324884.3416616", "arxiv_id": "https://doi.org/10.1145/3324884.3416616", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416616"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416616"}
{"title": "LEGION: Best-First Concolic Testing", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dongge Liu", "Gidon Ernst", "Toby Murray", "Benjamin I. P. Rubinstein"], "abstract": "Concolic execution and fuzzing are two complementary coverage-based testing techniques. How to achieve the best of both remains an open challenge. To address this research problem, we propose and evaluate Legion. Legion re-engineers the Monte Carlo tree search (MCTS) framework from the AI literature to treat automated test generation as a problem of sequential decision-making under uncertainty. Its best-first search strategy provides a principled way to learn the most promising program states to investigate at each search iteration, based on observed rewards from previous iterations. Legion incorporates a form of directed fuzzing that we call approximate path-preserving fuzzing (APPFUZZING) to investigate program states selected by MCTS. APPFUZZING serves as the Monte Carlo simulation technique and is implemented by extending prior work on constrained sampling. We evaluate Legion against competitors on 2531 benchmarks from the coverage category of Test-Comp 2020, as well as measuring its sensitivity to hyperparameters, demonstrating its effectiveness on a wide variety of input programs.", "doi": "10.1145/3324884.3416629", "arxiv_id": "https://doi.org/10.1145/3324884.3416629", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416629"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416629"}
{"title": "Plug the Database & Play With Automatic Testing: Improving System Testing by Exploiting Persistent Data", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Diego Clerissi", "Giovanni Denaro", "Marco Mobilio", "Leonardo Mariani"], "abstract": "A key challenge in automatic Web testing is the generation of syntactically and semantically valid input values that can exercise the many functionalities that impose constraints on the validity of the inputs. Existing test case generation techniques either rely on manually curated catalogs of values, or extract values from external data sources, such as the Web or publicly available knowledge bases. Unfortunately, relying on manual effort is generally too expensive for most practical applications, while domain-specific and application-specific data can be hardly found either on the Web or in general purpose knowledge bases.This paper proposes DBINPuTs, a novel approach that reuses the data from the database of the target Web application, to automatically identify domain-specific and application-specific inputs, and effectively fulfill the validity constraints present in the tested Web pages. DBINPUTS can properly cope with system testing and maintenance testing efforts, since databases are naturally and inexpensively available in those phases. To extract valid inputs from the application databases, DBINPUTS exploits the syntactic and semantic similarity between the identifiers of the input fields and the ones in the tables of the database, automatically resolving the mismatch between the user interface and the schema of the database. Our experiments provide initial evidence that DBINPUTS can outperform both random input selection and Link, a competing approach for searching inputs from knowledge bases.", "doi": "10.1145/3324884.3416561", "arxiv_id": "https://doi.org/10.1145/3324884.3416561", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416561"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416561"}
{"title": "Enhanced Compiler Bug Isolation via Memoized Search", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Junjie Chen", "Haoyang Ma", "Lingming Zhang"], "abstract": "Compiler bugs can be disastrous since they could affect all the software systems built on the buggy compilers. Meanwhile, diagnosing compiler bugs is extremely challenging since usually limited debugging information is available and a large number of compiler files can be suspicious. More specifically, when compiling a given bug-triggering test program, hundreds of compiler files are usually involved, and can all be treated as suspicious buggy files. To facilitate compiler debugging, in this paper we propose the first reinforcement compiler bug isolation approach via structural mutation, called RecBi. For a given bug-triggering test program, RecBi first augments traditional local mutation operators with structural ones to transform it into a set of passing test programs. Since not all the passing test programs can help isolate compiler bugs effectively, RecBi further leverages reinforcement learning to intelligently guide the process of passing test program generation. Then, RecBi ranks all the suspicious files by analyzing the compiler execution traces of the generated passing test programs and the given failing test program following the practice of compiler bug isolation. The experimental results on 120 real bugs from two most popular C open-source compilers, i.e., GCC and LLVM, show that RecBi is able to isolate about 23%/58%/78% bugs within Top-l/Top-5/Top-10 compiler files, and significantly outperforms the state-of-the-art compiler bug isolation approach by improving 92.86%/55.56%/25.68% isolation effectiveness in terms of Top-l/Top-5/Top-10 results.", "doi": "10.1145/3324884.3416570", "arxiv_id": "https://doi.org/10.1145/3324884.3416570", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416570"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416570"}
{"title": "M3: Semantic API Migrations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bruce Collie", "Philip Ginsbach", "Jackson Woodruff", "Ajitha Rajan", "Michael F. P. O'Boyle"], "abstract": "Library migration is a challenging problem, where most existing approaches rely on prior knowledge. This can be, for example, information derived from changelogs or statistical models of API usage. This paper addresses a different API migration scenario where there is no prior knowledge of the target library. We have no historical changelogs and no access to its internal representation. To tackle this problem, this paper proposes a novel approach (M3), where probabilistic program synthesis is used to semantically model the behavior of library functions. Then, we use an SMT-based code search engine to discover similar code in user applications. These discovered instances provide potential locations for API migrations. We evaluate our approach against 7 well-known libraries from varied application domains, learning correct implementations for 94 functions. Our approach is integrated with standard compiler tooling, and we use this integration to evaluate migration opportunities in 9 existing C/C++ applications with over 1MLoC. We discover over 7,000 instances of these functions, of which more than 2,000 represent migration opportunities.", "doi": "10.1145/3324884.3416618", "arxiv_id": "https://doi.org/10.1145/3324884.3416618", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416618"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416618"}
{"title": "The Impact of Generic Data Structures: Decoding the Role of Lists in the Linux Kernel", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nic Volanschi", "Julia Lawall"], "abstract": "The increasing adoption of the Linux kernel has been sustained by a large and constant maintenance effort, performed by a wide and heterogeneous base of contributors. One important problem that maintainers face in any code base is the rapid understanding of complex data structures. The Linux kernel is written in the C language, which enables the definition of arbitrarily uninformative datatypes, via the use of casts and pointer arithmetic, of which doubly linked lists are a prominent example. In this paper, we explore the advantages and disadvantages of such lists, for expressivity, for code understanding, and for code reliability. Based on our observations, we have developed a toolset that includes inference of descriptive list types and a tool for list visualization. Our tools identify more than 10,000 list fields and variables in recent Linux kernel releases and succeeds in typing 90%. We show how these tools could have been used to detect previously fixed bugs and identify 6 new ones.", "doi": "10.1145/3324884.3416635", "arxiv_id": "https://doi.org/10.1145/3324884.3416635", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416635"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416635"}
{"title": "Pending Constraints in Symbolic Execution for Better Exploration and Seeding", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Timotej Kapus", "Frank Busse", "Cristian Cadar"], "abstract": "Symbolic execution is a well established technique for software testing and analysis. However, scalability continues to be a challenge, both in terms of constraint solving cost and path explosion. In this work, we present a novel approach for symbolic execution, which can enhance its scalability by aggressively prioritising execution paths that are already known to be feasible, and deferring all other paths. We evaluate our technique on nine applications, including SQLite3, make and tcpdump and show it can achieve higher coverage for both seeded and non-seeded exploration.", "doi": "10.1145/3324884.3416589", "arxiv_id": "https://doi.org/10.1145/3324884.3416589", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416589"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416589"}
{"title": "Broadening Horizons of Multilingual Static Analysis: Semantic Summary Extraction from C Code for JNI Program Analysis", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sungho Lee", "Hyogun Lee", "Sukyoung Ryu"], "abstract": "Most programming languages support foreign language interoperation that allows developers to integrate multiple modules implemented in different languages into a single multilingual program. While utilizing various features from multiple languages expands expressivity, differences in language semantics require developers to understand the semantics of multiple languages and their inter-operation. Because current compilers do not support compile-time checking for interoperation, they do not help developers avoid in-teroperation bugs. Similarly, active research on static analysis and bug detection has been focusing on programs written in a single language. In this paper, we propose a novel approach to analyze multilingual programs statically. Unlike existing approaches that extend a static analyzer for a host language to support analysis of foreign function calls, our approach extracts semantic summaries from programs written in guest languages using a modular analysis technique, and performs a whole-program analysis with the extracted semantic summaries. To show practicality of our approach, we design and implement a static analyzer for multilingual programs, which analyzes JNI interoperation between Java and C. Our empirical evaluation shows that the analyzer is scalable in that it can construct call graphs for large programs that use JNI interoperation, and useful in that it found 74 genuine interoperation bugs in real-world Android JNI applications.", "doi": "10.1145/3324884.3416558", "arxiv_id": "https://doi.org/10.1145/3324884.3416558", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416558"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416558"}
{"title": "Assessing and Restoring Reproducibility of Jupyter Notebooks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiawei Wang", "Tzu-yang Kuo", "Li Li", "Andreas Zeller"], "abstract": "Jupyter notebooks-documents that contain live code, equations, visualizations, and narrative text-now are among the most popular means to compute, present, discuss and disseminate scientific findings. In principle, Jupyter notebooks should easily allow to reproduce and extend scientific computations and their findings; but in practice, this is not the case. The individual code cells in Jupyter notebooks can be executed in any order, with identifier usages preceding their definitions and results preceding their computations. In a sample of 936 published notebooks that would be executable in principle, we found that 73% of them would not be reproducible with straightforward approaches, requiring humans to infer (and often guess) the order in which the authors created the cells. In this paper, we present an approach to (1) automatically satisfy dependencies between code cells to reconstruct possible execution orders of the cells; and (2) instrument code cells to mitigate the impact of non-reproducible statements (i.e., random functions) in Jupyter notebooks. Our Osiris prototype takes a notebook as input and outputs the possible execution schemes that reproduce the exact notebook results. In our sample, Osiris was able to reconstruct such schemes for 82.23% of all executable notebooks, which has more than three times better than the state-of-the-art; the resulting reordered code is valid program code and thus available for further testing and analysis.", "doi": "10.1145/3324884.3416585", "arxiv_id": "https://doi.org/10.1145/3324884.3416585", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416585"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416585"}
{"title": "Verified from Scratch: Program Analysis for Learners' Programs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andreas Stahlbauer", "Christoph Frädrich", "Gordon Fraser"], "abstract": "Block-based programming languages like Scratch support learners by providing high-level constructs that hide details and by preventing syntactically incorrect programs. Questions nevertheless frequently arise: Is this program satisfying the given task? Why is my program not working? To support learners and educators, automated program analysis is needed for answering such questions. While adapting existing analyses to process blocks instead of textual statements is straightforward, the domain of programs controlled by block-based languages like Scratch is very different from traditional programs: In Scratch multiple actors, represented as highly concurrent programs, interact on a graphical stage, controlled by user inputs, and while the block-based program statements look playful, they hide complex mathematical operations that determine visual aspects and movement. Analyzing such programs is further hampered by the absence of clearly defined semantics, often resulting from ad-hoc decisions made by the implementers of the programming environment. To enable program analysis, we define the semantics of Scratch using an intermediate language. Based on this intermediate language, we implement the Bastet program analysis framework for Scratch programs, using concepts from abstract interpretation and software model checking. Like Scratch, Bastet is based on Web technologies, written in TypeScript, and can be executed using NodeJS or even directly in a browser. Evaluation on 279 programs written by children suggests that Bastet offers a practical solution for analysis of Scratch programs, thus enabling applications such as automated hint generation, automated evaluation of learner progress, or automated grading.", "doi": "10.1145/3324884.3416554", "arxiv_id": "https://doi.org/10.1145/3324884.3416554", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416554"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416554"}
{"title": "Interval Change-Point Detection for Runtime Probabilistic Model Checking", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xingyu Zhao", "Radu Calinescu", "Simos Gerasimou", "Valentin Robu", "David Flynn"], "abstract": "Recent probabilistic model checking techniques can verify reliability and performance properties of software systems affected by parametric uncertainty. This involves modelling the system behaviour using interval Markov chains, i.e., Markov models with transition probabilities or rates specified as intervals. These intervals can be updated continually using Bayesian estimators with imprecise priors, enabling the verification of the system properties of interest at runtime. However, Bayesian estimators are slow to react to sudden changes in the actual value of the estimated parameters, yielding inaccurate intervals and leading to poor verification results after such changes. To address this limitation, we introduce an efficient interval change-point detection method, and we integrate it with a state-of-the-art Bayesian estimator with imprecise priors. Our experimental results show that the resulting end-to-end Bayesian approach to change-point detection and estimation of interval Markov chain parameters handles effectively a wide range of sudden changes in parameter values, and supports runtime probabilistic model checking under parametric uncertainty.", "doi": "10.1145/3324884.3416565", "arxiv_id": "https://doi.org/10.1145/3324884.3416565", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416565"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416565"}
{"title": "UNCHARTIT: An Interactive Framework for Program Recovery from Charts", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniel Ramos", "Jorge Pereira", "Inês Lynce", "Vasco Manquinho", "Ruben Martins"], "abstract": "Charts are commonly used for data visualization. Generating a chart usually involves performing data transformations, including data pre-processing and aggregation. These tasks can be cumbersome and time-consuming, even for experienced data scientists. Reproducing existing charts can also be a challenging task when information about data transformations is no longer available. In this paper, we tackle the problem of recovering data transformations from existing charts. Given an input table and a chart, our goal is to automatically recover the data transformation program underlying the chart. We divide our approach into four steps: (1) data extraction, (2) candidate generation, (3) candidate ranking, and (4) candidate disambiguation. We implemented our approach in a tool called UNCHARTIT and evaluated it on a set of 50 benchmarks from Kaggle. Experimental results show that UNCHARTIT successfully ranks the correct data transformation among the top-10 programs in 92% of the benchmarks. To disambiguate the top-ranking programs, we use our new interactive procedure, which successfully disambiguates 98% of the ambiguous benchmarks by asking on average fewer than 2 questions to the user.", "doi": "10.1145/3324884.3416613", "arxiv_id": "https://doi.org/10.1145/3324884.3416613", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416613"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416613"}
{"title": "Demystifying Diehard Android Apps", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hao Zhou", "Haoyu Wang", "Yajin Zhou", "Xiapu Luo", "Yutian Tang", "Lei Xue", "Ting Wang"], "abstract": "Smartphone vendors are using multiple methods to kill processes of Android apps to reduce the battery consumption. This motivates developers to find ways to extend the liveness time of their apps, hence the name diehard apps in this paper. Although there are blogs and articles illustrating methods to achieve this purpose, there is no systematic research about them. What's more important, little is known about the prevalence of diehard apps in the wild. In this paper, we take a first step to systematically investigate diehard apps by answering the following research questions. First, why and how can they circumvent the resource-saving mechanisms of Android? Second, how prevalent are they in the wild? In particular, we conduct a semi -automated analysis to illustrate insights why existing methods to kill app processes could be evaded, and then systematically present 12 diehard methods. After that, we develop a system named DiehardDetector to detect diehard apps in a large scale. The experimental result of applying DiehardDetector to more than 80k Android apps downloaded from Google Play showed that around 21 % of apps adopt various diehard methods. Moreover, our system can achieve high precision and recall.", "doi": "10.1145/3324884.3416637", "arxiv_id": "https://doi.org/10.1145/3324884.3416637", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416637"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416637"}
{"title": "UI Obfuscation and Its Effects on Automated UI Analysis for Android Apps", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hao Zhou", "Ting Chen", "Haoyu Wang", "Le Yu", "Xiapu Luo", "Ting Wang", "Wei Zhang"], "abstract": "The UI driven nature of Android apps has motivated the development of automated UI analysis for various purposes, such as app analysis, malicious app detection, and app testing. Although existing automated UI analysis methods have demonstrated their capability in dissecting apps' UI, little is known about their effectiveness in the face of app protection techniques, which have been adopted by more and more apps. In this paper, we take a first step to systematically investigate UI obfuscation for Android apps and its effects on automated UI analysis. In particular, we point out the weaknesses in existing automated UI analysis methods and design 9 UI obfuscation approaches. We implement these approaches in a new tool named UIObfuscator after tackling several technical challenges. Moreover, we feed 3 kinds of tools that rely on automated UI analysis with the apps protected by UIObfuscator, and find that their performances severely drop. This work reveals limitations of automated UI analysis and sheds light on app protection techniques.", "doi": "10.1145/3324884.3416642", "arxiv_id": "https://doi.org/10.1145/3324884.3416642", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416642"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416642"}
{"title": "Good Things Come In Threes: Improving Search-based Crash Reproduction With Helper Objectives", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pouria Derakhshanfar", "Xavier Devroey", "Andy Zaidman", "Arie van Deursen", "Annibale Panichella"], "abstract": "Writing a test case reproducing a reported software crash is a common practice to identify the root cause of an anomaly in the software under test. However, this task is usually labor-intensive and time-taking. Hence, evolutionary intelligence approaches have been successfully applied to assist developers during debugging by generating a test case reproducing reported crashes. These approaches use a single fitness function called Crash Distance to guide the search process toward reproducing a target crash. Despite the reported achievements, these approaches do not always successfully reproduce some crashes due to a lack of test diversity (premature convergence). In this study, we introduce a new approach, called MOHO, that addresses this issue via multi-objectivization. In particular, we introduce two new Helper-Objectives for crash reproduction, namely test length (to minimize) and method sequence diversity (to maximize), in addition to Crash Distance. We assessed MO-HO using five multi-objective evolutionary algorithms (NSGA-II, SPEA2, PESA-II, MOEA/D, FEMO) on 124 non-trivial crashes stemming from open-source projects. Our results indicate that SPEA2 is the best-performing multi-objective algorithm for MO-HO. We evaluated this best-performing algorithm for MO-HO against the state-of-the-art: single-objective approach (Single-Objective Search) and decomposition-based multi-objectivization approach (De-MO). Our results show that MO-HO reproduces five crashes that cannot be reproduced by the current state-of-the-art. Besides, MO-HO improves the effectiveness (+10% and +8% in reproduction ratio) and the efficiency in 34.6% and 36% of crashes (i.e., significantly lower running time) compared to Single-Objective Search and De-MO, respectively. For some crashes, the improvements are very large, being up to +93.3% for reproduction ratio and −92% for the required running time.", "doi": "10.1145/3324884.3416643", "arxiv_id": "https://doi.org/10.1145/3324884.3416643", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416643"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416643"}
{"title": "Subdomain-Based Generality-Aware Debloating", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qi Xin", "Myeongsoo Kim", "Qirun Zhang", "Alessandro Orso"], "abstract": "Programs are becoming increasingly complex and typically contain an abundance of unneeded features, which can degrade the performance and security of the software. Recently, we have witnessed a surge of debloating techniques that aim to create a reduced version of a program by eliminating the unneeded features therein. To de-bloat a program, most existing techniques require a usage profile of the program, typically provided as a set of inputs $I$. Unfortunately, these techniques tend to generate a reduced program that is overfitted to $I$ and thus fails to behave correctly for other inputs. To address this limitation, we propose Domgad, which has two main advantages over existing debloating approaches. First, it produces a reduced program that is guaranteed to work for subdomains, rather than for specific inputs. Second, it uses stochastic optimization to generate reduced programs that achieve a close-to-optimal tradeoff between reduction and generality (i.e., the extent to which the reduced program is able to correctly handle inputs in its whole domain). To assess the effectiveness of Domgad, we applied our approach to a benchmark of ten Unix utility programs. Our results are promising, as they show that Domgad could produce debloated programs that achieve, on average, 50% code reduction and 95% generality. Our results also show that Domgad performs well when compared with two state-of-the-art debloating approaches.", "doi": "10.1145/3324884.3416644", "arxiv_id": "https://doi.org/10.1145/3324884.3416644", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416644"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416644"}
{"title": "Revisiting the Relationship Between Fault Detection, Test Adequacy Criteria, and Test Set Size", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yiqun T. Chen", "Rahul Gopinath", "Anita Tadakamalla", "Michael D. Ernst", "Reid Holmes", "Gordon Fraser", "Paul Ammann", "René Just"], "abstract": "The research community has long recognized a complex interrelationship between fault detection, test adequacy criteria, and test set size. However, there is substantial confusion about whether and how to experimentally control for test set size when assessing how well an adequacy criterion is correlated with fault detection and when comparing test adequacy criteria. Resolving the confusion, this paper makes the following contributions: (1) A review of contradictory analyses of the relationships between fault detection, test adequacy criteria, and test set size. Specifically, this paper addresses the supposed contradiction of prior work and explains why test set size is neither a confounding variable, as previously suggested, nor an independent variable that should be experimentally manipulated. (2) An explication and discussion of the experimental designs of prior work, together with a discussion of conceptual and statistical problems, as well as specific guidelines for future work. (3) A methodology for comparing test adequacy criteria on an equal basis, which accounts for test set size without directly manipulating it through unrealistic stratification. (4) An empirical evaluation that compares the effectiveness of coverage-based testing, mutation-based testing, and random testing. Additionally, this paper proposes probabilistic coupling, a methodology for assessing the representativeness of a set of test goals for a given fault and for approximating the fault-detection probability of adequate test sets.", "doi": "10.1145/3324884.3416667", "arxiv_id": "https://doi.org/10.1145/3324884.3416667", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416667"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416667"}
{"title": "Synthesis of Infinite-State Systems with Random Behavior", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andreas Katis", "Grigory Fedyukovich", "Jeffrey Chen", "David A. Greve", "Sanjai Rayadurgam", "Michael W. Whalen"], "abstract": "Diversity in the exhibited behavior of a given system is a desirable characteristic in a variety of application contexts. Synthesis of conformant implementations often proceeds by discovering witnessing Skolem functions, which are traditionally deterministic. In this paper, we present a novel Skolem extraction algorithm to enable synthesis of witnesses with random behavior and demonstrate its applicability in the context of reactive systems. The synthesized solutions are guaranteed by design to meet the given specification, while exhibiting a high degree of diversity in their responses to external stimuli. Case studies demonstrate how our proposed framework unveils a novel application of synthesis in model-based fuzz testing to generate fuzzers of competitive performance to general-purpose alternatives, as well as the practical utility of synthesized controllers in robot motion planning problems.", "doi": "10.1145/3324884.3416586", "arxiv_id": "https://doi.org/10.1145/3324884.3416586", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416586"], "github": ["https://github.com/andrewkatis/jkind-1"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416586"}
{"title": "Demystifying Loops in Smart Contracts", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Benjamin Mariano", "Yanju Chen", "Yu Feng", "Shuvendu K. Lahiri", "Isil Dillig"], "abstract": "This paper aims to shed light on how loops are used in smart contracts. Towards this goal, we study various syntactic and semantic characteristics of loops used in over 20,000 Solidity contracts deployed on the Ethereum blockchain, with the goal of informing future research on program analysis for smart contracts. Based on our findings, we propose a small domain-specific language (DSL) that can be used to summarize common looping patterns in Solidity. To evaluate what percentage of smart contract loops can be expressed in our proposed DSL, we also design and implement a program synthesis toolchain called Solis that can synthesize loop summaries in our DSL. Our evaluation shows that at least 56% of the analyzed loops can be summarized in our DSL, and 81% of these summaries are exactly equivalent to the original loop.", "doi": "10.1145/3324884.3416626", "arxiv_id": "https://doi.org/10.1145/3324884.3416626", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416626"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416626"}
{"title": "Patching as Translation: the Data and the Metaphor", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yangruibo Ding", "Baishakhi Ray", "Premkumar T. Devanbu", "Vincent J. Hellendoorn"], "abstract": "Machine Learning models from other fields, like Computational Linguistics, have been transplanted to Software Engineering tasks, often quite successfully. Yet a transplanted model's initial success at a given task does not necessarily mean it is well-suited for the task. In this work, we examine a common example of this phenomenon: the conceit that software patching is like language translation. We demonstrate empirically that there are subtle, but critical distinctions between sequence-to-sequence models and translation model: while program repair benefits greatly from the former, general modeling architecture, it actually suffers from design decisions built into the latter, both in terms of translation accuracy and diversity. Given these findings, we demonstrate how a more principled approach to model design, based on our empirical findings and general knowledge of software development, can lead to better solutions. Our findings also lend strong support to the recent trend towards synthesizing edits of code conditional on the buggy context, to repair bugs. We implement such models ourselves as “proof-of-concept” tools and empirically confirm that they behave in a fundamentally different, more effective way than the studied translation-based architectures. Overall, our results demonstrate the merit of studying the intricacies of machine learned models in software engineering: not only can this help elucidate potential issues that may be overshadowed by increases in accuracy; it can also help innovate on these models to raise the state-of-the-art further. We will publicly release our replication data and materials at https://github.com/ARiSE-Lab/Patch-as-translation.", "doi": "10.1145/3324884.3416587", "arxiv_id": "https://doi.org/10.1145/3324884.3416587", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416587"], "github": ["https://github.com/ARiSE-Lab/Patch-as-translation"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416587"}
{"title": "DeepTC-Enhancer: Improving the Readability of Automatically Generated Tests", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Devjeet Roy", "Ziyi Zhang", "Maggie Ma", "Venera Arnaoudova", "Annibale Panichella", "Sebastiano Panichella", "Danielle Gonzalez", "Mehdi Mirakhorli"], "abstract": "Automated test case generation tools have been successfully proposed to reduce the amount of human and infrastructure resources required to write and run test cases. However, recent studies demonstrate that the readability of generated tests is very limited due to (i) uninformative identifiers and (ii) lack of proper documentation. Prior studies proposed techniques to improve test readability by either generating natural language summaries or meaningful methods names. While these approaches are shown to improve test readability, they are also affected by two limitations: (1) generated summaries are often perceived as too verbose and redundant by developers, and (2) readable tests require both proper method names but also meaningful identifiers (within-method readability). In this work, we combine template based methods and Deep Learning (DL) approaches to automatically generate test case scenarios (elicited from natural language patterns of test case statements) as well as to train DL models on path-based representations of source code to generate meaningful identifier names. Our approach, called DeepTC-Enhancer, recommends documentation and identifier names with the ultimate goal of enhancing readability of automatically generated test cases. An empirical evaluation with 36 external and internal developers shows that (1) DeepTC-Enhancer outperforms significantly the baseline approach for generating summaries and performs equally with the baseline approach for test case renaming, (2) the transformation proposed by DeepTC-Enhancer results in a significant increase in readability of automatically generated test cases, and (3) there is a significant difference in the feature preferences between external and internal developers.", "doi": "10.1145/3324884.3416622", "arxiv_id": "https://doi.org/10.1145/3324884.3416622", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416622"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416622"}
{"title": "Hybrid Deep Neural Networks to Infer State Models of Black-Box Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Jafar Mashhadi", "Hadi Hemmati"], "abstract": "Inferring behavior model of a running software system is quite useful for several automated software engineering tasks, such as program comprehension, anomaly detection, and testing. Most existing dynamic model inference techniques are white-box, i.e., they require source code to be instrumented to get run-time traces. However, in many systems, instrumenting the entire source code is not possible (e.g., when using black-box third-party libraries) or might be very costly. Unfortunately, most black-box techniques that detect states over time are either univariate, or make assumptions on the data distribution, or have limited power for learning over a long period of past behavior. To overcome the above issues, in this paper, we propose a hybrid deep neural network that accepts as input a set of time series, one per input/output signal of the system, and applies a set of convolutional and recurrent layers to learn the non-linear correlations between signals and the patterns, over time. We have applied our approach on a real UAV auto-pilot solution from our industry partner with half a million lines of C code. We ran 888 random recent system-level test cases and inferred states, over time. Our comparison with several traditional time series change point detection techniques showed that our approach improves their performance by up to 102%, in terms of finding state change points, measured by F1 score. We also showed that our state classification algorithm provides on average 90.45% F1 score, which improves traditional classification algorithms by up to 17%.", "doi": "10.1145/3324884.3416559", "arxiv_id": "https://doi.org/10.1145/3324884.3416559", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416559"], "github": ["https://github.com/sea-lab/hybrid-net"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416559"}
{"title": "Representing and Reasoning about Dynamic Code", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jesse Bartels", "Jon Stephens", "Saumya Debray"], "abstract": "Dynamic code, i.e., code that is created or modified at runtime, is ubiquitous in today's world. The behavior of dynamic code can depend on the logic of the dynamic code generator in subtle and nonobvious ways, e.g., JIT compiler bugs can lead to exploitable vulnerabilities in the resulting JIT-compiled code. Existing approaches to program analysis do not provide adequate support for reasoning about such behavioral relationships. This paper takes a first step in addressing this problem by describing a program representation and a new notion of dependency that allows us to reason about dependency and information flow relationships between the dynamic code generator and the generated dynamic code. Experimental results show that analyses based on these concepts are able to capture properties of dynamic code that cannot be identified using traditional program analyses.", "doi": "10.1145/3324884.3416542", "arxiv_id": "https://doi.org/10.1145/3324884.3416542", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416542"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416542"}
{"title": "ER Catcher: A Static Analysis Framework for Accurate and Scalable Event-Race Detection in Android", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Navid Salehnamadi", "Abdulaziz Alshayban", "Iftekhar Ahmed", "Sam Malek"], "abstract": "Android platform provisions a number of sophisticated concurrency mechanisms for the development of apps. The concurrency mechanisms, while powerful, are quite difficult to properly master by mobile developers. In fact, prior studies have shown concurrency issues, such as event-race defects, to be prevalent among real-world Android apps. In this paper, we propose a flow-, context-, and thread-sensitive static analysis framework, called ER Catcher, for detection of event-race defects in Android apps. ER Catcher introduces a new type of summary function aimed at modeling the concurrent behavior of methods in both Android apps and libraries. In addition, it leverages a novel, statically constructed Vector Clock for rapid analysis of happens-before relations. Altogether, these design choices enable ER Catcher to not only detect event-race defects with a substantially higher degree of accuracy, but also in a fraction of time compared to the existing state-of-the-art technique.", "doi": "10.1145/3324884.3416639", "arxiv_id": "https://doi.org/10.1145/3324884.3416639", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416639"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416639"}
{"title": "A Deep Multitask Learning Approach for Requirements Discovery and Annotation from Open Forum", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mingyang Li", "Lin Shi", "Ye Yang", "Qing Wang"], "abstract": "The ability in rapidly learning and adapting to evolving user needs is key to modern business successes. Existing methods are based on text mining and machine learning techniques to analyze user comments and feedback, and often constrained by heavy reliance on manually codified rules or insufficient training data. Multitask learning (MTL) is an effective approach with many successful applications, with the potential to address these limitations associated with requirements analysis tasks. In this paper, we propose a deep MTL-based approach, DEMAR, to address these limitations when discovering requirements from massive issue reports and annotating the sentences in support of automated requirements analysis. DEMAR consists of three main phases: (1) data augmentation phase, for data preparation and allowing data sharing beyond single task learning; (2) model construction phase, for constructing the MTL-based model for requirements discovery and requirements annotation tasks; and (3) model training phase, enabling eavesdropping by shared loss function between the two related tasks. Evaluation results from eight open-source projects show that, the proposed multitask learning approach outperforms two state-of-the-art approaches (CNC and FRA) and six common machine learning algorithms, with the precision of 91 % and the recall of 83% for requirements discovery task, and the overall accuracy of 83% for requirements annotation task. The proposed approach provides a novel and effective way to jointly learn two related requirements analysis tasks. We believe that it also sheds light on further directions of exploring multitask learning in solving other software engineering problems.", "doi": "10.1145/3324884.3416627", "arxiv_id": "https://doi.org/10.1145/3324884.3416627", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416627"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416627"}
{"title": "Retrieve and Refine: Exemplar-based Neural Comment Generation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bolin Wei", "Yongmin Li", "Ge Li", "Xin Xia", "Zhi Jin"], "abstract": "Code comment generation which aims to automatically generate natural language descriptions for source code, is a crucial task in the field of automatic software development. Traditional comment generation methods use manually-crafted templates or information retrieval (IR) techniques to generate summaries for source code. In recent years, neural network-based methods which leveraged acclaimed encoder-decoder deep learning framework to learn comment generation patterns from a large-scale parallel code corpus, have achieved impressive results. However, these emerging methods only take code-related information as input. Software reuse is common in the process of software development, meaning that comments of similar code snippets are helpful for comment generation. Inspired by the IR-based and template-based approaches, in this paper, we propose a neural comment generation approach where we use the existing comments of similar code snippets as exemplars to guide comment generation. Specifically, given a piece of code, we first use an IR technique to retrieve a similar code snippet and treat its comment as an exemplar. Then we design a novel seq2seq neural network that takes the given code, its AST, its similar code, and its exemplar as input, and leverages the information from the exemplar to assist in the target comment generation based on the semantic similarity between the source code and the similar code. We evaluate our approach on a large-scale Java corpus, which contains about 2M samples, and experimental results demonstrate that our model outperforms the state-of-the-art methods by a substantial margin.", "doi": "10.1145/3324884.3416578", "arxiv_id": "https://doi.org/10.1145/3324884.3416578", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416578"], "github": ["https://github.com/Gompyn/re2com-opensource"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416578"}
{"title": "Where Shall We Log? Studying and Suggesting Logging Locations in Code Blocks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhenhao Li", "Tse-Hsun Chen", "Weiyi Shang"], "abstract": "Developers write logging statements to generate logs and record system execution behaviors to assist in debugging and software maintenance. However, deciding where to insert logging statements is a crucial yet challenging task. On one hand, logging too little may increase the maintenance difficulty due to missing important system execution information. On the other hand, logging too much may introduce excessive logs that mask the real problems and cause significant performance overhead. Prior studies provide recommendations on logging locations, but such recommendations are only for limited situations (e.g., exception logging) or at a coarse-grained level (e.g., method level). Thus, properly helping developers decide finer-grained logging locations for different situations remains an unsolved challenge. In this paper, we tackle the challenge by first conducting a comprehensive manual study on the characteristics of logging locations in seven open-source systems. We uncover six categories of logging locations and find that developers usually insert logging statements to record execution information in various types of code blocks. Based on the observed patterns, we then propose a deep learning framework to automatically suggest logging locations at the block level. We model the source code at the code block level using the syntactic and semantic information. We find that: 1) our models achieve an average of 80.1% balanced accuracy when suggesting logging locations in blocks; 2) our cross-system logging suggestion results reveal that there might be an implicit logging guideline across systems. Our results show that we may accurately provide finer-grained suggestions on logging locations, and such suggestions may be shared across systems.", "doi": "10.1145/3324884.3416636", "arxiv_id": "https://doi.org/10.1145/3324884.3416636", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416636"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416636"}
{"title": "How Incidental are the Incidents? Characterizing and Prioritizing Incidents for Large-Scale Online Service Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Junjie Chen", "Shu Zhang", "Xiaoting He", "Qingwei Lin", "Hongyu Zhang", "Dan Hao", "Yu Kang", "Feng Gao", "Zhangwei Xu", "Yingnong Dang", "Dongmei Zhang"], "abstract": "Although tremendous efforts have been devoted to the quality assurance of online service systems, in reality, these systems still come across many incidents (i.e., unplanned interruptions and outages), which can decrease user satisfaction or cause economic loss. To better understand the characteristics of incidents and improve the incident management process, we perform the first large-scale empirical analysis of incidents collected from 18 real-world online service systems in Microsoft. Surprisingly, we find that although a large number of incidents could occur over a short period of time, many of them actually do not matter, i.e., engineers will not fix them with a high priority after manually identifying their root cause. We call these incidents incidental incidents. Our qualitative and quantitative analyses show that incidental incidents are significant in terms of both number and cost. Therefore, it is important to prioritize incidents by identifying incidental incidents in advance to optimize incident management efforts. In particular, we propose an approach, called DeepIP (Deep learning based Incident Prioritization), to prioritizing incidents based on a large amount of historical incident data. More specifically, we design an attention-based Convolutional Neural Network (CNN) to learn a prediction model to identify incidental incidents. We then prioritize all incidents by ranking the predicted probabilities of incidents being incidental. We evaluate the performance of DeepIP using real-world incident data. The experimental results show that DeepIP effectively prioritizes incidents by identifying incidental incidents and significantly outperforms all the compared approaches. For example, the AUC of DeepIP achieves 0.808, while that of the best compared approach is only 0.624 on average.", "doi": "10.1145/3324884.3416624", "arxiv_id": "https://doi.org/10.1145/3324884.3416624", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416624"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416624"}
{"title": "Stay Professional and Efficient: Automatically Generate Titles for Your Bug Reports", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Songqiang Chen", "Xiaoyuan Xie", "Bangguo Yin", "Yuanxiang Ji", "Lin Chen", "Baowen Xu"], "abstract": "Bug reports in a repository are generally organized line by line in a list-view, with their titles and other meta-data displayed. In this list-view, a concise and precise title plays an important role that enables project practitioners to quickly and correctly digest the core idea of the bug, without carefully reading the corresponding details. However, the quality of bug report titles varies in open-source communities, which may be due to the limited time and unprofessionalism of authors. To help report authors efficiently draft good-quality titles, we propose a method, named iTAPE, to automatically generate titles for their bug reports. iTAPE formulates title generation into a one-sentence summarization task. By properly tackling two domain-specific challenges (i.e. lacking off-the-shelf dataset and handling the low-frequency human-named tokens), iTAPE then generates titles using a Seq2Seq-based model. A comprehensive experimental study shows that iTAPE can obtain fairly satisfactory results, in terms of the comparison with three latest one-sentence summarization works, as well as the feedback from human evaluation.", "doi": "10.1145/3324884.3416538", "arxiv_id": "https://doi.org/10.1145/3324884.3416538", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416538"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416538"}
{"title": "Owl Eyes: Spotting UI Display Issues via Visual Understanding", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhe Liu", "Chunyang Chen", "Junjie Wang", "Yuekai Huang", "Jun Hu", "Qing Wang"], "abstract": "Graphical User Interface (GUI) provides a visual bridge between a software application and end users, through which they can interact with each other. With the development of technology and aesthetics, the visual effects of the GUI are more and more attracting. However, such GUI complexity posts a great challenge to the GUI implementation. According to our pilot study of crowdtesting bug reports, display issues such as text overlap, blurred screen, missing image always occur during GUI rendering on different devices due to the software or hardware compatibility. They negatively influence the app usability, resulting in poor user experience. To detect these issues, we propose a novel approach, OwlEye, based on deep learning for modelling visual information of the GUI screenshot. Therefore, OwlEye can detect GUIs with display issues and also locate the detailed region of the issue in the given GUI for guiding developers to fix the bug. We manually construct a large-scale labelled dataset with 4,470 GUI screenshots with UI display issues and develop a heuristics-based data augmentation method for boosting the performance of our OwlEye. The evaluation demonstrates that our OwlEye can achieve 85% precision and 84% recall in detecting UI display issues, and 90% accuracy in localizing these issues. We also evaluate OwlEye with popular Android apps on Google Play and F-droid, and successfully uncover 57 previously-undetected UI display issues with 26 of them being confirmed or fixed so far.", "doi": "10.1145/3324884.3416547", "arxiv_id": "https://doi.org/10.1145/3324884.3416547", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416547"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416547"}
{"title": "Multiple-Boundary Clustering and Prioritization to Promote Neural Network Retraining", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Weijun Shen", "Yanhui Li", "Lin Chen", "Yuanlei Han", "Yuming Zhou", "Baowen Xu"], "abstract": "With the increasing application of deep learning (DL) models in many safety-critical scenarios, effective and efficient DL testing techniques are much in demand to improve the quality of DL models. One of the major challenges is the data gap between the training data to construct the models and the testing data to evaluate them. To bridge the gap, testers aim to collect an effective subset of inputs from the testing contexts, with limited labeling effort, for retraining DL models.To assist the subset selection, we propose Multiple-Boundary Clustering and Prioritization (MCP), a technique to cluster test samples into the boundary areas of multiple boundaries for DL models and specify the priority to select samples evenly from all boundary areas, to make sure enough useful samples for each boundary reconstruction. To evaluate MCP, we conduct an extensive empirical study with three popular DL models and 33 simulated testing contexts. The experiment results show that, compared with state-of-the-art baseline methods, on effectiveness, our approach MCP has a significantly better performance by evaluating the improved quality of retrained DL models; on efficiency, MCP also has the advantages in time costs.", "doi": "10.1145/3324884.3416621", "arxiv_id": "https://doi.org/10.1145/3324884.3416621", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416621"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416621"}
{"title": "Marble: Model-based Robustness Analysis of Stateful Deep Learning Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaoning Du", "Yi Li", "Xiaofei Xie", "Lei Ma", "Yang Liu", "Jianjun Zhao"], "abstract": "DEADLINE: JUNE 20,1993", "doi": "10.1145/3324884.3416564", "arxiv_id": "https://doi.org/10.1145/3324884.3416564", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416564"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416564"}
{"title": "MockSniffer: Characterizing and Recommending Mocking Decisions for Unit Tests", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hengcheng Zhu", "Lili Wei", "Ming Wen", "Yepang Liu", "Shing-Chi Cheung", "Qin Sheng", "Cui Zhou"], "abstract": "In unit testing, mocking is popularly used to ease test effort, reduce test flakiness, and increase test coverage by replacing the actual dependencies with simple implementations. However, there are no clear criteria to determine which dependencies in a unit test should be mocked. Inappropriate mocking can have undesirable consequences: under-mocking could result in the inability to isolate the class under test (CUT) from its dependencies while over-mocking increases the developers' burden on maintaining the mocked objects and may lead to spurious test failures. According to existing work, various factors can determine whether a dependency should be mocked. As a result, mocking decisions are often difficult to make in practice. Studies on the evolution of mocked objects also showed that developers tend to change their mocking decisions: 17% of the studied mocked objects were introduced sometime after the test scripts were created and another 13% of the originally mocked objects eventually became unmocked. In this work, we are motivated to develop an automated technique to make mocking recommendations to facilitate unit testing. We studied 10,846 test scripts in four actively maintained open-source projects that use mocked objects, aiming to characterize the dependencies that are mocked in unit testing. Based on our observations on mocking practices, we designed and implemented a tool, MockSniffer, to identify and recommend mocks for unit tests. The tool is fully automated and requires only the CUT and its dependencies as input. It leverages machine learning techniques to make mocking recommendations by holistically considering multiple factors that can affect developers' mocking decisions. Our evaluation of MockSniffer on ten open-source projects showed that it outperformed three baseline approaches, and achieved good performance in two potential application scenarios.", "doi": "10.1145/3324884.3416539", "arxiv_id": "https://doi.org/10.1145/3324884.3416539", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416539"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416539"}
{"title": "Defect Prediction Guided Search-Based Software Testing", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anjana Perera", "Aldeida Aleti", "Marcel Böhme", "Burak Turhan"], "abstract": "  Today, most automated test generators, such as search-based software testing\n(SBST) techniques focus on achieving high code coverage. However, high code\ncoverage is not sufficient to maximise the number of bugs found, especially\nwhen given a limited testing budget. In this paper, we propose an automated\ntest generation technique that is also guided by the estimated degree of\ndefectiveness of the source code. Parts of the code that are likely to be more\ndefective receive more testing budget than the less defective parts. To measure\nthe degree of defectiveness, we leverage Schwa, a notable defect prediction\ntechnique.\n  We implement our approach into EvoSuite, a state of the art SBST tool for\nJava. Our experiments on the Defects4J benchmark demonstrate the improved\nefficiency of defect prediction guided test generation and confirm our\nhypothesis that spending more time budget on likely defective parts increases\nthe number of bugs found in the same time budget.\n", "doi": "10.1145/3324884.3416612", "arxiv_id": "https://doi.org/10.1145/3324884.3416612", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416612", "https://arxiv.org/pdf/2109.12645"], "github": ["https://github.com/SBST-DPG/sbst-dpg"], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416612", "journal_ref": "In Proceedings of the 35th IEEE/ACM International Conference on\n  Automated Software Engineering (ASE '20), 2020", "categories": "cs.SE", "cited_by": 0}
{"title": "API-Misuse Detection Driven by Fine-Grained API-Constraint Knowledge Graph", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaoxue Ren", "Xinyuan Ye", "Zhenchang Xing", "Xin Xia", "Xiwei Xu", "Liming Zhu", "Jianling Sun"], "abstract": "API misuses cause significant problem in software development. Existing methods detect API misuses against frequent API usage patterns mined from codebase. They make a naive assumption that API usage that deviates from the most-frequent API usage is a misuse. However, there is a big knowledge gap between API usage patterns and API usage caveats in terms of comprehensiveness, explainability and best practices. In this work, we propose a novel approach that detects API misuses directly against the API caveat knowledge, rather than API usage patterns. We develop open information extraction methods to construct a novel API-constraint knowledge graph from API reference documentation. This knowledge graph explicitly models two types of API-constraint relations (call-order and condition-checking) and enriches return and throw relations with return conditions and exception triggers. It empowers the detection of three types of frequent API misuses - missing calls, missing condition checking and missing exception handling, while existing detectors mostly focus on only missing calls. As a proof-of-concept, we apply our approach to Java SDK API Specification. Our evaluation confirms the high accuracy of the extracted API-constraint relations. Our knowledge-driven API misuse detector achieves 0.60 (68/113) precision and 0.28 (68/239) recall for detecting Java API misuses in the API misuse benchmark MuBench. This performance is significantly higher than that of existing pattern-based API misused detectors. A pilot user study with 12 developers shows that our knowledge-driven API misuse detection is very promising in helping developers avoid API misuses and debug the bugs caused by API misuses.", "doi": "10.1145/3324884.3416551", "arxiv_id": "https://doi.org/10.1145/3324884.3416551", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416551"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416551"}
{"title": "Multi-task Learning based Pre-trained Language Model for Code Completion", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fang Liu", "Ge Li", "Yunfei Zhao", "Zhi Jin"], "abstract": "Code completion is one of the most useful features in the Integrated Development Environments (IDEs), which can accelerate software development by suggesting the next probable token based on the contextual code in real-time. Recent studies have shown that statistical language modeling techniques can improve the performance of code completion tools through learning from large-scale software repositories. However, these models suffer from two major drawbacks: a) Existing research uses static embeddings, which map a word to the same vector regardless of its context. The differences in the meaning of a token in varying contexts are lost when each token is associated with a single representation; b) Existing language model based code completion models perform poor on completing identifiers, and the type information of the identifiers is ignored in most of these models. To address these challenges, in this paper, we develop a multi-task learning based pre-trained language model for code understanding and code generation with a Transformer-based neural architecture. We pre-train it with hybrid objective functions that incorporate both code understanding and code generation tasks. Then we fine-tune the pre-trained model on code completion. During the completion, our model does not directly predict the next token. Instead, we adopt multi-task learning to predict the token and its type jointly and utilize the predicted type to assist the token prediction. Experiments results on two real-world datasets demonstrate the effectiveness of our model when compared with state-of-the-art methods.", "doi": "10.1145/3324884.3416591", "arxiv_id": "https://doi.org/10.1145/3324884.3416591", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416591"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416591"}
{"title": "Audee: Automated Testing for Deep Learning Frameworks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qianyu Guo", "Xiaofei Xie", "Yi Li", "Xiaoyu Zhang", "Yang Liu", "Xiaohong Li", "Chao Shen"], "abstract": "Deep learning (DL) has been applied widely, and the quality of DL system becomes crucial, especially for safety-critical applications. Existing work mainly focuses on the quality analysis of DL models, but lacks attention to the underlying frameworks on which all DL models depend. In this work, we propose Audee, a novel approach for testing DL frameworks and localizing bugs. Audee adopts a search-based approach and implements three different mutation strategies to generate diverse test cases by exploring combinations of model structures, parameters, weights and inputs. Audee is able to detect three types of bugs: logical bugs, crashes and Not-a-Number (NaN) errors. In particular, for logical bugs, Audee adopts a cross-reference check to detect behavioural inconsistencies across multiple frameworks (e.g., TensorFlow and PyTorch), which may indicate potential bugs in their implementations. For NaN errors, Audee adopts a heuristic-based approach to generate DNNs that tend to output outliers (i.e., too large or small values), and these values are likely to produce NaN. Furthermore, Audee leverages a causal-testing based technique to localize layers as well as parameters that cause inconsistencies or bugs. To evaluate the effectiveness of our approach, we applied Audee on testing four DL frameworks, i.e., TensorFlow, PyTorch, CNTK, and Theano. We generate a large number of DNNs which cover 25 widely-used APIs in the four frameworks. The results demonstrate that Audee is effective in detecting inconsistencies, crashes and NaN errors. Intotal, 26 unique unknown bugs were discovered, and 7 of them have already been confirmed or fixed by the developers.", "doi": "10.1145/3324884.3416571", "arxiv_id": "https://doi.org/10.1145/3324884.3416571", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416571"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416571"}
{"title": "Towards Interpreting Recurrent Neural Networks through Probabilistic Abstraction", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Guoliang Dong", "Jingyi Wang", "Jun Sun", "Yang Zhang", "Xinyu Wang", "Ting Dai", "Jin Song Dong", "Xingen Wang"], "abstract": "Neural networks are becoming a popular tool for solving many realworld problems such as object recognition and machine translation, thanks to its exceptional performance as an end-to-end solution. However, neural networks are complex black-box models, which hinders humans from interpreting and consequently trusting them in making critical decisions. Towards interpreting neural networks, several approaches have been proposed to extract simple deterministic models from neural networks. The results are not encouraging (e.g., low accuracy and limited scalability), fundamentally due to the limited expressiveness of such simple models.In this work, we propose an approach to extract probabilistic automata for interpreting an important class of neural networks, i.e., recurrent neural networks. Our work distinguishes itself from existing approaches in two important ways. One is that probability is used to compensate for the loss of expressiveness. This is inspired by the observation that human reasoning is often ‘probabilistic’. The other is that we adaptively identify the right level of abstraction so that a simple model is extracted in a request-specific way. We conduct experiments on several real-world datasets using state-of-the-art architectures including GRU and LSTM. The result shows that our approach significantly improves existing approaches in terms of accuracy or scalability. Lastly, we demonstrate the usefulness of the extracted models through detecting adversarial texts.", "doi": "10.1145/3324884.3416592", "arxiv_id": "https://doi.org/10.1145/3324884.3416592", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416592"], "github": ["https://github.com/dgl-prc/rnn2automata"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416592"}
{"title": "Continuous Compliance", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Kellogg", "Martin Schäf", "Serdar Tasiran", "Michael D. Ernst"], "abstract": "Vendors who wish to provide software or services to large corporations and governments must often obtain numerous certificates of compliance. Each certificate asserts that the software satisfies a compliance regime, like SOC or the PCI DSS, to protect the privacy and security of sensitive data. The industry standard for obtaining a compliance certificate is an auditor manually auditing source code. This approach is expensive, error-prone, partial, and prone to regressions. We propose continuous compliance to guarantee that the codebase stays compliant on each code change using lightweight verification tools. Continuous compliance increases assurance and reduces costs. Continuous compliance is applicable to any source-code compliance requirement. To illustrate our approach, we built verification tools for five common audit controls related to data security: cryptographically unsafe algorithms must not be used, keys must be at least 256 bits long, credentials must not be hard-coded into program text, HTTPS must always be used instead of HTTP, and cloud data stores must not be world-readable. We evaluated our approach in three ways. (1) We applied our tools to over 5 million lines of open-source software. (2) We compared our tools to other publicly-available tools for detecting misuses of encryption on a previously-published benchmark, finding that only ours are suitable for continuous compliance. (3) We deployed a continuous compliance process at AWS, a large cloud-services company: we integrated verification tools into the compliance process (including auditors accepting their output as evidence) and ran them on over 68 million lines of code. Our tools and the data for the former two evaluations are publicly available.", "doi": "10.1145/3324884.3416593", "arxiv_id": "https://doi.org/10.1145/3324884.3416593", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416593"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416593"}
{"title": "SADT: Syntax-Aware Differential Testing of Certificate Validation in SSL/TLS Implementations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lili Quan", "Qianyu Guo", "Hongxu Chen", "Xiaofei Xie", "Xiaohong Li", "Yang Liu", "Jing Hu"], "abstract": "The security assurance of SSL/TLS critically depends on the correct validation of X.509 certificates. Therefore, it is important to check whether a certificate is correctly validated by the SSL/TLS implementations. Although differential testing has been proven to be effective in finding semantic bugs, it still suffers from the following limitations: (1) The syntax of test cases cannot be correctly guaranteed. (2) Current test cases are not diverse enough to cover more implementation behaviours. This paper tackles these problems by introducing SADT, a novel syntax-aware differential testing framework for evaluating the certificate validation process in SSL/TLS implementations. We first propose a tree-based mutation strategy to ensure that the generated certificates are syntactically correct, and then diversify the certificates by sharing interesting test cases among all target SSL/TLS implementations. Such generated certificates are more likely to trigger discrepancies among SSL/TLS implementations, which may indicate some potential bugs.", "doi": "10.1145/3324884.3416552", "arxiv_id": "https://doi.org/10.1145/3324884.3416552", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416552"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416552"}
{"title": "CoFI: Consistency-Guided Fault Injection for Cloud Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haicheng Chen", "Wensheng Dou", "Dong Wang", "Feng Qin"], "abstract": "Network partitions are inevitable in large-scale cloud systems. Despite developer's efforts in handling network partitions throughout designing, implementing and testing cloud systems, bugs caused by network partitions, i.e., partition bugs, still exist and cause severe failures in production clusters. It is challenging to expose these partition bugs because they often require network partitions to start and stop at specific timings. In this paper, we propose Consistency-Guided Fault Injection (CoFI), a novel technique that systematically injects network partitions to effectively expose partition bugs. We observe that, network partitions can leave cloud systems in inconsistent states, where partition bugs are more likely to occur. Based on this observation, CoFI first infers invariants (i.e., consistent states) among different nodes in a cloud system. Once detecting violations to the inferred invariants (i.e., inconsistent states) while running the cloud system, CoFI injects network partitions to prevent the cloud system from recovering back to consistent states, and thoroughly tests whether the cloud system still proceeds correctly at inconsistent states. We have applied CoFI to three widely-deployed cloud systems, i.e., Cassandra, HDFS, and YARN. CoFI has detected 12 previously-unknown bugs, and four of them have been confirmed by developers.", "doi": "10.1145/3324884.3416548", "arxiv_id": "https://doi.org/10.1145/3324884.3416548", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416548"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416548"}
{"title": "ChemTest: An Automated Software Testing Framework for an Emerging Paradigm", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michael C. Gerten", "James I. Lathrop", "Myra B. Cohen", "Titus H. Klinge"], "abstract": "In recent years the use of non-traditional computing mechanisms has grown rapidly. One paradigm uses chemical reaction networks (CRNs) to compute via chemical interactions. CRNs are used to prototype molecular devices at the nanoscale such as intelligent drug therapeutics. In practice, these programs are first written and simulated in environments such as MatLab and later compiled into physical molecules such as DNA strands. However, techniques for testing the correctness of CRNs are lacking. Current methods of validating CRNs include model checking and theorem proving, but these are limited in scalability. In this paper we present the first (to the best of our knowledge) testing framework for CRNs, ChemTest. ChemTest evaluates test oracles on individual simulation traces and supports functional, metamorphic, internal and hyper test cases. It also allows for flakiness and programs that are probabilistic. We performed a large case study demonstrating that ChemTest can find seeded faults and scales beyond model checking. Of our tests, 21% are inherently flaky, suggesting that systematic support for this paradigm is needed. On average, functional tests find 66.5% of the faults, while metamorphic tests find 80.4%, showing the benefit of using metamorphic relationships in our test framework. In addition, we show how the time at evaluation impacts fault detection.", "doi": "10.1145/3324884.3416638", "arxiv_id": "https://doi.org/10.1145/3324884.3416638", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416638"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416638"}
{"title": "Automatic Extraction of Cause-Effect-Relations from Requirements Artifacts", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julian Frattini", "Maximilian Junker", "Michael Unterkalmsteiner", "Daniel Méndez"], "abstract": "Background: The detection and extraction of causality from natural language sentences have shown great potential in various fields of application. The field of requirements engineering is eligible for multiple reasons: (1) requirements artifacts are primarily written in natural language, (2) causal sentences convey essential context about the subject of requirements, and (3) extracted and formalized causality relations are usable for a (semi-)automatic translation into further artifacts, such as test cases. Objective: We aim at understanding the value of interactive causality extraction based on syntactic criteria for the context of requirements engineering. Method: We developed a prototype of a system for automatic causality extraction and evaluate it by applying it to a set of publicly available requirements artifacts, determining whether the automatic extraction reduces the manual effort of requirements formalization. Result: During the evaluation we analyzed 4457 natural language sentences from 18 requirements documents, 558 of which were causal (12.52%). The best evaluation of a requirements document provided an automatic extraction of 48.57% cause-effect graphs on average, which demonstrates the feasibility of the approach. Limitation: The feasibility of the approach has been proven in theory but lacks exploration of being scaled up for practical use. Evaluating the applicability of the automatic causality extraction for a requirements engineer is left for future research. Conclusion: A syntactic approach for causality extraction is viable for the context of requirements engineering and can aid a pipeline towards an automatic generation of further artifacts from requirements artifacts.", "doi": "10.1145/3324884.3416549", "arxiv_id": "https://doi.org/10.1145/3324884.3416549", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416549"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416549"}
{"title": "BiLO-CPDP: Bi-Level Programming for Automated Model Discovery in Cross-Project Defect Prediction", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ke Li", "Zilin Xiang", "Tao Chen", "Kay Chen Tan"], "abstract": "Cross-Project Defect Prediction (CPDP), which borrows data from similar projects by combining a transfer learner with a classifier, have emerged as a promising way to predict software defects when the available data about the target project is insufficient. However, developing such a model is challenge because it is difficult to determine the right combination of transfer learner and classifier along with their optimal hyper-parameter settings. In this paper, we propose a tool, dubbed BiLO-CPDP, which is the first of its kind to formulate the automated CPDP model discovery from the perspective of bi-level programming. In particular, the bi-level programming proceeds the optimization with two nested levels in a hierarchical manner. Specifically, the upper-level optimization routine is designed to search for the right combination of transfer learner and classifier while the nested lower-level optimization routine aims to optimize the corresponding hyper-parameter settings. To evaluate BiLO-CPDP, we conduct experiments on 20 projects to compare it with a total of 21 existing CPDP techniques, along with its single-level optimization variant and Auto-Sklearn, a state-of-the-art automated machine learning tool. Empirical results show that BiLO-CPDP champions better prediction performance than all other 21 existing CPDP techniques on 70% of the projects, while being overwhelmingly superior to Auto-Sklearn and its single-level optimization variant on all cases. Furthermore, the unique bi-level formalization in BiLO-CPDP also permits to allocate more budget to the upper-level, which significantly boosts the performance.", "doi": "10.1145/3324884.3416617", "arxiv_id": "https://doi.org/10.1145/3324884.3416617", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416617"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416617"}
{"title": "Automating Just-In-Time Comment Updating", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhongxin Liu", "Xin Xia", "Meng Yan", "Shanping Li"], "abstract": "Code comments are valuable for program comprehension and software maintenance, and also require maintenance with code evolution. However, when changing code, developers sometimes neglect updating the related comments, bringing in inconsistent or obsolete comments (aka., bad comments). Such comments are detrimental since they may mislead developers and lead to future bugs. Therefore, it is necessary to fix and avoid bad comments. In this work, we argue that bad comments can be reduced and even avoided by automatically performing comment updates with code changes. We refer to this task as “Just-In-Time (JIT) Comment Updating” and propose an approach named CUP (Comment UPdater) to automate this task. CUP can be used to assist developers in updating comments during code changes and can consequently help avoid the introduction of bad comments. Specifically, CUP leverages a novel neural sequence-to-sequence model to learn comment update patterns from extant code-comment co-changes and can automatically generate a new comment based on its corresponding old comment and code change. Several customized enhancements, such as a special tokenizer and a novel co-attention mechanism, are introduced in CUP by us to handle the characteristics of this task. We build a dataset with over 108K comment-code co-change samples and evaluate CUP on it. The evaluation results show that CUP outperforms an information-retrieval-based and a rule-based baselines by substantial margins, and can reduce developers' edits required for JIT comment updating. In addition, the comments generated by our approach are identical to those updated by developers in 1612 (16.7%) test samples, 7 times more than the best-performing baseline.", "doi": "10.1145/3324884.3416581", "arxiv_id": "https://doi.org/10.1145/3324884.3416581", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416581"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416581"}
{"title": "Automated Implementation of Windows-related Security-Configuration Guides", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Patrick Stöckle", "Bernd Grobauer", "Alexander Pretschner"], "abstract": "Hardening is the process of configuring IT systems to ensure the security of the systems' components and data they process or store. The complexity of contemporary IT infrastructures, however, renders manual security hardening and maintenance a daunting task. In many organizations, security-configuration guides expressed in the SCAP (Security Content Automation Protocol) are used as a basis for hardening, but these guides by themselves provide no means for automatically implementing the required configurations. In this paper, we propose an approach to automatically extract the relevant information from publicly available security-configuration guides for Windows operating systems using natural language processing. In a second step, the extracted information is verified using the information of available settings stored in the Windows Administrative Template files, in which the majority of Windows configuration settings is defined. We show that our implementation of this approach can extract and implement 83% of the rules without any manual effort and 96% with minimal manual effort. Furthermore, we conduct a study with 12 state-of-the-art guides consisting of 2014 rules with automatic checks and show that our tooling can implement at least 97% of them correctly. We have thus significantly reduced the effort of securing systems based on existing security-configuration guides. In many organizations, security-configuration guides expressed in the SCAP (Security Content Automation Protocol) are used as a basis for hardening, but these guides by themselves provide no means for automatically implementing the required configurations. In this paper, we propose an approach to automatically extract the relevant information from publicly available security-configuration guides for Windows operating systems using natural language processing. In a second step, the extracted information is verified using the information of available settings stored in the Windows Administrative Template files, in which the majority of Windows configuration settings is defined. We show that our implementation of this approach can extract and implement 83% of the rules without any manual effort and 96% with minimal manual effort. Furthermore, we conduct a study with 12 state-of-the-art guides consisting of 2014 rules with automatic checks and show that our tooling can implement at least 97% of them correctly. We have thus significantly reduced the effort of securing systems based on existing security-configuration guides. In this paper, we propose an approach to automatically extract the relevant information from publicly available security-configuration guides for Windows operating systems using natural language processing. In a second step, the extracted information is verified using the information of available settings stored in the Windows Administrative Template files, in which the majority of Windows configuration settings is defined. We show that our implementation of this approach can extract and implement 83% of the rules without any manual effort and 96% with minimal manual effort. Furthermore, we conduct a study with 12 state-of-the-art guides consisting of 2014 rules with automatic checks and show that our tooling can implement at least 97% of them correctly. We have thus significantly reduced the effort of securing systems based on existing security-configuration guides. We show that our implementation of this approach can extract and implement 83% of the rules without any manual effort and 96% with minimal manual effort. Furthermore, we conduct a study with 12 state-of-the-art guides consisting of 2014 rules with automatic checks and show that our tooling can implement at least 97% of them correctly. We have thus significantly reduced the effort of securing systems based on existing security-configuration guides.", "doi": "10.1145/3324884.3416540", "arxiv_id": "https://doi.org/10.1145/3324884.3416540", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416540"], "github": ["https://github.com/tum-i22/disa-windows-server-2019", "https://github.com/tum-i22/disa-windows-server-2016", "https://github.com/tum-i22/cis-benchmark-evaluation"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416540"}
{"title": "Identifying Software Performance Changes Across Variants and Versions", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stefan Mühlbauer", "Sven Apel", "Norbert Siegmund"], "abstract": "We address the problem of identifying performance changes in the evolution of configurable software systems. Finding optimal configurations and configuration options that influence performance is already difficult, but in the light of software evolution, configuration-dependent performance changes may lurk in a potentially large number of different versions of the system.", "doi": "10.1145/3324884.3416573", "arxiv_id": "https://doi.org/10.1145/3324884.3416573", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416573"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416573"}
{"title": "CP-Detector: Using Configuration-related Performance Properties to Expose Performance Bugs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haochen He", "Zhouyang Jia", "Shanshan Li", "Erci Xu", "Tingting Yu", "Yue Yu", "Ji Wang", "Xiangke Liao"], "abstract": "Performance bugs are often hard to detect due to their non fail-stop symptoms. Existing debugging techniques can only detect performance bugs with known patterns (e.g., inefficient loops). The key reason behind this incapability is the lack of a general test oracle. Here, we argue that the performance (e.g., throughput, latency, execution time) expectation of configuration can serve as a strong oracle candidate for performance bug detection. First, prior work shows that most performance bugs are related to configurations. Second, the configuration change reflects common expectation on performance changes. If the actual performance is contrary to the expectation, the related code snippet is likely to be problematic. In this paper, we first conducted a comprehensive study on 173 real-world configuration-related performance bugs (CPBugs) from 12 representative software systems. We then derived seven configuration-related performance properties, which can serve as the test oracle in performance testing. Guided by the study, we designed and evaluated an automated performance testing framework, CP-DETECTOR, for detecting real-world configuration-related performance bugs. CP-DETECTOR was evaluated on 12 open-source projects. The results showed that it detected 43 out of 61 existing bugs and reported 13 new bugs.", "doi": "10.1145/3324884.3416531", "arxiv_id": "https://doi.org/10.1145/3324884.3416531", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416531"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416531"}
{"title": "Just-In-Time Reactive Synthesis", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shahar Maoz", "Ilia Shevrin"], "abstract": "Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from its temporal logic specification. GR(1) is an expressive assume-guarantee fragment of LTL that enables efficient synthesis and has been recently used in different contexts and application domains. In this work we present just-in-time synthesis (JITS) for GR(1), a novel means to execute synthesized reactive systems. Rather than constructing a controller at synthesis time, we compute next states during system execution, and only when they are required. We prove that JITS does not compromise the correctness of the synthesized system execution. We further show that the basic algorithm can be extended to enable several variants. We have implemented JITS in the Spectra synthesizer. Our evaluation, comparing JITS to existing tools over known benchmark specifications, shows that JITS reduces (1) total synthesis time, (2) the size of the synthesis output, and (3) the loading time for system execution, all while having little to no effect on system execution performance.", "doi": "10.1145/3324884.3416557", "arxiv_id": "https://doi.org/10.1145/3324884.3416557", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416557"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416557"}
{"title": "JISET: JavaScript IR-based Semantics Extraction Toolchain", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jihyeok Park", "Jihee Park", "Seungmin An", "Sukyoung Ryu"], "abstract": "JavaScript was initially designed for client-side programming in web browsers, but its engine is now embedded in various kinds of host software. Despite the popularity, since the JavaScript semantics is complex especially due to its dynamic nature, understanding and reasoning about JavaScript programs are challenging tasks. Thus, researchers have proposed several attempts to define the formal semantics of JavaScript based on ECMAScript, the official JavaScript specification. However, the existing approaches are manual, labor-intensive, and error-prone and all of their formal semantics target ECMAScript 5.1 (ES5.1, 2011) or its former versions. Therefore, they are not suitable for understanding modern JavaScript language features introduced since ECMAScript 6 (ES6, 2015). Moreover, ECMAScript has been annually updated since ES6, which already made five releases after ES5.1.", "doi": "10.1145/3324884.3416632", "arxiv_id": "https://doi.org/10.1145/3324884.3416632", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416632"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416632"}
{"title": "FlashRegex: Deducing Anti-ReDoS Regexes from Examples", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yeting Li", "Zhiwu Xu", "Jialun Cao", "Haiming Chen", "Tingjian Ge", "Shing-Chi Cheung", "Haoren Zhao"], "abstract": "Regular expressions (regexes) are widely used in different fields of computer science such as programming languages, string processing and databases. However, existing tools for synthesizing or repairing regexes were not designed to be resilient to Regex Denial of Service (ReDoS) attacks. Specifically, if a regex has super-linear (SL) worst-case complexity, an attacker could provide carefully-crafted inputs to launch ReDoS attacks. Therefore, in this paper, we propose a programming-by-example framework, FlashRegex, for generating anti-ReDoS regexes by either synthesizing or repairing from given examples. It is the first framework that integrates regex synthesis and repair with the awareness of ReDoS-vulnerabilities. We present novel algorithms to deduce anti-ReDoS regexes by reducing the ambiguity of these regexes and by using Boolean Satisfiability (SAT) or Neighborhood Search (NS) techniques. We evaluate FlashRegex with five related state-of-the-art tools. The evaluation results show that our work can effectively and efficiently generate anti-ReDoS regexes from given examples, and also reveal that existing synthesis and repair tools have neglected ReDoS-vulnerabilities of regexes. Specifically, the existing synthesis and repair tools generated up to 394 ReDoS-vulnerable regex within few seconds to more than one hour, while FlashRegex generated no SL regex within around five seconds. Furthermore, the evaluation results on ReDoS-vulnerable regex repair also show that FlashRegex has better capability than existing repair tools and even human experts, achieving 4 more ReDoS-invulnerable regex after repair without trimming and resorting, highlighting the usefulness of FlashRegex in terms of the generality, automation and user-friendliness.", "doi": "10.1145/3324884.3416556", "arxiv_id": "https://doi.org/10.1145/3324884.3416556", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416556"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416556"}
{"title": "Inferring and Applying Def-Use Like Configuration Couplings in Deployment Descriptors", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chengyuan Wen", "Yaxuan Zhang", "Xiao He", "Na Meng"], "abstract": "When building enterprise applications on Java frameworks (e.g., Spring), developers often specify components and configure operations with a special kind of XML files named “deployment descriptors (DD)”. Maintaining such XML files is challenging and time-consuming; because (1) the correct configuration semantics is domain-specific but usually vaguely documented, and (2) existing compilers and program analysis tools rarely examine XML files. To help developers ensure the quality of DD, this paper presents a novel approach-XEDITOR-that extracts configuration couplings (i.e., frequently co-occurring configurations) from DD, and adopts the coupling rules to validate new or updated files. Xeditor has two phases: coupling extraction and bug detection. To identify couplings, Xeditor first mines DD in open-source projects, and extracts XML entity pairs that (i) frequently coexist in the same files and (ii) hold the same data at least once. Xeditor then applies customized association rule mining to the extracted pairs. For bug detection, given a new XML file, Xeditor checks whether the file violates any coupling; if so, Xeditor reports the violation(s). For evaluation, we first created two data sets with the 4,248 DD mined from 1,137 GitHub projects. According to the experiments with these data sets, Xeditor extracted couplings with high precision (73%); it detected bugs with 92% precision, 96% recall, and 94% accuracy. Additionally, we applied Xeditor to the version history of another 478 GitHub projects. Xeditor identified 25 very suspicious XML updates, 15 of which were later fixed by developers.", "doi": "10.1145/3324884.3416577", "arxiv_id": "https://doi.org/10.1145/3324884.3416577", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416577"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416577"}
{"title": "Mastering Uncertainty in Performance Estimations of Configurable Software Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Johannes Dorn", "Sven Apel", "Norbert Siegmund"], "abstract": "Understanding the influence of configuration options on performance is key for finding optimal system configurations, system understanding, and performance debugging. In prior research, a number of performance-influence modeling approaches have been proposed, which model a configuration option's influence and a configuration's performance as a scalar value. However, these point estimates falsely imply a certainty regarding an option's influence that neglects several sources of uncertainty within the assessment process, such as (1) measurement bias, (2) model representation and learning process, and (3) incomplete data. This leads to the situation that different approaches and even different learning runs assign different scalar performance values to options and interactions among them. The true influence is uncertain, though. There is no way to quantify this uncertainty with state-of-the-art performance modeling approaches. We propose a novel approach, P4, based on probabilistic programming that explicitly models uncertainty for option influences and consequently provides a confidence interval for each prediction of a configuration's performance alongside a scalar. This way, we can explain, for the first time, why predictions may cause errors and which option's influences may be unreliable. An evaluation on 12 real-world subject systems shows that P4's accuracy is in line with the state of the art while providing reliable confidence intervals, in addition to scalar predictions.", "doi": "10.1145/3324884.3416620", "arxiv_id": "https://doi.org/10.1145/3324884.3416620", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416620"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416620"}
{"title": "Team Discussions and Dynamics During DevOps Tool Adoptions in OSS Projects", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Likang Yin", "Vladimir Filkov"], "abstract": "In Open Source Software (OSS) projects, pre-built tools dominate DevOps-oriented pipelines. In practice, a multitude of configuration management, cloud-based continuous integration, and automated deployment tools exist, and often more than one for each task. Tools are adopted (and given up) by OSS projects regularly. Prior work has shown that some tool adoptions are preceded by discussions, and that tool adoptions can result in benefits to the project. But important questions remain: how do teams decide to adopt a tool? What is discussed before the adoption and for how long? And, what team characteristics are determinant of the adoption?In this paper, we employ a large-scale empirical study in order to characterize the team discussions and to discern the team-level determinants of tool adoption into OSS projects' development pipelines. Guided by theories of team and individual motivations and dynamics, we perform exploratory data analyses, do deep-dive case studies, and develop regression models to learn the determinants of adoption and discussion length, and the direction of their effect on the adoption. From data of commit and comment traces of large-scale GitHub projects, our models find that prior exposure to a tool and member involvement are positively associated with the tool adoption, while longer discussions and the number of newer team members associate negatively. These results can provide guidance beyond the technical appropriateness for the timeliness of tool adoptions in diverse programmer teams. Our data and code is available at https://github.com/lkyin/tool_adoptions. In this paper, we employ a large-scale empirical study in order to characterize the team discussions and to discern the team-level determinants of tool adoption into OSS projects' development pipelines. Guided by theories of team and individual motivations and dynamics, we perform exploratory data analyses, do deep-dive case studies, and develop regression models to learn the determinants of adoption and discussion length, and the direction of their effect on the adoption. From data of commit and comment traces of large-scale GitHub projects, our models find that prior exposure to a tool and member involvement are positively associated with the tool adoption, while longer discussions and the number of newer team members associate negatively. These results can provide guidance beyond the technical appropriateness for the timeliness of tool adoptions in diverse programmer teams. Our data and code is available at https://github.com/lkyin/tool_adoptions.", "doi": "10.1145/3324884.3416640", "arxiv_id": "https://doi.org/10.1145/3324884.3416640", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416640"], "github": ["https://github.com/lkyin/tool_adoptions"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416640"}
{"title": "TestMC: Testing Model Counters using Differential and Metamorphic Testing", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Muhammad Usman", "Wenxi Wang", "Sarfraz Khurshid"], "abstract": "Model counting is the problem for finding the number of solutions to a formula over a bounded universe. This is a classic problem in computer science that has seen many recent advances in techniques and tools that tackle it. These advances have led to applications of model counting in many domains, e.g., quantitative program analysis, reliability, and security. Given the sheer complexity of the underlying problem, today's model counters employ sophisticated algorithms and heuristics, which result in complex tools that must be heavily optimized. Therefore, establishing the correctness of implementations of model counters necessitates rigorous testing. This experience paper presents an empirical study on testing industrial strength model counters by applying the principles of differential and metamorphic testing together with bounded exhaustive input generation and input minimization. We embody these principles in the TestMC framework, and apply it to test four model counters, including three state-of-the-art model counters from three different classes. Specifically, we test the exact model counters projMC and dSharp, the probabilistic exact model counter Ganak, and the probabilistic approximate model counter ApproxMC. As subjects, we use three complementary test suites of input formulas. One suite consists of larger formulas that are derived from a wide range of real-world software design problems. The second suite consists of a bounded exhaustive set of small formulas that TestMC generated. The third suite consists of formulas generated using an off-the-shelf CNF fuzzer. TestMC found bugs in three of the four subject model counters. The bugs led to crashes, segmentation faults, incorrect model counts, and resource exhaustion by the solvers. Two of the tools were corrected subsequent to the bug reports we submitted based on our study, whereas the bugs we reported in the third tool were deemed by the tool authors to not require a fix.", "doi": "10.1145/3324884.3416563", "arxiv_id": "https://doi.org/10.1145/3324884.3416563", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416563"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416563"}
{"title": "BigFuzz: Efficient Fuzz Testing for Data Analytics Using Framework Abstraction", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qian Zhang", "Jiyuan Wang", "Muhammad Ali Gulzar", "Rohan Padhye", "Miryung Kim"], "abstract": "As big data analytics become increasingly popular, data-intensive scalable computing (DISC) systems help address the scalability issue of handling large data. However, automated testing for such data-centric applications is challenging, because data is often incomplete, continuously evolving, and hard to know a priori. Fuzz testing has been proven to be highly effective in other domains such as security; however, it is nontrivial to apply such traditional fuzzing to big data analytics directly for three reasons: (1) the long latency of DISC systems prohibits the applicability of fuzzing: naïve fuzzing would spend 98% of the time in setting up a test environment; (2) conventional branch coverage is unlikely to scale to DISC applications because most binary code comes from the framework implementation such as Apache Spark; and (3) random bit or byte level mutations can hardly generate meaningful data, which fails to reveal real-world application bugs. We propose a novel coverage-guided fuzz testing tool for big data analytics, called BigFuzz. The key essence of our approach is that: (a) we focus on exercising application logic as opposed to increasing framework code coverage by abstracting the DISC framework using specifications. BigFuzz performs automated source to source transformations to construct an equivalent DISC application suitable for fast test generation, and (b) we design schema-aware data mutation operators based on our in-depth study of DISC application error types. BigFuzz speeds up the fuzzing time by 78 to 1477X compared to random fuzzing, improves application code coverage by 20% to 271%, and achieves 33% to 157% improvement in detecting application errors. When compared to the state of the art that uses symbolic execution to test big data analytics, BigFuzz is applicable to twice more programs and can find 81% more bugs.", "doi": "10.1145/3324884.3416641", "arxiv_id": "https://doi.org/10.1145/3324884.3416641", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416641"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416641"}
{"title": "Scaling Client-Specific Equivalence Checking via Impact Boundary Search", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nick Feng", "Federico Mora", "Vincent Hui", "Marsha Chechik"], "abstract": "Client-specific equivalence checking (CSEC) is a technique proposed previously to perform impact analysis of changes to downstream components (libraries) from the perspective of an unchanged system (client). Existing analysis techniques, whether general (re-gression verification, equivalence checking) or special-purpose, when applied to CSEC, either require users to provide specifications, or do not scale. We propose a novel solution to the CSEC problem, called 2clever, that is based on searching the control-flow of a program for impact boundaries. We evaluate a prototype implementation of 2clever on a comprehensive set of benchmarks and conclude that our prototype performs well compared to the state-of-the-art.", "doi": "10.1145/3324884.3416634", "arxiv_id": "https://doi.org/10.1145/3324884.3416634", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416634"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416634"}
{"title": "Code to Comment \"Translation\": Data, Metrics, Baselining & Evaluation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David Gros", "Hariharan Sezhiyan", "Prem Devanbu", "Zhou Yu"], "abstract": "The relationship of comments to code, and in particular, the task of generating useful comments given the code, has long been of interest. The earliest approaches have been based on strong syntactic theories of comment-structures, and relied on textual templates. More recently, researchers have applied deep-learning methods to this task---specifically, trainable generative translation models which are known to work very well for Natural Language translation (e.g., from German to English). We carefully examine the underlying assumption here: that the task of generating comments sufficiently resembles the task of translating between natural languages, and so similar models and evaluation metrics could be used. We analyze several recent code-comment datasets for this task: CodeNN, DeepCom, FunCom, and DocString. We compare them with WMT19, a standard dataset frequently used to train state-of-the-art natural language translators. We found some interesting differences between the code-comment data and the WMT19 natural language data. Next, we describe and conduct some studies to calibrate BLEU (which is commonly used as a measure of comment quality). using \"affinity pairs\" of methods, from different projects, in the same project, in the same class, etc; Our study suggests that the current performance on some datasets might need to be improved substantially. We also argue that fairly naive information retrieval (IR) methods do well enough at this task to be considered a reasonable baseline. Finally, we make some suggestions on how our findings might be used in future research in this area.", "doi": "10.1145/3324884.3416546", "arxiv_id": "https://doi.org/10.1145/3324884.3416546", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416546"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416546"}
{"title": "Exploring the Architectural Impact of Possible Dependencies in Python Software", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wuxia Jin", "Yuanfang Cai", "Rick Kazman", "Gang Zhang", "Qinghua Zheng", "Ting Liu"], "abstract": "Dependencies among software entities are the basis for many software analytic research and architecture analysis tools. Dynamically typed languages, such as Python, JavaScript and Ruby, tolerate the lack of explicit type references, making certain syntactic dependencies indiscernible in source code. We call these possible dependencies, in contrast with the explicit dependencies that are directly referenced in source code. Type inference techniques have been widely studied and applied, but existing architecture analytic research and tools have not taken possible dependencies into consideration. The fundamental question is, to what extent will these missing possible dependencies impact the architecture analysis? To answer this question, we conducted an empirical study with 105 Python projects, using type inference techniques to manifest possible dependencies. Our study revealed that the architectural impact of possible dependencies is substantial-higher than that of explicit dependencies: (1) file-level possible dependencies account for at least 27.93% of all file-level dependencies, and create different dependency structures than that of explicit dependencies only, with an average difference of 30.71%; (2) adding possible dependencies significantly improves the precision (0.52%~14.18%), recall(31.73%~39.12%), and F1 scores (22.13%~32.09%) of capturing co-change relations; (3) on average, a file involved in possible dependencies influences 28% more files and 42% more dependencies within architectural sub-spaces than a file involved in just explicit dependencies; (4) on average, a file involved in possible dependencies consumes 32% more maintenance effort. Consequently, maintainability scores reported by existing tools make a system written in these dynamic languages appear to be better modularized than it actually is. This evidence stronglysuggests that possible dependencies have a more significant impact than explicit dependencies on architecture quality, that architecture analysis and tools should assess and even emphasize the architectural impact of possible dependencies due to dynamic typing.", "doi": "10.1145/3324884.3416619", "arxiv_id": "https://doi.org/10.1145/3324884.3416619", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416619"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416619"}
{"title": "Problems and Opportunities in Training Deep Learning Software Systems: An Analysis of Variance", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hung Viet Pham", "Shangshu Qian", "Jiannan Wang", "Thibaud Lutellier", "Jonathan Rosenthal", "Lin Tan", "Yaoliang Yu", "Nachiappan Nagappan"], "abstract": "Deep learning (DL) training algorithms utilize nondeterminism to improve models' accuracy and training efficiency. Hence, multiple identical training runs (e.g., identical training data, algorithm, and network) produce different models with different accuracies and training times. In addition to these algorithmic factors, DL libraries (e.g., TensorFlow and cuDNN) introduce additional variance (referred to as implementation-level variance) due to parallelism, optimization, and floating-point computation. This work is the first to study the variance of DL systems and the awareness of this variance among researchers and practitioners. Our experiments on three datasets with six popular networks show large overall accuracy differences among identical training runs. Even after excluding weak models, the accuracy difference is 10.8%. In addition, implementation-level factors alone cause the accuracy difference across identical training runs to be up to 2.9%, the per-class accuracy difference to be up to 52.4%, and the training time difference to be up to 145.3%. All core libraries (TensorFlow, CNTK, and Theano) and low-level libraries (e.g., cuDNN) exhibit implementation-level variance across all evaluated versions. Our researcher and practitioner survey shows that 83.8% of the 901 participants are unaware of or unsure about any implementation-level variance. In addition, our literature survey shows that only 19.5±3% of papers in recent top software engineering (SE), artificial intelligence (AI), and systems conferences use multiple identical training runs to quantify the variance of their DL approaches. This paper raises awareness of DL variance and directs SE researchers to challenging tasks such as creating deterministic DL implementations to facilitate debugging and improving the reproducibility of DL software and results.", "doi": "10.1145/3324884.3416545", "arxiv_id": "https://doi.org/10.1145/3324884.3416545", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416545"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416545"}
{"title": "NEURODIFF: Scalable Differential Verification of Neural Networks using Fine-Grained Approximation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Brandon Paulsen", "Jingbo Wang", "Jiawei Wang", "Chao Wang"], "abstract": "As neural networks make their way into safety-critical systems, where misbehavior can lead to catastrophes, there is a growing interest in certifying the equivalence of two structurally similar neural networks - a problem known as differential verification. For example, compression techniques are often used in practice for deploying trained neural networks on computationally- and energy-constrained devices, which raises the question of how faithfully the compressed network mimics the original network. Unfortunately, existing methods either focus on verifying a single network or rely on loose approximations to prove the equivalence of two networks. Due to overly conservative approximation, differential verification lacks scalability in terms of both accuracy and computational cost. To overcome these problems, we propose NEURODIFF, a symbolic and fine-grained approximation technique that drastically increases the accuracy of differential verification on feed-forward ReLU networks while achieving many orders-of-magnitude speedup. NEURODIFF has two key contributions. The first one is new convex approximations that more accurately bound the difference of two networks under all possible inputs. The second one is judicious use of symbolic variables to represent neurons whose difference bounds have accumulated significant error. We find that these two techniques are complementary, i.e., when combined, the benefit is greater than the sum of their individual benefits. We have evaluated NEURODIFF on a variety of differential verification tasks. Our results show that NEURODIFF is up to 1000X faster and 5X more accurate than the state-of-the-art tool.", "doi": "10.1145/3324884.3416560", "arxiv_id": "https://doi.org/10.1145/3324884.3416560", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416560"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416560"}
{"title": "Identifying and Describing Information Seeking Tasks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chris Satterfield", "Thomas Fritz", "Gail C. Murphy"], "abstract": "A software developer works on many tasks per day, frequently switching between these tasks back and forth. This constant churn of tasks makes it difficult for a developer to know the specifics of when they worked on what task, complicating task resumption, planning, retrospection, and reporting activities. In a first step towards an automated aid to this issue, we introduce a new approach to help identify the topic of work during an information seeking task - one of the most common types of tasks that software developers face - that is based on capturing the contents of the developer's active window at regular intervals and creating a vector representation of key information the developer viewed. To evaluate our approach, we created a data set with multiple developers working on the same set of six information seeking tasks that we also make available for other researchers to investigate similar approaches. Our analysis shows that our approach enables: 1) segments of a developer's work to be automatically associated with a task from a known set of tasks with average accuracy of 70.6%, and 2) a word cloud describing a segment of work that a developer can use to recognize a task with average accuracy of 67.9%.", "doi": "10.1145/3324884.3416537", "arxiv_id": "https://doi.org/10.1145/3324884.3416537", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416537"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416537"}
{"title": "Predicting Code Context Models for Software Development Tasks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhiyuan Wan", "Gail C. Murphy", "Xin Xia"], "abstract": "Code context models consist of source code elements and their relations relevant to a development task. Prior research showed that making code context models explicit in software tools can benefit software development practices, e.g., code navigation and searching. However, little focus has been put on how to proactively form code context models. In this paper, we explore the proactive formation of code context models based on the topological patterns of code elements from interaction histories for a project. Specifically, we first learn abstract topological patterns based on the stereotype roles of code elements, rather than on specific code elements; we then leverage the learned patterns to predict the code context models for a given task by graph pattern matching. To determine the effectiveness of this approach, we applied the approach to interaction histories stored for the Eclipse Mylyn open source project. We found that our approach achieves maximum F-measures of 0.67, 0.33 and 0.21 for 1-step, 2-step and 3-step predictions, respectively. The most similar approach to ours is Suade, which supports 1-step prediction only. In comparison to this existing work, our approach predicts code context models with significantly higher F-measure (0.57 over 0.23 on average). The results demonstrate the value of integrating historical and structural approaches to form more accurate code context models.CCS CONCEPTS • Software and its engineering → Development frameworks and environments; • Human-centered computing → Human computer interaction (HCI).", "doi": "10.1145/3324884.3416544", "arxiv_id": "https://doi.org/10.1145/3324884.3416544", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416544"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416544"}
{"title": "SCDetector: Software Functional Clone Detection Based on Semantic Tokens Analysis", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yueming Wu", "Deqing Zou", "Shihan Dou", "Siru Yang", "Wei Yang", "Feng Cheng", "Hong Liang", "Hai Jin"], "abstract": "Code clone detection is to find out code fragments with similar functionalities, which has been more and more important in software engineering. Many approaches have been proposed to detect code clones, in which token-based methods are the most scalable but cannot handle semantic clones because of the lack of consideration of program semantics. To address the issue, researchers conduct program analysis to distill the program semantics into a graph representation and detect clones by matching the graphs. However, such approaches suffer from low scalability since graph matching is typically time-consuming. In this paper, we propose SCDetector to combine the scalability of token-based methods with the accuracy of graph-based methods for software functional clone detection. Given a function source code, we first extract the control flow graph by static analysis. Instead of using traditional heavyweight graph matching, we treat the graph as a social network and apply social-network-centrality analysis to dig out the centrality of each basic block. Then we assign the centrality to each token in a basic block and sum the centrality ofthe same token in different basic blocks. By this, a graph is turned into certain tokens with graph details (i.e., centrality), called semantic tokens. Finally, these semantic tokens are fed into a Siamese architecture neural network to train a code clone detector. We evaluate SCDetector on two large datasets of functionally similar code. Experimental results indicate that our system is superior to four state-of-the-art methods (i.e., SourcererCC, Deckard, RtvNN, and ASTNN) and the time cost of SCDetector is 14 times less than a traditional graph-based method (i.e., CCSharp) on detecting semantic clones.", "doi": "10.1145/3324884.3416562", "arxiv_id": "https://doi.org/10.1145/3324884.3416562", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416562"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416562"}
{"title": "Generating Concept based API Element Comparison Using a Knowledge Graph", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yang Liu", "Mingwei Liu", "Xin Peng", "Christoph Treude", "Zhenchang Xing", "Xiaoxin Zhang"], "abstract": "Developers are concerned with the comparison of similar APIs in terms of their commonalities and (often subtle) differences. Our empirical study of Stack Overflow questions and API documentation confirms that API comparison questions are common and can often be answered by knowledge contained in API reference documentation. Our study also identifies eight types of API statements that are useful for API comparison. Based on these findings, we propose a knowledge graph based approach APIComp that automatically extracts API knowledge from API reference documentation to support the comparison of a pair of API classes or methods from different aspects. Our approach includes an offline phase for constructing an API knowledge graph, and an online phase for generating an API comparison result for a given pair of API elements. Our evaluation shows that the quality of different kinds of extracted knowledge in the API knowledge graph is generally high. Furthermore, the comparison results generated by APIComp are significantly better than those generated by a baseline approach based on heuristic rules and text similarity, and our generated API comparison results are useful for helping developers in API selection tasks.", "doi": "10.1145/3324884.3416628", "arxiv_id": "https://doi.org/10.1145/3324884.3416628", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416628"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416628"}
{"title": "Multiplex Symbolic Execution: Exploring Multiple Paths by Solving Once", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yufeng Zhang", "Zhenbang Chen", "Ziqi Shuai", "Tianqi Zhang", "Kenli Li", "Ji Wang"], "abstract": "Path explosion and constraint solving are two challenges to symbolic execution's scalability. Symbolic execution explores the program's path space with a searching strategy and invokes the underlying constraint solver in a black-box manner to check the feasibility of a path. Inside the constraint solver, another searching procedure is employed to prove or disprove the feasibility. Hence, there exists the problem of double searchings in symbolic execution. In this paper, we propose to unify the double searching procedures to improve the scalability of symbolic execution. We propose Multiplex Symbolic Execution (MuSE) that utilizes the intermediate assignments during the constraint solving procedure to generate new program inputs. MuSE maps the constraint solving procedure to the path exploration in symbolic execution and explores multiple paths in one time of solving. We have implemented MuSE on two symbolic execution tools (based on KLEE and JPF) and three commonly used constraint solving algorithms. The results of the extensive experiments on real-world benchmarks indicate that MuSE has orders of magnitude speedup to achieve the same coverage.", "doi": "10.1145/3324884.3416645", "arxiv_id": "https://doi.org/10.1145/3324884.3416645", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416645"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416645"}
{"title": "Zeror: Speed Up Fuzzing with Coverage-sensitive Tracing and Scheduling", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chijin Zhou", "Mingzhe Wang", "Jie Liang", "Zhe Liu", "Yu Jiang"], "abstract": "Coverage-guided fuzzing is one of the most popular software testing techniques for vulnerability detection. While effective, current fuzzing methods suffer from significant performance penalty due to instrumentation overhead, which limits its practical use. Existing solutions improve the fuzzing speed by decreasing instrumentation overheads but sacrificing coverage accuracy, which results in unstable performance of vulnerability detection. In this paper, we propose a coverage-sensitive tracing and scheduling framework Zeror that can improve the performance of existing fuzzers, especially in their speed and vulnerability detection. The Zeror is mainly made up of two parts: (1) a self-modifying tracing mechanism to provide a zero-overhead instrumentation for more effective coverage collection, and (2) a real-time scheduling mechanism to support adaptive switch between the zero-overhead instrumented binary and the fully instrumented binary for better vulnerability detection. In this way, Zeror is able to decrease collection overhead and preserve fine-grained coverage for guidance. For evaluation, we implement a prototype of Zeror and evaluate it on Google fuzzer-test-suite, which consists of 24 widely-used applications. The results show that Zeror performs better than existing fuzzing speed-up frameworks such as Untracer and INSTRIM, improves the execution speed of the state-of-the-art fuzzers such as AFL and MOPT by 159.80%, helps them achieve better coverage (averagely 10.14% for AFL, 6.91% for MOPT) and detect vulnerabilities faster (averagely 29.00% for AFL, 46.99% for MOPT).", "doi": "10.1145/3324884.3416572", "arxiv_id": "https://doi.org/10.1145/3324884.3416572", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416572"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416572"}
{"title": "Detecting and Explaining Self-Admitted Technical Debts with Attention-based Neural Networks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xin Wang", "Jin Liu", "Li Li", "Xiao Chen", "Xiao Liu", "Hao Wu"], "abstract": "Self-Admitted Technical Debt (SATD) is a sub-type of technical debt. It is introduced to represent such technical debts that are intentionally introduced by developers in the process of software development. While being able to gain short-term benefits, the introduction of SATDs often requires to be paid back later with a higher cost, e.g., introducing bugs to the software or increasing the complexity of the software.", "doi": "10.1145/3324884.3416583", "arxiv_id": "https://doi.org/10.1145/3324884.3416583", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416583"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416583"}
{"title": "OCoR: An Overlapping-Aware Code Retriever", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qihao Zhu", "Zeyu Sun", "Xiran Liang", "Yingfei Xiong", "Lu Zhang"], "abstract": "Code retrieval helps developers reuse code snippets in the open-source projects. Given a natural language description, code retrieval aims to search for the most relevant code relevant among a set of code snippets. Existing state-of-the-art approaches apply neural networks to code retrieval. However, these approaches still fail to capture an important feature: overlaps. The overlaps between different names used by different people indicate that two different names may be potentially related (e.g., “message” and “msg”), and the overlaps between identifiers in code and words in natural language descriptions indicate that the code snippet and the description may potentially be related. To address this problem, we propose a novel neural architecture named OCoR, where we introduce two specifically-designed components to capture overlaps: the first embeds names by characters to capture the overlaps between names, and the second introduces a novel overlap matrix to represent the degrees of overlaps between each natural language word and each identifier. The evaluation was conducted on two established datasets. The experimental results show that OCoR significantly outperforms the existing state-of-the-art approaches and achieves 13.1% to 22.3% improvements. Moreover, we also conducted several in-depth experiments to help understand the performance of the different components in OCoR.", "doi": "10.1145/3324884.3416530", "arxiv_id": "https://doi.org/10.1145/3324884.3416530", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416530"], "github": ["https://github.com/anyone546/OCoR", "https://github.com/zysszy/TreeGen"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416530"}
{"title": "Understanding Performance Concerns in the API Documentation of Data Science Libraries", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yida Tao", "Jiefang Jiang", "Yepang Liu", "Zhiwu Xu", "Shengchao Qin"], "abstract": "The development of efficient data science applications is often impeded by unbearably long execution time and rapid RAM exhaustion. Since API documentation is the primary information source for troubleshooting, we investigate how performance concerns are documented in popular data science libraries. Our quantitative results reveal the prevalence of data science APIs that are documented in performance-related context and the infrequent maintenance activities on such documentation. Our qualitative analyses further reveal that crowd documentation like Stack Overflow and GitHub are highly complementary to official documentation in terms of the API coverage, the knowledge distribution, as well as the specific information conveyed through performance-related content. Data science practitioners could benefit from our findings by learning a more targeted search strategy for resolving performance issues. Researchers can be more assured of the advantages of integrating both the official and the crowd documentation to achieve a holistic view on the performance concerns in data science development.", "doi": "10.1145/3324884.3416543", "arxiv_id": "https://doi.org/10.1145/3324884.3416543", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416543"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416543"}
{"title": "On the Effectiveness of Unified Debugging: An Extensive Study on 16 Program Repair Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Samuel Benton", "Xia Li", "Yiling Lou", "Lingming Zhang"], "abstract": "Automated debugging techniques, including fault localization and program repair, have been studied for over a decade. However, the only existing connection between fault localization and program repair is that fault localization computes the potential buggy elements for program repair to patch. Recently, a pioneering work, ProFL, explored the idea of unified debugging to unify fault localization and program repair in the other direction for the first time to boost both areas. More specifically, ProFL utilizes the patch execution results from one state-of-the-art repair system, PraPR, to help improve state-of-the-art fault localization. In this way, ProFL not only improves fault localization for manual repair, but also extends the application scope of automated repair to all possible bugs (not only the small ratio of bugs that can be automaticallyfi xed). However, ProFL only considers one APR system (i.e., PraPR), and it is not clear how other existing APR systems based on different designs contribute to unified debugging. In this work, we perform an extensive study of the unified-debugging approach on 16 state-of-the-art program repair systems for the first time. Our experimental results on the widely studied Defects4J benchmark suite reveal various practical guidelines for unified debugging, such as (1) nearly all the studied 16 repair systems can positively contribute to unified debugging despite their varying repairing capabilities, (2) repair systems targeting multi-edit patches can bring extraneous noise into unified debugging, (3) repair systems with more executed/plausible patches tend to perform better for unified debugging, and (4) unified debugging effectiveness does not rely on the availability of correct patches in automated repair. Based on our results, we further propose an advanced unified debugging technique, UniDebug++, which can localize over 20% more bugs within Top-1 positions than state-of-the-art unified debugging technique, ProFL.", "doi": "10.1145/3324884.3416566", "arxiv_id": "https://doi.org/10.1145/3324884.3416566", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416566"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416566"}
{"title": "Automated Third-Party Library Detection for Android Applications: Are We There Yet?", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xian Zhan", "Lingling Fan", "Tianming Liu", "Sen Chen", "Li Li", "Haoyu Wang", "Yifei Xu", "Xiapu Luo", "Yang Liu"], "abstract": "Third-party libraries (TPLs) have become a significant part of the Android ecosystem. Developers can employ various TPLs with different functionalities to facilitate their app development. Unfortunately, the popularity of TPLs also brings new challenges and even threats. TPLs may carry malicious or vulnerable code, which can infect popular apps to pose threats to mobile users. Besides, the code of third-party libraries could constitute noises in some downstream tasks (e.g., malware and repackaged app detection). Thus, researchers have developed various tools to identify TPLs. However, no existing work has studied these TPL detection tools in detail; different tools focus on different applications with performance differences, but little is known about them. To better understand existing TPL detection tools and dissect TPL detection techniques, we conduct a comprehensive empirical study to fill the gap by evaluating and comparing all publicly available TPL detection tools based on four criteria: effectiveness, efficiency, code obfuscation-resilience capability, and ease of use. We reveal their advantages and disadvantages based on a systematic and thorough empirical study. Furthermore, we also conduct a user study to evaluate the usability of each tool. The results showthat LibScout outperforms others regarding effectiveness, LibRadar takes less time than others and is also regarded as the most easy-to-use one, and LibPecker performs the best in defending against code obfuscation techniques. We further summarize the lessons learned from different perspectives, including users, tool implementation, and researchers. Besides, we enhance these open-sourced tools by fixing their limitations to improve their detection ability. We also build an extensible framework that integrates all existing available TPL detection tools, providing online service for the research community. We make publicly available the evaluation dataset and enhanced tools. We believe our work provides a clear picture of existing TPL detection techniques and also give a road-map for future directions.", "doi": "10.1145/3324884.3416582", "arxiv_id": "https://doi.org/10.1145/3324884.3416582", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416582"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416582"}
{"title": "CCGraph: a PDG-based code clone detector with approximate graph matching", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yue Zou", "Bihuan Ban", "Yinxing Xue", "Yun Xu"], "abstract": "Software clone detection is an active research area, which is very important for software maintenance, bug detection, etc. The two pieces of cloned code reflect some similarities or equivalents in the syntax or structure of the code representations. There are many representations of code like AST, token, PDG, etc. The PDG (Program Dependency Graph) of source code can contain both syntactic and structural information. However, most existing PDG-based tools are quite time-consuming and miss many clones because they detect code clones with exact graph matching by using subgraph isomorphism. In this paper, we propose a novel PDG-based code clone detector, CCGraph, that uses graph kernels. Firstly, we normalize the structure of PDGs and design a two-stage filtering strategy by measuring the characteristic vectors of codes. Then we detect the code clones by using an approximate graph matching algorithm based on the reforming WL (Weisfeiler-Lehman) graph kernel. Experiment results show that CCGraph retains a high accuracy, has both better recall and F1-score values, and detects more semantic clones than other two related state-of-the-art tools. Besides, CCGraph is much more efficient than the existing PDG-based tools.", "doi": "10.1145/3324884.3416541", "arxiv_id": "https://doi.org/10.1145/3324884.3416541", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416541"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416541"}
{"title": "Towards Generating Thread-Safe Classes Automatically", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haichi Wang", "Zan Wang", "Jun Sun", "Shuang Liu", "Ayesha Sadiq", "Yuan-Fang Li"], "abstract": "The existing concurrency model for Java (or C) requires programmers to design and implement thread-safe classes by explicitly acquiring locks and releasing locks. Such a model is error-prone and is the reason for many concurrency bugs. While there are alternative models like transactional memory, manually writing locks remains prevalent in practice. In this work, we propose AutoLock, which aims to solve the problem by fully automatically generating thread-safe classes. Given a class which is assumed to be correct with sequential clients, AutoLock automatically generates a thread-safe class which is linearizable, and does it in a way without requiring a specification of the class. AutoLock takes three steps: (1) infer access annotations (i.e., abstract information on how variables are accessed and aliased), (2) synthesize a locking policy based on the access annotations, and (3) consistently implement the locking policy. AutoLock has been evaluated on a set of benchmark programs and the results show that AutoLock generates thread-safe classes effectively and could have prevented existing concurrency bugs.", "doi": "10.1145/3324884.3416625", "arxiv_id": "https://doi.org/10.1145/3324884.3416625", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416625"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416625"}
{"title": "No Strings Attached: An Empirical Study of String-related Software Bugs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Aryaz Eghbali", "Michael Pradel"], "abstract": "Strings play many roles in programming because they often contain complex and semantically rich information. For example, programmers use strings to filter inputs via regular expression matching, to express the names of program elements accessed through some form of reflection, to embed code written in another formal language, and to assemble textual output produced by a program. The omnipresence of strings leads to a wide range of mistakes that developers may make, yet little is currently known about these mistakes. The lack of knowledge about string-related bugs leads to developers repeating the same mistakes again and again, and to poor support for finding and fixing such bugs. This paper presents the first empirical study of the root causes, consequences, and other properties of string-related bugs. We systematically study 204 string-related bugs in a diverse set of projects written in JavaScript, a language where strings play a particularly important role. Our findings include (i) that many string-related mistakes are caused by a recurring set of root cause patterns, such as incorrect string literals and regular expressions, (ii) that string-related bugs have a diverse set of consequences, including incorrect output or silent omission of expected behavior, (iii) that fixing string-related bugs often requires changing just a single line, with many of the required repair ingredients available in the surrounding code, (iv) that string-related bugs occur across all parts of applications, including the core components, and (v) that almost none of these bugs are detected by existing static analyzers. Our findings not only show the importance and prevalence of string-related bugs, but they help developers to avoid common mistakes and tool builders to tackle the challenge of finding and fixing string-related bugs.", "doi": "10.1145/3324884.3416576", "arxiv_id": "https://doi.org/10.1145/3324884.3416576", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416576"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416576"}
{"title": "Automated Patch Correctness Assessment: How Far are We?", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shangwen Wang", "Ming Wen", "Bo Lin", "Hongjun Wu", "Yihao Qin", "Deqing Zou", "Xiaoguang Mao", "Hai Jin"], "abstract": "Test-based automated program repair (APR) has attracted huge attention from both industry and academia. Despite the significant progress made in recent studies, the overfitting problem (i.e., the generated patch is plausible but overfitting) is still a major and long-standing challenge. Therefore, plenty of techniques have been proposed to assess the correctness of patches either in the patch generation phase or in the evaluation of APR techniques. However, the effectiveness of existing techniques has not been systematically compared and little is known to their advantages and disadvantages. To fill this gap, we performed a large-scale empirical study in this paper. Specifically, we systematically investigated the effectiveness of existing automated patch correctness assessment techniques, including both static and dynamic ones, based on 902 patches automatically generated by 21 APR tools from 4 different categories. Our empirical study revealed the following major findings: (1) static code features with respect to patch syntax and semantics are generally effective in differentiating overfitting patches over correct ones; (2) dynamic techniques can generally achieve high precision while heuristics based on static code features are more effective towards recall; (3) existing techniques are more effective towards certain projects and types of APR techniques while less effective to the others; (4) existing techniques are highly complementary to each other. For instance, a single technique can only detect at most 53.5% of the overfitting patches while 93.3% of them can be detected by at least one technique when the oracle information is available. Based on our findings, we designed an integration strategy to first integrate static code features via learning, and then combine with others by the majority voting strategy. Our experiments show that the strategy can enhance the performance of existing patch correctness assessment techniques significantly.", "doi": "10.1145/3324884.3416590", "arxiv_id": "https://doi.org/10.1145/3324884.3416590", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416590"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416590"}
{"title": "Evaluating Representation Learning of Code Changes for Predicting Patch Correctness in Program Repair", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haoye Tian", "Kui Liu", "Abdoul Kader Kaboré", "Anil Koyuncu", "Li Li", "Jacques Klein", "Tegawendé F. Bissyandé"], "abstract": "A large body of the literature of automated program repair develops approaches where patches are generated to be validated against an oracle (e.g., a test suite). Because such an oracle can be imperfect, the generated patches, although validated by the oracle, may actually be incorrect. While the state of the art explore research directions that require dynamic information or that rely on manually-crafted heuristics, we study the benefit of learning code representations in order to learn deep features that may encode the properties of patch correctness. Our empirical work mainly investigates different representation learning approaches for code changes to derive embeddings that are amenable to similarity computations. We report on findings based on embeddings produced by pre-trained and re-trained neural networks. Experimental results demonstrate the potential of embeddings to empower learning algorithms in reasoning about patch correctness: a machine learning predictor with BERT transformer-based embeddings associated with logistic regression yielded an AUC value of about 0.8 in the prediction of patch correctness on a deduplicated dataset of 1000 labeled patches. Our investigations show that learned representations can lead to reasonable performance when comparing against the state-of-the-art, PATCH-SIM, which relies on dynamic information. These representations may further be complementary to features that were carefully (manually) engineered in the literature.", "doi": "10.1145/3324884.3416532", "arxiv_id": "https://doi.org/10.1145/3324884.3416532", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416532"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416532"}
{"title": "Scalable Multiple-View Analysis of Reactive Systems via Bidirectional Model Transformations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christos Tsigkanos", "Nianyu Li", "Zhi Jin", "Zhenjiang Hu", "Carlo Ghezzi"], "abstract": "Systematic model-driven design and early validation enable engineers to verify that a reactive system does not violate its requirements before actually implementing it. Requirements may come from multiple stakeholders, who are often concerned with different facets - design typically involves different experts having different concerns and views of the system. Engineers start from a specification which may be sourced from some domain model, while validation is often done on state-transition structures that support model checking. Two computationally expensive steps may work against scalability: transformation from specification to state-transition structures, and model checking. We propose a technique that makes the former efficient and also makes the resulting transition systems small enough to be efficiently verified. The technique automatically projects the specification into submodels depending on a property sought to be evaluated, which captures some stakeholder's viewpoint. The resulting reactive system submodel is then transformed into a state-transition structure and verified. The technique achieves cone-of-influence reduction, by slicing at the specification model level. Submodels are analysis-equivalent to the corresponding full model. If stakeholders propose a change to a submodel based on their own view, changes are automatically propagated to the specification model and other views affected. Automated reflection is achieved thanks to bidirectional model transformations, ensuring correctness. We cast our proposal in the context of graph-based reactive systems whose dynamics is described by rewriting rules. We demonstrate our view-based framework in practice on a case study within cyber-physical systems.", "doi": "10.1145/3324884.3416579", "arxiv_id": "https://doi.org/10.1145/3324884.3416579", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416579"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416579"}
{"title": "Trace-Checking Signal-based Temporal Properties: A Model-Driven Approach", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chaima Boufaied", "Claudio Menghi", "Domenico Bianculli", "Lionel C. Briand", "Yago Isasi Parache"], "abstract": "Signal-based temporal properties (SBTPs) characterize the behavior of a system when its inputs and outputs are signals over time; they are very common for the requirements specification of cyber-physical systems. Although there exist several specification languages for expressing SBTPs, such languages either do not easily allow the specification of important types of properties (such as spike or oscillatory behaviors), or are not supported by (efficient) trace-checking procedures. In this paper, we propose SB-TemPsy, a novel model-driven trace-checking approach for SBTPs. SB-TemPsy provides (i) SB-TemPsy-DSL, a domain-specific language that allows the specification of SBTPs covering the most frequent requirement types in cyber-physical systems, and (ii) SB-TemPsy-Check, an efficient, model-driven trace-checking procedure. This procedure reduces the problem of checking an SB-TemPsy-DSL property over an execution trace to the problem of evaluating an Object Constraint Language constraint on a model of the execution trace. We evaluated our contributions by assessing the expressiveness of SB-TemPsy-DSL and the applicability of SB-TemPsy-Check using a representative industrial case study in the satellite domain. SB-TemPsy-DSL could express 97% of the requirements of our case study and SB-TemPsy-Check yielded a trace-checking verdict in 87% of the cases, with an average checking time of 48.7 s. From a practical standpoint and compared to state-of-the-art alternatives, our approach strikes a better trade-off between expressiveness and performance as it supports a large set of property types that can be checked, in most cases, within practical time limits.", "doi": "10.1145/3324884.3416631", "arxiv_id": "https://doi.org/10.1145/3324884.3416631", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416631"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416631"}
{"title": "Attend and Represent: A Novel View on Algorithm Selection for Software Verification", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Cedric Richter", "Heike Wehrheim"], "abstract": "Today, a plethora of different software verification tools exist. When having a concrete verification task at hand, software developers thus face the problem of algorithm selection. Existing algorithm selectors for software verification typically use handpicked program features together with (1) either manually designed selection heuristics or (2) machine learned strategies. While the first approach suffers from not being transferable to other selection problems, the second approach lacks interpretability, i.e., insights into reasons for choosing particular tools. In this paper, we propose a novel approach to algorithm selection for software verification. Our approach employs representation learning together with an attention mechanism. Representation learning circumvents feature engineering, i.e., avoids the handpicking of program features. Attention permits a form of interpretability of the learned selectors. We have implemented our approach and have experimentally evaluated and compared it with existing approaches. The evaluation shows that representation learning does not only outperform manual feature engineering, but also enables transferability of the learning model to other selection tasks.", "doi": "10.1145/3324884.3416633", "arxiv_id": "https://doi.org/10.1145/3324884.3416633", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416633"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416633"}
{"title": "Cross-Contract Static Analysis for Detecting Practical Reentrancy Vulnerabilities in Smart Contracts", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yinxing Xue", "Mingliang Ma", "Yun Lin", "Yulei Sui", "Jiaming Ye", "Tianyong Peng"], "abstract": "Reentrancy bugs, one of the most severe vulnerabilities in smart contracts, have caused huge financial loss in recent years. Researchers have proposed many approaches to detecting them. However, empirical studies have shown that these approaches suffer from undesirable false positives and false negatives, when the code under detection involves the interaction between multiple smart contracts. In this paper, we propose an accurate and efficient cross-contract reentrancy detection approach in practice. Rather than design rule-of-thumb heuristics, we conduct a large empirical study of 11714 real-world contracts from Etherscan against three well-known general-purpose security tools for reentrancy detection. We manually summarized the reentrancy scenarios where the state-of-the-art approaches cannot address. Based on the empirical evidence, we present Clairvoyance, a cross-function and cross-contract static analysis to detect reentrancy vulnerabilities in real world with significantly higher accuracy. To reduce false negatives, we enable, for the first time, a cross-contract call chain analysis by tracking possibly tainted paths. To reduce false positives, we systematically summarized five major path protective techniques (PPTs) to support fast yet precise path feasibility checking. We implemented our approach and compared Clairvoyance with five state-of-the-art tools on 17770 real-worlds contracts. The results show that Clairvoyance yields the best detection accuracy among all the five tools and also finds 101 unknown reentrancy vulnerabilities.", "doi": "10.1145/3324884.3416553", "arxiv_id": "https://doi.org/10.1145/3324884.3416553", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416553"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416553"}
{"title": "Cats Are Not Fish: Deep Learning Testing Calls for Out-Of-Distribution Awareness", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David Berend", "Xiaofei Xie", "Lei Ma", "Lingjun Zhou", "Yang Liu", "Chi Xu", "Jianjun Zhao"], "abstract": "As Deep Learning (DL) is continuously adopted in many industrial applications, its quality and reliability start to raise concerns. Similar to the traditional software development process, testing the DL software to uncover its defects at an early stage is an effective way to reduce risks after deployment. According to the fundamental assumption of deep learning, the DL software does not provide statistical guarantee and has limited capability in handling data that falls outside of its learned distribution, i.e., out-of-distribution (OOD) data. Although recent progress has been made in designing novel testing techniques for DL software, which can detect thousands of errors, the current state-of-the-art DL testing techniques usually do not take the distribution of generated test data into consideration. It is therefore hard to judge whether the “identified errors” are indeed meaningful errors to the DL application (i.e., due to quality issues of the model) or outliers that cannot be handled by the current model (i.e., due to the lack of training data). Tofill this gap, we take thefi rst step and conduct a large scale empirical study, with a total of 451 experiment configurations, 42 deep neural networks (DNNs) and 1.2 million test data instances, to investigate and characterize the impact of OOD-awareness on DL testing. We further analyze the consequences when DL systems go into production by evaluating the effectiveness of adversarial retraining with distribution-aware errors. The results confirm that introducing data distribution awareness in both testing and enhancement phases outperforms distribution unaware retraining by up to 21.5%.", "doi": "10.1145/3324884.3416609", "arxiv_id": "https://doi.org/10.1145/3324884.3416609", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416609"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416609"}
{"title": "Metamorphic Object Insertion for Testing Object Detection Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shuai Wang", "Zhendong Su"], "abstract": "Recent advances in deep neural networks (DNNs) have led to object detectors (ODs) that can rapidly process pictures or videos, and recognize the objects that they contain. Despite the promising progress by industrial manufacturers such as Amazon and Google in commercializing deep learning-based ODs as a standard computer vision service, ODs --- similar to traditional software --- may still produce incorrect results. These errors, in turn, can lead to severe negative outcomes for the users. For instance, an autonomous driving system that fails to detect pedestrians can cause accidents or even fatalities. However, despite their importance, principled, systematic methods for testing ODs do not yet exist.", "doi": "10.1145/3324884.3416584", "arxiv_id": "https://doi.org/10.1145/3324884.3416584", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416584"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416584"}
{"title": "Seven Reasons Why: An In-Depth Study of the Limitations of Random Test Input Generation for Android", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Farnaz Behrang", "Alessandro Orso"], "abstract": "Experience paper: Testing of mobile apps is time-consuming and requires a great deal of manual effort. For this reason, industry and academic researchers have proposed a number of test input generation techniques for automating app testing. Although useful, these techniques have weaknesses and limitations that often prevent them from achieving high coverage. We believe that one of the reasons for these limitations is that tool developers tend to focus mainly on improving the strategy the techniques employ to explore app behavior, whereas limited effort has been put into investigating other ways to improve the performance of these techniques. To address this problem, and get a better understanding of the limitations of input-generation techniques for mobile apps, we conducted an in-depth study of the limitations of Monkey-arguably the most widely used tool for automated testing of Android apps. Specifically, in our study, we manually analyzed Monkey's performance on a benchmark of 64 apps to identify the common limitations that prevent the tool from achieving better coverage results. We then assessed the coverage improvement that Monkey could achieve if these limitations were eliminated. In our analysis of the results, we also discuss whether other existing test input generation tools suffer from these common limitations and provide insights on how they could address them.", "doi": "10.1145/3324884.3416567", "arxiv_id": "https://doi.org/10.1145/3324884.3416567", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416567"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416567"}
{"title": "Test Automation in Open-Source Android Apps: A Large-Scale Empirical Study", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jun-Wei Lin", "Navid Salehnamadi", "Sam Malek"], "abstract": "Automated testing of mobile apps has received significant attention in recent years from researchers and practitioners alike. In this paper, we report on the largest empirical study to date, aimed at understanding the test automation culture prevalent among mobile app developers. We systematically examined more than 3.5 million repositories on GitHub and identified more than 12,000 non-trivial and real-world Android apps. We then analyzed these non-trivial apps to investigate (1) the prevalence of adoption of test automation; (2) working habits of mobile app developers in regards to automated testing; and (3) the correlation between the adoption of test automation and the popularity of projects. Among others, we found that (1) only 8% of the mobile app development projects leverage automated testing practices; (2) developers tend to follow the same test automation practices across projects; and (3) popular projects, measured in terms of the number of contributors, stars, and forks on GitHub, are more likely to adopt test automation practices. To understand the rationale behind our observations, we further conducted a survey with 148 professional and experienced developers contributing to the subject apps. Our findings shed light on the current practices and future research directions pertaining to test automation for mobile app development.", "doi": "10.1145/3324884.3416623", "arxiv_id": "https://doi.org/10.1145/3324884.3416623", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416623"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416623"}
{"title": "Synthesis-Based Resolution of Feature Interactions in Cyber-Physical Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Benjamin Gafford", "Tobias Dürschmid", "Gabriel A. Moreno", "Eunsuk Kang"], "abstract": "The feature interaction problem arises when two or more independent features interact with each other in an undesirable manner. Feature interactions remain a challenging and important problem in emerging domains of cyber-physical systems (CPS), such as intelligent vehicles, unmanned aerial vehicles (UAVs) and the Internet of Things (IoT), where the outcome of an unexpected interaction may result in a safety failure. Existing approaches to resolving feature interactions rely on priority lists or fixed strategies, but may not be effective in scenarios where none of the competing feature actions are satisfactory with respect to system requirements. This paper proposes a novel synthesis-based approach to resolution, where a conflict among features is resolved by synthesizing an action that best satisfies the specification of desirable system behaviors in the given environmental context. Unlike existing resolution methods, our approach is capable of producing a desirable system outcome even when none of the conflicting actions are satisfactory. The effectiveness of the proposed approach is demonstrated using a case study involving interactions among safety-critical features in an autonomous drone.", "doi": "10.1145/3324884.3416630", "arxiv_id": "https://doi.org/10.1145/3324884.3416630", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416630"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416630"}
{"title": "MoFuzz: A Fuzzer Suite for Testing Model-Driven Software Engineering Tools", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hoang Lam Nguyen", "Nebras Nassar", "Timo Kehrer", "Lars Grunske"], "abstract": "Fuzzing or fuzz testing is an established technique that aims to discover unexpected program behavior (e.g., bugs, security vulnerabilities, or crashes) by feeding automatically generated data into a program under test. However, the application of fuzzing to test Model-Driven Software Engineering (MDSE) tools is still limited because of the difficulty of existing fuzzers to provide structured, well-typed inputs, namely models that conform to typing and consistency constraints induced by a given meta-model and underlying modeling framework. By drawing from recent advances on both fuzz testing and automated model generation, we present three different approaches for fuzzing MDSE tools: A graph grammar-based fuzzer and two variants of a coverage-guided mutation-based fuzzer working with different sets of model mutation operators. Our evaluation on a set of real-world MDSE tools shows that our approaches can outperform both standard fuzzers and model generators w.r.t. their fuzzing capabilities. Moreover, we found that each of our approaches comes with its own strengths and weaknesses in terms of fault finding capabilities and the ability to cover different aspects of the system under test. Thus the approaches complement each other, forming a fuzzer suite for testing MDSE tools.", "doi": "10.1145/3324884.3416668", "arxiv_id": "https://doi.org/10.1145/3324884.3416668", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416668"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416668"}
{"title": "Prober: Practically Defending Overflows with Page Protection", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hongyu Liu", "Ruiqin Tian", "Tongping Liu", "Bin Ren"], "abstract": "Heap-based overflows are still not completely solved even after decades of research. This paper proposes Prober, a novel system aiming to detect and prevent heap overflows in the production environment. Prober leverages a key observation based on the analysis of dozens of real bugs: all heap overflows are related to arrays. Based on this observation, Prober only focuses on array-related heap objects, instead of all heap objects. Prober utilizes static analysis to label all susceptible call-stacks during the compilation, and then employs the page protection to detect any invalid accesses during the runtime. In addition to this, Prober integrates multiple existing methods together to ensure the efficiency of its detection. Overall, Prober introduces almost negligible performance overhead, with 1.5% on average. Prober not only stops possible attacks on time, but also reports the faulty instructions that could guide bug fixes. Prober is ready for deployment due to its effectiveness and low overhead.", "doi": "10.1145/3324884.3416533", "arxiv_id": "https://doi.org/10.1145/3324884.3416533", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416533"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416533"}
{"title": "MinerRay: Semantics-Aware Analysis for Ever-Evolving Cryptojacking Detection", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alan Romano", "Yunhui Zheng", "Weihang Wang"], "abstract": "Recent advances in web technology have made in-browser crypto-mining a viable funding model. However, these services have been abused to launch large-scale cryptojacking attacks to secretly mine cryptocurrency in browsers. To detect them, various signature-based or runtime feature-based methods have been proposed. However, they can be imprecise or easily circumvented. To this end, we propose MinerRay, a generic scheme to detect malicious in-browser cryptominers. Instead of leveraging unreliable external patterns, MinerRay infers the essence of cryptomining behaviors that differentiate mining from common browser activities in both WebAssembly and JavaScript contexts. Additionally, to detect stealthy mining activities without user consents, MinerRay checks if the miner can only be instantiated from user actions. MinerRay was evaluated on over 1 million websites. It detected cryptominers on 901 websites, where 885 secretly start mining without user consent. Besides, we compared MinerRay with five state-of-the-art signature-based or behavior-based cryptominer detectors (MineSweeper, CMTracker, Outguard, No Coin, and minerBlock). We observed that emerging miners with new signatures or new services were detected by MinerRay but missed by others. The results show that our proposed technique is effective and robust in detecting evolving cryptominers, yielding more true positives, and fewer errors.", "doi": "10.1145/3324884.3416580", "arxiv_id": "https://doi.org/10.1145/3324884.3416580", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416580"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416580"}
{"title": "Summary-Based Symbolic Evaluation for Smart Contracts", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yu Feng", "Emina Torlak", "Rastislav Bodík"], "abstract": "This paper presents Solar, a system for automatic synthesis of adversarial contracts that exploit vulnerabilities in a victim smart contract. To make the synthesis tractable, we introduce a query language as well as summary-based symbolic evaluation, which significantly reduces the number of instructions that our synthesizer needs to evaluate symbolically, without compromising the precision of the vulnerability query. We encoded common vulnerabilities of smart contracts and evaluated Solar on the entire data set from Etherscan. Our experiments demonstrate the benefits of summary-based symbolic evaluation and show that Solar outperforms state-of-the-art smart contracts analyzers, TEETHER, Mythril, and Contract Fuzzer, in terms of running time and precision.", "doi": "10.1145/3324884.3416646", "arxiv_id": "https://doi.org/10.1145/3324884.3416646", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3416646"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3416646"}
{"title": "Applying Learning Techniques to Oracle Synthesis", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Facundo Molina"], "abstract": "Software reliability is a primary concern in the construction of software, and thus a fundamental component in the definition of software quality. Analyzing software reliability requires a specification of the intended behavior of the software under analysis. Unfortunately, software many times lacks such specifications. This issue seriously diminishes the analyzability of software with respect to its reliability. Thus, finding novel techniques to capture the intended software behavior in the form of specifications would allow us to exploit them for automated reliability analysis. Our research focuses on the application of learning techniques to automatically distinguish correct from incorrect software behavior. The aim here is to decrease the developer's effort in specifying oracles, and instead generating them from actual software behaviors.", "doi": "10.1145/3324884.3415287", "arxiv_id": "https://doi.org/10.1145/3324884.3415287", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415287"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415287"}
{"title": "Automated Generation of Client-Specific Backends Utilizing Existing Microservices and Architectural Knowledge", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nils Wieber"], "abstract": "The design and development of production-grade microservice backends is a tedious and error-prone task. In particular, they must be capable of handling all Functional Requirements (FRs) and all Non-Functional Requirements (NFRs) (like security) including all operational requirements (like monitoring). This becomes even more difficult if there are many clients with different roles, linked to diverse (non-)functional requirements and many existing services are involved, which have to consider these in a consistent way. In this paper we present a model-driven approach that automatically generates client-specific production-grade backends by incorporating previously expressed architectural knowledge out of an interpretable specification of the targeted APIs and the NFRs.CCS CONCEPTS • Software and its engineering →Abstraction, modeling and modularity; System modeling languages; Software architectures; Software development techniques.", "doi": "10.1145/3324884.3415283", "arxiv_id": "https://doi.org/10.1145/3324884.3415283", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415283"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415283"}
{"title": "SAT-Based Arithmetic Support for Alloy", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["César Cornejo"], "abstract": "Formal specifications in Alloy are organized around user-defined data domains, associated with signatures, with almost no support for built-in datatypes. This minimality in the built-in datatypes provided by the language is one of its main features, as it contributes to the automated analyzability of models. One of the few built-in datatypes available in Alloy specifications are integers, whose SAT-based treatment allows only for small bit-widths. In many contexts, where relational datatypes dominate, the use of integers may be auxiliary, e.g., in the use of cardinality constraints and other features. However, as the applications of Alloy are increased, e.g., with the use of the language and its tool support as backend engine for different analysis tasks, the provision of efficient support for numerical datatypes becomes a need. In this work, we present our current preliminary approach to providing an efficient, scalable and user-friendly extension to Alloy, with arithmetic support for numerical datatypes. Our implementation allows for arithmetic with varying precisions, and is implemented via standard Alloy constructions, thus resorting to SAT solving for resolving arithmetic constraints in models.", "doi": "10.1145/3324884.3415285", "arxiv_id": "https://doi.org/10.1145/3324884.3415285", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415285"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415285"}
{"title": "Towards Robust Production Machine Learning Systems: Managing Dataset Shift", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hala Abdelkader"], "abstract": "The advances in machine learning (ML) have stimulated the integration of their capabilities into software systems. However, there is a tangible gap between software engineering and machine learning practices, that is delaying the progress of intelligent services development. Software organisations are devoting effort to adjust the software engineering processes and practices to facilitate the integration of machine learning models. Machine learning researchers as well are focusing on improving the interpretability of machine learning models to support overall system robustness. Our research focuses on bridging this gap through a methodology that evaluates the robustness of machine learning-enabled software engineering systems. In particular, this methodology will automate the evaluation of the robustness properties of software systems against dataset shift problems in ML. It will also feature a notification mechanism that facilitates the debugging of ML components.", "doi": "10.1145/3324884.3415281", "arxiv_id": "https://doi.org/10.1145/3324884.3415281", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415281"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415281"}
{"title": "Towards Transparency-Encouraging Partial Software Disclosure to Enable Trust in Data Usage", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christian Schindler"], "abstract": "Whenever software components process personal or private data, appropriate data protection mechanisms are mandatory. An essential factor in achieving trust and transparency is not to give preference to a single party but to make it possible to audit the data usage in an unbiased way. The scenario in mind for this contribution contains (i) users bringing in sensitive data they want to be safe, (ii) developers building software-based services whose Intellectual Properties (IPs) they desire to protect, and (iii) platform providers wanting to be trusted and to be able to rely on the developers integrity. The authors see these interests as an insufficiently solved field of tension that can be relaxed by a suitable level of transparently represented software components to give insights without exposing every detail.", "doi": "10.1145/3324884.3415282", "arxiv_id": "https://doi.org/10.1145/3324884.3415282", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415282"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415282"}
{"title": "Using Defect Prediction to Improve the Bug Detection Capability of Search-Based Software Testing", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anjana Perera"], "abstract": "Automated test generators, such as search based software testing (SBST) techniques, replace the tedious and expensive task of manually writing test cases. SBST techniques are effective at generating tests with high code coverage. However, is high code coverage sufficient to maximise the number of bugs found? We argue that SBST needs to be focused to search for test cases in defective areas rather in non-defective areas of the code in order to maximise the likelihood of discovering the bugs. Defect prediction algorithms give useful information about the bug-prone areas in software. Therefore, we formulate the objective of this thesis: Improve the bug detection capability of SBST by incorporating defect prediction information. To achieve this, we devise two research objectives, i.e., 1) Develop a novel approach ($(\\mathrm{SBST}_{CL})$) that allocates time budget to classes based on the likelihood of classes being defective, and 2) Develop a novel strategy ($(\\mathrm{SBST}_{CL})$) to guide the underlying search algorithm (i.e., genetic algorithm) towards the defective areas in a class. Through empirical evaluation on 434 real reported bugs in the Defects4J dataset, we demonstrate that our novel approach, $(\\mathrm{SBST}_{CL})$, is significantly more efficient than the state of the art SBST when they are given a tight time budget in a resource constrained environment.", "doi": "10.1145/3324884.3415286", "arxiv_id": "https://doi.org/10.1145/3324884.3415286", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415286"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415286"}
{"title": "The New Approach to IT Testing : Real Transaction-Based Automated Validation Solution", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yongsik Kim", "SoAh Min", "Youkyung Kim"], "abstract": "Traditional IT projects have rolled out newly developed software or systems after iterating manual tests based on the scenarios and cases that are considered sufficient. However, due to the time and budget limitation of IT projects, these traditional tests almost always fail to include all the possible scenarios and cases of the real world. Thus, we cannot eliminate all potential defects before go-live and unexpected failures might occur as a result, which can lead to severe damage to both customers and IT project contractors. This paper demonstrates a real transaction-based automated testing approach named ‘PerfecTwin’ with several real-world examples. PerfecTwin overcomes the above limitations of the traditional testing by running the new and old systems side-by-side, automatically validating the new system against the old system's actual transactions, in real time, which can eliminate almost all potential defects before go-live.", "doi": "10.1145/3324884.3421839", "arxiv_id": "https://doi.org/10.1145/3324884.3421839", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3421839"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3421839"}
{"title": "Automatic Generation of IFTTT Mashup Infrastructures", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lei Liu", "Mehdi Bahrami", "Wei-Peng Chen"], "abstract": "In recent years, IF-This-Then-That (IFTTT) services are becoming more and more popular. Many platforms such as Zapier, IFTTT.com, and Workato provide such services, which allow users to create workflows with “triggers” and “actions” by using Web Application Programming Interfaces (APIs). However, the number of IFTTT recipes in the above platforms increases much slower than the growth of Web APIs. This is because human efforts are still largely required to build and deploy IFTTT recipes in the above platforms. To address this problem, in this paper, we present an automation tool to automatically generate the IFTTT mashup infrastructure. The proposed tool provides 5 REST APIs, which can automatically generate triggers, rules, and actions in AWS, and create a workflow XML to describe an IFTTT mashup by connecting the triggers, rules, and actions. This workflow XML is automatically sent to Fujitsu RunMyProcess (RMP) to set up and execute IFTTT mashup. The proposed tool, together with its associated method and procedure, enables an end-to-end solution for automatically creating, deploying, and executing IFTTT mashups in a few seconds, which can greatly reduce the development cycle and cost for new IFTTT mashups.", "doi": "10.1145/3324884.3421837", "arxiv_id": "https://doi.org/10.1145/3324884.3421837", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3421837"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3421837"}
{"title": "Towards Building Robust DNN Applications: An Industrial Case Study of Evolutionary Data Augmentation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haruki Yokoyama", "Satoshi Onoue", "Shinji Kikuchi"], "abstract": "Data augmentation techniques that increase the amount of training data by adding realistic transformations are used in machine learning to improve the level of accuracy. Recent studies have demonstrated that data augmentation techniques improve the robustness of image classification models with open datasets; however, it has yet to be investigated whether these techniques are effective for industrial datasets. In this study, we investigate the feasibility of data augmentation techniques for industrial use. We evaluate data augmentation techniques in image classification and object detection tasks using an industrial in-house graphical user interface dataset. As the results indicate, the genetic algorithm-based data augmentation technique outperforms two random-based methods in terms of the robustness of the image classification model. In addition, through this evaluation and interviews with the developers, we learned following two lessons: data augmentation techniques should (1) maintain the training speed to avoid slowing the development and (2) include extensibility for a variety of tasks.", "doi": "10.1145/3324884.3421841", "arxiv_id": "https://doi.org/10.1145/3324884.3421841", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3421841"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3421841"}
{"title": "Industry Practice of JavaScript Dynamic Analysis on WeChat Mini-Programs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yi Liu", "Jinhui Xie", "Jianbo Yang", "Shiyu Guo", "Yuetang Deng", "Shuqing Li", "Yechang Wu", "Yepang Liu"], "abstract": "JavaScript is one of the most popular programming languages. WeChat Mini-Program is a large ecosystem of JavaScript applications that runs on the WeChat platform. Millions of Mini-Programs are accessed by WeChat users every week. Consequently, the performance and robustness of Mini-Programs are particularly important. Unfortunately, many Mini-Programs suffer from various defects and performance problems. Dynamic analysis is a useful technique to pinpoint application defects. However, due to the dynamic features of the JavaScript language and the complexity of the runtime environment, dynamic analysis techniques were rarely used to improve the quality of JavaScript applications running on industrial platforms such as WeChat Mini-Program previously. In this work, we report our experience of extending Jalangi, a dynamic analysis framework for JavaScript applications developed by academia, and applying the extended version, named WeJalangi, to diagnose defects in WeChat Mini-Programs. WeJalangi is compatible with existing dynamic analysis tools such as DLint, Smemory, and JITProf. We implemented a null pointer checker on WeJalangi and tested the tool's usability on 152 open-source Mini-Programs. We also conducted a case study in Tencent by applying WeJalangi on six popular commercial Mini-Programs. In the case study, WeJalangi accurately located six null pointer issues and three of them haven't been discovered previously. All of the reported defects have been confirmed by developers and testers.", "doi": "10.1145/3324884.3421842", "arxiv_id": "https://doi.org/10.1145/3324884.3421842", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3421842"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3421842"}
{"title": "Lightweight MBT Testing for National e-Health Portal in Norway", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Davrondzhon Gafurov", "Margrete Sunde Grovan", "Arne Erik Hurum"], "abstract": "We present lightweight model-based testing (MBT) of privacy and authorization concepts of national portal for electronic health services in Norway (which has over a million of visits per month). We have developed test models for creating and updating privacy levels and authorization categories using finite state machine. Our models emphasize not only positive but also negative behavioral aspects of the system. Using edge and edge-pair coverage as an acceptance criteria we identify and systematically derive abstract tests (high level user scenario) from models. Abstract tests are further refined and transformed into concrete tests with detailed steps and data. Although derivation of abstract tests and their transformation into concrete ones are manual, execution of concrete tests and generation of test report are automated. In total, we extracted 85 abstract test cases which resulted in 80 concrete test cases with over 550 iterations. Automated execution of all tests takes about 1 hour, while manual execution of one takes about 5 minutes (over 40 times speedup). MBT contributed to shift the focus of our intellectual work effort into model design rather than test case design, thus making derivation of test scenarios systematic and straight forward. In addition, applying MBT augmented and extended our traditional quality assurance techniques by facilitating better comprehension of new privacy and authorization concepts. Graphical models served as a useful aid in learning these concepts for newcomers.", "doi": "10.1145/3324884.3421843", "arxiv_id": "https://doi.org/10.1145/3324884.3421843", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3421843"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3421843"}
{"title": "Code-Based Vulnerability Detection in Node.js Applications: How far are we?", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bodin Chinthanet", "Serena Elisa Ponta", "Henrik Plate", "Antonino Sabetta", "Raula Gaikovina Kula", "Takashi Ishio", "Kenichi Matsumoto"], "abstract": "With one of the largest available collection of reusable packages, the JavaScript runtime environment Node.js is one of the most popular programming application. With recent work showing evidence that known vulnerabilities are prevalent in both open source and industrial software, we propose and implement a viable code-based vulnerability detection tool for Node.js applications. Our case study lists the challenges encountered while implementing our Node.js vulnerable code detector.", "doi": "10.1145/3324884.3421838", "arxiv_id": "https://doi.org/10.1145/3324884.3421838", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3421838"], "github": ["https://github.com/NAIST-SE/steady"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3421838"}
{"title": "A Framework for Automated Test Mocking of Mobile Apps", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mattia Fazzini", "Alessandra Gorla", "Alessandro Orso"], "abstract": "Mobile apps interact with their environment extensively, and these interactions can complicate testing activities because test cases may need a complete environment to be executed. Interactions with the environment can also introduce test flakiness, for instance when the environment behaves in non-deterministic ways. For these reasons, it is common to create test mocks that can eliminate the need for (part of) the environment to be present during testing. Manual mock creation, however, can be extremely time consuming and error-prone. Moreover, the generated mocks can typically only be used in the context of the specific tests for which they were created. To address these issues, we propose MOKA, a general framework for collecting and generating reusable test mocks in an automated way. MOKA leverages the ability to observe a large number of interactions between an application and its environment and uses an iterative approach to generate two possible, alternative types of mocks with different reusability characteristics: advanced mocks generated through program synthesis (ideally) and basic record-replay-based mocks (as a fallback solution). In this paper, we describe the new ideas behind MOKA, its main characteristics, a preliminary empirical study, and a set of possible applications that could benefit from our framework.", "doi": "10.1145/3324884.3418927", "arxiv_id": "https://doi.org/10.1145/3324884.3418927", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418927"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418927"}
{"title": "A Hybrid Analysis to Detect Java Serialisation Vulnerabilities", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shawn Rasheed", "Jens Dietrich"], "abstract": "Serialisation related security vulnerabilities have recently been reported for numerous Java applications. Since serialisation presents both soundness and precision challenges for static analysis, it can be difficult for analyses to precisely pinpoint serialisation vulnerabilities in a Java library. In this paper, we propose a hybrid approach that extends a static analysis with fuzzing to detect serialisation vulnerabilities. The novelty of our approach is in its use of a heap abstraction to direct fuzzing for vulnerabilities in Java libraries. This guides fuzzing to produce results quickly and effectively, and it validates static analysis reports automatically. Our approach shows potential as it can detect known serialisation vulnerabilities in the Apache Commons Collections library.", "doi": "10.1145/3324884.3418931", "arxiv_id": "https://doi.org/10.1145/3324884.3418931", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418931"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418931"}
{"title": "BugPecker: Locating Faulty Methods with Deep Learning on Revision Graphs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Junming Cao", "Shouliang Yang", "Wenhui Jiang", "Hushuang Zeng", "Beijun Shen", "Hao Zhong"], "abstract": "Given a bug report of a project, the task of locating the faults of the bug report is called fault localization. To help programmers in the fault localization process, many approaches have been proposed, and have achieved promising results to locate faulty files. However, it is still challenging to locate faulty methods, because many methods are short and do not have sufficient details to determine whether they are faulty. In this paper, we present BugPecker, a novel approach to locate faulty methods based on its deep learning on revision graphs. Its key idea includes (1) building revision graphs and capturing the details of past fixes as much as possible, and (2) discovering relations inside our revision graphs to expand the details for methods and calculating various features to assist our ranking. We have implemented BugPecker, and evaluated it on three open source projects. The early results show that BugPecker achieves a mean average precision (MAP) of 0.263 and mean reciprocal rank (MRR) of 0.291, which improve the prior approaches significantly. For example, BugPecker improves the MAP values of all three projects by five times, compared with two recent approaches such as DNNLoc-m and BLIA 1.5.", "doi": "10.1145/3324884.3418934", "arxiv_id": "https://doi.org/10.1145/3324884.3418934", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418934"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418934"}
{"title": "Closer to the Edge: Testing Compilers More Thoroughly by Being Less Conservative About Undefined Behaviour", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Karine Even-Mendoza", "Cristian Cadar", "Alastair F. Donaldson"], "abstract": "Randomised compiler testing techniques require a means of generating programs that are free from undefined behaviour (UB) in order to reliably reveal miscompilation bugs. Existing program generators such as Csmith heavily restrict the form of generated programs in order to achieve DB-freedom. We hypothesise that the idiomatic nature of such programs limits the test coverage they can offer. Our idea is to generate less restricted programs that are still UB-free-programs that get closer to the edge of UB, but that do not quite cross the edge. We present preliminary support for our idea via a prototype tool, Csmithedge, which uses simple dynamic analysis to determine where Csmith has been too conservative in its use of safe math wrappers that guarantee UB-freedom for arithmetic operations. By eliminating redundant wrappers, Csmithedge was able to discover two new miscompilation bugs in GCC that could not be found via intensive testing using regular Csmith, and to achieve substantial differences in code coverage on GCC compared with regular Csmith. CCS CONCEPTS • Software and its engineering →Compilers; Software verification and validation.", "doi": "10.1145/3324884.3418933", "arxiv_id": "https://doi.org/10.1145/3324884.3418933", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418933"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418933"}
{"title": "Generating Highly-structured Input Data by Combining Search-based Testing and Grammar-based Fuzzing", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mitchell Olsthoorn", "Arie van Deursen", "Annibale Panichella"], "abstract": "Software testing is an important and time-consuming task that is often done manually. In the last decades, researchers have come up with techniques to generate input data (e.g., fuzzing) and automate the process of generating test cases (e.g., search-based testing). However, these techniques are known to have their own limitations: search-based testing does not generate highly-structured data; grammar-based fuzzing does not generate test case structures. To address these limitations, we combine these two techniques. By applying grammar-based mutations to the input data gathered by the search-based testing algorithm, it allows us to co-evolve both aspects of test case generation. We evaluate our approach, called G-EVOSUITE, by performing an empirical study on 20 Java classes from the three most popular JSON parsers across multiple search budgets. Our results show that the proposed approach on average improves branch coverage for JSON related classes by 15 % (with a maximum increase of 50 %) without negatively impacting other classes.", "doi": "10.1145/3324884.3418930", "arxiv_id": "https://doi.org/10.1145/3324884.3418930", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418930"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418930"}
{"title": "Making Fair ML Software using Trustworthy Explanation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Joymallya Chakraborty", "Kewen Peng", "Tim Menzies"], "abstract": "  Machine learning software is being used in many applications (finance,\nhiring, admissions, criminal justice) having a huge social impact. But\nsometimes the behavior of this software is biased and it shows discrimination\nbased on some sensitive attributes such as sex, race, etc. Prior works\nconcentrated on finding and mitigating bias in ML models. A recent trend is\nusing instance-based model-agnostic explanation methods such as LIME to find\nout bias in the model prediction. Our work concentrates on finding shortcomings\nof current bias measures and explanation methods. We show how our proposed\nmethod based on K nearest neighbors can overcome those shortcomings and find\nthe underlying bias of black-box models. Our results are more trustworthy and\nhelpful for the practitioners. Finally, We describe our future framework\ncombining explanation and planning to build fair software.\n", "doi": "10.1145/3324884.3418932", "arxiv_id": "https://doi.org/10.1145/3324884.3418932", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418932", "https://arxiv.org/pdf/2007.02893"], "github": ["https://github.com/joymallyac/Fair-Knn"], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418932", "journal_ref": "ASE 2020: The 35th IEEE/ACM International Conference on Automated\n  Software Engineering, Melbourne, Australia, Mon 21 - Fri 25 September 2020", "categories": "cs.SE", "cited_by": 0}
{"title": "On Benign Features in Malware Detection", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michael Cao", "Sahar Badihi", "Khaled Ahmed", "Peiyu Xiong", "Julia Rubin"], "abstract": "This paper investigates the problem of classifying Android applications into malicious and benign. We analyze the performance of a popular malware detection tool, Drebin, and show that its correct classification decisions often stem from using benign rather than malicious features for making predictions. That, effectively, turns the classifier into a benign app detector rather than a malware detector. While such behavior allows the classifier to achieve a high detection accuracy, it also makes it vulnerable to attacks, e.g., by a malicious app pretending to be benign by using features similar to those of benign apps. In this paper, we propose an approach for deprioritizing benign features in malware detection, focusing the detection on truly malicious portions of the apps. We show that our proposed approach makes a classifier more resilient to attacks while still allowing it to maintain a high detection accuracy.", "doi": "10.1145/3324884.3418926", "arxiv_id": "https://doi.org/10.1145/3324884.3418926", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418926"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418926"}
{"title": "Proving Termination by k-Induction", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jianhui Chen", "Fei He"], "abstract": "We propose a novel approach to proving the termination of imperative programs by -induction. By our approach, the termination proving problem can be formalized as a -inductive invariant synthesis task. On the one hand, -induction uses weaker invariants than that required by the standard inductive approach. On the other hand, the base case of -induction, which unrolls the program, can provide stronger pre-condition for invariant synthesis. As a result, the termination arguments of our approach can be synthesized more efficiently than the standard method. We implement a prototype of our inductive approach. The experimental results show the significant effectiveness and efficiency of our approach.", "doi": "10.1145/3324884.3418929", "arxiv_id": "https://doi.org/10.1145/3324884.3418929", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418929"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418929"}
{"title": "SRRTA: Regression Testing Acceleration via State Reuse", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jinhao Dong", "Yiling Lou", "Dan Hao"], "abstract": "Regression testing is widely recognized as an important but time-consuming process. To alleviate this cost issue, test selection, reduction, and prioritization have been widely studied, and they share the commonality that they improve regression testing by optimizing the execution of the whole test suite. In this paper, we attempt to accelerate regression testing from a totally new perspective, i.e., skipping some execution of a new program by reusing program states of an old program. Following this intuition, we propose a state-reuse based acceleration approach SRRTA, consisting of two components: state storage and loading. With the former, SRRTA collects some program states during the execution of an old version through three heuristic-based storage strategies; with the latter, SRRTA loads the stored program states with efficiency optimization strategies. Through the preliminary study on commons-math, SRRTA reduces 82.7% of the regression testing time.", "doi": "10.1145/3324884.3418928", "arxiv_id": "https://doi.org/10.1145/3324884.3418928", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418928"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418928"}
{"title": "An Automated Assessment of Android Clipboards", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wei Wang", "Ruoxi Sun", "Minhui Xue", "Damith C. Ranasinghe"], "abstract": "Since the new privacy feature in iOS enabling users to acknowledge which app is reading or writing to his or her clipboard through prompting notifications was updated, a plethora of top apps have been reported to frequently access the clipboard without user consent. However, the lack of monitoring and control of Android application's access to the clipboard data leave Android users blind to their potential to leak private information from Android clipboards, raising severe security and privacy concerns. In this preliminary work, we envisage and investigate an approach to (i) dynamically detect clipboard access behaviour, and (ii) determine privacy leaks via static data flow analysis, in which we enhance the results of taint analysis with call graph concatenation to enable leakage source backtracking. Our preliminary results indicate that the proposed method can expose clipboard data leakage as substantiated by our discovery of a popular app, i.e., Sogou Input, directly monitoring and transferring user data in a clipboard to backend servers.", "doi": "10.1145/3324884.3418905", "arxiv_id": "https://doi.org/10.1145/3324884.3418905", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418905"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418905"}
{"title": "Edge4Sys: A Device-Edge Collaborative Framework for MEC based Smart Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Han Gao", "Yi Xu", "Xiao Liu", "Jia Xu", "Tianxiang Chen", "Bowen Zhou", "Rui Li", "Xuejun Li"], "abstract": "At present, most of the smart systems are based on cloud computing, and massive data generated at the smart end device will need to be transferred to the cloud where AI models are deployed. Therefore, a big challenge for smart system engineers is that cloud based smart systems often face issues such as network congestion and high latency. In recent years, mobile edge computing (MEC) is becoming a promising solution which supports computation-intensive tasks such as deep learning through computation offloading to the servers located at the local network edge. To take full advantage of MEC, an effective collaboration between the end device and the edge server is essential. In this paper, as an initial investigation, we propose Edge4Sys, a Device-Edge Collaborative Framework for MEC based Smart System. Specifically, we employ the deep learning based user identification process in a MEC-based UAV (Unmanned Aerial Vehicle) delivery system as a case study to demonstrate the effectiveness of the proposed framework which can significantly reduce the network traffic and the response time.", "doi": "10.1145/3324884.3418908", "arxiv_id": "https://doi.org/10.1145/3324884.3418908", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418908"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418908"}
{"title": "Efficient Multiplex Symbolic Execution with Adaptive Search Strategy", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tianqi Zhang", "Yufeng Zhang", "Zhenbang Chen", "Ziqi Shuai", "Ji Wang"], "abstract": "Symbolic execution is still facing the scalability problem caused by path explosion and constraint solving overhead. The recently proposed MuSE framework supports exploring multiple paths by generating partial solutions in one time of solving. In this work, we improve MuSE from two aspects. Firstly, we use a light-weight check to reduce redundant partial solutions for avoiding the redundant executions having the same results. Secondly, we introduce online learning to devise an adaptive search strategy for the target programs. The preliminary experimental results indicate the promising of the proposed methods.", "doi": "10.1145/3324884.3418902", "arxiv_id": "https://doi.org/10.1145/3324884.3418902", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418902"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418902"}
{"title": "Managing App Testing Device Clouds: Issues and Opportunities", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mattia Fazzini", "Alessandro Orso"], "abstract": "Because creating and maintaining an in-house test lab is expensive and time-consuming, companies and app developers often use device clouds to test their apps. Because quality-assurance activities depend on such device clouds, it is important to understand possible issues related to their use. To this end, in this paper we present a preliminary study that investigates issues and highlights research opportunities in the context of managing and maintaining device clouds. In the study, we analyzed over 12 million test executions on 110 devices. We found that the management software of the cloud infrastructure we considered affected some test executions, and almost all the cloud devices had at least one security-related issue.", "doi": "10.1145/3324884.3418909", "arxiv_id": "https://doi.org/10.1145/3324884.3418909", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418909"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418909"}
{"title": "Styx: A Data-Oriented Mutation Framework to Improve the Robustness of DNN", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Meixi Liu", "Weijiang Hong", "Weiyu Pan", "Chendong Feng", "Zhenbang Chen", "Ji Wang"], "abstract": "The robustness of deep neural network (DNN) is critical and challenging to ensure. In this paper, we propose a general data-oriented mutation framework, called Styx, to improve the robustness of DNN. Styx generates new training data by slightly mutating the training data. In this way, Styx ensures the DNN's accuracy on the test dataset while improving the adaptability to small perturbations, i.e., improving the robustness. We have instantiated Styx for image classification and proposed pixel-level mutation rules that are applicable to any image classification DNNs. We have applied Styx on several commonly used benchmarks and compared Styx with the representative adversarial training methods. The preliminary experimental results indicate the effectiveness of Styx.", "doi": "10.1145/3324884.3418903", "arxiv_id": "https://doi.org/10.1145/3324884.3418903", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418903"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418903"}
{"title": "Synthesizing Smart Solving Strategy for Symbolic Execution", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zehua Chen", "Zhenbang Chen", "Ziqi Shuai", "Yufeng Zhang", "Weiyu Pan"], "abstract": "Constraint solving is one of the challenges for symbolic execution. Modern SMT solvers allow users to customize the internal solving procedure by solving strategies. In this extended abstract, we report our recent progress in synthesizing a program-specific solving strategy for the symbolic execution of a program. We propose a two-stage procedure for symbolic execution. At the first stage, we synthesize a solving strategy by utilizing deep learning techniques. Then, the strategy will be used in the second stage to improve the performance of constraint solving. The preliminary experimental results indicate the promising of our method.", "doi": "10.1145/3324884.3418904", "arxiv_id": "https://doi.org/10.1145/3324884.3418904", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418904"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418904"}
{"title": "The Symptom, Cause and Repair of Workaround", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daohan Song", "Hao Zhong", "Li Jia"], "abstract": "In software development, issue tracker systems are widely used to manage bug reports. In such a system, a bug report can be filed, diagnosed, assigned, and fixed. In the standard process, a bug can be resolved as fixed, invalid, duplicated or won't fix. Although the above resolutions are well-defined and easy to understand, a bug report can end with a less known resolution, i.e., workaround. Compared with other resolutions, the definition of workarounds is more ambiguous. Besides the problem that is reported in a bug report, the resolution of a workaround raises more questions. Some questions are important for users, especially those programmers who build their projects upon others (e.g., libraries). Although some early studies have been conducted to analyze API workarounds, many research questions on workarounds are still open. For example, which bugs are resolved as workarounds? Why is a bug report resolved as workarounds? What are the repairs of workarounds? In this experience paper, we conduct the first empirical study to explore the above research questions. In particular, we analyzed 221 real workarounds that were collected from Apache projects. Our results lead to some interesting and useful answers to all the above questions. For example, we find that most bug reports are resolved as workarounds, because their problems reside in libraries (24.43%), settings (18.55%), and clients (10.41%). Among them, many bugs are difficult to be fixed fully and perfectly. As a late breaking result, we can only briefly introduce our study, but we present a detailed plan to extend it to a full paper.", "doi": "10.1145/3324884.3418910", "arxiv_id": "https://doi.org/10.1145/3324884.3418910", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418910"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418910"}
{"title": "Towards Immersive Comprehension of Software Systems Using Augmented Reality - An Empirical Evaluation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rohit Mehra", "Vibhu Saujanya Sharma", "Vikrant Kaulgud", "Sanjay Podder", "Adam P. Burden"], "abstract": "While traditionally, software comprehension relies on approaches like reading through the code or looking at charts on screens, which are 2D mediums, there have been some recent approaches that advocate exploring 3D approaches like Augmented or Virtual Reality (AR/VR) to have a richer experience towards understanding software and its internal relationships. However, there is a dearth of objective studies that compare such 3D representations with their traditional 2D counterparts in the context of software comprehension. In this paper, we present an evaluation study to quantitatively and qualitatively compare 2D and 3D software representations with respect to typical comprehension tasks. For the 3D medium, we utilize an AR-based approach for 3D visualizations of a software system (XRaSE), while the 2D medium comprises of textual IDEs and 2D graph representations. The study, which has been conducted using 20 professional developers, shows that for most comprehension tasks, the developers perform much better using the 3D representation, especially in terms of velocity and recollection, while also displaying reduced cognitive load and better engagement.", "doi": "10.1145/3324884.3418907", "arxiv_id": "https://doi.org/10.1145/3324884.3418907", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418907"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418907"}
{"title": "Towards Programming and Verification for Activity-Oriented Smart Home Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xuansong Li", "Wei Song", "Xiangyu Zhang"], "abstract": "Smart home systems are becoming increasingly popular. Software engineering of such systems hence becomes a prominent challenge. In this engineering paradigm, users are often interested in considering sensor states while they are performing various activities. Existing works have proposed initial efforts on incremental development method for activity-oriented requirements. However, there is no systematic way of ensuring reliability and security of such systems which may be developed by various developers and may execute in a complex environment. Some properties, especially those including timing constraints, need to be satisfied. In this paper, we introduce Actom, a framework for identification of activity-oriented requirements and runtime verification. Actom supports the development of the mapping between activities and required sensor readings (activity-sensor mapping). At runtime, Actom receives results of activity recognition and is able to trigger actuators to provide the required physical conditions for the activities, as determined by the activity-sensor mapping. Moreover, Actom continuously monitors whether activity-sensor mapping holds over a time period during the activity. We also discuss the evaluation plan to demonstrate the effectiveness and efficiency of Actom. The end product will be a systematic framework to facilitate the development of activity-oriented requirements and monitor properties with timing constraints to improve reliability and security.", "doi": "10.1145/3324884.3418906", "arxiv_id": "https://doi.org/10.1145/3324884.3418906", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418906"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418906"}
{"title": "AirMochi - A Tool for Remotely Controlling iOS Devices", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nikola Lukic", "Saghar Talebipour", "Nenad Medvidovic"], "abstract": "This paper presents AIRMOCHI, a tool that provides remote access and control of apps by leveraging a mobile platform's publicly exported accessibility features. While AIRMOCHI is designed to be platform-independent, we discuss its iOS implementation. We show that AIRMOCHI places no restrictions on apps, is able to handle a variety of scenarios, and imposes a negligible performance overhead. https://youtu.be/rhPz2Hs4Ius https://github.com/nkllkc/air_mochi", "doi": "10.1145/3324884.3415304", "arxiv_id": "https://doi.org/10.1145/3324884.3415304", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415304"], "github": ["https://github.com/nkllkc/air_mochi"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415304"}
{"title": "Botsing, a Search-based Crash Reproduction Framework for Java", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pouria Derakhshanfar", "Xavier Devroey", "Annibale Panichella", "Andy Zaidman", "Arie van Deursen"], "abstract": "Approaches for automatic crash reproduction aim to generate test cases that reproduce crashes starting from the crash stack traces. These tests help developers during their debugging practices. One of the most promising techniques in this research field leverages search-based software testing techniques for generating crash reproducing test cases. In this paper, we introduce Botsing, an open-source search-based crash reproduction framework for Java. Botsing implements state-of-the-art and novel approaches for crash reproduction. The well-documented architecture of Botsing makes it an easy-to-extend framework, and can hence be used for implementing new approaches to improve crash reproduction. We have applied Botsing to a wide range of crashes collected from open source systems. Furthermore, we conducted a qualitative assessment of the crash-reproducing test cases with our industrial partners. In both cases, Botsing could reproduce a notable amount of the given stack traces.Demo. video: https://www.youtube.com/watch?v=k6XaQjHqe48 Botsing website: https://stamp-project.github.io/botsing/", "doi": "10.1145/3324884.3415299", "arxiv_id": "https://doi.org/10.1145/3324884.3415299", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415299"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415299"}
{"title": "Express: An Energy-Efficient and Secure Framework for Mobile Edge Computing and Blockchain based Smart Systems**This research is in part supported by the National Natural Science Foundation of China Project No. 61972001", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jia Xu", "Xiao Liu", "Xuejun Li", "Lei Zhang", "Yun Yang"], "abstract": "As most smart systems such as smart logistic and smart manufacturing are delay sensitive, the current mainstream cloud computing based system architecture is facing the critical issue of high latency over the Internet. Meanwhile, as huge amount of data is generated by smart devices with limited battery and computing power, the increasing demand for energy-efficient machine learning and secure data communication at the network edge has become a hurdle to the success of smart systems. To address these challenges with using smart UAV (Unmanned Aerial Vehicle) delivery system as an example, we propose EXPRESS, a novel energy-efficient and secure framework based on mobile edge computing and blockchain technologies. We focus on computation and data (resource) management which are two of the most prominent components in this framework. The effectiveness of the EXPRESS framework is demonstrated through the implementation of a real-world UAV delivery system. As an open-source framework, EXPRESS can help researchers implement their own prototypes and test their computation and data management strategies in different smart systems. The demo video can be found at https://youtu.be/r3U1iU8tSmk.", "doi": "10.1145/3324884.3415294", "arxiv_id": "https://doi.org/10.1145/3324884.3415294", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415294"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415294"}
{"title": "Edge4Real: A Cost-Effective Edge Computing based Human Behaviour Recognition System for Human-Centric Software Engineering", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Di Shao", "Xiao Liu", "Ben Cheng", "Owen Wang", "Thuong N. Hoang"], "abstract": "Recognition of human behaviours including body motions and facial expressions plays a significant role in human-centric software engineering. However, due to the data and computation intensive nature of human behaviour recognition through video analytics, expensive powerful machines are often required, which could hinder the research and application in human-centric software engineering. To address such an issue, this paper proposes a cost-effective human behaviour recognition system named Edge4Real which can be easily deployed in an edge computing environment with commodity machines. Compared with existing centralised solutions, Edge4Real has three major advantages including cost-effectiveness, easy-to-use, and realtime. Specifically, Edge4Real adopts a distributed architecture where components such as motion capturing, human behaviour recognition, data decoding and extraction, and the application of the recognition result, can be deployed on separated end devices and edge nodes in an edge computing environment. Using a virtual reality application which can capture a user's motion and translate into the motion of a 3D avatar in real time, we successfully validate the effectiveness of the system and demonstrate its promising value to the research and application of human-centric software engineering. The demo video can be found at https://youtu.be/tnEshD8j-kA.", "doi": "10.1145/3324884.3415297", "arxiv_id": "https://doi.org/10.1145/3324884.3415297", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415297"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415297"}
{"title": "FILO: FIx-LOcus Localization for Backward Incompatibilities Caused by Android Framework Upgrades", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marco Mobilio", "Oliviero Riganelli", "Daniela Micucci", "Leonardo Mariani"], "abstract": "Mobile operating systems evolve quickly, frequently updating the APIs that app developers use to build their apps. Unfortunately, API updates do not always guarantee backward compatibility, causing apps to not longer work properly or even crash when running with an updated system. This paper presents FILO, a tool that assists Android developers in resolving backward compatibility issues introduced by API upgrades. FILO both suggests the method that needs to be modified in the app in order to adapt the app to an upgraded API, and reports key symptoms observed in the failed execution to facilitate the fixing activity. Results obtained with the analysis of 12 actual upgrade problems and the feedback produced by early tool adopters show that FILO can practically support Android developers. FILO can be downloaded from https://gitlab.com/learnERC/filo, and its video demonstration is available at https://youtu.be/WDvkKj-wnlQ.", "doi": "10.1145/3324884.3415290", "arxiv_id": "https://doi.org/10.1145/3324884.3415290", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415290"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415290"}
{"title": "GUI2WiRe: Rapid Wireframing with a Mined and Large-Scale GUI Repository using Natural Language Requirements", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kristian Kolthoff", "Christian Bartelt", "Simone Paolo Ponzetto"], "abstract": "High-fidelity Graphical User Interface (GUI) prototyping is a well-established and suitable method for enabling fruitful discussions, clarification and refinement of requirements formulated by customers. GUI prototypes can help to reduce misunderstandings between customers and developers, which may occur due to the ambiguity comprised in informal Natural Language (NL). However, a disadvantage of employing high-fidelity GUI prototypes is their time-consuming and expensive development. Common GUI prototyping tools are based on combining individual GUI components or manually crafted templates. In this work, we present GUI2WiRe, a tool that enables users to retrieve GUI prototypes from a semiautomatically created large-scale GUI repository for mobile applications matching user requirements specified in Natural Language (NLR). We extract multiple text segments from the GUI hierarchy data and employ various Information Retrieval (IR) models and Automatic Query Expansion (AQE) techniques to achieve ad-hoc GUI retrieval from NLR. Retrieved GUI prototypes mined from applications can be inserted in the graphical editor of GUI2WiRe to rapidly create wireframes. GUI components are extracted automatically from the GUI screenshots and basic editing functionality is provided to the user. Finally, a preview of the application is created from the wireframe to allow interactive exploration of the current design. We evaluated the applied IR and AQE approaches for their effectiveness in terms of GUI retrieval relevance on a manually annotated collection of NLR and discuss our planned user studies. Video presentation of GUI2WiRe: https://youtu.be/2nN-Xr2Hk7I", "doi": "10.1145/3324884.3415289", "arxiv_id": "https://doi.org/10.1145/3324884.3415289", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415289"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415289"}
{"title": "HomoTR: Online Test Recommendation System Based on Homologous Code Matching", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chenqian Zhu", "Weisong Sun", "Qin Liu", "Yangyang Yuan", "Chunrong Fang", "Yong Huang"], "abstract": "A growing number of new technologies are used in test development. Among them, automatic test generation, a promising technology to improve the efficiency of unit testing, currently performs not satisfactory in practice. Test recommendation, like code recommendation, is another feasible technology for supporting efficient unit testing and gets increasing attention. In this paper, we develop a novel system, namely HomoTR, which implements online test recommendations by measuring the homology of two methods. If the new method under test shares homology with an existing method that has test cases, HomoTR will recommend the test cases to the new method. The preliminary experiments show that HomoTR can quickly and effectively recommend test cases to help the developers improve the testing efficiency. Besides, HomoTR has been integrated into the MoocTest platform successfully, so it can also execute the recommended test cases automatically and visualize the testing results (e.g., Branch Coverage) friendly to help developers understand the process of testing. The demo video of HomoTR can be found at https://youtu.be/_227EfcUbus.", "doi": "10.1145/3324884.3415296", "arxiv_id": "https://doi.org/10.1145/3324884.3415296", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415296"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415296"}
{"title": "ImpAPTr: A Tool For Identifying The Clues To Online Service Anomalies", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hao Wang", "Guoping Rong", "Yangchen Xu", "Yong You"], "abstract": "As a common IT infrastructure, APM (Application Performance Management) systems have been widely adopted to monitor call requests to an on-line service. Usually, each request may contain multi-dimensional attributes (e.g., City, ISP, Platform, etc.), which may become the reason for a certain anomaly regarding DSR (De-clining Success Rate) of service calls either solely or as a combination. Moreover, each attribute may also have multiple values (e.g., ISP could be T-Mobile, Vodafone, CMCC, etc.), rendering intricate root causes and huge challenges to identify the root causes. In this paper, we propose a prototype tool, ImpAPTr (Impact Analysis based on Pruning Tree), to identify the combination of dimensional attributes as the clues to dig out the root causes of anomalies regarding DSR of a service call in a timely manner. ImpAPTr has been evaluated in MeiTuan, one of the biggest on-line service providers. Performance regarding the accuracy outperforms several previous tools in the same field.", "doi": "10.1145/3324884.3415301", "arxiv_id": "https://doi.org/10.1145/3324884.3415301", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415301"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415301"}
{"title": "OSLDetector: Identifying Open-Source Libraries through Binary Analysis", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dan Zhang", "Ping Luo", "Wei Tang", "Min Zhou"], "abstract": "Using open-source libraries can provide rich functions and reduce development cost. However, some critical issues have also been caused such as license conflicts and vulnerability risks. In this paper, we design and implement an open-source libraries detection tool OSLDetector which uses methods of matching features to detect third-party libraries for multi-platform software in binaries. We took a series of methods such as filtering features and novelty building an internal clone forest to cope with the challenge of feature duplication. The tool can also provide the conflict of licenses and identify possible corresponding vulnerabilities, so these potential risks can be resolved and avoided. To evaluate the efficiency of OSLDetector, we collect 5K libraries containing 9K versions and manage their respective license type and existing vulnerabilities. The experimental results with a precision of 96% and recall of 92.3% show that OSLDetector is effective and outperforms similar tools.", "doi": "10.1145/3324884.3415303", "arxiv_id": "https://doi.org/10.1145/3324884.3415303", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415303"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415303"}
{"title": "Sosed: a tool for finding similar software projects", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Egor Bogomolov", "Yaroslav Golubev", "Artyom Lobanov", "Vladimir Kovalenko", "Timofey Bryksin"], "abstract": "In this paper, we present Sosed, a tool for discovering similar software projects. We use fastText to compute the embeddings of subtokens into a dense space for 120,000 GitHub projects in 200 languages. Then, we cluster embeddings to identify groups of semantically similar subtokens that reflect topics in source code. We use a dataset of 9 million GitHub projects as a reference search base. To identify similar projects, we compare the distributions of clusters among their subtokens. The tool receives an arbitrary project as input, extracts subtokens in 16 most popular programming languages, computes cluster distribution, and finds projects with the closest distribution in the search base. We labeled subtoken clusters with short descriptions to enable Sosed to produce interpretable output.", "doi": "10.1145/3324884.3415291", "arxiv_id": "https://doi.org/10.1145/3324884.3415291", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415291"], "github": ["https://github.com/JetBrains-Research/buckwheat", "https://github.com/JetBrains-Research/sosed"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415291"}
{"title": "WASim: Understanding WebAssembly Applications through Classification", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alan Romano", "Weihang Wang"], "abstract": "WebAssembly is a new programming language built for better performance in web applications. It defines a binary code format and a text representation for the code. At first glance, WebAssembly files are not easily understandable to human readers, regardless of the experience level. As a result, distributed third-party WebAssembly modules need to be implicitly trusted by developers as verifying the functionality requires significant effort. To this end, we develop an automated classification tool WASim for identifying the purpose of WebAssembly programs by analyzing features at the module-level. It assigns purpose labels to a module in order to assist developers in understanding the binary module. The code for WASim is available at https://github.com/WASimilarity/WASim and a video demo is available at https://youtu.be/usfYFleTy0U.", "doi": "10.1145/3324884.3415293", "arxiv_id": "https://doi.org/10.1145/3324884.3415293", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415293"], "github": ["https://github.com/WASimilarity/WASim"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415293"}
{"title": "MetPurity: A Learning-Based Tool of Pure Method Identification for Automatic Test Generation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Runze Yu", "Youzhe Zhang", "Jifeng Xuan"], "abstract": "In object-oriented programming, a method is pure if calling the method does not change object states that exist in the pre-states of the method call. Pure methods are widely-used in automatic techniques, including test generation, compiler optimization, and program repair. Due to the source code dependency, it is infeasible to completely and accurately identify all pure methods. Instead, existing techniques such as ReImInfer are designed to identify a subset of accurate results of pure method and mark the other methods as unknown ones. In this paper, we designed and implemented MetPurity, a learning-based tool of pure method identification. Given all methods in a project, MetPurity labels a training set via automatic program analysis and builds a binary classifier (implemented with the random forest classifier) based on the training set. This classifier is used to predict the purity of all the other methods (i.e., unknown ones) in the same project. Preliminary evaluation on four open-source Java projects shows that MetPurity can provide a list of identified pure methods with a low error rate. Applying MetPurity to EvoSuite can increase the number of generated assertions for regression testing in test generation by EvoSuite.", "doi": "10.1145/3324884.3415292", "arxiv_id": "https://doi.org/10.1145/3324884.3415292", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415292"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415292"}
{"title": "STIFA: Crowdsourced Mobile Testing Report Selection Based on Text and Image Fusion Analysis", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhenfei Cao", "Xu Wang", "Shengcheng Yu", "Yexiao Yun", "Chunrong Fang"], "abstract": "Crowdsourced mobile testing has been widely used due to its convenience and high efficiency [10]. Crowdsourced workers complete testing tasks and record results in test reports. However, the problem of duplicate reports has prevented the efficiency of crowdsourced mobile testing from further improving. Existing crowdsourced testing report analysis techniques usually leverage screenshots and text descriptions independently, but fail to recognize the link between these two types of information. In this paper, we present a crowdsourced mobile testing report selection tool, namely STIFA, to extract image and text feature information in reports and establish an image-text-fusion bug context. Based on text and image fusion analysis results, STIFA performs cluster analysis and report selection. To evaluate, we employed STIFA to analyze 150 reports from 2 apps. The results show that STIFA can extract, on average, 95.23% text feature information and 84.15% image feature information. Besides, STIFA reaches an accuracy of 87.64% in detecting duplicate reports. The demo can be found at https://youtu.be/Gw6ptqyQbQY.", "doi": "10.1145/3324884.3415300", "arxiv_id": "https://doi.org/10.1145/3324884.3415300", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415300"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415300"}
{"title": "JITBot: An Explainable Just-In-Time Defect Prediction Bot", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chaiyakarn Khanan", "Worawit Luewichana", "Krissakorn Pruktharathikoon", "Jirayus Jiarpakdee", "Chakkrit Tantithamthavorn", "Morakot Choetkiertikul", "Chaiyong Ragkhitwetsagul", "Thanwadee Sunetnanta"], "abstract": "Just-In-Time (JIT) defect prediction is a classification model that is trained using historical data to predict bug-introducing changes. However, recent studies raised concerns related to the explainability of the predictions of many software analytics applications (i.e., practitioners do not understand why commits are risky and how to improve them). In addition, the adoption of Just-In-Time defect prediction is still limited due to a lack of integration into CI/CD pipelines and modern software development platforms (e.g., GitHub). In this paper, we present an explainable Just-In-Time defect prediction framework to automatically generate feedback to developers by providing the riskiness of each commit, explaining why such commit is risky, and suggesting risk mitigation plans. The proposed framework is integrated into the GitHub CI/CD pipeline as a GitHub application to continuously monitor and analyse a stream of commits in many GitHub repositories. Finally, we discuss the usage scenarios and their implications to practitioners. The VDO demonstration is available at https://jitbot-tool.github.io/", "doi": "10.1145/3324884.3415295", "arxiv_id": "https://doi.org/10.1145/3324884.3415295", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415295"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415295"}
{"title": "Speeding up GUI Testing by On-Device Test Generation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nataniel P. Borges", "Jenny Rau", "Andreas Zeller"], "abstract": "When generating GUI tests for Android apps, it typically is a separate test computer that generates interactions, which are then executed on an actual Android device. While this approach is efficient in the sense that apps and interactions execute quickly, the communication overhead between test computer and device slows down testing considerably. In this work, we present DD-2, a test generator for Android that tests other apps on the device using Android accessibility services. In our experiments, DD-2 has shown to be 3.2 times faster than its computer-device counterpart, while sharing the same source code.", "doi": "10.1145/3324884.3415302", "arxiv_id": "https://doi.org/10.1145/3324884.3415302", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415302"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415302"}
{"title": "PerfCI: A Toolchain for Automated Performance Testing during Continuous Integration of Python Projects", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Omar Javed", "Joshua Heneage Dawes", "Marta Han", "Giovanni Franzoni", "Andreas Pfeiffer", "Giles Reger", "Walter Binder"], "abstract": "Software performance testing is an essential quality assurance mechanism that can identify optimization opportunities. Automating this process requires strong tool support, especially in the case of Continuous Integration (CI) where tests need to run completely automatically and it is desirable to provide developers with actionable feedback. A lack of existing tools means that performance testing is normally left out of the scope of CI. In this paper, we propose a toolchain - PerfCI - to pave the way for developers to easily set up and carry out automated performance testing under CI. Our toolchain is based on allowing users to (1) specify performance testing tasks, (2) analyze unit tests on a variety of python projects ranging from scripts to full-blown flask-based web services, by extending a performance analysis framework (VyPR) and (3) evaluate performance data to get feedback on the code. We demonstrate the feasibility of our toolchain by using it on a web service running at the Compact Muon Solenoid (CMS) experiment at the world's largest particle physics laboratory - CERN. Package. Source code, example and documentation of PerfCI are available: https://gitlab.cern.ch/omjaved/PerfCI. Tool demonstration can be viewed on YouTube: https://youtu.be/RDmXMKAlv7g. We also provide the data set used in the analysis: https://gitlab.cern.ch/omjaved/PerfCI-dataset.", "doi": "10.1145/3324884.3415288", "arxiv_id": "https://doi.org/10.1145/3324884.3415288", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415288"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415288"}
{"title": "SmartBugs: A Framework to Analyze Solidity Smart Contracts", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["João F. Ferreira", "Pedro Cruz", "Thomas Durieux", "Rui Abreu"], "abstract": "Over the last few years, there has been substantial research on automated analysis, testing, and debugging of Ethereum smart contracts. However, it is not trivial to compare and reproduce that research. To address this, we present SmartBugs, an extensible and easy-to-use execution framework that simplifies the execution of analysis tools on smart contracts written in Solidity, the primary language used in Ethereum. SmartBugs is currently distributed with support for 10 tools and two datasets of Solidity contracts. The first dataset can be used to evaluate the precision of analysis tools, as it contains 143 annotated vulnerable contracts with 208 tagged vulnerabilities. The second dataset contains 47,518 unique contracts collected through Etherscan. We discuss how SmartBugs supported the largest experimental setup to date both in the number of tools and in execution time. Moreover, we show how it enables easy integration and comparison of analysis tools by presenting a new extension to the tool SmartCheck that improves substantially the detection of vulnerabilities related to the DASP10 categories Bad Randomness, Time Manipulation, and Access Control(identified vulnerabilities increased from 11% to 24%).", "doi": "10.1145/3324884.3415298", "arxiv_id": "https://doi.org/10.1145/3324884.3415298", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415298"], "github": ["https://github.com/smartbugs/smartbugs"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415298"}
{"title": "RepoSkillMiner: Identifying software expertise from GitHub repositories using Natural Language Processing", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stratos Kourtzanidis", "Alexander Chatzigeorgiou", "Apostolos Ampatzoglou"], "abstract": "A GitHub profile is becoming an essential part of a developer's resume enabling HR departments to extract someone's expertise, through automated analysis of his/her contribution to open-source projects. At the same time, having clear insights on the technologies used in a project can be very beneficial for resource allocation and project maintainability planning. In the literature, one can identify various approaches for identifying expertise on programming languages, based on the projects that developer contributed to. In this paper, we move one step further and introduce an approach (ac-companied by a tool) to identify low-level expertise on particular software frameworks and technologies apart, relying solely on GitHub data, using the GitHub API and Natural Language Processing (NLP)-using the Microsoft Language Understanding Intelligent Service (LUIS). In particular, we developed an NLP model in LUIS for named-entity recognition for three (3). NET technologies and two (2) front-end frameworks. Our analysis is based upon specific commit contents, in terms of the exact code chunks, which the committer added or changed. We evaluate the precision, recall and f-measure for the derived technologies/frameworks, by conducting a batch test in LUIS and report the results. The proposed approach is demonstrated through a fully functional web application named RepoSkillMiner.", "doi": "10.1145/3324884.3415305", "arxiv_id": "https://doi.org/10.1145/3324884.3415305", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3415305"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3415305"}
{"title": "A Machine Learning based Approach to Autogenerate Diagnostic Models for CNC machines", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kamil Adipovich Masalimov"], "abstract": "This article presents a description of a system for the automatic generation of predictive diagnostic models of CNC machine tools. This system allows machine tool maintenance specialists to select and operate models based on LSTM neural networks to determine the state of elements of CNC machines. Examples of changes in the accuracy of the models used during operation are given to determine the state of the cutting tool (more than 95%) and the bearings of electric motors (more than 91%).", "doi": "10.1145/3324884.3418915", "arxiv_id": "https://doi.org/10.1145/3324884.3418915", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418915"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418915"}
{"title": "A Program Verification based Approach to Find Data Race Vulnerabilities in Interrupt-driven Program", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haining Feng"], "abstract": "The data race problem is common in the interrupt-driven program, and it is difficult to find as a result of complicated interrupt interleaving. Static analysis is a mainstream technology to detect those problems, however, the synchronization mechanism of interrupt is hard to be processed by the existing method, which brings many false alarms. Eliminating false alarms in static analysis is the main challenge for precisely data race detection. In this paper, we present a framework of static analysis combined with program verification, which performs static analysis to find all potential races, and then verifies every race to eliminate false alarms. The experiment results on related race benchmarks show that our implementation finds all race bugs in the phase of static analysis, and eliminates all false alarms through program verification.", "doi": "10.1145/3324884.3418925", "arxiv_id": "https://doi.org/10.1145/3324884.3418925", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418925"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418925"}
{"title": "A Unified Framework to Learn Program Semantics with Graph Neural Networks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shangqing Liu"], "abstract": "Program semantics learning is a vital problem in various AI for SE applications e.g., clone detection, code summarization. Learning to represent programs with Graph Neural Networks (GNNs) has achieved state-of-the-art performance in many applications e.g., vulnerability identification, type inference. However, currently, there is a lack of a unified framework with GNNs for distinct applications. Furthermore, most existing GNN-based approaches ignore global relations with nodes, limiting the model to learn rich semantics. In this paper, we propose a unified framework to construct two types of graphs to capture rich code semantics for various SE applications.", "doi": "10.1145/3324884.3418924", "arxiv_id": "https://doi.org/10.1145/3324884.3418924", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418924"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418924"}
{"title": "Anti-patterns for Java Automated Program Repair Tools", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yi Wu"], "abstract": "Prior study has identified common anti-patterns in automated repair for C programs. In this work, we study if the same problems exist in Java programs. We performed a manual inspection on the plausible patches generated by Java automated repair tools. We integrated anti-patterns in jGenProg2 and evaluated on Defects4J benchmark. The result shows that the average repair time is reduced by 22.6 % and the number of generated plausible patches is reduced from 67 to 29 for 14 bugs in total. Our study provided evidence about the effectiveness of applying anti-patterns in future Java automated repair tools.", "doi": "10.1145/3324884.3418919", "arxiv_id": "https://doi.org/10.1145/3324884.3418919", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418919"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418919"}
{"title": "CrossPriv: User Privacy Preservation Model for Cross-Silo Federated Software", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Harshita Diddee", "Bhrigu Kansra"], "abstract": "The design and implementation of artificial intelligence driven software that keeps user data private is a complex yet necessary requirement in the current times. Developers must consider several ethical and legal challenges while developing services which relay massive amount of private information over a network grid which is susceptible to attack from malicious agents. In most cases, organizations adopt a traditional model training approach where publicly available data, or data specifically collated for the task is used to train the model. Specifically in the healthcare section, the operation of deep learning algorithms on limited local data may introduce a significant bias to the system and the accuracy of the model may not be representative due to lack of richly covariate training data. In this paper, we propose CrossPriv,a user privacy preservation model for cross-silo Federated Learning systems to dictate some preliminary norms of SaaS based collaborative software. We discuss the client and server side characteristics of the software deployed on each side. Further, We demonstrate the efficacy of the proposed model by training a convolution neural network on distributed data of two different silos to detect pneumonia using X-Rays whilst not sharing any raw data between the silos.", "doi": "10.1145/3324884.3418911", "arxiv_id": "https://doi.org/10.1145/3324884.3418911", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418911"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418911"}
{"title": "Discovering UI Display Issues with Visual Understanding", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhe Liu"], "abstract": "GUI complexity posts a great challenge to the GUI implementation. According to our pilot study of crowdtesting bug reports, display issues such as text overlap, blurred screen, missing image always occur during GUI rendering on difference devices due to the software or hardware compatibility. They negatively influence the app usability, resulting in poor user experience. To detect these issues, we propose a novel approach, OwlEye, based on deep learning for modelling visual information of the GUI screenshot.Therefore, OwlEye can detect GUIs with display issues and also locate the detailed region of the issue in the given GUI for guiding developers to fix the bug. We manually construct a large-scale labelled dataset with 4,470 GUI screenshots with UI display issues. We develop a heuristics-based data augmentation method and a GAN-based data augmentation method for boosting the performance of our OwlEye. At present, the evaluation demonstrates that our OwlEye can achieve 85% precision and 84% recall in detecting UI display issues, and 90% accuracy in localizing these issues.", "doi": "10.1145/3324884.3418917", "arxiv_id": "https://doi.org/10.1145/3324884.3418917", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418917"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418917"}
{"title": "Dynamic Algorithm Selection for SMT", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nikhil Pimpalkhare"], "abstract": "We describe an online approach to SMT solver selection using nearest neighbor classification and runtime estimation. We implement and evaluate our approach with MedleySolver, finding that it makes nearly optimal selections and evaluates a dataset of queries three times faster than any indivdual solver.", "doi": "10.1145/3324884.3418922", "arxiv_id": "https://doi.org/10.1145/3324884.3418922", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418922"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418922"}
{"title": "FLUX: From SQL to GQL query translation tool", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chandan Sharma"], "abstract": "With the influx of Web 3.0 the focus in Big Data Analytics has shifted towards modelling highly interconnected data and analysing relationships between them. Graph databases befit the requirements of Big Data Analytics yet organizations still depend on relational databases. A major roadblock in the industry wide adoption of graph databases is that a standard query language is still in its inception stage hence withholding interoperability between the two technologies. In this research we propose a tool FLUX for translating relational database queries to graph database queries.", "doi": "10.1145/3324884.3418916", "arxiv_id": "https://doi.org/10.1145/3324884.3418916", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418916"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418916"}
{"title": "Finding Ethereum Smart Contracts Security Issues by Comparing History Versions", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiachi Chen"], "abstract": "Smart contracts are Turing-complete programs running on the blockchain. They cannot be modified, even when bugs are detected. The Selfdestruct function is the only way to destroy a contract on the blockchain system and transfer all the Ethers on the contract balance. Thus, many developers use this function to destroy a contract and redeploy a new one when bugs are detected. In this paper, we propose a deep learning-based method to find security issues of Ethereum smart contracts by finding the updated version of a destructed contract. After finding the updated versions, we use open card sorting to find security issues.", "doi": "10.1145/3324884.3418923", "arxiv_id": "https://doi.org/10.1145/3324884.3418923", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418923"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418923"}
{"title": "Formal Verification of Masking Countermeasures for Arithmetic Programs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pengfei Gao"], "abstract": "Cryptographic algorithms are widely used to protect data privacy in many aspects of daily lives from smart card to cyber-physical systems. Unfortunately, programs implementing cryptographic algorithms may be vulnerable to practical power side-channel attacks, which may infer private data via statistical analysis of the correlation between power consumptions of an electronic device and private data. To thwart these attacks, several masking schemes have been proposed. However, programs that rely on secure masking schemes are not secure a priori. Although some techniques have been proposed for formally verifying masking countermeasures and for quantifying masking strength, they are currently limited to Boolean programs and suffer from low accuracy. In this work, we propose an approach for formally verifying masking countermeasures of arithmetic programs. Our approach is more accurate for arithmetic programs and more scalable for Boolean programs comparing to the existing approaches. We have implemented our methods in a verification tool QMVERIF which has been extensively evaluated on cryptographic benchmarks including full AES, DES and MAC-Keccak. The experimental results demonstrate the effectiveness and efficiency of our approach, especially for compositional reasoning.", "doi": "10.1145/3324884.3418920", "arxiv_id": "https://doi.org/10.1145/3324884.3418920", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418920"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418920"}
{"title": "Identifying Mutation Subsumption Relations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Beatriz Souza"], "abstract": "One recent promising direction in reducing costs of mutation analysis is to identify redundant mutations. We propose a technique to discover redundant mutations by proving subsumption relations among method-level mutation operators using weak mutation testing. We conceive and encode a theory of subsumption relations in Z3 for 40 mutation targets (mutations of an expression or statement). Then we prove a number of subsumption relations using the Z3 theorem prover, and reduce the number of mutations in a number of mutation targets. MUJAvA-M includes some subsumption relations in Mujava. We apply Mujava and Mujava-m to 187 classes of 17 projects. Our approach correctly discards mutations in 74.97% of the cases, and reduces the number of mutations by 72.52%.", "doi": "10.1145/3324884.3418921", "arxiv_id": "https://doi.org/10.1145/3324884.3418921", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418921"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418921"}
{"title": "Scalability and Precision Improvement of Neural Program Synthesis", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yating Zhang"], "abstract": "Mosts of the neural synthesis construct encoder-decoder models to learn a probability distribution over the space of programs. Two drawbacks in such neural program synthesis are that the synthesis scale is relatively small and the correctness of the synthesis result cannot be guaranteed. We address these problems by constructing a framework, which analyzes and solves problems from three dimensions: program space description, model architecture, and result processing. Experiments show that the scalability and precision of synthesis are improved in every dimension.", "doi": "10.1145/3324884.3418912", "arxiv_id": "https://doi.org/10.1145/3324884.3418912", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418912"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418912"}
{"title": "The Classification and Propagation of Program Comments", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiangzhe Xu"], "abstract": "Natural language comments are like bridges between human logic and software semantics. Developers use comments to describe the function, implementation, and property of code snippets. This kind of connections contains rich information, like the potential types of a variable and the pre-condition of a method, among other things. In this paper, we categorize comments and use natural language processing techniques to extract information from them. Based on the semantics of programming languages, different rules are built for each comment category to systematically propagate comments among code entities. Then we use the propagated comments to check the code usage and comments consistency. Our demo system finds 37 bugs in real-world projects, 30 of which have been confirmed by the developers. Except for bugs in the code, we also find 304 pieces of defected comments. The 12 of them are misleading and 292 of them are not correct. Moreover, among the 41573 pieces of comments we propagate, 87 comments are for private native methods which had neither code nor comments. We also conduct a user study where we find that propagated comments are as good as human-written comments in three dimensions of consistency, naturalness, and meaningfulness.", "doi": "10.1145/3324884.3418913", "arxiv_id": "https://doi.org/10.1145/3324884.3418913", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418913"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418913"}
{"title": "Source Code and Binary Level Vulnerability Detection and Hot Patching", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhengzi Xu"], "abstract": "This paper presents a static vulnerability detection and patching framework at both source code and binary level. It automatically identifies and collects known vulnerability information to build the signature. It matches vulnerable functions with similar signatures and filters out the ones that have been patched in the target program. For the vulnerable functions, the framework tries to generate hot patches by learning from the source code.", "doi": "10.1145/3324884.3418914", "arxiv_id": "https://doi.org/10.1145/3324884.3418914", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418914"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418914"}
{"title": "When Deep Learning Meets Smart Contracts", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhipeng Gao"], "abstract": "Ethereum has become a widely used platform to enable secure, Blockchain-based financial and business transactions. However, many identified bugs and vulnerabilities in smart contracts have led to serious financial losses, which raises serious concerns about smart contract security. Thus, there is a significant need to better maintain smart contract code and ensure its high reliability. In this research: (1) Firstly, we propose an automated deep learning based approach to learn structural code embeddings of smart contracts in Solidity, which is useful for clone detection, bug detection and contract validation on smart contracts. We apply our approach to more than 22K solidity contracts collected from the Ethereum blockchain, results show that the clone ratio of solidity code is at around 90%, much higher than traditional software. We collect a list of 52 known buggy smart contracts belonging to 10 kinds of common vulnerabilities as our bug database. Our approach can identify more than 1000 clone related bugs based on our bug databases efficiently and accurately. (2) Secondly, according to developers' feedback, we have implemented the approach in a web-based tool, named Smartembed, to facilitate Solidity developers for using our approach. Our tool can assist Solidity developers to efficiently identify repetitive smart contracts in the existing Ethereum blockchain, as well as checking their contract against a known set of bugs. which can help to improve the users' confidence in the reliability of the contract. We optimize the implementations of Smartembed which is sufficient in supporting developers in real-time for practical uses. The Ethereum ecosystem as well as the individual Solidity developer can both benefit from our research. Smartembed website: http://www.smartembed.tools Demo video: https://youtu.be/o9ylyOpYFq8 Replication package: https://github.com/beyondacm/SmartEmbed", "doi": "10.1145/3324884.3418918", "arxiv_id": "https://doi.org/10.1145/3324884.3418918", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1145/3324884.3418918"], "github": ["https://github.com/beyondacm/SmartEmbed"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1145/3324884.3418918"}
{"title": "36th IEEE/ACM International Conference on Automated Software Engineering, ASE 2021, Melbourne, Australia, November 15-19, 2021", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": [], "abstract": null, "doi": "10.1109/ase51524.2021", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021"}
{"title": "Explainable AI for Software Engineering", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chakkrit Kla Tantithamthavorn", "Jirayus Jiarpakdee"], "abstract": "The success of software engineering projects largely depends on complex decision-making. For example, which tasks should a developer do first, who should perform this task, is the software of high quality, is a software system reliable and resilient enough to deploy, etc. However, erroneous decision-making for these complex questions is costly in terms of money and reputation. Thus, Artificial Intelligence/Machine Learning (AI/ML) techniques have been widely used in software engineering for developing software analytics tools and techniques to improve decision-making, developer productivity, and software quality. However, the predictions of such AI/ML models for software engineering are still not practical (i.e., coarse-grained), not explainable, and not actionable. These concerns often hinder the adoption of AI/ML models in software engineering practices. In addition, many recent studies still focus on improving the accuracy, while a few of them focus on improving explainability. Are we moving in the right direction? How can we better improve the SE community (both research and education)?In this tutorial, we first provide a concise yet essential introduction to the most important aspects of Explainable AI and a hands-on tutorial of Explainable AI tools and techniques. Then, we introduce the fundamental knowledge of defect prediction (an example application of AI for Software Engineering). Finally, we demonstrate three successful case studies on how Explainable AI techniques can be used to address the aforementioned challenges by making the predictions of software defect prediction models more practical, explainable, and actionable. The materials are available at https://xai4se.github.io.", "doi": "10.1109/ase51524.2021.9678580", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678580", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678580"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678580"}
{"title": "Tackling Flaky Tests: Understanding the Problem and Providing Practical Solutions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Gruber"], "abstract": "Non-deterministically behaving tests impede software development as they hamper regression testing, destroy trust, and waste resources. This phenomenon, also called test flakiness, has received increasing attention over the past years. The multitude of both peer-reviewed literature and online blog articles touching the issue illustrates that flaky tests are deemed both a relevant research topic and a serious problem in everyday business. A major shortcoming of existing work aiming to mitigate test flakiness is its limited applicability, since many of the proposed tools are highly relying on specific ecosystems. This issue also reflects on various attempts to investigate flaky tests: Using mostly similar sets of open-source Java projects, many studies are unable to generalize their findings to projects laying beyond this scope. On top of that, a holistic understanding of test flakiness also suffers from a lack of analyses focusing on the developers’ perspective, since most existing studies take a code-centric approach.With my work, I want to close these gaps: I plan to create an overarching and widely applicable framework that empowers developers to tackle flaky tests through existing and novel techniques and enables researchers to swiftly deploy and evaluate new approaches. As a starting point, I am studying test flakiness from previously unconsidered angles: I widen the scope of observation investigating flakiness beyond the realm of the Java ecosystem, while also capturing the practitioners’ opinion. By adding to the understanding of the phenomenon I not only hope to close existing research gaps, but to retrieve a clear vision of how research on test flakiness can create value for developers working in the field.", "doi": "10.1109/ase51524.2021.9678701", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678701", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678701"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678701"}
{"title": "Automating User Notice Generation for Smart Contract Functions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xing Hu", "Zhipeng Gao", "Xin Xia", "David Lo", "Xiaohu Yang"], "abstract": "Smart contracts have obtained much attention and are crucial for automatic financial and business transactions. For end-users who have never seen the source code, they can read the user notice shown in end-user client to understand what a transaction does of a smart contract function. However, due to time constraints or lack of motivation, user notice is often missing during the development of smart contracts. For end-users who lack the information of the user notices, there is no easy way for them to check the code semantics of the smart contracts. Thus, in this paper, we propose a new approach SMARTDOC to generate user notice for smart contract functions automatically. Our tool can help end-users better understand the smart contract and aware of the financial risks, improving the users’ confidence on the reliability of the smart contracts. SMARTDOC exploits the Transformer to learn the representation of source code and generates natural language descriptions from the learned representation. We also integrate the Pointer mechanism to copy words from the input source code instead of generating words during the prediction process. We extract 7,878 〈function, notice〉 pairs from 54,739 smart contracts written in Solidity. Due to the limited amount of collected smart contract functions (i.e., 7,878 functions), we exploit a transfer learning technique to utilize the learned knowledge to improve the performance of SMARTDOC. The learned knowledge obtained by the pre-training on a corpus of Java code, that has similar characteristics as Solidity code. The experimental results show that our approach can effectively generate user notice given the source code and significantly outperform the state-of-the-art approaches. To investigate human perspectives on our generated user notice, we also conduct a human evaluation and ask participants to score user notice generated by different approaches. Results show that SMARTDOC outperforms baselines from three aspects, naturalness, informativeness, and similarity.", "doi": "10.1109/ase51524.2021.9678552", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678552", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678552"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678552"}
{"title": "End-to-End Automation of Feedback on Student Assembly Programs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zikai Liu", "Tingkai Liu", "Qi Li", "Wenqing Luo", "Steven S. Lumetta"], "abstract": "We developed a set of tools designed to provide rapid feedback to students as they learn to write programs in assembly language (LC-3, a RISC-like educational instruction set architecture). At the heart of the system is an extended version of KLEE, KLC3, that enables us to both identify issues and perform equivalence checking between student code and a gold (correct) version of each assignment. Feedback begins when students edit their code using a VSCode extension that leverages static analysis to perform a variety of correctness and style checks, encouraging students to improve their code quality. Each time a student commits code to their Git repository, our system triggers. Using KLC3 (KLEE), the student code is executed along with the gold version, and issues and behavioral differences are delivered back to the student through their Git repository as a human-readable report, test cases, and scripts. A queueing system allows students to monitor progress, but responses are generally available within minutes. We also extended the LC-3 simulation tools to support reverse debugging, making the process of finding complex bugs much more tractable for students, and used Emscripten to develop a browser-based interface for use in testing and debugging. Finally, our system maintains an individual regression test suite for each student and requires a submission to pass all previous tests before re-evaluation in KLC3, thus avoiding encouraging programming-by-guesswork. We deployed the system to provide feedback for the assembly programming assignments in a class of over 100 students in Fall 2020. Students wrote a median of around 700 lines of assembly for these assignments, making heavy use of our tools to understand and eliminate their bugs. Anonymous student feedback on the tools was uniformly positive. Since that semester, we have continued to refine and expand our tools’ analysis capabilities and performance, and plan to deploy the system again in the near future (the class is offered every Fall).", "doi": "10.1109/ase51524.2021.9678837", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678837", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678837"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678837"}
{"title": "Is Historical Data an Appropriate Benchmark for Reviewer Recommendation Systems? : A Case Study of the Gerrit Community", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ian X. Gauthier", "Maxime Lamothe", "Gunter Mussbacher", "Shane McIntosh"], "abstract": "Reviewer recommendation systems are used to suggest community members to review change requests. Like several other recommendation systems, it is customary to evaluate recommendations using held out historical data. While history-based evaluation makes pragmatic use of available data, historical records may be: (1) overly optimistic, since past assignees may have been suboptimal choices for the task at hand; or (2) overly pessimistic, since \"incorrect\" recommendations may have been equal (or even better) choices.In this paper, we empirically evaluate the extent to which historical data is an appropriate benchmark for reviewer recommendation systems. We replicate the CHREV and WLRREC approaches and apply them to 9,679 reviews from the GERRIT open source community. We then assess the recommendations with members of the GERRIT reviewing community using quantitative methods (personalized questionnaires about their comfort level with tasks) and qualitative methods (semi-structured interviews).We find that history-based evaluation is far more pessimistic than optimistic in the context of GERRIT review recommendations. Indeed, while 86% of those who had been assigned to a review in the past felt comfortable handling the review, 74% of those labelled as incorrect recommendations also felt that they would have been comfortable reviewing the changes. This indicates that, on the one hand, when reviewer recommendation systems recommend the past assignee, they should indeed be considered correct. Yet, on the other hand, recommendations labelled as incorrect because they do not match the past assignee may have been correct as well.Our results suggest that current reviewer recommendation evaluations do not always model the reality of software development. Future studies may benefit from looking beyond repository data to gain a clearer understanding of the practical value of proposed recommendations.", "doi": "10.1109/ase51524.2021.9678640", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678640", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678640"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678640"}
{"title": "An Empirical Study of Bugs in WebAssembly Compilers", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alan Romano", "Xinyue Liu", "Yonghwi Kwon", "Weihang Wang"], "abstract": "WebAssembly is the newest programming language for the Web. It defines a portable bytecode format for use as a compilation target for programs developed in high-level languages such as C, C++, and Rust. As a result, WebAssembly binaries are generally created by WebAssembly compilers rather than being written manually. To port native code to the Web, WebAssembly compilers need to address the differences between the source and target languages and dissimilarities in their execution environments. A deep understanding of the bugs in WebAssembly compilers can help compiler developers determine where to focus development and testing efforts. In this paper, we conduct two empirical studies to understand the characteristics of the bugs found in WebAssembly compilers. First, we perform a qualitative analysis of bugs in Emscripten, the most widely-used WebAssembly compiler. We investigate 146 bug reports in Emscripten related to the unique challenges WebAssembly compilers encounter compared with traditional compilers. Second, we provide a quantitative analysis of 1,054 bugs in three open-source WebAssembly compilers, AssemblyScript, Emscripten, and Rustc/Wasm-Bindgen. We analyze these bugs along three dimensions: lifecycle, impact, and sizes of bug-inducing inputs and bug fixes. These studies deepen our understanding of WebAssembly compiler bugs. We hope that the findings of our study will shed light on opportunities to design practical tools for testing and debugging WebAssembly compilers.", "doi": "10.1109/ase51524.2021.9678776", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678776", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678776"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678776"}
{"title": "Detecting TensorFlow Program Bugs in Real-World Industrial Environment", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chen Liu", "Jie Lu", "Guangwei Li", "Ting Yuan", "Lian Li", "Feng Tan", "Jun Yang", "Liang You", "Jingling Xue"], "abstract": "Deep learning has been widely adopted in industry and has achieved great success in a wide range of application areas. Bugs in deep learning programs can cause catastrophic failures, in addition to a serious waste of resources and time.This paper aims at detecting industrial TensorFlow program bugs. We report an extensive empirical study on 12,289 failed TensorFlow jobs, showing that existing static tools can effectively detect 72.55% of the top three types of Python bugs in industrial TensorFlow programs. In addition, we propose (for the first time) a constraint-based approach for detecting TensorFlow shape-related errors (one of the most common TensorFlow-specific bugs), together with an associated tool, ShapeTracer. Our evaluation on a set of 60 industrial TensorFlow programs shows that ShapeTracer is efficient and effective: it analyzes each program in at most 3 seconds and detects effectively 40 out of 60 industrial TensorFlow program bugs, with no false positives. ShapeTracer has been deployed in the platform-X platform and will be released soon.", "doi": "10.1109/ase51524.2021.9678891", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678891", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678891"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678891"}
{"title": "Why Do Developers Remove Lambda Expressions in Java?", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mingwei Zheng", "Jun Yang", "Ming Wen", "Hengcheng Zhu", "Yepang Liu", "Hai Jin"], "abstract": "Java 8 has introduced lambda expressions, a core feature of functional programming. Since its introduction, there is an increasing trend of lambda adoptions in Java projects. Developers often adopt lambda expressions to simplify code, avoid code duplication or simulate other functional features. However, we observe that lambda expressions can also incur different types of side effects (i.e., performance issues and memory leakages) or even severe bugs, and developers also frequently remove lambda expressions in their implementations. Consequently, the advantages of utilizing lambda expressions can be significantly compromised by the collateral side effects. In this study, we present the first large-scale, quantitative and qualitative empirical study to characterize and understand inappropriate usages of lambda expressions. Particularly, we summarized seven main reasons for the removal of lambdas as well as seven common migration patterns. For instance, we observe that lambdas using customized functional interfaces are more likely to be removed by developers. Moreover, from a complementary perspective, we performed a user study over 30 developers to seek the underlying reasons why they remove lambda expressions in practice. Finally, based on our empirical results, we made suggestions on scenarios to avoid lambda usages for Java developers and also pointed out future directions for researchers.", "doi": "10.1109/ase51524.2021.9678600", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678600", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678600"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678600"}
{"title": "Context Debloating for Object-Sensitive Pointer Analysis", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dongjie He", "Jingbo Lu", "Jingling Xue"], "abstract": "We Introduce a new approach, Conch, for debloating contexts for all the object-sensitive pointer analysis algorithms developed for object-oriented languages, where the calling contexts of a method are distinguished by its receiver objects. Our key insight is to approximate a recently proposed set of two necessary conditions for an object to be context-sensitive, i.e., context-dependent (whose precise verification is undecidable) with a set of three linearly verifiable conditions (in terms of the number of statements in the program) that are almost always necessary for real-world object-oriented applications, based on three key observations regarding context-dependability for their objects used. To create a practical implementation, we introduce a new IFDS-based algorithm for reasoning about object reachability in a program. By debloating contexts for two representative object-sensitive pointer analyses applied to a set of 12 representative Java programs, Conch can speed up the two baselines together substantially (3.1x on average with a maximum of 15.9x) and analyze 7 more programs scalably, but at only a negligible loss of precision (less than 0.1%).", "doi": "10.1109/ase51524.2021.9678880", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678880", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678880"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678880"}
{"title": "Dynamic Generation of Python Bindings for HPC Kernels", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Steven Zhu", "Nader Al Awar", "Mattan Erez", "Milos Gligoric"], "abstract": "Traditionally, high performance kernels (HPKs) have been written in statically typed languages, such as C/C++ and Fortran. A recent trend among scientists—prototyping applications in dynamic languages such as Python—created a gap between the applications and existing HPKs. Thus, scientists have to either reimplement necessary kernels or manually create a connection layer to leverage existing kernels. Either option requires substantial development effort and slows down progress in science. We present a technique, dubbed WayOut, which automatically generates the entire connection layer for HPKs invoked from Python and written in C/C++. WayOut performs a hybrid analysis: it statically analyzes header files to generate Python wrapper classes and functions, and dynamically generates bindings for those kernels. By leveraging the type information available at run-time, it generates only the necessary bindings. We evaluate WayOut by rewriting dozens of existing examples from C/C++ to Python and leveraging HPKs enabled by WayOut. Our experiments show the feasibility of our technique, as well as negligible performance overhead on HPKs performance.", "doi": "10.1109/ase51524.2021.9678726", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678726", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678726"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678726"}
{"title": "Testing Your Question Answering Software via Asking Recursively", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Songqiang Chen", "Shuo Jin", "Xiaoyuan Xie"], "abstract": "Question Answering (QA) is an attractive and challenging area in NLP community. There are diverse algorithms being proposed and various benchmark datasets with different topics and task formats being constructed. QA software has also been widely used in daily human life now. However, current QA software is mainly tested in a reference-based paradigm, in which the expected outputs (labels) of test cases need to be annotated with much human effort before testing. As a result, neither the just-in-time test during usage nor the extensible test on massive unlabeled real-life data is feasible, which keeps the current testing of QA software from being flexible and sufficient. In this paper, we propose a method, qaAskeR, with three novel Metamorphic Relations for testing QA software. qaAskeR does not require the annotated labels but tests QA software by checking its behaviors on multiple recursively asked questions that are related to the same knowledge. Experimental results show that qaAskeR can reveal violations at over 80% of valid cases without using any preannotated labels. Diverse answering issues, especially the limited generalization on question types across datasets, are revealed on a state-of-the-art QA algorithm.", "doi": "10.1109/ase51524.2021.9678670", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678670", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678670"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678670"}
{"title": "Improving Test Case Generation for REST APIs Through Hierarchical Clustering", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dimitri Michel Stallenberg", "Mitchell Olsthoorn", "Annibale Panichella"], "abstract": "With the ever-increasing use of web APIs in modern- day applications, it is becoming more important to test the system as a whole. In the last decade, tools and approaches have been proposed to automate the creation of system-level test cases for these APIs using evolutionary algorithms (EAs). One of the limiting factors of EAs is that the genetic operators (crossover and mutation) are fully randomized, potentially breaking promising patterns in the sequences of API requests discovered during the search. Breaking these patterns has a negative impact on the effectiveness of the test case generation process. To address this limitation, this paper proposes a new approach that uses Agglomerative Hierarchical Clustering (AHC) to infer a linkage tree model, which captures, replicates, and preserves these patterns in new test cases. We evaluate our approach, called LT-MOSA, by performing an empirical study on 7 real-world benchmark applications w.r.t. branch coverage and real-fault detection capability. We also compare LT-MOSA with the two existing state-of-the-art white-box techniques (MIO, MOSA) for REST API testing. Our results show that LT-MOSA achieves a statistically significant increase in test target coverage (i.e., lines and branches) compared to MIO and MOSA in 4 and 5 out of 7 applications, respectively. Furthermore, LT-MOSA discovers 27 and 18 unique real-faults that are left undetected by MIO and MOSA, respectively.", "doi": "10.1109/ase51524.2021.9678586", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678586", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678586"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678586"}
{"title": "VizSmith: Automated Visualization Synthesis by Mining Data-Science Notebooks", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rohan Bavishi", "Shadaj Laddad", "Hiroaki Yoshida", "Mukul R. Prasad", "Koushik Sen"], "abstract": "Visualizations are widely used to communicate findings and make data-driven decisions. Unfortunately creating bespoke and reproducible visualizations requires the use of procedural tools such as matplotlib. These tools present a steep learning curve as their documentation often lacks sufficient usage examples to help beginners get started or accomplish a specific task. Forums such as StackOverflow have long helped developers search for code online and adapt it for their use. However, developers still have to sift through search results and understand the code before adapting it for their use.We built a tool called VizSmith which enables code reuse for visualizations by mining visualization code from Kaggle notebooks and creating a database of 7176 reusable Python functions. Given a dataset, columns to visualize and a text query from the user, VizSmith searches this database for appropriate functions, runs them and displays the generated visualizations to the user. At the core of VizSmith is a novel metamorphic testing based approach to automatically assess the reusability of functions, which improves end-to-end synthesis performance by 10% and cuts the number of execution failures by 50%.", "doi": "10.1109/ase51524.2021.9678696", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678696", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678696"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678696"}
{"title": "ISPY: Automatic Issue-Solution Pair Extraction from Community Live Chats", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lin Shi", "Ziyou Jiang", "Ye Yang", "Xiao Chen", "Yumin Zhang", "Fangwen Mu", "Hanzhi Jiang", "Qing Wang"], "abstract": "Collaborative live chats are gaining popularity as a development communication tool. In community live chatting, developers are likely to post issues they encountered (e.g., setup issues and compile issues), and other developers respond with possible solutions. Therefore, community live chats contain rich sets of information for reported issues and their corresponding solutions, which can be quite useful for knowledge sharing and future reuse if extracted and restored in time. However, it remains challenging to accurately mine such knowledge due to the noisy nature of interleaved dialogs in live chat data. In this paper, we first formulate the problem of issue-solution pair extraction from developer live chat data, and propose an automated approach, named ISPY, based on natural language processing and deep learning techniques with customized enhancements, to address the problem. Specifically, ISPY automates three tasks: 1) Disentangle live chat logs, employing a feedforward neural network to disentangle a conversation history into separate dialogs automatically; 2) Detect dialogs discussing issues, using a novel convolutional neural network (CNN), which consists of a BERT-based utterance embedding layer, a context-aware dialog embedding layer, and an output layer; 3) Extract appropriate utterances and combine them as corresponding solutions, based on the same CNN structure but with different feeding inputs. To evaluate ISPY, we compare it with six baselines, utilizing a dataset with 750 dialogs including 171 issue-solution pairs and evaluate ISPY from eight open source communities. The results show that, for issue-detection, our approach achieves the F1 of 76%, and outperforms all baselines by 30%. Our approach achieves the F1 of 63% for solution-extraction and outperforms the baselines by 20%. Furthermore, we apply ISPY on three new communities to extensively evaluate ISPY’s practical usage. Moreover, we publish over 30K issue-solution pairs extracted from 11 communities. We believe that ISPY can facilitate community-based software development by promoting knowledge sharing and shortening the issue-resolving process.", "doi": "10.1109/ase51524.2021.9678894", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678894", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678894"], "github": ["https://github.com/jzysaber1996/ispy"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678894"}
{"title": "EditSum: A Retrieve-and-Edit Framework for Source Code Summarization", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jia Li", "Yongmin Li", "Ge Li", "Xing Hu", "Xin Xia", "Zhi Jin"], "abstract": "Existing studies show that code summaries help developers understand and maintain source code. Unfortunately, these summaries are often missing or outdated in software projects. Code summarization aims to generate natural language descriptions automatically for source code. According to Gros et al., code summaries are highly structured and have repetitive patterns (e.g. \"return true if...\"). Besides the patternized words, a code summary also contains important keywords, which are the key to reflecting the functionality of the code. However, the state-of-the-art approaches perform poorly on predicting the keywords, which leads to the generated summaries suffer a loss in informativeness. To alleviate this problem, this paper proposes a novel retrieve-and-edit approach named EditSum for code summarization. Specifically, EditSum first retrieves a similar code snippet from a pre-defined corpus and treats its summary as a prototype summary to learn the pattern. Then, EditSum edits the prototype automatically to combine the pattern in the prototype with the semantic information of input code. Our motivation is that the retrieved prototype provides a good start-point for post-generation because the summaries of similar code snippets often have the same pattern. The post-editing process further reuses the patternized words in prototype and generates keywords based on the semantic information of input code. We conduct experiments on a large-scale Java corpus (2M) and experimental results demonstrate that EditSum outperforms the state-of-the-art approaches by a substantial margin. The human evaluation also proves the summaries generated by EditSum are more informative and useful. We also verify that EditSum performs well on predicting the patternized words and keywords.", "doi": "10.1109/ase51524.2021.9678724", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678724", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678724"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678724"}
{"title": "Interactive Cross-language Code Retrieval with Auto-Encoders", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Binger Chen", "Ziawasch Abedjan"], "abstract": "Cross-language code retrieval is necessary in many real-world scenarios. A major application is program translation, e.g., porting codebases from an obsolete or deprecated language to a modern one or re-implementing existing projects in one’s preferred programming language. Existing approaches based on the translation model require large amounts of training data and extra information or neglects significant characteristics of programs. Leveraging cross-language code retrieval to assist automatic program translation can make use of Big Code. However, existing code retrieval systems have the barrier to finding the translation with only the features of the input program as the query. In this paper, we present BigPT for interactive cross-language retrieval from Big Code only based on raw code and reusing the retrieved code to assist program translation. We build on existing work on cross-language code representation and propose a novel predictive transformation model based on auto-encoders. The model is trained on Big Code to generate a target-language representation, which will be used as the query to retrieve the most relevant translations for a given program. Our query representation enables the user to easily update and correct the returned results to improve the retrieval process. Our experiments show that BigPT outperforms state-of-the-art baselines in terms of program accuracy. Using our novel querying and retrieving mechanism, BigPT can be scaled to the large dataset and efficiently retrieve the translation.", "doi": "10.1109/ase51524.2021.9678929", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678929", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678929"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678929"}
{"title": "Data-Driven Design and Evaluation of SMT Meta-Solving Strategies: Balancing Performance, Accuracy, and Cost", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Malte Mues", "Falk Howar"], "abstract": "Many modern software engineering tools integrate SMT decision procedures and rely on the accuracy and performance of SMT solvers. We describe four basic patterns for integrating constraint solvers (earliest verdict, majority vote, feature-based solver selection, and verdict-based second attempt) that can be used for combining individual solvers into meta-decision procedures that balance accuracy, performance, and cost – or optimize for one of these metrics. In order to evaluate the effectiveness of meta-solving, we analyze and minimize 16 existing benchmark suites and benchmark seven state-of-the-art SMT solvers on 17k unique instances. From the obtained performance data, we can estimate the performance of different meta-solving strategies. We validate our results by implementing and analyzing two strategies. As additional results, we obtain (a) the first benchmark suite of unique SMT string problems with validated expected verdicts, (b) an extensive dataset containing data on benchmark instances as well as on the performance of individual decision procedures and several meta-solving strategies on these instances, and (c) a framework for generating data that can easily be used for similar analyses on different benchmark instances or for different decision procedures.", "doi": "10.1109/ase51524.2021.9678881", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678881", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678881"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678881"}
{"title": "Reducing Bug Triaging Confusion by Learning from Mistakes with a Bug Tossing Knowledge Graph", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yanqi Su", "Zhenchang Xing", "Xin Peng", "Xin Xia", "Chong Wang", "Xiwei Xu", "Liming Zhu"], "abstract": "Assigning bugs to the right components is the prerequisite to get the bugs analyzed and fixed. Classification-based techniques have been used in practice for assisting bug component assignments, for example, the BugBug tool developed by Mozilla. However, our study on 124,477 bugs in Mozilla products reveals that erroneous bug component assignments occur frequently and widely. Most errors are repeated errors and some errors are even misled by the BugBug tool. Our study reveals that complex component designs and misleading component names and bug report keywords confuse bug component assignment not only for bug reporters but also developers and even bug triaging tools. In this work, we propose a learning to rank framework that learns to assign components to bugs from correct, erroneous and irrelevant bug-component assignments in the history. To inform the learning, we construct a bug tossing knowledge graph which incorporates not only goal-oriented component tossing relationships but also rich information about component tossing community, component descriptions, and historical closed and tossed bugs, from which three categories and seven types of features for bug, component and bug-component relation can be derived. We evaluate our approach on a dataset of 98,587 closed bugs (including 29,100 tossed bugs) of 186 components in six Mozilla products. Our results show that our approach significantly improves bug component assignments for both tossed and non-tossed bugs over the BugBug tool and the BugBug tool enhanced with component tossing relationships, with >20% Top-k accuracies and >30% NDCG@k (k=1,3,5,10).", "doi": "10.1109/ase51524.2021.9678574", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678574", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678574"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678574"}
{"title": "ASE: A Value Set Decision Procedure for Symbolic Execution", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alireza S. Abyaneh", "Christoph M. Kirsch"], "abstract": "A symbolic execution engine regularly queries a Satisfiability Modulo Theory (SMT) solver to determine reachability of code during execution. Unfortunately, the SMT solver is often the bottleneck of symbolic execution. Inspired by abstract interpretation, we propose an abstract symbolic execution (ASE) engine which aims at querying the SMT solver less often by trying to compute reachability faster through an increasingly weaker abstraction. For this purpose, we have designed and implemented a value set decision procedure based on strided value interval (SVI) sets for efficiently determining precise, or under-approximating value sets for variables. Our ASE engine begins reasoning with respect to the SVI abstraction, and then only if needed uses the theory of bit-vectors implemented in SMT solvers. Our ASE engine efficiently detects when the former abstraction becomes incomplete to move on and try the next abstraction.We have designed and implemented a prototype of our engine for a subset of 64-bit RISC-V. Our experimental evaluation shows that our prototype often improves symbolic execution time by significantly reducing the number of SMT queries while, whenever the abstraction does not work, the overhead for trying still remains low.", "doi": "10.1109/ase51524.2021.9678584", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678584", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678584"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678584"}
{"title": "CorbFuzz: Checking Browser Security Policies with Fuzzing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chaofan Shou", "Ismet Burak Kadron", "Qi Su", "Tevfik Bultan"], "abstract": "Browsers use security policies to block malicious behaviors. Cross-Origin Read Blocking (CORB) is a browser security policy for preventing side-channel attacks such as Spectre. We propose a web browser security policy fuzzer called CorbFuzz for checking CORB and similar policies. In implementing a security policy, the browser only has access to HTTP requests and responses, and takes policy actions based solely on those interactions. In checking the browser security policies, CorbFuzz uses a policy oracle that tracks the web application behavior and infers the desired policy action based on the web application state. By comparing the policy oracle with the browser behavior, CorbFuzz detects weaknesses in browser security policies. CorbFuzz checks the web browser policy by fuzzing a set of web applications where the state-related queries are symbolically evaluated for increased coverage and automation. CorbFuzz collects type information from database queries and branch conditions in order to prevent the generation of inconsistent data values during fuzzing. We evaluated CorbFuzz on CORB implementations of Chromium and Webkit, and Opaque Response Blocking (ORB) policy implementation of Firefox using web applications collected from GitHub. We found three classes of weaknesses in Chromium’s implementation of CORB.", "doi": "10.1109/ase51524.2021.9678636", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678636", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678636"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678636"}
{"title": "SMARTIAN: Enhancing Smart Contract Fuzzing with Static and Dynamic Data-Flow Analyses", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jaeseung Choi", "Doyeon Kim", "Soomin Kim", "Gustavo Grieco", "Alex Groce", "Sang Kil Cha"], "abstract": "Unlike traditional software, smart contracts have the unique organization in which a sequence of transactions shares persistent states. Unfortunately, such a characteristic makes it difficult for existing fuzzers to find out critical transaction sequences. To tackle this challenge, we employ both static and dynamic analyses for fuzzing smart contracts. First, we statically analyze smart contract bytecodes to predict which transaction sequences will lead to effective testing, and figure out if there is a certain constraint that each transaction should satisfy. Such information is then passed to the fuzzing phase and used to construct an initial seed corpus. During a fuzzing campaign, we perform a lightweight dynamic data-flow analysis to collect data-flow-based feedback to effectively guide fuzzing. We implement our ideas on a practical open-source fuzzer, named SMARTIAN. SMARTIAN can discover bugs in real-world smart contracts without the need for the source code. Our experimental results show that SMARTIAN is more effective than existing state-of-the-art tools in finding known CVEs from real-world contracts. SMARTIAN also outperforms other tools in terms of code coverage.", "doi": "10.1109/ase51524.2021.9678888", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678888", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678888"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678888"}
{"title": "Restoring the Executability of Jupyter Notebooks by Automatic Upgrade of Deprecated APIs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chenguang Zhu", "Ripon K. Saha", "Mukul R. Prasad", "Sarfraz Khurshid"], "abstract": "Data scientists typically practice exploratory programming using computational notebooks, to comprehend new data and extract insights. To do this they iteratively refine their code, actively trying to re-use and re-purpose solutions created by other data scientists, in real time. However, recent studies have shown that a vast majority of publicly available notebooks cannot be executed out of the box. One of the prominent reasons is the deprecation of data science APIs used in such notebooks, due to the rapid evolution of data science libraries. In this work we propose RELANCER, an automatic technique that restores the executability of broken Jupyter Notebooks, in near real time, by upgrading deprecated APIs. RELANCER employs an iterative runtime-error-driven approach to identify and fix one API issue at a time. This is supported by a machine-learned model which uses the runtime error message to predict the kind of API repair needed - an update in the API or package name, a parameter, or a parameter value. Then RELANCER creates a search space of candidate repairs by combining knowledge from API migration examples on GitHub as well as the API documentation and employs a second machine-learned model to rank this space of candidate mappings. An evaluation of RELANCER on a curated dataset of 255 un-executable Jupyter Notebooks from Kaggle shows that RELANCER can successfully restore the executability of 56% of the subjects, while baselines relying on just GitHub examples and just API documentation can only fix 38% and 36% of the subjects respectively. Further, pursuant to its real-time use case, RELANCER can restore execution to 49% of subjects, within a 5 minute time limit, while a baseline lacking its machine learning models can only fix 24%.", "doi": "10.1109/ase51524.2021.9678889", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678889", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678889"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678889"}
{"title": "Adversarial Attacks to API Recommender Systems: Time to Wake Up and Smell the Coffeeƒ", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Phuong T. Nguyen", "Claudio Di Sipio", "Juri Di Rocco", "Massimiliano Di Penta", "Davide Di Ruscio"], "abstract": "Recommender systems in software engineering provide developers with a wide range of valuable items to help them complete their tasks. Among others, API recommender systems have gained momentum in recent years as they became more successful at suggesting API calls or code snippets. While these systems have proven to be effective in terms of prediction accuracy, there has been less attention for what concerns such recommenders’ resilience against adversarial attempts. In fact, by crafting the recommenders’ learning material, e.g., data from large open-source software (OSS) repositories, hostile users may succeed in injecting malicious data, putting at risk the software clients adopting API recommender systems. In this paper, we present an empirical investigation of adversarial machine learning techniques and their possible influence on recommender systems. The evaluation performed on three state-of-the-art API recommender systems reveals a worrying outcome: all of them are not immune to malicious data. The obtained result triggers the need for effective countermeasures to protect recommender systems against hostile attacks disguised in training data.", "doi": "10.1109/ase51524.2021.9678946", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678946", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678946"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678946"}
{"title": "REPFINDER: Finding Replacements for Missing APIs in Library Update", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kaifeng Huang", "Bihuan Chen", "Linghao Pan", "Shuai Wu", "Xin Peng"], "abstract": "Libraries are widely adopted in developing software projects. Library APIs are often missing during library evolution as library developers may deprecate, remove or refactor APIs. As a result, client developers have to manually find replacement APIs for missing APIs when updating library versions in their projects, which is a difficult and expensive software maintenance task. One of the key limitations of the existing automated approaches is that they usually consider the library itself as the single source to find replacement APIs, which heavily limits their accuracy.In this paper, we first present an empirical study to understand characteristics about missing APIs and their replacements. Specifically, we quantify the prevalence of missing APIs, and summarize the knowledge sources where the replacements are found, and the code change and mapping cardinality between missing APIs and their replacements. Then, inspired by the insights from our study, we propose a heuristic-based approach, REPFINDER, to automatically find replacements for missing APIs in library update. We design and combine a set of heuristics to hierarchically search three sources (deprecation message, own library, and external library) for finding replacements. Our evaluation has demonstrated that REPFINDER can find replacement APIs effectively and efficiently, and significantly outperform the state-of-the-art approaches.", "doi": "10.1109/ase51524.2021.9678905", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678905", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678905"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678905"}
{"title": "Targeting Requirements Violations of Autonomous Driving Systems by Dynamic Evolutionary Search", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yixing Luo", "Xiao-Yi Zhang", "Paolo Arcaini", "Zhi Jin", "Haiyan Zhao", "Fuyuki Ishikawa", "Rongxin Wu", "Tao Xie"], "abstract": "Autonomous Driving Systems (ADSs) are complex systems that must satisfy multiple requirements such as safety, compliance to traffic rules, and comfortableness. However, satisfying all these requirements may not always be possible due to emerging environmental conditions. Therefore, the ADSs may have to make trade-offs among multiple requirements during the ongoing operation, resulting in one or more requirements violations. For ADS engineers, it is highly important to know which combinations of requirements violations may occur, as different combinations can expose different types of failures. However, there is currently no testing approach that can generate scenarios to expose different combinations of requirements violations. To address this issue, in this paper, we introduce the notion of requirements violation pattern to characterize a specific combination of requirements violations. Based on this notion, we propose a testing approach named EMOOD that can effectively generate test scenarios to expose as many requirements violation patterns as possible. EMOOD uses a prioritization technique to sort all possible patterns to search for, from the most to the least critical ones. Then, EMOOD iteratively includes an evolutionary many-objective optimization algorithm to find different combinations of requirements violations. In each iteration, the targeted pattern is determined by a dynamic prioritization technique to give preferences to those patterns with higher criticality and higher likelihood to occur. We apply EMOOD to an industrial ADS under two common traffic situations. Evaluation results show that EMOOD outperforms three baseline approaches in generating test scenarios by discovering more requirements violation patterns.", "doi": "10.1109/ase51524.2021.9678883", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678883", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678883"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678883"}
{"title": "On the Real-World Effectiveness of Static Bug Detectors at Finding Null Pointer Exceptions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David A. Tomassi", "Cindy Rubio-González"], "abstract": "Static bug detectors aim at helping developers to automatically find and prevent bugs. In this experience paper, we study the effectiveness of static bug detectors at identifying Null Pointer Dereferences or Null Pointer Exceptions (NPEs). NPEs pervade all programming domains from systems to web development. Specifically, our study measures the effectiveness of five Java static bug detectors: CheckerFramework, ERADICATE, INFER, NULLAWAY, and SPOTBUGS. We conduct our study on 102 real-world and reproducible NPEs from 42 open-source projects found in the BUGSWARM and DEFECTS4J datasets. We apply two known methods to determine whether a bug is found by a given tool, and introduce two new methods that leverage stack trace and code coverage information. Additionally, we provide a categorization of the tool’s capabilities and the bug characteristics to better understand the strengths and weaknesses of the tools. Overall, the tools under study only find 30 out of 102 bugs (29.4%), with the majority found by ERADICATE. Based on our observations, we identify and discuss opportunities to make the tools more effective and useful.", "doi": "10.1109/ase51524.2021.9678535", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678535", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678535"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678535"}
{"title": "Subtle Bugs Everywhere: Generating Documentation for Data Wrangling Code", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chenyang Yang", "Shurui Zhou", "Jin L. C. Guo", "Christian Kästner"], "abstract": "Data scientists reportedly spend a significant amount of their time in their daily routines on data wrangling, i.e. cleaning data and extracting features. However, data wrangling code is often repetitive and error-prone to write. Moreover, it is easy to introduce subtle bugs when reusing and adopting existing code, which results in reduced model quality. To support data scientists with data wrangling, we present a technique to generate documentation for data wrangling code. We use (1) program synthesis techniques to automatically summarize data transformations and (2) test case selection techniques to purposefully select representative examples from the data based on execution information collected with tailored dynamic program analysis. We demonstrate that a JupyterLab extension with our technique can provide on-demand documentation for many cells in popular notebooks and find in a user study that users with our plugin are faster and more effective at finding realistic bugs in data wrangling code.", "doi": "10.1109/ase51524.2021.9678520", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678520", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678520"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678520"}
{"title": "Distribution Models for Falsification and Verification of DNNs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Felipe Toledo", "David Shriver", "Sebastian G. Elbaum", "Matthew B. Dwyer"], "abstract": "DNN validation and verification approaches that are input distribution agnostic waste effort on irrelevant inputs and report false property violations. Drawing on the large body of work on model-based validation and verification of traditional systems, we introduce the first approach that leverages environmental models to focus DNN falsification and verification on the relevant input space. Our approach, DFV, automatically builds an input distribution model using unsupervised learning, prefixes that model to the DNN to force all inputs to come from the learned distribution, and reformulates the property to the input space of the distribution model. This transformed verification problem allows existing DNN falsification and verification tools to target the input distribution – avoiding consideration of infeasible inputs. Our study of DFV with 7 falsification and verification tools, two DNNs defined over different data sets, and 93 distinct distribution models, provides clear evidence that the counterexamples found by the tools are much more representative of the data distribution, and it shows how the performance of DFV varies across domains, models, and tools.", "doi": "10.1109/ase51524.2021.9678590", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678590", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678590"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678590"}
{"title": "SATune: A Study-Driven Auto-Tuning Approach for Configurable Software Verification Tools", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ugur Koc", "Austin Mordahl", "Shiyi Wei", "Jeffrey S. Foster", "Adam A. Porter"], "abstract": "Many program verification tools can be customized via run-time configuration options that trade off performance, precision, and soundness. However, in practice, users often run tools under their default configurations, because understanding these tradeoffs requires significant expertise. In this paper, we ask how well a single, default configuration can work in general, and we propose SATune, a novel tool for automatically configuring program verification tools for given target programs. To answer our question, we gathered a dataset that runs four well-known program verification tools against a range of C and Java benchmarks, with results labeled as correct, incorrect, or inconclusive (e.g., timeout). Examining the dataset, we find there is generally no one-size-fits-all best configuration. Moreover, a statistical analysis shows that many individual configuration options do not have simple tradeoffs: they can be better or worse depending on the program.Motivated by these results, we developed SATune, which constructs configurations using a meta-heuristic search. The search is guided by a surrogate fitness function trained on our dataset. We compare the performance of SATune to three baselines: a single configuration with the most correct results in our dataset; the most precise configuration followed by the most correct configuration (if needed); and the most precise configuration followed by random search (also if needed). We find that SATune outperforms these approaches by completing more correct tasks with high precision. In summary, our work shows that good configurations for verification tools are not simple to find, and SATune takes an important step towards automating the process of finding them.", "doi": "10.1109/ase51524.2021.9678761", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678761", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678761"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678761"}
{"title": "Efficient SMT-Based Model Checking for Signal Temporal Logic", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jia Lee", "Geunyeol Yu", "Kyungmin Bae"], "abstract": "Signal temporal logic (STL) is widely used to specify and analyze properties of cyber-physical systems with continuous behaviors. However, STL model checking is still quite limited, as existing STL model checking methods are either incomplete or very inefficient. This paper presents a new SMT-based model checking algorithm for verifying STL properties of cyber-physical systems. We propose a novel translation technique to reduce the STL bounded model checking problem to the satisfiability of a first-order logic formula over reals, which can be solved using state-of-the-art SMT solvers. Our algorithm is based on a new theoretical result, presented in this paper, to build a small but complete discretization of continuous signals, which preserves the bounded satisfiability of STL. Our translation method allows an efficient STL model checking algorithm that is refutationally complete for bounded signals, and that is much more scalable than the previous refutationally complete algorithm.", "doi": "10.1109/ase51524.2021.9678719", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678719", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678719"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678719"}
{"title": "DeepMetis: Augmenting a Deep Learning Test Set to Increase its Mutation Score", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vincenzo Riccio", "Nargiz Humbatova", "Gunel Jahangirova", "Paolo Tonella"], "abstract": "Deep Learning (DL) components are routinely integrated into software systems that need to perform complex tasks such as image or natural language processing. The adequacy of the test data used to test such systems can be assessed by their ability to expose artificially injected faults (mutations) that simulate real DL faults.In this paper, we describe an approach to automatically generate new test inputs that can be used to augment the existing test set so that its capability to detect DL mutations increases. Our tool DeepMetis implements a search based input generation strategy. To account for the non-determinism of the training and the mutation processes, our fitness function involves multiple instances of the DL model under test. Experimental results show that DeepMetis is effective at augmenting the given test set, increasing its capability to detect mutants by 63% on average. A leave-one-out experiment shows that the augmented test set is capable of exposing unseen mutants, which simulate the occurrence of yet undetected faults.", "doi": "10.1109/ase51524.2021.9678764", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678764", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678764"], "github": ["https://github.com/testingautomated-usi/deepmetis"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678764"}
{"title": "Efficient state synchronisation in model-based testing through reinforcement learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Uraz Cengiz Türker", "Robert M. Hierons", "Mohammad Reza Mousavi", "Ivan Yu. Tyukin"], "abstract": "Model-based testing is a structured method to test complex systems. Scaling up model-based testing to large systems requires improving the efficiency of various steps involved in testcase generation and more importantly, in test-execution. One of the most costly steps of model-based testing is to bring the system to a known state, best achieved through synchronising sequences. A synchronising sequence is an input sequence that brings a given system to a predetermined state regardless of system’s initial state. Depending on the structure, the system might be complete, i.e., all inputs are applicable at every state of the system. However, some systems are partial and in this case not all inputs are usable at every state. Derivation of synchronising sequences from complete or partial systems is a challenging task. In this paper, we introduce a novel Q-learning algorithm that can derive synchronising sequences from systems with complete or partial structures. The proposed algorithm is faster and can process larger systems than the fastest sequential algorithm that derives synchronising sequences from complete systems. Moreover, the proposed method is also faster and can process larger systems than the most recent massively parallel algorithm that derives synchronising sequences from partial systems. Furthermore, the proposed algorithm generates shorter synchronising sequences.", "doi": "10.1109/ase51524.2021.9678566", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678566", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678566"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678566"}
{"title": "Faster Mutation Analysis with Fewer Processes and Smaller Overheads", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bo Wang", "Sirui Lu", "Yingfei Xiong", "Feng Liu"], "abstract": "Mutation analysis is a powerful dynamic approach that has many applications, such as measuring the quality of test suites or automatically locating faults. However, the inherent low scalability hampers its practical use. To accelerate mutation analysis, researchers propose approaches to reduce redundant executions. A family of fork-based approaches tries to share identical executions among mutants. Fork-based approaches carry all mutants in one process and decide whether to fork new child processes when reaching a mutated statement. The mutants carried by the parent process are split into groups and distributed to different processes to finish the remaining executions. However, existing fork-based approaches have two limitations: (1) the limited analysis scope on a single statement to compare and cluster mutants prevents their systems from detecting more equivalent mutants, and (2) the interpretation of the mutants and the runtime equivalence analysis introduce significant overhead.In this paper, we present a novel fork-based mutation analysis approach WinMut, which (1) groups mutants in a scope of mutated statements and, (2) removes redundant computations inside interpreters. WinMut not only reduces the number of invoked processes but also has a lower cost for executing a single process. Our experiments show that our approach can further accelerate mutation analysis with an average speedup of 5.57x on top of the state-of-the-art fork-based approach, AccMut.", "doi": "10.1109/ase51524.2021.9678827", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678827", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678827"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678827"}
{"title": "FRUGAL: Unlocking Semi-Supervised Learning for Software Analytics", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Huy Tu", "Tim Menzies"], "abstract": "Standard software analytics often involves having a large amount of data with labels in order to commission models with acceptable performance. However, prior work has shown that such requirements can be expensive, taking several weeks to label thousands of commits, and not always available when traversing new research problems and domains. Unsupervised Learning is a promising direction to learn hidden patterns within unlabelled data, which has only been extensively studied in defect prediction. Nevertheless, unsupervised learning can be ineffective by itself and has not been explored in other domains (e.g., static analysis and issue close time).Motivated by this literature gap and technical limitations, we present FRUGAL, a tuned semi-supervised method that builds on a simple optimization scheme that does not require sophisticated (e.g., deep learners) and expensive (e.g., 100% manually labelled data) methods. FRUGAL optimizes the unsupervised learner’s configurations (via a simple grid search) while validating our design decision of labelling just 2.5% of the data before prediction.As shown by the experiments of this paper FRUGAL outperforms the state-of-the-art adoptable static code warning recognizer and issue closed time predictor, while reducing the cost of labelling by a factor of 40 (from 100% to 2.5%). Hence we assert that FRUGAL can save considerable effort in data labelling especially in validating prior work or researching new problems.Based on this work, we suggest that proponents of complex and expensive methods should always baseline such methods against simpler and cheaper alternatives. For instance, a semi-supervised learner like FRUGAL can serve as a baseline to the state-of-theart software analytics.", "doi": "10.1109/ase51524.2021.9678617", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678617", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678617"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678617"}
{"title": "PyExplainer: Explaining the Predictions of Just-In-Time Defect Models", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chanathip Pornprasit", "Chakkrit Tantithamthavorn", "Jirayus Jiarpakdee", "Michael Fu", "Patanamon Thongtanunam"], "abstract": "Just-In-Time (JIT) defect prediction (i.e., an AI/ML model to predict defect-introducing commits) is proposed to help developers prioritize their limited Software Quality Assurance (SQA) resources on the most risky commits. However, the explainability of JIT defect models remains largely unexplored (i.e., practitioners still do not know why a commit is predicted as defect-introducing). Recently, LIME has been used to generate explanations for any AI/ML models. However, the random perturbation approach used by LIME to generate synthetic neighbors is still suboptimal, i.e., generating synthetic neighbors that may not be similar to an instance to be explained, producing low accuracy of the local models, leading to inaccurate explanations for just-in-time defect models. In this paper, we propose PyExplainer—i.e., a local rule-based model-agnostic technique for generating explanations (i.e., why a commit is predicted as defective) of JIT defect models. Through a case study of two open-source software projects, we find that our PyExplainer produces (1) synthetic neighbors that are 41%-45% more similar to an instance to be explained; (2) 18%-38% more accurate local models; and (3) explanations that are 69%-98% more unique and 17%-54% more consistent with the actual characteristics of defect-introducing commits in the future than LIME (a state-ofthe-art model-agnostic technique). This could help practitioners focus on the most important aspects of the commits to mitigate the risk of being defect-introducing. Thus, the contributions of this paper build an important step towards Explainable AI for Software Engineering, making software analytics more explainable and actionable. Finally, we publish our PyExplainer as a Python package to support practitioners and researchers (https://github.com/awsm-research/PyExplainer).", "doi": "10.1109/ase51524.2021.9678763", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678763", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678763"], "github": ["https://github.com/awsm-research/PyExplainer"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678763"}
{"title": "Groot: An Event-graph-based Approach for Root Cause Analysis in Industrial Settings", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hanzhang Wang", "Zhengkai Wu", "Huai Jiang", "Yichao Huang", "Jiamu Wang", "Selçuk Köprü", "Tao Xie"], "abstract": "For large-scale distributed systems, it is crucial to efficiently diagnose the root causes of incidents to maintain high system availability. The recent development of microservice architecture brings three major challenges (i.e., complexities of operation, system scale, and monitoring) to root cause analysis (RCA) in industrial settings. To tackle these challenges, in this paper, we present Groot, an event-graph-based approach for RCA. Groot constructs a real-time causality graph based on events that summarize various types of metrics, logs, and activities in the system under analysis. Moreover, to incorporate domain knowledge from site reliability engineering (SRE) engineers, Groot can be customized with user-defined events and domain-specific rules. Currently, Groot supports RCA among 5,000 real production services and is actively used by the SRE teams in eBay, a global e-commerce system serving more than 159 million active buyers per year. Over 15 months, we collect a data set containing labeled root causes of 952 real production incidents for evaluation. The evaluation results show that Groot is able to achieve 95% top-3 accuracy and 78% top-1 accuracy. To share our experience in deploying and adopting RCA in industrial settings, we conduct a survey to show that users of Groot find it helpful and easy to use. We also share the lessons learned from deploying and adopting Groot to solve RCA problems in production environments.", "doi": "10.1109/ase51524.2021.9678708", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678708", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678708"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678708"}
{"title": "Graph-based Incident Aggregation for Large-Scale Online Service Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhuangbin Chen", "Jinyang Liu", "Yuxin Su", "Hongyu Zhang", "Xuemin Wen", "Xiao Ling", "Yongqiang Yang", "Michael R. Lyu"], "abstract": "As online service systems continue to grow in terms of complexity and volume, how service incidents are managed will significantly impact company revenue and user trust. Due to the cascading effect, cloud failures often come with an overwhelming number of incidents from dependent services and devices. To pursue efficient incident management, related incidents should be quickly aggregated to narrow down the problem scope. To this end, in this paper, we propose GRLIA, an incident aggregation framework based on graph representation learning over the cascading graph of cloud failures. A representation vector is learned for each unique type of incident in an unsupervised and unified manner, which is able to simultaneously encode the topological and temporal correlations among incidents. Thus, it can be easily employed for online incident aggregation. In particular, to learn the correlations more accurately, we try to recover the complete scope of failures’ cascading impact by leveraging fine-grained system monitoring data, i.e., Key Performance Indicators (KPIs). The proposed framework is evaluated with real-world incident data collected from a large-scale online service system of Huawei Cloud. The experimental results demonstrate that GRLIA is effective and outperforms existing methods. Furthermore, our framework has been successfully deployed in industrial practice.", "doi": "10.1109/ase51524.2021.9678746", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678746", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678746"], "github": ["https://github.com/opspai/grlia"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678746"}
{"title": "On Multi-Modal Learning of Editing Source Code", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saikat Chakraborty", "Baishakhi Ray"], "abstract": "In recent years, Neural Machine Translator (NMT) has shown promise in automatically editing source code. Typical NMT based code editor only considers the code that needs to be changed as input and suggests developers with a ranked list of patched code to choose from - where the correct one may not always be at the top of the list. While NMT based code editing systems generate a broad spectrum of plausible patches, the correct one depends on the developers’ requirement and often on the context where the patch is applied. Thus, if developers provide some hints, using natural language, or providing patch context, NMT models can benefit from them.As a proof of concept, in this research, we leverage three modalities of information: edit location, edit code context, commit messages (as a proxy of developers’ hint in natural language) to automatically generate edits with NMT models. To that end, we build Modit, a multi-modal NMT based code editing engine. With in-depth investigation and analysis, we show that developers’ hint as an input modality can narrow the search space for patches and outperform state-of-the-art models to generate correctly patched code in top-1 position.", "doi": "10.1109/ase51524.2021.9678559", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678559", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678559"], "github": ["https://github.com/modit-team/MODIT"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678559"}
{"title": "Learning Highly Recursive Input Grammars", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Neil Kulkarni", "Caroline Lemieux", "Koushik Sen"], "abstract": "This paper presents Arvada, an algorithm for learning context-free grammars from a set of positive examples and a Boolean-valued oracle. Arvada learns a context-free grammar by building parse trees from the positive examples. Starting from initially flat trees, Arvada builds structure to these trees with a key operation: it bubbles sequences of sibling nodes in the trees into a new node, adding a layer of indirection to the tree. Bubbling operations enable recursive generalization in the learned grammar. We evaluate Arvada against GLADE and find it achieves on average increases of 4.98× in recall and 3.13× in F1 score, while incurring only a 1.27× slowdown and requiring only 0.87× as many calls to the oracle. Arvada has a particularly marked improvement over GLADE on grammars with highly recursive structure, like those of programming languages.", "doi": "10.1109/ase51524.2021.9678879", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678879", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678879"], "github": ["https://github.com/neil-kulkarni/arvada"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678879"}
{"title": "Automated Testing for Machine Translation via Constituency Invariance", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pin Ji", "Yang Feng", "Jia Liu", "Zhihong Zhao", "Baowen Xu"], "abstract": "With the development of deep neural networks, machine translation has achieved significant progress and integrated with people’s daily lives to assist in various tasks. However, machine translators, which are essentially one kind of software, also suffer from software defects. Translation errors might cause misunderstanding or even lead to marketing blunders, and political crisis. Thus, almost all translation service providers have feedback channels of incorrect translations to collect training data and improve product performance. Inspired by the syntax structure analysis, we introduce the constituency invariance, which reflects the structural similarity between a simple sentence and sentences derived from it, to test machine translators. We implement it into an automated tool CIT to detect translation errors by checking the constituency invariance relation between the translation results. CIT adopts constituency parse trees to represent the syntactic structures of sentences and employs an efficient data augmentation method to derive multiple new sentences based on one sentence. To validate CIT, we experiment with three widely-used machine translators, i.e., Bing Microsoft Translator, Google Translate, and Youdao Translator. With 600 seed sentences as input, CIT detects 2212, 1910, and 1590 translation errors with around 77% precision. We have submitted detected errors to the development teams. Until we submit this paper, Google, Bing, and Youdao have fixed 15.4%, 32.0%, 14.3% of reported errors, respectively.", "doi": "10.1109/ase51524.2021.9678715", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678715", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678715"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678715"}
{"title": "Race Detection for Event-Driven Node.js Applications", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiaoning Chang", "Wensheng Dou", "Jun Wei", "Tao Huang", "Jinhui Xie", "Yuetang Deng", "Jianbo Yang", "Jiaheng Yang"], "abstract": "Node.js has become a widely-used event-driven architecture for server-side and desktop applications. Node.js provides an effective asynchronous event-driven programming model, and supports asynchronous tasks and multi-priority event queues. Unexpected races among events and asynchronous tasks can cause severe consequences. Existing race detection approaches in Node.js applications mainly adopt random fuzzing technique, and can miss races due to large schedule space.In this paper, we propose a dynamic race detection approach NRace for Node.js applications. In NRace, we build precise happens-before relations among events and asynchronous tasks in Node.js applications, which also take multi-priority event queues into consideration. We further develop a predictive race detection technique based on these relations. We evaluate NRace on 10 realworld Node.js applications. The experimental result shows that NRace can precisely detect 6 races, and 5 of them have been confirmed by developers.", "doi": "10.1109/ase51524.2021.9678814", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678814", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678814"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678814"}
{"title": "Log-based Anomaly Detection Without Log Parsing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Van-Hoang Le", "Hongyu Zhang"], "abstract": "Software systems often record important runtime information in system logs for troubleshooting purposes. There have been many studies that use log data to construct machine learning models for detecting system anomalies. Through our empirical study, we find that existing log-based anomaly detection approaches are significantly affected by log parsing errors that are introduced by 1) OOV (out-of-vocabulary) words, and 2) semantic misunderstandings. The log parsing errors could cause the loss of important information for anomaly detection. To address the limitations of existing methods, we propose NeuralLog, a novel log-based anomaly detection approach that does not require log parsing. NeuralLog extracts the semantic meaning of raw log messages and represents them as semantic vectors. These representation vectors are then used to detect anomalies through a Transformer-based classification model, which can capture the contextual information from log sequences. Our experimental results show that the proposed approach can effectively understand the semantic meaning of log messages and achieve accurate anomaly detection results. Overall, NeuralLog achieves F1-scores greater than 0.95 on four public datasets, outperforming the existing approaches.", "doi": "10.1109/ase51524.2021.9678773", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678773", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678773"], "github": ["https://github.com/vanhoanglepsa/NeuralLog"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678773"}
{"title": "Finding the Missing Piece: Permission Specification Analysis for Android NDK", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hao Zhou", "Haoyu Wang", "Shuohan Wu", "Xiapu Luo", "Yajin Zhou", "Ting Chen", "Ting Wang"], "abstract": "The Android research community has long focused on building the permission specification for Android framework APIs, which can be referenced by app developers to request the necessary permissions for their apps. However, existing studies just analyze the permission specification for Java framework APIs in Android SDK, whereas the permission specification for native framework APIs in Android NDK remains intact. Since more and more apps implement their functionalities using native framework APIs, and the permission specification for these APIs is poorly documented, the permission specification analysis for Android NDK is in urgent need. To fill in the gap, in this paper, we conduct the first permission specification analysis for Android NDK. In particular, to automatically generate the permission specification for Android NDK, we design and develop PSGen, a new tool that statically analyzes the implementation of Android framework and Android kernel to correlate native framework APIs with their required permissions. Applying PSGen to 3 Android systems, including Android 9.0, 10.0, and 11.0, we find that PSGen can precisely build the permission specification. With the help of PSGen, we discover more than 200 native framework APIs that are correlated with at least one permission.", "doi": "10.1109/ase51524.2021.9678843", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678843", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678843"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678843"}
{"title": "Characterizing and Detecting Configuration Compatibility Issues in Android Apps", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Huaxun Huang", "Ming Wen", "Lili Wei", "Yepang Liu", "Shing-Chi Cheung"], "abstract": "XML configuration files are widely used in Android to define an app’s user interface and essential runtime information such as system permissions. As Android evolves, it might introduce functional changes in the configuration environment, thus causing compatibility issues that manifest as inconsistent app behaviors at different API levels. Such issues can often induce software crashes and inconsistent look-and-feel when running at specific Android versions. Existing works incur plenty of false positive and false negative issue-detection rules by conducting trivial data-flow analysis while failing to model the XML tree hierarchies of the Android configuration files. Besides, little is known about how the changes in an Android framework can induce such compatibility issues. To bridge such gaps, we conducted a systematic study by analyzing 196 real-world issues collected from 43 popular apps. We identified common patterns of Android framework code changes that induce such configuration compatibility issues. Based on the findings, we propose CONFDROID that can automatically extract rules for detecting configuration compatibility issues. The intuition is to perform symbolic execution based on a model learned from the common code change patterns. Experiment results show that CONFDROID can successfully extract 282 valid issue-detection rules with a precision of 91.9%. Among them, 65 extracted rules can manifest issues that cannot be detected by the rules of state-of-the-art baselines. More importantly, 11 out of them have led to the detection of 107 reproducible configuration compatibility issues that the baselines cannot detect in 30 out of 316 real-world Android apps.", "doi": "10.1109/ase51524.2021.9678556", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678556", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678556"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678556"}
{"title": "Where to Start: Studying Type Annotation Practices in Python", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wuxia Jin", "Dinghong Zhong", "Zifan Ding", "Ming Fan", "Ting Liu"], "abstract": "Dynamic programming languages have been embracing gradual typing, which supports optional type annotations in source code. Type-annotating a complex and long-lasting codebase is indeed a gradual and expensive process, where two issues have troubled developers. First, there is few guidance about how to implement type annotations due to the existence of non-trivial type practices; second, there is few guidance about which portion of a codebase should be type-annotated first. To address these issues, this paper investigates the patterns of non-trivial type-annotation practices and features of type-annotated code files. Our study detected six patterns of type-annotation practices, which involve recovering and expressing design concerns. Moreover, we revealed three complementary features of type-annotated files. Besides, we implemented a tool for studying optional typing practice. We suggest that: 1) design concerns should be considered to improve type annotation implementation by following at least six patterns; 2) files critical to software architecture could be type-annotated in priority. We believe these guidelines would promote a better type annotation practice for dynamic languages.", "doi": "10.1109/ase51524.2021.9678947", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678947", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678947"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678947"}
{"title": "APIzation: Generating Reusable APIs from StackOverflow Code Snippets", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Valerio Terragni", "Pasquale Salza"], "abstract": "Developer forums like StackOverflow have become essential resources to modern software development practices. However, many code snippets lack a well-defined method declaration, and thus they are often incomplete for immediate reuse. Developers must adapt the retrieved code snippets by parameterizing the variables involved and identifying the return value. This activity, which we call APIzation of a code snippet, can be tedious and time-consuming. In this paper, we present APIZATOR to perform APIzations of JAVA code snippets automatically. APIZATOR is grounded by four common patterns that we extracted by studying real APIzations in GitHub. APIZATOR presents a static analysis algorithm that automatically extracts the method parameters and return statements. We evaluated APIZATOR with a ground-truth of 200 APIzations collected from 20 developers. For 113 (56.50 %) and 115 (57.50 %) APIzations, APIZATOR and the developers extracted identical parameters and return statements, respectively. For 163 (81.50 %) APIzations, either the parameters or the return statements were identical.", "doi": "10.1109/ase51524.2021.9678576", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678576", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678576"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678576"}
{"title": "FIGCPS: Effective Failure-inducing Input Generation for Cyber-Physical Systems with Deep Reinforcement Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shaohua Zhang", "Shuang Liu", "Jun Sun", "Yuqi Chen", "Wenzhi Huang", "Jinyi Liu", "Jian Liu", "Jianye Hao"], "abstract": "Cyber-Physical Systems (CPSs) are composed of computational control logic and physical processes, which intertwine with each other. CPSs are widely used in various domains of daily life, including those safety-critical systems and infrastructures, such as medical monitoring, autonomous vehicles, and water treatment systems. It is thus critical to effectively test them. However, it is not easy to obtain test cases which can fail the CPS. In this work, we propose a failure-inducing input generation approach FIGCPS, which requires no knowledge of the CPS under test or any history logs of the CPS which are usually hard to obtain. Our approach adopts deep reinforcement learning techniques to interact with the CPS under test and effectively searches for failure-inducing input guided by rewards. Our approach adaptively collects information from the CPS, which reduces the training time and is also able to explore different states. Moreover, our approach is the first attempt to generate failure-inducing input for CPSs with both continuous action space and high-dimensional discrete action space, which are common for some classes of CPSs. The evaluation results show that FIGCPS not only achieves a higher success rate than the state-of-the-art approaches but also finds two new attacks in a well-tested CPS.", "doi": "10.1109/ase51524.2021.9678832", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678832", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678832"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678832"}
{"title": "InstruGuard: Find and Fix Instrumentation Errors for Coverage-based Greybox Fuzzing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuwei Liu", "Yanhao Wang", "Purui Su", "Yuanping Yu", "Xiangkun Jia"], "abstract": "As one of the most successful methods at vulnerability discovery, coverage-based greybox fuzzing relies on the lightweight compile-time instrumentation to achieve the fine-grained coverage feedback of the target program. Researchers improve it by optimizing the coverage metrics without questioning the correctness of the instrumentation. However, instrumentation errors, including missed instrumentation locations and redundant instrumentation locations, harm the ability of fuzzers. According to our experiments, it is a common and severe problem in various coverage-based greybox fuzzers and at different compiler optimization levels.In this paper, we design and implement InstruGuard, an open-source and pragmatic platform to find and fix instrumentation errors. It detects instrumentation errors by static analysis on target binaries, and fixes them with a general solution based on binary rewriting. To study the impact of instrumentation errors and test our solutions, we built a dataset of 15 real-world programs and selected 6 representative fuzzers as targets. We used InstruGuard to check and repair the instrumented binaries with different fuzzers and different compiler optimization options. To evaluate the effectiveness of the repair, we ran the fuzzers with original instrumented programs and the repaired ones, and compared the fuzzing results from aspects of execution paths, line coverage, and real bug findings. The results showed that InstruGuard had corrected the instrumentation errors of different fuzzers and helped to find more bugs in the dataset. Moreover, we discovered one new zero-day vulnerability missed by other fuzzers with fixed instrumentation but without any changes to the fuzzers.", "doi": "10.1109/ase51524.2021.9678671", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678671", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678671"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678671"}
{"title": "RULF: Rust Library Fuzzing via API Dependency Graph Traversal", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jianfeng Jiang", "Hui Xu", "Yangfan Zhou"], "abstract": "Robustness is a key concern for Rust library development because Rust promises no risks of undefined behaviors if developers use safe APIs only. Fuzzing is a practical approach for examining the robustness of programs. However, existing fuzzing tools are not directly applicable to library APIs due to the absence of fuzz targets. It mainly relies on human efforts to design fuzz targets case by case which is labor-intensive. To address this problem, this paper proposes a novel automated fuzz target generation approach for fuzzing Rust libraries via API dependency graph traversal. We identify several essential requirements for library fuzzing, including validity and effectiveness of fuzz targets, high API coverage, and efficiency. To meet these requirements, we first employ breadth-first search with pruning to find API sequences under a length threshold, then we backward search longer sequences for uncovered APIs, and finally we optimize the sequence set as a set covering problem. We implement our fuzz target generator and conduct fuzzing experiments with AFL++ on several real-world popular Rust projects. Our tool finally generates 7 to 118 fuzz targets for each library with API coverage up to 0.92. We exercise each target with a threshold of 24 hours and find 30 previously-unknown bugs from seven libraries.", "doi": "10.1109/ase51524.2021.9678813", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678813", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678813"], "github": ["https://github.com/artisan-lab/rulf"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678813"}
{"title": "PyNose: A Test Smell Detector For Python", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tongjie Wang", "Yaroslav Golubev", "Oleg Smirnov", "Jiawei Li", "Timofey Bryksin", "Iftekhar Ahmed"], "abstract": "Similarly to production code, code smells also occur in test code, where they are called test smells. Test smells have a detrimental effect not only on test code but also on the production code that is being tested. To date, the majority of the research on test smells has been focusing on programming languages such as Java and Scala. However, there are no available automated tools to support the identification of test smells for Python, despite its rapid growth in popularity in recent years. In this paper, we strive to extend the research to Python, build a tool for detecting test smells in this language, and conduct an empirical analysis of test smells in Python projects.We started by gathering a list of test smells from existing research and selecting test smells that can be considered language-agnostic or have similar functionality in Python’s standard Unittest framework. In total, we identified 17 diverse test smells. Additionally, we searched for Python-specific test smells by mining frequent code change patterns that can be considered as either fixing or introducing test smells. Based on these changes, we proposed our own test smell called Suboptimal Assert. To detect all these test smells, we developed a tool called PYNOSE in the form of a plugin to PyCharm, a popular Python IDE. Finally, we conducted a large-scale empirical investigation aimed at analyzing the prevalence of test smells in Python code. Our results show that 98% of the projects and 84% of the test suites in the studied dataset contain at least one test smell. Our proposed Suboptimal Assert smell was detected in as much as 70.6% of the projects, making it a valuable addition to the list.", "doi": "10.1109/ase51524.2021.9678615", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678615", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678615"], "github": ["https://github.com/jetbrains-research/pynose"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678615"}
{"title": "JSTAR: JavaScript Specification Type Analyzer using Refinement", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jihyeok Park", "Seungmin An", "Wonho Shin", "Yusung Sim", "Sukyoung Ryu"], "abstract": "JavaScript is one of the mainstream programming languages for client-side programming, server-side programming, and even embedded systems. Various JavaScript engines developed and maintained in diverse fields must conform to the syntax and semantics described in ECMAScript, the standard specification of JavaScript. Since an incorrect description in ECMAScript can lead to wrong JavaScript engine implementations, checking the correctness of ECMAScript is critical and essential. However, all the specification updates are currently manually reviewed by the Ecma Technical Committee 39 (TC39) without any automated tools. Moreover, in late 2014, the committee announced the yearly release cadence and open development process of ECMAScript to quickly adapt to evolving development environments. Because of such frequent updates, checking the correctness of ECMAScript becomes more labor-intensive and error-prone.To alleviate the problem, we propose JSTAR, a JavaScript Specification Type Analyzer using Refinement. It is the first tool that performs type analysis on JavaScript specifications and detects specification bugs using a bug detector. For a given specification, JSTAR first compiles each abstract algorithm written in a structured natural language to a corresponding function in IRES, an untyped intermediate representation for ECMAScript. Then, it performs type analysis for compiled functions with specification types defined in ECMAScript. Based on the result of type analysis, JSTAR detects specification bugs using a bug detector consisting of four checkers. To increase the precision of the type analysis, we present condition-based refinement for type analysis, which prunes out infeasible abstract states using conditions of assertions and branches. We evaluated JSTAR with all 864 versions in the official ECMAScript repository for the recent three years from 2018 to 2021. JSTAR took 137.3 seconds on average to perform type analysis for each version, and detected 157 type-related specification bugs with 59.2% precision; 93 out of 157 bugs are true bugs. Among them, 14 bugs are newly detected by JSTAR, and the committee confirmed them all.", "doi": "10.1109/ase51524.2021.9678781", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678781", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678781"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678781"}
{"title": "Can Neural Clone Detection Generalize to Unseen Functionalitiesƒ", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chenyao Liu", "Zeqi Lin", "Jian-Guang Lou", "Lijie Wen", "Dongmei Zhang"], "abstract": "Many recently proposed code clone detectors exploit neural networks to capture latent semantics of source code, thus achieving impressive results for detecting semantic clones. These neural clone detectors rely on the availability of large amounts of labeled training data. We identify a key oversight in the current evaluation methodology for neural clone detection: cross-functionality generalization (i.e., detecting semantic clones of which the functionalities are unseen in training). Specifically, we focus on this question: do neural clone detectors truly learn the ability to detect semantic clones, or they just learn how to model specific functionalities in training data while cannot generalize to realistic unseen functionalitiesƒ This paper investigates how the generalizability can be evaluated and improved.Our contributions are 3-folds: (1) We propose an evaluation methodology that can systematically measure the cross-functionality generalizability of neural clone detection. Based on this evaluation methodology, an empirical study is conducted and the results indicate that current neural clone detectors cannot generalize well as expected. (2) We conduct empirical analysis to understand key factors that can impact the generalizability. We investigate 3 factors: training data diversity, vocabulary, and locality. Results show that the performance loss on unseen functionalities can be reduced through addressing the out-of-vocabulary problem and increasing training data diversity. (3) We propose a human-in-the-loop mechanism that help adapt neural clone detectors to new code repositories containing lots of unseen functionalities. It improves annotation efficiency with the combination of transfer learning and active learning. Experimental results show that it reduces the amount of annotations by about 88%. Our code and data are publicly available1.", "doi": "10.1109/ase51524.2021.9678907", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678907", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678907"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678907"}
{"title": "Characterizing Transaction-Reverting Statements in Ethereum Smart Contracts", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lu Liu", "Lili Wei", "Wuqi Zhang", "Ming Wen", "Yepang Liu", "Shing-Chi Cheung"], "abstract": "Smart contracts are programs stored on blockchains to execute transactions. When input constraints or security properties are violated at runtime, the transaction being executed by a smart contract needs to be reverted to avoid undesirable consequences. On Ethereum, the most popular blockchain that supports smart contracts, developers can choose among three transaction-reverting statements (i.e., require, if…revert, and if…throw) to handle anomalous transactions. While these transaction-reverting statements are vital for preventing smart contracts from exhibiting abnormal behaviors or suffering malicious attacks, there is limited understanding of how they are used in practice. In this work, we perform the first empirical study to characterize transaction-reverting statements in Ethereum smart contracts. We measured the prevalence of these statements in 3,866 verified smart contracts from popular dapps and built a taxonomy of their purposes via manually analyzing 557 transaction-reverting statements. We also compared template contracts and their corresponding custom contracts to understand how developers customize the use of transaction-reverting statements. Finally, we analyzed the security impact of transaction-reverting statements by removing them from smart contracts and comparing the mutated contracts against the original ones. Our study led to important findings. For example, we found that transaction-reverting statements are commonly used to perform seven types of authority verifications or validity checks, and missing such statements may compromise the security of smart contracts. We also found that current smart contract security analyzers cannot effectively handle transaction-reverting statements when detecting security vulnerabilities. Our findings can shed light on further research in the broad area of smart contract quality assurance and provide practical guidance to smart contract developers on the appropriate use of transaction-reverting statements.", "doi": "10.1109/ase51524.2021.9678597", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678597", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678597"], "github": ["https://github.com/transaction-reverting-statements/characterizing-require-statement-in-ethereum-smart-contract"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678597"}
{"title": "\"What makes my queries slow?\": Subgroup Discovery for SQL Workload Analysis", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Youcef Remil", "Anes Bendimerad", "Romain Mathonat", "Philippe Chaleat", "Mehdi Kaytoue"], "abstract": "Among daily tasks of database administrators (DBAs), the analysis of query workloads to identify schema issues and improving performances is crucial. Although DBAs can easily pinpoint queries repeatedly causing performance issues, it remains challenging to automatically identify subsets of queries that share some properties only (a pattern) and simultaneously foster some target measures, such as execution time. Patterns are defined on combinations of query clauses, environment variables, database alerts and metrics and help answer questions like what makes SQL queries slow? What makes I/O communications high? Automatically discovering these patterns in a huge search space and providing them as hypotheses for helping to localize issues and root-causes is important in the context of explainable AI. To tackle it, we introduce an original approach rooted on Subgroup Discovery. We show how to instantiate and develop this generic data-mining framework to identify potential causes of SQL workloads issues. We believe that such data-mining technique is not trivial to apply for DBAs. As such, we also provide a visualization tool for interactive knowledge discovery. We analyse a one week workload from hundreds of databases from our company, make both the dataset and source code available, and experimentally show that insightful hypotheses can be discovered.", "doi": "10.1109/ase51524.2021.9678915", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678915", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678915"], "github": ["https://github.com/remilyoucef/sd-4sql", "https://github.com/RemilYoucef/sd-4sql/tree/main/Code"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678915"}
{"title": "AID: Efficient Prediction of Aggregated Intensity of Dependency in Large-scale Cloud Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tianyi Yang", "Jiacheng Shen", "Yuxin Su", "Xiao Ling", "Yongqiang Yang", "Michael R. Lyu"], "abstract": "Service reliability is one of the key challenges that cloud providers have to deal with. In cloud systems, unplanned service failures may cause severe cascading impacts on their dependent services, deteriorating customer satisfaction. Predicting the cascading impacts accurately and efficiently is critical to the operation and maintenance of cloud systems. Existing approaches identify whether one service depends on another via distributed tracing but no prior work focused on discriminating to what extent the dependency between cloud services is. In this paper, we survey the outages and the procedure for failure diagnosis in two cloud providers to motivate the definition of the intensity of dependency. We define the intensity of dependency between two services as how much the status of the callee service influences the caller service. Then we propose AID, the first approach to predict the intensity of dependencies between cloud services. AID first generates a set of candidate dependency pairs from the spans. AID then represents the status of each cloud service with a multivariate time series aggregated from the spans. With the representation of services, AID calculates the similarities between the statuses of the caller and the callee of each candidate pair. Finally, AID aggregates the similarities to produce a unified value as the intensity of the dependency. We evaluate AID on the data collected from an open-source microservice benchmark and a cloud system in production. The experimental results show that AID can efficiently and accurately predict the intensity of dependencies. We further demonstrate the usefulness of our method in a large-scale commercial cloud system.", "doi": "10.1109/ase51524.2021.9678534", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678534", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678534"], "github": ["https://github.com/opspai/aid"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678534"}
{"title": "Performance Testing for Cloud Computing with Dependent Data Bootstrapping", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sen He", "Tianyi Liu", "Palden Lama", "Jaewoo Lee", "In Kee Kim", "Wei Wang"], "abstract": "To effectively utilize cloud computing, cloud practice and research require accurate knowledge of the performance of cloud applications. However, due to the random performance fluctuations, obtaining accurate performance results in the cloud is extremely difficult. To handle this random fluctuation, prior research on cloud performance testing relied on a non-parametric statistic tool called bootstrapping to design their stop criteria. However, in this paper, we show that the basic bootstrapping employed by prior work overlooks the internal dependency within cloud performance test data, which leads to inaccurate performance results.We then present Metior, a novel automated cloud performance testing methodology, which is designed based on statistical tools of block bootstrapping, the law of large numbers, and autocorrelation. These statistical tools allow Metior to properly consider the internal dependency within cloud performance test data. They also provide better coverage of cloud performance fluctuation and reduce the testing cost. Experimental evaluation on two public clouds showed that 98% of Metior’s tests could provide performance results with less than 3% error. Metior also significantly outperformed existing cloud performance testing methodologies in terms of accuracy and cost – with up to 14% increase in the accurate test count and up to 3.1 times reduction in testing cost.", "doi": "10.1109/ase51524.2021.9678687", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678687", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678687"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678687"}
{"title": "Nekara: Generalized Concurrency Testing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Udit Agarwal", "Pantazis Deligiannis", "Cheng Huang", "Kumseok Jung", "Akash Lal", "Immad Naseer", "Matthew Parkinson", "Arun Thangamani", "Jyothi Vedurada", "Yunpeng Xiao"], "abstract": "Testing concurrent systems remains an uncomfortable problem for developers. The common industrial practice is to stress-test a system against large workloads, with the hope of triggering enough corner-case interleavings that reveal bugs. However, stress testing is often inefficient and its ability to get coverage of interleavings is unclear. In reaction, the research community has proposed the idea of systematic testing, where a tool takes over the scheduling of concurrent actions so that it can perform an algorithmic search over the space of interleavings.We present an experience paper on the application of systematic testing to several case studies. We separate the algorithmic advancements in prior work (on searching the large space of interleavings) from the engineering of their tools. The latter was unsatisfactory; often the tools were limited to a small domain, hard to maintain, and hard to extend to other domains. We designed Nekara, an open-source cross-platform library for easily building custom systematic testing solutions.We show that (1) Nekara can effectively encapsulate state-of-the-art exploration algorithms by evaluating on prior bench-marks, and (2) Nekara can be applied to a wide variety of scenarios, including existing open-source systems as well as production distributed services of Microsoft Azure. Nekara was easy to use, improved testing, and found multiple new bugs.", "doi": "10.1109/ase51524.2021.9678838", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678838", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678838"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678838"}
{"title": "QDiff: Differential Testing of Quantum Software Stacks", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiyuan Wang", "Qian Zhang", "Guoqing Harry Xu", "Miryung Kim"], "abstract": "Over the past few years, several quantum software stacks (QSS) have been developed in response to rapid hardware advances in quantum computing. A QSS includes a quantum programming language, an optimizing compiler that translates a quantum algorithm written in a high-level language into quantum gate instructions, a quantum simulator that emulates these instructions on a classical device, and a software controller that sends analog signals to a very expensive quantum hardware based on quantum circuits. In comparison to traditional compilers and architecture simulators, QSSes are difficult to tests due to the probabilistic nature of results, the lack of clear hardware specifications, and quantum programming complexity.This work devises a novel differential testing approach for QSSes, named QDiff with three major innovations: (1) We generate input programs to be tested via semantics-preserving, source to source transformation to explore program variants. (2) We speed up differential testing by filtering out quantum circuits that are not worthwhile to execute on quantum hardware by analyzing static characteristics such as a circuit depth, 2-gate operations, gate error rates, and T1 relaxation time. (3) We design an extensible equivalence checking mechanism via distribution comparison functions such as Kolmogorov–Smirnov test and cross entropy.We evaluate QDiff with three widely-used open source QSSes: Qiskit from IBM, Cirq from Google, and Pyquil from Rigetti. By running QDiff on both real hardware and quantum simulators, we found several critical bugs revealing potential instabilities in these platforms. QDiff’s source transformation is effective in producing semantically equivalent yet not-identical circuits (i.e., 34% of trials), and its filtering mechanism can speed up differential testing by 66%.", "doi": "10.1109/ase51524.2021.9678792", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678792", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678792"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678792"}
{"title": "Finding A Needle in a Haystack: Automated Mining of Silent Vulnerability Fixes", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiayuan Zhou", "Michael Pacheco", "Zhiyuan Wan", "Xin Xia", "David Lo", "Yuan Wang", "Ahmed E. Hassan"], "abstract": "Following the coordinated vulnerability disclosure model, a vulnerability in open source software (OSS) is sug-gested to be fixed \"silently\", without disclosing the fix until the vulnerability is disclosed. Yet, it is crucial for OSS users to be aware of vulnerability fixes as early as possible, as once a vulnerability fix is pushed to the source code repository, a malicious party could probe for the corresponding vulnerability to exploit it. In practice, OSS users often rely on the vulnerability disclosure information from security advisories (e.g., National Vulnerability Database) to sense vulnerability fixes. However, the time between the availability of a vulnerability fix and its disclosure can vary from days to months, and in some cases, even years. Due to manpower constraints and the lack of expert knowledge, it is infeasible for OSS users to manually analyze all code changes for vulnerability fix detection. Therefore, it is essential to identify vulnerability fixes automatically and promptly. In a first-of-its-kind study, we propose VulFixMiner, a Transformer-based approach, capable of automatically extracting semantic meaning from commit-level code changes to identify silent vulnerability fixes. We construct our model using sampled commits from 204 projects, and evaluate using the full set of commits from 52 additional projects. The evaluation results show that VulFixMiner outperforms various state-of-the-art baselines in terms of AUC (i.e., 0.81 and 0.73 on Java and Python dataset, respectively) and two effort-aware performance metrics (i.e., EffortCost, Popt). Especially, with an effort of inspecting 5% of total LOC, VulFixMiner can identify 49% of total vulnerability fixes. Additionally, with manual verification of sampled commits that were identified as vulnerability fixes, but not marked as such in our dataset, we observe that 35% (29 out of 82) of the commits are for fixing vulnerabilities, indicating VulFixMiner is also capable of identifying unreported vulnerability fixes.", "doi": "10.1109/ase51524.2021.9678720", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678720", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678720"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678720"}
{"title": "DeepCVA: Automated Commit-level Vulnerability Assessment with Deep Multi-task Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Triet Huynh Minh Le", "David Hin", "Roland Croft", "Muhammad Ali Babar"], "abstract": "It is increasingly suggested to identify Software Vulnerabilities (SVs) in code commits to give early warnings about potential security risks. However, there is a lack of effort to assess vulnerability-contributing commits right after they are detected to provide timely information about the exploitability, impact and severity of SVs. Such information is important to plan and prioritize the mitigation for the identified SVs. We propose a novel Deep multi-task learning model, DeepCVA, to automate seven Commit-level Vulnerability Assessment tasks simultaneously based on Common Vulnerability Scoring System (CVSS) metrics. We conduct large-scale experiments on 1,229 vulnerability-contributing commits containing 542 different SVs in 246 real-world software projects to evaluate the effectiveness and efficiency of our model. We show that DeepCVA is the best-performing model with 38% to 59.8% higher Matthews Correlation Coefficient than many supervised and unsupervised baseline models. DeepCVA also requires 6.3 times less training and validation time than seven cumulative assessment models, leading to significantly less model maintenance cost as well. Over-all, DeepCVA presents the first effective and efficient solution to automatically assess SVs early in software systems.", "doi": "10.1109/ase51524.2021.9678622", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678622", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678622"], "github": ["https://github.com/lhmtriet/deepcva"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678622"}
{"title": "Automated Repair of Size-Based Inaccessibility Issues in Mobile Applications", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali S. Alotaibi", "Paul T. Chiou", "William G. J. Halfond"], "abstract": "An increasing number of people are dependent on mobile devices to access data and complete essential tasks. For people with disabilities, mobile apps that violate accessibility guidelines can prevent them from carrying out these activities. Size-Based Inaccessibility is one of the top accessibility issues in mobile applications. These issues make apps difficult to use, especially for older people and people with motor disabilities. Existing accessibility related techniques are limited in terms of helping developers to resolve these issues. In this paper, we present our novel automated approach for repairing Size-Based Inaccessibility issues in mobile applications. Our empirical evaluation showed that our approach was able to successfully resolve 99% of the reported Size-Based Inaccessibility issues and received a high approval rating in a user study of the appearance of the repaired user interfaces.", "doi": "10.1109/ase51524.2021.9678625", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678625", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678625"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678625"}
{"title": "Mining Cross-Domain Apps for Software Evolution: A Feature-based Approach", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Md Kafil Uddin", "Qiang He", "Jun Han", "Caslon Chua"], "abstract": "The skyrocketing growth of mobile apps and mobile devices has significantly fueled the competition among app developers. They have leveraged the app store capabilities to analyse app data and identify app improvement opportunities. Existing research has shown that app developers mostly rely on in-domain (i.e., same domain or same app) data to improve their apps. However, relying on in-domain data results in low diversity and lacks novelty in recommended features. In this work, we present an approach that automatically identifies, classifies and ranks relevant popular features from cross-domain apps for recommendation to any given target app. It includes the following three steps: 1) identify cross-domain apps that are relevant to the target app in terms of their features; 2) filter and group semantically the features of the relevant cross-domain apps that are complementary to the target app; 3) rank and prioritize the complementary cross-domain features (in terms of their domain, app, feature and popularity characteristics) for adoption by the target app’s developers. We have run extensive experiments on 100 target apps from 10 categories over 15,200 cross-domain apps from 31 categories. The experimental results have shown that our approach to identifying, grouping and ranking complementary cross-domain features for recommendation has achieved an accuracy level of over 89%. Our semantic feature grouping technique has also significantly outperformed two existing baseline techniques. The empirical evaluation validates the efficacy of our approach in providing personalised feature recommendation and enhancing app’s user serendipity.", "doi": "10.1109/ase51524.2021.9678514", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678514", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678514"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678514"}
{"title": "UI Test Migration Across Mobile Platforms", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saghar Talebipour", "Yixue Zhao", "Luka Dojcilovic", "Chenggang Li", "Nenad Medvidovic"], "abstract": "Writing UI tests manually requires significant effort. Several approaches have tried to address this problem in mobile apps: by exploiting the similarities of different apps within the same domain on a single platform, they have shown that it is possible to transfer tests that exercise similar functionality between the apps. A related recent technique enables transfer of UI tests uni-directionally, from an open-source iOS app to the same app implemented for Android. This paper presents MAPIT, a technique that expands existing work in three important ways: (1) it enables bi-directional UI test transfer between pairs of \"sibling\" Android and iOS apps; (2) it does not assume that the apps’ source code is available; (3) it is capable of transferring tests containing oracles in addition to UI events. MAPIT runs existing tests on a \"source\" app and builds a partial model of the app corresponding to each test. The model comprises the app’s screenshots, obtainable properties of each screenshot’s constituent elements, and labeled transitions between the screenshots. MAPIT uses this model to determine the corresponding information on the \"target\" app and generates an equivalent test, via a novel approach that leverages computer vision and NLP. Our evaluation on a diverse set of widely used, closed-source sibling Android and iOS apps shows that MAPIT is feasible, accurate, and useful in transferring UI tests across platforms.", "doi": "10.1109/ase51524.2021.9678643", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678643", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678643"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678643"}
{"title": "Intelligent Change Operators for Multi-Objective Refactoring", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chaima Abid", "James Ivers", "Thiago do Nascimento Ferreira", "Marouane Kessentini", "Fares E. Kahla", "Ipek Ozkaya"], "abstract": "In this paper, we propose intelligent change operators and integrate them into an evolutionary multi-objective search algorithm to recommend valid refactorings that address conflicting quality objectives such as understandability and effectiveness. The proposed intelligent crossover and mutation operators incorporate refactoring dependencies to avoid creating invalid refactorings or invalidating existing refactorings. Further, the intelligent crossover operator is augmented to create offspring that improve solution quality by exchanging blocks of valid refactorings that improve a solution’s weakest objectives. We used our intelligent change operators to generate refactoring recommendations for four widely used open-source projects. The results show that our intelligent change operators improve the diversity of solutions. Diversity is important in genetic algorithms because crossing over a homogeneous population does not yield new solutions. Given the inherent nature of design trade-offs in software, giving developers choices that reflect these trade-offs is important. Higher diversity makes better use of developers time than lots of incredibly similar solutions. Our intelligent change operators also accelerate solution convergence to a feasible solution that optimizes the trade-off between the conflicting quality objectives. Finally, they reduce the number of invalid refactorings by up to 71.52% compared to existing search-based refactoring approaches, and increase the quality of the solutions. Our approach outperformed the state-of-the-art search-based refactoring approaches and an existing deterministic refactoring tool based on manual validation by developers with an average manual correctness, precision and recall of 0.89, 0.82, and 0.87.", "doi": "10.1109/ase51524.2021.9678519", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678519", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678519"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678519"}
{"title": "Refactorings and Technical Debt in Docker Projects: An Empirical Study", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Emna Ksontini", "Marouane Kessentini", "Thiago do Nascimento Ferreira", "Foyzul Hassan"], "abstract": "Software containers, such as Docker, are recently considered as the mainstream technology of providing reusable software artifacts. Developers can easily build and deploy their applications based on the large number of reusable Docker images that are publicly available. Thus, a current popular trend in industry is to move towards the containerization of their applications. However, container-based projects compromise different components including the Docker and Docker-compose files, and several other dependencies to the source code combining different containers and facilitating the interactions with them. Similar to any other complex systems, container-based projects are prone to various quality and technical debt issues related to different artifacts: Docker and Docker-compose files, and regular source code ones. Unfortunately, there is a gap of knowledge in how container-based projects actually evolve and are maintained.In this paper, we address the above gap by studying refactorings, i.e., structural changes while preserving the behavior, applied in open-source Docker projects, and the technical debt issues they alleviate. We analyzed 68 projects, consisting of 19,5 MLOC, along with 193 manually examined commits. The results indicate that developers refactor these Docker projects for a variety of reasons that are specific to the configuration, combination and execution of containers, leading to several new technical debt categories and refactoring types compared to existing refactoring domains. For instance, refactorings for reducing the image size of Dockerfiles, improving the extensibility of Docker-compose files, and regular source code refactorings are mainly associated with the evolution of Docker and Docker-compose files. We also introduced 24 new Docker-specific refactorings and technical debt categories, respectively, and defined different best practices. The implications of this study will assist practitioners, tool builders, and educators in improving the quality of Docker projects.", "doi": "10.1109/ase51524.2021.9678585", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678585", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678585"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678585"}
{"title": "FirmGuide: Boosting the Capability of Rehosting Embedded Linux Kernels through Model-Guided Kernel Execution", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qiang Liu", "Cen Zhang", "Lin Ma", "Muhui Jiang", "Yajin Zhou", "Lei Wu", "Wenbo Shen", "Xiapu Luo", "Yang Liu", "Kui Ren"], "abstract": "Linux kernel is widely used in embedded systems. To understand practical threats to the Linux kernel, we need to perform dynamic analysis with a full-system emulator, e.g., QEMU. However, due to hardware fragmentation, e.g., various types of peripherals, most embedded systems are not currently supported by QEMU. Though some progress has been made on rehosting firmware, it mainly focuses on user space programs or simple real-time operating systems.The goal of this work is to boost the capability of rehosting the embedded Linux kernels in QEMU. By doing so, dynamic analysis systems can be firstly applied on embedded Linux kernels by leveraging off-the-shelf tools upon QEMU. Accordingly, we proposed a new technique called model-guided kernel execution. It combines the peripheral abstractions in the Linux kernel and kernel-peripheral interactions to semi-automatically generate peripheral models that are then used to synthesize new QEMU virtual machines to start the dynamic analysis.We have implemented a prototype called FirmGuide. It generates 9 peripheral models with full functionality and 64 with minimum functionality covering 26 SoCs. Our evaluation with 6,188 firmware images shows that it can successfully rehost more than 95% of Linux kernels in 2 architectures and 22 versions. None of them can be rehosted in the vanilla QEMU. The result of the LTP benchmark shows the reliability and robustness of the rehosted Linux kernels. We further conduct two security applications, i.e., vulnerability analysis and fuzzing, on the rehosted Linux kernels to demonstrate the usage scenarios.", "doi": "10.1109/ase51524.2021.9678653", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678653", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678653"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678653"}
{"title": "IFIZZ: Deep-State and Efficient Fault-Scenario Generation to Test IoT Firmware", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Peiyu Liu", "Shouling Ji", "Xuhong Zhang", "Qinming Dai", "Kangjie Lu", "Lirong Fu", "Wenzhi Chen", "Peng Cheng", "Wenhai Wang", "Raheem Beyah"], "abstract": "IoT devices are abnormally prone to diverse errors due to harsh environments and limited computational capabilities. As a result, correct error handling is critical in IoT. Implementing correct error handling is non-trivial, thus requiring extensive testing such as fuzzing. However, existing fuzzing cannot effectively test IoT error-handling code. First, errors typically represent corner cases, thus are hard to trigger. Second, testing error-handling code would frequently crash the execution, which prevents fuzzing from testing following deep error paths.In this paper, we propose IFIZZ, a new bug detection system specifically designed for testing error-handling code in Linux-based IoT firmware. IFIZZ first employs an automated binary-based approach to identify realistic runtime errors by analyzing errors and error conditions in closed-source IoT firmware. Then, IFIZZ employs state-aware and bounded error generation to reach deep error paths effectively. We implement and evaluate IFIZZ on 10 popular IoT firmware. The results show that IFIZZ can find many bugs hidden in deep error paths. Specifically, IFIZZ finds 109 critical bugs, 63 of which are even in widely used IoT libraries. IFIZZ also features high code coverage and efficiency, and covers 67.3% more error paths than normal execution. Meanwhile, the depth of error handling covered by IFIZZ is 7.3 times deeper than that covered by the state-of-the-art method. Furthermore, IFIZZ has been practically adopted and deployed in a worldwide leading IoT company. We will open-source IFIZZ to facilitate further research in this area.", "doi": "10.1109/ase51524.2021.9678785", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678785", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678785"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678785"}
{"title": "Learning Patterns in Configuration", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ranjita Bhagwan", "Sonu Mehta", "Arjun Radhakrishna", "Sahil Garg"], "abstract": "Large services depend on correct configuration to run efficiently and seamlessly. Checking such configuration for correctness is important because services use a large and continuously increasing number of configuration files and parameters. Yet, very few such tools exist because the permissible values for a configuration parameter are seldom specified or documented, existing at best as tribal knowledge among a few domain experts.In this paper, we address the problem of configuration pattern mining: learning configuration rules from examples. Using program synthesis and a novel string profiling algorithm, we show that we can use file contents and histories of commits to learn patterns in configuration. We have built a tool called ConfMiner that implements configuration pattern mining and have evaluated it on four large repositories containing configuration for a large-scale enterprise service. Our evaluation shows that ConfMiner learns a large variety of configuration rules with high precision and is very useful in flagging anomalous configuration.", "doi": "10.1109/ase51524.2021.9678525", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678525", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678525"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678525"}
{"title": "Transcode: Detecting Status Code Mapping Errors in Large-Scale Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wensheng Tang", "Yikun Hu", "Gang Fan", "Peisen Yao", "Rongxin Wu", "Guangyuan Bai", "Pengcheng Wang", "Charles Zhang"], "abstract": "Status code mappings reveal state shifts of a program, mapping one status code to another. Due to careless programming or the lack of the system-wide knowledge of a whole program, developers can make incorrect mappings. Such errors are widely spread across modern software, some of which have even become critical vulnerabilities. Unfortunately, existing solutions merely focus on single status code values, while never considering the relationships, that is, mappings, among them. Therefore, it is imperative to propose an effective method to detect status code mapping errors.In this paper, we propose Transcode to detect potential status code mapping errors. It firstly conducts value flow analysis to efficiently and precisely collect candidate status code values, that is, the integer values, which are checked by following conditional comparisons. Then, it aggregates the correlated status codes according to whether they are propagated with the same variable. Finally, Transcode extracts mappings based on control dependencies and reports the mapping error if one status code is mapped to two others of the same kind. We have implemented Transcode as a prototype system, and evaluated it with 5 real-world software projects, each of which possesses in the order of a million lines of code. The experimental results show that Transcode is capable of handling large-scale systems in both a precise and efficient manner. Furthermore, it has discovered 59 new errors in the tested projects, among which 13 have been fixed by the community. We also deploy Transcode in WeChat, a widely-used instant messaging service, and have succeeded in finding real mapping errors in the industrial settings.", "doi": "10.1109/ase51524.2021.9678823", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678823", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678823"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678823"}
{"title": "Evolutionary-Guided Synthesis of Verified Pareto-Optimal MDP Policies", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Simos Gerasimou", "Javier Cámara", "Radu Calinescu", "Naif Alasmari", "Faisal Alhwikem", "Xinwei Fang"], "abstract": "We present a new approach for synthesising Paretooptimal Markov decision process (MDP) policies that satisfy complex combinations of quality-of-service (QoS) software requirements. These policies correspond to optimal designs or configurations of software systems, and are obtained by translating MDP models of these systems into parametric Markov chains, and using multi-objective genetic algorithms to synthesise Pareto-optimal parameter values that define the required MDP policies. We use case studies from the service-based systems and robotic control software domains to show that our MDP policy synthesis approach can handle a wide range of QoS requirement combinations unsupported by current probabilistic model checkers. Moreover, for requirement combinations supported by these model checkers, our approach generates better Pareto-optimal policy sets according to established quality metrics.", "doi": "10.1109/ase51524.2021.9678727", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678727", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678727"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678727"}
{"title": "Automating Developer Chat Mining", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shengyi Pan", "Lingfeng Bao", "Xiaoxue Ren", "Xin Xia", "David Lo", "Shanping Li"], "abstract": "Online chatrooms are gaining popularity as a communication channel between widely distributed developers of Open Source Software (OSS) projects. Most discussion threads in chatrooms follow a Q&A format, with some developers (askers) raising an initial question and others (respondents) joining in to provide answers. These discussion threads are embedded with rich information that can satisfy the diverse needs of various OSS stakeholders. However, retrieving information from threads is challenging as it requires a thread-level analysis to understand the context. Moreover, the chat data is transient and unstructured, consisting of entangled informal conversations. In this paper, we address this challenge by identifying the information types available in developer chats and further introducing an automated mining technique. Through manual examination of chat data from three chatrooms on Gitter, using card sorting, we build a thread-level taxonomy with nine information categories and create a labeled dataset with 2,959 threads. We propose a classification approach (named F2CHAT) to structure the vast amount of threads based on the information type automatically, helping stakeholders quickly acquire their desired information. F2CHAT effectively combines handcrafted non-textual features with deep textual features extracted by neural models. Specifically, it has two stages with the first one leveraging the siamese architecture to pretrain the textual feature encoder, and the second one facilitating an in-depth fusion of two types of features. Evaluation results suggest that our approach achieves an average F1-score of 0.628, which improves the baseline by 57%. Experiments also verify the effectiveness of our identified non-textual features under both intra-project and cross-project validations.", "doi": "10.1109/ase51524.2021.9678923", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678923", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678923"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678923"}
{"title": "Thinking Like a Developer? Comparing the Attention of Humans with Neural Models of Code", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Matteo Paltenghi", "Michael Pradel"], "abstract": "Neural models of code are successfully tackling various prediction tasks, complementing and sometimes even outperforming traditional program analyses. While most work focuses on end-to-end evaluations of such models, it often remains unclear what the models actually learn, and to what extent their reasoning about code matches that of skilled humans. A poor understanding of the model reasoning risks deploying models that are right for the wrong reason, and taking decisions based on spurious correlations in the training dataset. This paper investigates to what extent the attention weights of effective neural models match the reasoning of skilled humans. To this end, we present a methodology for recording human attention and use it to gather 1,508 human attention maps from 91 participants, which is the largest such dataset we are aware of. Computing human-model correlations shows that the copy attention of neural models often matches the way humans reason about code (Spearman rank coefficients of 0.49 and 0.47), which gives an empirical justification for the intuition behind copy attention. In contrast, the regular attention of models is mostly uncorrelated with human attention. We find that models and humans sometimes focus on different kinds of tokens, e.g., strings are important to humans but mostly ignored by models. The results also show that human-model agreement positively correlates with accurate predictions by a model, which calls for neural models that even more closely mimic human reasoning. Beyond the insights from our study, we envision the release of our dataset of human attention maps to help understand future neural models of code and to foster work on human-inspired models.", "doi": "10.1109/ase51524.2021.9678712", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678712", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678712"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678712"}
{"title": "Detecting Memory-Related Bugs by Tracking Heap Memory Management of C++ Smart Pointers", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xutong Ma", "Jiwei Yan", "Wei Wang", "Jun Yan", "Jian Zhang", "Zongyan Qiu"], "abstract": "The smart pointer mechanism, which is improved in the continuous versions of the C++ standards over the last decade, is designed to prevent memory-leak bugs by automatically deallocating the managed memory blocks. However, not all kinds of memory errors can be immunized by adopting this mechanism. For example, dereferencing a null smart pointer will lead to a software failure. Due to the lack of specialized support for smart pointers, the off-the-shelf C++ static analyzers cannot effectively reveal these bugs.In this paper, we propose a static approach to detecting memory-related bugs by tracking the heap memory management of smart pointers. The behaviors of smart pointers are modeled during their lifetime to trace the state transitions of managed memory blocks. And the specially designed checkers are used to check the state changes according to five collected bug patterns. To evaluate the effectiveness of our approach, we implement it on the top of the Clang Static Analyzer. A set of handmade code snippets, as well as nine popular open-source C++ projects, are used to compare our tool against four other analyzers. The results show that our approach can successfully discover nearly all the built-in bugs. And 442 out of 648 reports generated from the open-source projects are true positives after manual reviewing, where the bugs of dereferencing null smart pointers are most frequently reported. To further confirm our reports, we design patches for Aria2, Restbed, MySQL and LLVM, in which seven pull requests covering 76 bug reports have been merged by the developers up to now. The results indicate that pointers should always be carefully used even after migrated to smart pointers and static analysis upon specialized models can effectively detect such bugs.", "doi": "10.1109/ase51524.2021.9678836", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678836", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678836"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678836"}
{"title": "Understanding and Detecting Performance Bugs in Markdown Compilers", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Penghui Li", "Yinxi Liu", "Wei Meng"], "abstract": "Markdown compilers are widely used for translating plain Markdown text into formatted text, yet they suffer from performance bugs that cause performance degradation and resource exhaustion. Currently, there is little knowledge and understanding about these performance bugs in the wild. In this work, we first conduct a comprehensive study of known performance bugs in Markdown compilers. We identify that the ways Markdown compilers handle the language’s context-sensitive features are the dominant root cause of performance bugs. To detect unknown performance bugs, we develop MdPerfFuzz, a fuzzing framework with a syntax-tree based mutation strategy to efficiently generate test cases to manifest such bugs. It equips an execution trace similarity algorithm to de-duplicate the bug reports. With MdPerfFuzz, we successfully identified 216 new performance bugs in real-world Markdown compilers and applications. Our work demonstrates that the performance bugs are a common, severe, yet previously overlooked security problem.", "doi": "10.1109/ase51524.2021.9678611", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678611", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678611"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678611"}
{"title": "Deep GUI: Black-box GUI Input Generation with Deep Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Faraz Yazdani Banafshe Daragh", "Sam Malek"], "abstract": "Despite the proliferation of Android testing tools, Google Monkey has remained the de facto standard for practitioners. The popularity of Google Monkey is largely due to the fact that it is a black-box testing tool, making it widely applicable to all types of Android apps, regardless of their underlying implementation details. An important drawback of Google Monkey, however, is the fact that it uses the most naive form of test input generation technique, i.e., random testing. In this work, we present Deep GUI, an approach that aims to complement the benefits of black-box testing with a more intelligent form of GUI input generation. Given only screenshots of apps, Deep GUI first employs deep learning to construct a model of valid GUI interactions. It then uses this model to generate effective inputs for an app under test without the need to probe its implementation details. Moreover, since the data collection, training, and inference processes are performed independent of the platform, the model inferred by Deep GUI has application for testing apps in other platforms as well. We implemented a prototype of Deep GUI in a tool called Monkey++ by extending Google Monkey and evaluated it for its ability to crawl Android apps. We found that Monkey++ achieves significant improvements over Google Monkey in cases where an app’s UI is complex, requiring sophisticated inputs. Furthermore, our experimental results demonstrate the model inferred using Deep GUI can be reused for effective GUI input generation across platforms without the need for retraining.", "doi": "10.1109/ase51524.2021.9678778", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678778", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678778"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678778"}
{"title": "Towards Exploring the Limitations of Active Learning: An Empirical Study", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qiang Hu", "Yuejun Guo", "Maxime Cordy", "Xiaofei Xie", "Wei Ma", "Mike Papadakis", "Yves Le Traon"], "abstract": "Deep neural networks (DNNs) are increasingly deployed as integral parts of software systems. However, due to the complex interconnections among hidden layers and massive hyperparameters, DNNs must be trained using a large number of labeled inputs, which calls for extensive human effort for collecting and labeling data. Spontaneously, to alleviate this growing demand, multiple state-of-the-art studies have developed different metrics to select a small yet informative dataset for the model training. These research works have demonstrated that DNN models can achieve competitive performance using a carefully selected small set of data. However, the literature lacks proper investigation of the limitations of data selection metrics, which is crucial to apply them in practice. In this paper, we fill this gap and conduct an extensive empirical study to explore the limits of data selection metrics. Our study involves 15 data selection metrics evaluated over 5 datasets (2 image classification tasks and 3 text classification tasks), 10 DNN architectures, and 20 labeling budgets (ratio of training data being labeled). Our findings reveal that, while data selection metrics are usually effective in producing accurate models, they may induce a loss of model robustness (against adversarial examples) and resilience to compression. Overall, we demonstrate the existence of a trade-off between labeling effort and different model qualities. This paves the way for future research in devising data selection metrics considering multiple quality criteria.", "doi": "10.1109/ase51524.2021.9678672", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678672", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678672"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678672"}
{"title": "Learning Domain-Specific Edit Operations from Model Repositories with Frequent Subgraph Mining", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christof Tinnes", "Timo Kehrer", "Mitchell Joblin", "Uwe Hohenstein", "Andreas Biesdorf", "Sven Apel"], "abstract": "Model transformations play a fundamental role in model-driven software development. They can be used to solve or support central tasks, such as creating models, handling model co-evolution, and model merging. In the past, various (semi-)automatic approaches have been proposed to derive model transformations from meta-models or from examples. These approaches require time-consuming handcrafting or the recording of concrete examples, or they are unable to derive complex transformations. We propose a novel unsupervised approach, called Ockham, which is able to learn edit operations from model histories in model repositories. Ockham is based on the idea that meaningful domain-specific edit operations are the ones that compress the model differences. It employs frequent subgraph mining to discover frequent structures in model difference graphs. We evaluate our approach in two controlled experiments and one real-world case study of a large-scale industrial model-driven architecture project in the railway domain. We found that our approach is able to discover frequent edit operations that have actually been applied before. Furthermore, Ockham is able to extract edit operations that are meaningful to practitioners in an industrial setting.", "doi": "10.1109/ase51524.2021.9678698", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678698", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678698"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678698"}
{"title": "Unsupervised Labeling and Extraction of Phrase-based Concepts in Vulnerability Descriptions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sofonias Yitagesu", "Zhenchang Xing", "Xiaowang Zhang", "Zhiyong Feng", "Xiaohong Li", "Linyi Han"], "abstract": "People usually describe the key characteristics of software vulnerabilities in natural language mixed with domain-specific names and concepts. This textual nature poses a significant challenge for the automatic analysis of vulnerabilities. Automatic extraction of key vulnerability aspects is highly desirable but demands significant effort to manually label data for model training. In this paper, we propose an unsupervised approach to label and extract important vulnerability concepts in textural vulnerability descriptions (TVDs). We focus on three types of phrase-based vulnerability concepts (root cause, attack vector, and impact) as they are much more difficult to label and extract than name- or number-based entities (i.e., vendor, product, and version). Our approach is based on a key observation that the same-type of phrases, no matter how they differ in sentence structures and phrase expressions, usually share syntactically similar paths in the sentence parsing trees. Therefore, we propose two path representations (absolute paths and relative paths) and use an auto-encoder to encode such syntactic similarities. To address the discrete nature of our paths, we enhance traditional Variational Auto-encoder (VAE) with Gumble-Max trick for categorical data distribution, and thus creates a Categorical VAE (CaVAE). In the latent space of absolute and relative paths, we further use FIt-TSNE and clustering techniques to generate clusters of the same-type of concepts. Our evaluation confirms the effectiveness of our CaVAE for encoding path representations and the accuracy of vulnerability concepts in the resulting clusters. In a concept classification task, our unsupervisedly labeled vulnerability concepts outperform the two manually labeled datasets from previous work.", "doi": "10.1109/ase51524.2021.9678638", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678638", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678638"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678638"}
{"title": "A Compositional Deadlock Detector for Android Java", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["James Brotherston", "Paul Brunet", "Nikos Gorogiannis", "Max I. Kanovich"], "abstract": "We develop a static deadlock analysis for commercial Android Java applications, of sizes in the tens of millions of LoC, under active development at Facebook. The analysis runs primarily at code-review time, on only the modified code and its dependents; we aim at reporting to developers in under 15 minutes.To detect deadlocks in this setting, we first model the real language as an abstract language with balanced re-entrant locks, nondeterministic iteration and branching, and non-recursive procedure calls. We show that the existence of a deadlock in this abstract language is equivalent to a certain condition over the sets of critical pairs of each program thread; these record, for all possible executions of the thread, which locks are currently held at the point when a fresh lock is acquired. Since the critical pairs of any program thread is finite and computable, the deadlock detection problem for our language is decidable, and in NP.We then leverage these results to develop an open-source implementation of our analysis adapted to deal with real Java code. The core of the implementation is an algorithm which computes critical pairs in a compositional, abstract interpretation style, running in quasi-exponential time. Our analyser is built in the Infer verification framework and has been in industrial deployment for over two years; it has seen over two hundred fixed deadlock reports with a report fix rate of ~54%.", "doi": "10.1109/ase51524.2021.9678572", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678572", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678572"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678572"}
{"title": "Binary Diffing as a Network Alignment Problem via Belief Propagation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Elie Mengin", "Fabrice Rossi"], "abstract": "In this paper, we address the problem of finding a correspondence, or matching, between the functions of two programs in binary form, which is one of the most common task in binary diffing. We introduce a new formulation of this problem as a particular instance of a graph edit problem over the call graphs of the programs. In this formulation, the quality of a mapping is evaluated simultaneously with respect to both function content and call graph similarities. We show that this formulation is equivalent to a network alignment problem. We propose a solving strategy for this problem based on max-product belief propagation. Finally, we implement a prototype of our method, called QBinDiff, and propose an extensive evaluation which shows that our approach outperforms state of the art diffing tools.", "doi": "10.1109/ase51524.2021.9678782", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678782", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678782"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678782"}
{"title": "CiFi: Versatile Analysis of Class and Field Immutability", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tobias Roth", "Dominik Helm", "Michael Reif", "Mira Mezini"], "abstract": "Reasoning about immutability is important for pre-venting bugs, e.g., in multi-threaded software. So far, static analysis to infer immutability properties has mostly focused on individual objects and references. Reasoning about fields and entire classes, while significantly simpler, has gained less attention. Even a consistently used terminology is missing, which makes it difficult to implement analyses that rely on immutability information. We propose a model for class and field immutability that unifies terminology for immutability flavors considered by previous work and covers new levels of immutability to handle lazy initialization and immutability dependent on generic type parameters. Using the OPAL static analysis framework, we implement CiFi, a set of modular, collaborating analyses for different flavors of immutability, inferring the properties defined in our model. Additionally, we propose a benchmark of representative test cases for class and field immutability. We use the benchmark to showcase CiFi’s precision and recall in comparison to state of the art and use CiFi to study the prevalence of immutability in real-world libraries, showcasing the practical quality and relevance of our model.", "doi": "10.1109/ase51524.2021.9678903", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678903", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678903"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678903"}
{"title": "Modeling Team Dynamics for the Characterization and Prediction of Delays in User Stories", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Elvan Kula", "Arie van Deursen", "Georgios Gousios"], "abstract": "In agile software development, proper team structures and effort estimates are crucial to ensure the on-time delivery of software projects. Delivery performance can vary due to the influence of changes in teams, resulting in team dynamics that remain largely unexplored. In this paper, we explore the effects of various aspects of teamwork on delays in software deliveries. We conducted a case study at ING and analyzed historical log data from 765,200 user stories and 571 teams to identify team factors characterizing delayed user stories. Based on these factors, we built models to predict the likelihood and duration of delays in user stories. The evaluation results show that the use of team-related features leads to a significant improvement in the predictions of delay, achieving on average 74%-82% precision, 78%-86% recall and 76%-84% F-measure. Moreover, our results show that team-related features can help improve the prediction of delay likelihood, while delay duration can be explained exclusively using them. Finally, training on recent user stories using a sliding window setting improves the predictive performance; our predictive models perform significantly better for teams that have been stable. Overall, our results indicate that planning in agile development settings can be significantly improved by incorporating team-related information and incremental learning methods into analysis/predictive models.", "doi": "10.1109/ase51524.2021.9678939", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678939", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678939"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678939"}
{"title": "DeepMemory: Model-based Memorization Analysis of Deep Neural Language Models", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Derui Zhu", "Jinfu Chen", "Weiyi Shang", "Xuebing Zhou", "Jens Grossklags", "Ahmed E. Hassan"], "abstract": "The neural network model is having a significant impact on many real-world applications. Unfortunately, the increasing popularity and complexity of these models also amplifies their security and privacy challenges, with privacy leakage from training data being one of the most prominent issues. In this context, prior studies proposed to analyze the abstraction behavior of neural network models, e.g., RNN, to understand their robustness. However, the existing research rarely addresses privacy breaches caused by memorization in neural language models. To fill this gap, we propose a novel approach, DeepMemory, that analyzes memorization behavior for a neural language model. We first construct a memorization-analysis-oriented model, taking both training data and a neural language model as input. We then build a semantic first-order Markov model to bind the constructed memorization-analysis-oriented model to the training data to analyze memorization distribution. Finally, we apply our approach to address data leakage issues associated with memorization and to assist in dememorization. We evaluate our approach on one of the most popular neural language models, the LSTM-based language model, with three public datasets, namely, WikiText-103, WMT2017, and IWSLT2016. We find that sentences in the studied datasets with low perplexity are more likely to be memorized. Our approach achieves an average AUC of 0.73 in automatically identifying data leakage issues during assessment. We also show that with the assistance of DeepMemory, data breaches due to memorization of neural language models can be successfully mitigated by mutating training data without reducing the performance of neural language models.", "doi": "10.1109/ase51524.2021.9678871", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678871", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678871"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678871"}
{"title": "Automated Verification of Go Programs via Bounded Model Checking", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nicolas Dilley", "Julien Lange"], "abstract": "The Go programming language offers a wide range of primitives to coordinate lightweight threads, e.g., channels, waitgroups, and mutexes — all of which may cause concurrency bugs. Static checkers that guarantee the absence of bugs are essential to help programmers avoid these costly errors before their code is executed. However existing tools either miss too many bugs or cannot handle large programs. To address these limitations, we propose a static checker for Go programs which relies on performing bounded model checking of their concurrent behaviours. In contrast to previous works, our approach deals with large codebases, supports programs that have statically unknown parameters, and is extensible to additional concurrency primitives. Our work includes a detailed presentation of the extraction algorithm from Go programs to models, an algorithm to automatically check programs with statically unknown parameters, and a large scale evaluation of our approach. The latter shows that our approach outperforms the state-of-the-art.", "doi": "10.1109/ase51524.2021.9678571", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678571", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678571"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678571"}
{"title": "A Prediction Model for Software Requirements Change Impact", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kareshna Zamani"], "abstract": "Software requirements Change Impact Analysis (CIA) is a pivotal process in requirements engineering (RE) since changes to requirements are inevitable. When a requirement change is requested, its impact on all software artefacts has to be investigated to accept or reject the request. Manually performed CIA in large-scale software development is time-consuming and error-prone so, automating this analysis can improve the process of requirements change management. The main goal of this research is to apply a combination of Machine Learning (ML) and Natural Language Processing (NLP) based approaches to develop a prediction model for forecasting the requirement change impact on other requirements in the specification document. The proposed prediction model will be evaluated using appropriate datasets for accuracy and performance. The resulting tool will support project managers to perform automated change impact analysis and make informed decisions on the acceptance or rejection of requirement change requests.", "doi": "10.1109/ase51524.2021.9678582", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678582", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678582"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678582"}
{"title": "DSInfoSearch: Supporting Experimentation Process of Data Scientists", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shangeetha Sivasothy"], "abstract": "Experimentation plays an important role in the work of data scientists to explore unfamiliar problem domains, to answer questions from data, and to develop diverse machine learning applications. Good experimentation requires creativity, is based on prior results and informed from the literature. However, finding relevant information from online sources to guide experimentation causes inefficiencies for data scientists. The objective of this research is to help data scientists through the presentation of context aware ranked data science experiments, considering problem domain, development task and learning task. Data science experiments for this study were extracted from publicly available interactive notebooks and were manually annotated based on a taxonomy of data science techniques and a meta model of a data science experiment. Further, the ranking algorithm was developed for data science experiments for given problem domain and development task. As a result, a tool was developed to demonstrate context aware ranked data science experiments for given problem domains such as natural language processing, computer vision and time series and for development stages such as feature engineering and model selection. This study shows that tools and techniques can be designed to be aware of the data science context, in fact, much more so than for software engineering tools. This study supports these efforts by providing knowledge that can improve experimentation process of data scientists.", "doi": "10.1109/ase51524.2021.9678873", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678873", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678873"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678873"}
{"title": "Towards the generation of machine learning defect reports", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tuan Dung Lai"], "abstract": "Effective locating and fixing defects requires detailed defect reports. Unlike traditional software systems, machine learning applications are subject defects caused from changes in the input data streams (concept drift) and assumptions encoded into models. Without appropriate training, developers face difficulties understanding and interpreting faults in machine learning (ML). However, little research is done on how to prepare developers to detect and investigate machine learning system defects. Software engineers often do not have sufficient knowledge to fix the issues themselves without the help of data scientists or domain experts. To investigate this issue, we analyse issue templates and check how developers report machine learning related issues in open-source applied AI projects. The overall goal is to develop a tool for automatically repairing ML defects or generating defect reports if a fix cannot be made. Previous research has identified classes of faults specific to machine learning systems, such as performance degradation arising from concept drift where the machine learning model is no longer aligned with the real-world environment. However, the current issue templates that developers use do not seem to capture the information needed. This research seeks to systematically develop a two-way human-machine information exchange protocol to support domain experts, software engineers, and data scientists to collaboratively detect, report, and respond to these new classes of faults.", "doi": "10.1109/ase51524.2021.9678592", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678592", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678592"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678592"}
{"title": "Leveraging Code Clones and Natural Language Processing for Log Statement Prediction", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sina Gholamian"], "abstract": "Software developers embed logging statements inside the source code as an imperative duty in modern software development as log files are necessary for tracking down runtime system issues and troubleshooting system management tasks. Prior research has emphasized the importance of logging statements in the operation and debugging of software systems. However, the current logging process is mostly manual and ad hoc, and thus, proper placement and content of logging statements remain as challenges. To overcome these challenges, methods that aim to automate log placement and log content, i.e., ‘where, what, and how to log’, are of high interest. Thus, we propose to accomplish the goal of this research, that is “to predict the log statements by utilizing source code clones and natural language processing (NLP)”, as these approaches provide additional context and advantage for log prediction. We pursue the following four research objectives: (RO1) investigate whether source code clones can be leveraged for log statement location prediction, (RO2) propose a clone-based approach for log statement prediction, (RO3) predict log statement’s description with code-clone and NLP models, and (RO4) examine approaches to automatically predict additional details of the log statement, such as its verbosity level and variables. For this purpose, we perform an experimental analysis on seven open-source java projects, extract their method-level code clones, investigate their attributes, and utilize them for log location and description prediction. Our work demonstrates the effectiveness of log-aware clone detection for automated log location and description prediction and outperforms the prior work.", "doi": "10.1109/ase51524.2021.9678596", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678596", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678596"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678596"}
{"title": "An Automated Pipeline for Privacy Leak Analysis of Android Applications", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yifan Zhou"], "abstract": "We propose an automated pipeline for analyzing privacy leaks in Android applications. By using a combination of dynamic and static analysis, we validate the results from each other to improve accuracy. Compare to the state-of-the-art approaches, we not only capture the network traffic for analysis, but also look into the data flows inside the application. We particularly focus on the privacy leakage caused by third-party services and high-risk permissions. The proposed automated approach will combine taint analysis, permission analysis, network traffic analysis, and dynamic function tracing during run-time to identify private information leaks. We further implement an automatic validation and complementation process to reduce false positives. A small-scale experiment has been conducted on 30 Android applications and a large-scale experiment on more than 10,000 Android applications is in progress.", "doi": "10.1109/ase51524.2021.9678875", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678875", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678875"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678875"}
{"title": "Training Automated Test Oracles to Identify Semantic Bugs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Charaka Geethal"], "abstract": "Can a machine find and fix a Semantic Bug? A Semantic Bug is a deviation from the expected program behaviour that causes to produce incorrect outputs for certain inputs. To identify this category of bugs, the knowledge on the expected program behaviour is essential. The reason is that a program with a semantic bug does not fail (i.e., crash or hang) in the middle of the execution in most scenarios. Thus, only a human (a user or a developer) knowing the correct program behaviour can detect this kind of bug by observing the output. However, identifying bugs solely through human effort is not practical for all software. A Test Oracle is any procedure used to differentiate the correct and incorrect behaviours of a program. This dissertation mainly focuses on developing learning techniques to produce Automated Test Oracles for programs with semantic bugs. Also, discovering methods to incorporate human knowledge effectively for the learning techniques is another concern. The automated test oracles could make semantic bug detection more efficient. Also, such test oracles could guide Automated Program Repair tools to generate more accurate fixes for semantic bugs.", "doi": "10.1109/ase51524.2021.9678886", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678886", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678886"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678886"}
{"title": "Binary Code Similarity Detection", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zian Liu"], "abstract": "Binary code similarity detection is to detect the similarity of code at binary (assembly) level without source code. Existing work still has their limitation when dealing with mutated binary code with different compiling options. We proposed a novel approach to address this problem. By inspecting the binary code, we found that generally, within a function, some instructions aim to calculate (prepare) value for some other instructions. The latter instructions are defined by us the key instructions. Currently, we define four categories of key instructions: calling subfunctions, comparing instruction, returning instruction, and memory address writing instruction. Thus if we symbolically execute similar binary codes, the symbolic value at these key instructions should be similar. We implemented our idea into a tool. This prototype tool can: 1. symbolically execute binary code, 2. extract symbolic values at key instructions into a graph, and 3. compare the symbolic graph similarity. In our implementation, we also address some problems, including path explosion and loop handling.", "doi": "10.1109/ase51524.2021.9678518", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678518", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678518"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678518"}
{"title": "API Compatibility Issue Detection, Testing and Analysis for Android Apps", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tarek Mahmud"], "abstract": "Android apps are developed using a Software Development Kit (SDK), where the Android application programming interface (API) enables app developers to harness the functionalities of Android devices by interacting with services and hardware. However, API frequently evolves together with its associated SDK. The mismatch between the API level supported by the device where apps are installed and the API level targeted by app developers can induce compatibility issues. These issues can manifest themselves as unexpected behaviors, including runtime crashes, creating a poor user experience. Recent studies investigated API evolution to ensure the reliability of the Android apps, however, they require improvements. This work aims to establish novel methodologies that will improve the state-of-the-art compatibility issue detection and testing approaches.", "doi": "10.1109/ase51524.2021.9678812", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678812", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678812"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678812"}
{"title": "Effectively Analyzing Evolving Software with Differential Facts", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiuheng Wu"], "abstract": "Software systems evolve continuously during their lifecycle. Developers incrementally introduce new features and fix bugs during the process, leading to lots of changes and artifacts accumulated. Driven by those rich data recorded in version control systems or issue trackers, lots of work has been done to analyze the software histories. In this PhD work, we propose a universal representation to effectively store and query over knowledge extracted from the histories, with the hope of supporting software evolution research. We have created a toolset, named DIFFBASE, to extract both relations between program entities at the same version, as well as atomic changes between versions. Then users can compose queries using algebraic operators, Datalog or an SQL-like language to accomplish several different evolution management tasks. Based on the existing research outcome, possible future work includes utilizing the facts approach in a scalable solution to discovering compatibility issues involving changes of multiple components and improvement on the storage and query performance of DIFFBASE.", "doi": "10.1109/ase51524.2021.9678659", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678659", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678659"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678659"}
{"title": "Automated Approach for System-level Testing of Unmanned Aerial Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hassan Sartaj"], "abstract": "Unmanned aerial systems (UAS) have a large number of applications in civil and military domains. UAS rely on various avionics systems that are safety-critical and mission-critical. A major requirement of international safety standards is to perform rigorous system-level testing of avionics systems, including software systems. The current industrial practice is to manually create test scenarios, manually or automatically execute these scenarios using simulators, and manual evaluation of the outcomes. A fundamental part of system-level testing of such systems is the simulation of environmental context. The test scenarios typically consist of setting certain environment conditions and testing the system under test in these settings. The state-of-the-art approaches available for this purpose also require manual test scenario development and manual test evaluation. In this research work, we propose an approach to automate the system-level testing of the UAS. The proposed approach (AITester) utilizes model-based testing and artificial intelligence (AI) techniques to automatically generate, execute, and evaluate various test scenarios. The test scenarios are generated on the fly, i.e., during test execution based on the environmental context at runtime. We develop a toolset to support automation. We perform a pilot experiment using a widely-used open-source autopilot, ArduPilot. The preliminary results show that the AITester is effective and efficient in violating autopilot expected behavior.", "doi": "10.1109/ase51524.2021.9678902", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678902", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678902"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678902"}
{"title": "Cross-Lingual Transfer Learning Framework for Program Analysis", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhiming Li"], "abstract": "Deep learning-based techniques have been widely applied to program analysis tasks, in fields such as type inference, fault localization, and code summarization. Hitherto deep learning-based software engineering systems rely thoroughly on supervised learning approaches, which require laborious manual effort to collect and label a prohibitively large amount of data. However, most Turing-complete imperative languages share similar control- and data-flow structures, which make it possible to transfer knowledge learned from one language to another. In this paper, we propose a general cross-lingual transfer learning framework PLATO for program analysis by using a series of techniques that are general to different downstream tasks. PLATO allows Bert-based models to leverage prior knowledge learned from the labeled dataset of one language and transfer it to the others. We evaluate our approaches on several downstream tasks such as type inference and code summarization to demonstrate its feasibility.", "doi": "10.1109/ase51524.2021.9678848", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678848", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678848"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678848"}
{"title": "Fuzzing Methods Recommendation Based on Feature Vectors", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chi Zhang", "Jinfu Chen"], "abstract": "Fuzzing is a technique that aims to detect vulnerabilities or exceptions through unexpected input and has found tremendous recent interest in both academia and industry. Although these fuzzing methods have great advantages in the field of vulnerability detection, they also have their own disadvantages in the face of different target programs. It is obviously impractical for a fuzzing test method to adapt to all the target programs. Therefore, we study how to select the appropriate fuzzing methods for different target programs. Specifically, we first analyze the program, and then extract the feature vectors of the target program to get the information of the program, such as syntax, context and so on. Next, we build a matching model to match the similarity of target program and the fuzzing algorithm to select the fuzzing algorithm with higher matching degree. Through our matching model, we get a more suitable fuzzing algorithm to improve the detection efficiency, precision, recall, F-measure, and other statistical measures.", "doi": "10.1109/ase51524.2021.9678630", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678630", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678630"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678630"}
{"title": "Gas Estimation and Optimization for Smart Contracts on Ethereum", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chunmiao Li"], "abstract": "When users deploy or invoke smart contracts on Ethereum, a fee is charged for avoiding resource abuse. Metered in gas, the fee is the product of the amount of gas used and the gas price. The more gas used indicates a higher transaction fee. In my doctoral research, we aim to investigate two widely studied issues regarding gas, i.e., gas estimation and gas optimization. The former is to predict gas costs for executing a transactions to avoid out-of-gas exceptions, and the latter is to modify existing contracts to save transaction fee. We target some problems that previous work did not solve: gas estimation for loop functions, and gas optimization for storage usage and arrays. We expect that my research can help Ethereum users avoid economical loss for out-of-gas exceptions and pay less transaction fee.", "doi": "10.1109/ase51524.2021.9678932", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678932", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678932"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678932"}
{"title": "Quality analysis of mobile applications with special focus on security aspects", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kristiina Rahkema"], "abstract": "Smart phones and mobile apps have become an essential part of our daily lives. It is necessary to ensure the quality of these apps. Two important aspects of code quality are maintainability and security. The goals of my PhD project are (1) to study code smells, security issues and their evolution in iOS apps and frameworks, (2) to enhance training and teaching using visualisation support, and (3) to support developers in automatically detecting dependencies to vulnerable library elements in their apps. For each of the three tools, dedicated tool support will be provided, i.e., GraphifyEvolution, VisualiseEvolution, and DependencyEvolution respectively. The tool GraphifyEvolution exists and has been applied to analyse code smells in iOS apps written in Swift. The tool has a modular architecture and can be extended to add support for additional languages and external analysis tools. In the remaining two years of my PhD studies, I will complete the other two tools and apply them in case studies with developers in industry as well as in university teaching.", "doi": "10.1109/ase51524.2021.9678681", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678681", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678681"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678681"}
{"title": "Semi-automated Cross-Component Issue Management and Impact Analysis", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sandro Speth"], "abstract": "Despite microservices and other component-based architecture styles being state of the art in research for many years by now, issue management across the boundaries of a single component is still challenging. Components that were developed independently and can be used independently are joined together in the overall architecture, which results in dependencies between those components. Due to these dependencies, bugs can result that propagate along the call chains through the architecture. Other types of issues, such as the violation of non-functional quality properties, can also impact other components. However, traditional issue management systems end at the boundaries of a component, making tracking of issues across different components time-consuming and error-prone. Therefore, a need for automation arises for cross-component issue management, which automatically puts issues of the independent components in the correct mutual context, creating new cross-component issues and syncing cross-component issues between different components. This automation could enable developers to manage issues across components as efficiently as possible and increases the system’s quality. To solve this problem, we propose an initial approach for semi-automated cross-component issue management in conjunction with service-level objectives based on our Gropius system. For example, relationships between issues of the same or different components can be predicted using classification to identify dependencies of issues across component boundaries. In addition, we are developing a system to model, monitor and alert service-level objectives. Based on this, the impact of such quality violations on the overall system and the business process will be analysed and explained through cross-component issues.", "doi": "10.1109/ase51524.2021.9678830", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678830", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678830"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678830"}
{"title": "How Can Subgroup Discovery Help AIOps?", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Youcef Remil"], "abstract": "The genuine supervision of modern IT systems brings new challenges as it requires higher standards of scalability, reliability and efficiency when analysing and monitoring big data streams. Rule-based inference engines are a key component of maintenance systems in detecting anomalies and automating their resolution. However, they remain confined to simple and general rules and cannot handle the huge amount of data, nor the large number of alerts raised by IT systems, a lesson learned from expert systems era. Artificial Intelligence for Operation Systems (AIOps) proposes to take advantage of advanced analytics and machine learning on big data to improve and automate every step of supervision systems and aid incident management in detecting outages, identifying root causes and applying appropriate healing actions. Nevertheless, the best AIOps techniques rely on opaque models, strongly limiting their adoption. As a part of this PhD thesis, we study how Subgroup Discovery can help AIOps. This promising data mining technique offers possibilities to extract interesting hypothesis from data and understand the underlying process behind predictive models. To ensure relevancy of our propositions, this project involves both data mining researchers and practitioners from Infologic, a French software editor.", "doi": "10.1109/ase51524.2021.9678697", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678697", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678697"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678697"}
{"title": "Improving Configurability of Unit-level Continuous Fuzzing: An Industrial Case Study with SAP HANA", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hanyoung Yoo", "Jingun Hong", "Lucas Bader", "Dongwon Hwang", "Shin Hong"], "abstract": "This paper presents industrial experiences on enhancing the configurability of a fuzzing framework for effective continuous fuzzing of the SAP HANA components. We propose five new mutation scheduling strategies for effective uses of grammar-aware mutators in the unit-level fuzzing framework, and three new seed corpus selection strategies to configure a fuzzing campaign to check on changed code in priority. The empirical results show that the proposed extension gives users chances to improve fuzzing effectiveness and efficiency by configuring the framework specifically for each target component.", "doi": "10.1109/ase51524.2021.9678685", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678685", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678685"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678685"}
{"title": "Access Control Tree for Testing and Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Davrondzhon Gafurov", "Arne Erik Hurum", "Margrete Sunde Grovan"], "abstract": "We present our work on testing access control of large national e-health Internet portal which has millions of monthly visits. Our aim is twofold: (1) to improve testing by applying systematic and rigorous (semi-formal) approach and (2) to obtain holistic view of portal’s complex access control structure. Applying more rigorous approach facilitates reducing ambiguity while holistic picture aids on easier and often also faster comprehension of complex access control structure. We use set-theoretic approach for specifying access control. Then, from access control’s abstract set notations we derive a visual version in form of the access control tree. Nodes of the tree represent attributes that influence access while edges are values of those attributes. The leaf of the tree represents a scope which is a grouping of individual services. Access control tree presented in this paper has 15 scopes (leaves) which results in 105 pairs of abstract test scenarios. Complete version of the tree has 66 scopes that result in over 2000 pairs of abstract test scenarios. Abstract test scenarios are implemented into over 600 concrete and automated test cases. Manual execution test of one concrete test takes about five minutes while automated execution of all tests takes about one hour (thus achieving over 40 times speedup). These automated test cases run as a part of our CI/CD pipeline. Access control tree can also be used as a collaboration or learning tool, to get quicker familiarity with the solution.", "doi": "10.1109/ase51524.2021.9678797", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678797", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678797"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678797"}
{"title": "FinFuzzer: One Step Further in Fuzzing Fintech Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qingshun Wang", "Lihua Xu", "Jun Xiao", "Qi Guo", "Haotian Zhang", "Liang Dou", "Liang He", "Tao Xie"], "abstract": "Comprehensive testing is of high importance to ensure the reliability of software systems, especially for systems with high stakes such as FinTech systems. In this paper, we share our observations of the Ant Group’s status quo in testing their financial services, specifically on the importance of properly transforming relevant external environment settings and prioritizing input object fields for mutation during automated fuzzing. Based on these observations, we propose FinFuzzer, an automated fuzz testing framework that detects and transforms relevant environmental settings into system inputs, prioritizes input object fields, and mutates system inputs on both environment settings and high-priority object fields. Our evaluation of FinFuzzer against four FinTech systems developed by the Ant Group shows that FinFuzzer can outperform a state-of-the-art approach in terms of line coverage in much shorter time.", "doi": "10.1109/ase51524.2021.9678675", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678675", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678675"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678675"}
{"title": "Evaluating Semantic Autocompletion of Business Processes with Domain Experts", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Maayan Goldstein", "Cecilia González-Alvarez"], "abstract": "Process modeling can benefit from automation using knowledge mined from collections of existing processes. One promising technique for such automation is the recommendation of the next elements to be added to the processes under construction. In this paper, we review an autocompletion engine that is based on the semantic similarity of business processes. To assess its efficiency in practical settings, we conduct a user study where domain experts are asked to rate the suggestions made by the engine for a commercial product. Their ratings are then compared to the engine’s accuracy measured by metrics from the natural language processing field. Our study shows a strong correlation between the expert ratings and some of these metrics. We confirm the usefulness of such an autocompletion engine, and enumerate potential improvements to any process autocompletion technique.", "doi": "10.1109/ase51524.2021.9678821", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678821", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678821"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678821"}
{"title": "Learning-based Assistant for Data Migration of Enterprise Information Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sayandeep Mitra", "Debayan Mukherjee", "Atreya Bandyopadhyay", "Rajdip Chowdhury", "Raveendra Kumar Medicherla", "Indrajit Bhattacharya", "Ravindra Naik"], "abstract": "Data migration from source to target information system is a critical step for modernizing information systems. Central to data migration is data transform that transforms the source system data into target system. In this paper we present a tool that assists the experts in creating the data transformation specification by (a) suggesting candidate field matches between the source and target data models using machine learning and knowledge representation, and (b) rules for the data transformation using program synthesis. It takes the expert’s feedback for the identified matches and synthesized rules and proposes new matches and transformation rules. We have executed our tool on real-life industrial data. Our schema matching recall at 5 is 0.76, while for the rule generator recall at 2 is 0.81.", "doi": "10.1109/ase51524.2021.9678533", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678533", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678533"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678533"}
{"title": "Reducing Time-To-Fix For Fuzzer Bugs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rui Abreu", "Franjo Ivancic", "Filip Niksic", "Hadi Ravanbakhsh", "Ramesh Viswanathan"], "abstract": "At Google, fuzzing C/C++ libraries has discovered tens of thousands of security and robustness bugs. However, these bugs are often reported much after they were introduced. Developers are provided only with fault-inducing test inputs and replication instructions that highlight a crash, but additional debugging information may be needed to localize the cause of the bug. Hence, developers need to spend substantial time debugging the code and identifying commits that introduced the bug. In this paper, we discuss our experience with automating a fuzzing-enabled bisection that pinpoints the commit in which the crash first manifests itself. This ultimately reduces the time critical bugs stay open in our code base. We report on our experience over the past year, which shows that developers fix bugs on average 2.23 times faster when aided by this automated analysis.", "doi": "10.1109/ase51524.2021.9678606", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678606", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678606"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678606"}
{"title": "Automatically Deciding on the Integration of Commits Based on Their Descriptions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Samuel C. Fonseca", "Mateus C. Lucena", "Tiago M. Reis", "Pedro F. Cabral", "Walmir A. Silva", "Flávia de S. Santos", "Felipe T. Giuntini", "Juliano Sales"], "abstract": "Continuous Integration is a critical problem for software maintenance in global projects, compromising companies’ performance, which tends to accumulate a high-resolution time due to the approval process, conflict resolution, tests, and validations. The process of the validation involves the commit description interpretation and can be automated by NLP-mechanisms. This paper presents an intelligent NLP-based approach to evaluate whether the commits can be integrated into a certain software release based only on their descriptions. Our experiments showed an accuracy of 92.9%.", "doi": "10.1109/ase51524.2021.9678906", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678906", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678906"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678906"}
{"title": "BeeSwarm: Enabling Parallel Scaling Performance Measurement in Continuous Integration for HPC Applications", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jake Tronge", "Jieyang Chen", "Patricia Grubel", "Tim Randles", "Rusty Davis", "Quincy Wofford", "Steven Anaya", "Qiang Guan"], "abstract": "Testing is one of the most important steps in software development–it ensures the quality of software. Continuous Integration (CI) is a widely used testing standard that can report software quality to the developer in a timely manner during development progress. Performance, especially scalability, is another key factor for High Performance Computing (HPC) applications. There are many existing profiling and performance tools for HPC applications, but none of these are integrated into CI tools. In this work, we propose BeeSwarm, an HPC container based parallel scaling performance system that can be easily applied to the current CI test environments. BeeSwarm is mainly designed for HPC application developers who need to monitor how their applications can scale on different compute resources. We demonstrate BeeSwarm using a multi-physics HPC application with Travis CI, GitLab CI and GitHub Actions while using ChameleonCloud and Google Compute Engine as the compute backends. Our results show that BeeSwarm can be used for scalability and performance testing of HPC applications.", "doi": "10.1109/ase51524.2021.9678805", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678805", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678805"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678805"}
{"title": "Lessons learned from hyper-parameter tuning for microservice candidate identification", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rahul Yedida", "Rahul Krishna", "Anup K. Kalia", "Tim Menzies", "Jin Xiao", "Maja Vukovic"], "abstract": "When optimizing software for the cloud, monolithic applications need to be partitioned into many smaller microservices. While many tools have been proposed for this task, we warn that the evaluation of those approaches has been incomplete; e.g. minimal prior exploration of hyperparameter optimization. Using a set of open source Java EE applications, we show here that (a) such optimization can significantly improve microservice partitioning; and that (b) an open issue for future work is how to find which optimizer works best for different problems. To facilitate that future work, see https://github.com/yrahul3910/ase-tuned-mono2micro for a reproduction package for this research.", "doi": "10.1109/ase51524.2021.9678704", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678704", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678704"], "github": ["https://github.com/yrahul3910/ase-tuned-mono2micro", "https://github.com/yrahul3910/tuned-microservices-results"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678704"}
{"title": "Learning GraphQL Query Cost", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Georgios Mavroudeas", "Guillaume Baudart", "Alan Cha", "Martin Hirzel", "Jim Alain Laredo", "Malik Magdon-Ismail", "Louis Mandel", "Erik Wittern"], "abstract": "GraphQL is a query language for APIs and a runtime for executing those queries, fetching the requested data from existing microservices, REST APIs, databases, or other sources. Its expressiveness and its flexibility have made it an attractive candidate for API providers in many industries, especially through the web. A major drawback to blindly servicing a client’s query in GraphQL is that the cost of a query can be unexpectedly large, creating computation and resource overload for the provider, and API rate-limit overages and infrastructure overload for the client. To mitigate these drawbacks, it is necessary to efficiently estimate the cost of a query before executing it. Estimating query cost is challenging, because GraphQL queries have a nested structure, GraphQL APIs follow different design conventions, and the underlying data sources are hidden. Estimates based on worst-case static query analysis have had limited success because they tend to grossly overestimate cost. We propose a machine-learning approach to efficiently and accurately estimate the query cost. We also demonstrate the power of this approach by testing it on query-response data from publicly available commercial APIs. Our framework is efficient and predicts query costs with high accuracy, consistently outperforming the static analysis by a large margin.", "doi": "10.1109/ase51524.2021.9678513", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678513", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678513"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678513"}
{"title": "Automatic HMI Structure Exploration Via Curiosity-Based Reinforcement Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yushi Cao", "Yan Zheng", "Shang-Wei Lin", "Yang Liu", "Yon Shin Teo", "Yuxuan Toh", "Vinay Vishnumurthy Adiga"], "abstract": "Discovering the underlying structure of HMI software efficiently and sufficiently for the purpose of testing without any prior knowledge on the software logic remains a difficult problem. The key challenge lies in the complexity of the HMI software and the high variance in the coverage of current methods. In this paper, we introduce the PathFinder, an effective and automatic HMI software exploration framework. PathFinder adopts a curiosity-based reinforcement learning framework to choose actions that lead to the discovery of more unknown states. Additionally, PathFinder progressively builds a navigation model during the exploration to further improve state coverage. We have conducted experiments on both simulations and real-world HMI software testing environment, which comprise a full tool chain of automobile dashboard instrument cluster. The exploration coverage outperforms manual and fuzzing methods which are the current industrial standards.", "doi": "10.1109/ase51524.2021.9678703", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678703", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678703"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678703"}
{"title": "Towards a Serverless Java Runtime", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yifei Zhang", "Tianxiao Gu", "Xiaolin Zheng", "Lei Yu", "Wei Kuai", "Sanhong Li"], "abstract": "Java virtual machine (JVM) has the well-known slow startup and warmup issues. This is because the JVM needs to dynamically create many runtime data before reaching peak performance, including class metadata, method profile data, and just-in-time (JIT) compiled native code, for each run of even the same application. Many techniques are then proposed to reuse and share these runtime data across different runs. For example, Class Data Sharing (CDS) and Ahead-of-time (AOT) compilation aim to save and share class metadata and compiled native code, respectively. Unfortunately, these techniques are developed independently and cannot leverage the ability of each other well. This paper presents an approach that systematically reuses JVM runtime data to accelerate application startup and warmup. We first propose and implement JWarmup, a technique that can record and reuse JIT compilation data (e.g., compiled methods and their profile data). Then, we feed JIT compilation data to the AOT compiler to perform profile-guided optimization (PGO). We also integrate existing CDS and AOT techniques to further optimize application startup. Evaluation on real-world applications shows that our approach can bring a 41.35% improvement to the application startup. Moreover, our approach can trigger JIT compilation in advance and reduce CPU load at peak time.", "doi": "10.1109/ase51524.2021.9678709", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678709", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678709"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678709"}
{"title": "BIFF: Practical Binary Fuzzing Framework for Programs of IoT and Mobile Devices", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Cen Zhang", "Yuekang Li", "Hongxu Chen", "Xiaoxing Luo", "Miaohua Li", "Anh Quynh Nguyen", "Yang Liu"], "abstract": "Internet-of-things (IoT) or mobile devices are omnipresent in our daily life; the security issues inside them are especially crucial. Greybox fuzzing has been shown effective in detecting vulnerabilities. However, applications in IoT or mobile devices are usually proprietary to specific vendors, fuzzers are required to support binary-only targets. Moreover, since these devices are of heterogeneous architecture, assigned with limited resources, and many testing targets are server-like programs, applying existing fuzzing techniques faces great challenges.This paper proposes BIFF, a general-purpose fuzzer that aims to stress these issues. It supports binary-only targets, is general (supports multiple CPU architectures including Intel, ARM, MIPS, and PowerPC), fast (has the lowest runtime overhead compared to existing fuzzers), and flexible (uses a new fuzzing workflow that can fuzz any piece of code inside the target binary). Experiments demonstrate that BIFF has the best performance compared with state-of-the-art binary fuzzers and can fuzz the server-like programs which cannot be fuzzed by the existing fuzzers. Using BIFF, we’ve found 24 unknown vulnerabilities (including memory corruptions, infinite loops, and infinite recursions) in industrial products.", "doi": "10.1109/ase51524.2021.9678910", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678910", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678910"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678910"}
{"title": "Infrastructure in Code: Towards Developer-Friendly Cloud Applications", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladislav Tankov", "Dmitriy Valchuk", "Yaroslav Golubev", "Timofey Bryksin"], "abstract": "The popularity of cloud technologies has led to the development of a new type of applications that specifically target cloud environments. Such applications require a lot of cloud infrastructure to run, which brought about the Infrastructure as Code approach, where the infrastructure is also coded using a separate language in parallel to the main application. In this paper, we propose a new concept of Infrastructure in Code, where the infrastructure is deduced from the application code itself, without the need for separate specifications. We describe this concept, discuss existing solutions that can be classified as Infrastructure in Code and their limitations, and then present our own framework called Kotless — an extendable cloud-agnostic serverless framework for Kotlin that supports two cloud providers, three DSLs, and two runtimes. Finally, we showcase the usefulness of Kotless by demonstrating its efficiency in migrating an existing application to a serverless environment.", "doi": "10.1109/ase51524.2021.9678943", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678943", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678943"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678943"}
{"title": "Metamorphic Testing on Multi-module UAV Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rui Li", "Huai Liu", "Guannan Lou", "James Xi Zheng", "Xiao Liu", "Tsong Yueh Chen"], "abstract": "Recent years have seen a rapid development of machine learning based multi-module unmanned aerial vehicle (UAV) systems. To address the oracle problem in autonomous systems, numerous studies have been conducted to use metamorphic testing to automatically generate test scenes for various modules, e.g., those in self-driving cars. However, as most of the studies are based on unit testing including end-to-end model-based testing, a similar testing approach may not be equally effective for UAV systems where multiple modules are working closely together. Therefore, in this paper, instead of unit testing, we propose a novel metamorphic system testing framework for UAV, named MSTU, to detect the defects in multi-module UAV systems. A preliminary evaluation plan to apply MSTU on an emerging autonomous multi-module UAV system is also presented to demonstrate the feasibility of the proposed testing framework.", "doi": "10.1109/ase51524.2021.9678841", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678841", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678841"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678841"}
{"title": "Decoupling Server and Client Code Through Cloud-Native Domain-Specific Functions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["José Miguel Pérez-Álvarez", "Adrian Mos", "Benjamin V. Hanrahan", "Iyadunni J. Adenuga"], "abstract": "Simple domain-specific graphical languages and libraries can empower a variety of users to create application behavior and logic. However, it remains challenging to produce and maintain a heterogeneous set of client applications based on these descriptions, as each client typically requires the developers to both understand and embed the domain-specific logic. This is because application logic must be encoded to some extent in both the server and client sides.In this paper, we propose an alternative approach, which allows the specification of application logic to reside solely on the cloud. In our system, reusable application components are assembled on the cloud in different logical chains and the client is solely concerned with how data is displayed and gathered from users. In this way, the chaining of requests and responses is done by the cloud and the client side has no knowledge of the application logic. This means that the experts in the domain build modular cloud components, arrange them in logical chains, generate a simple user interface, and later leave it to client-side developers to customize the presentation.", "doi": "10.1109/ase51524.2021.9678747", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678747", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678747"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678747"}
{"title": "Automatically Annotating Sentences for Task-specific Bug Report Summarization", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Akalanka Galappaththi", "John Anvik", "Rafat Bin Islam"], "abstract": "There is a need to summarize bug reports as they can become long due to many comments from conversations between developers and various DevOps tools. Although automated approaches to bug report summarization have been developed, we believe they aim at the wrong target - getting as close as possible to a gold-standard summary. Instead, researchers should create automated bug report annotation approaches that allow project members to create summaries based on their task-specific information needs. We present such an approach.", "doi": "10.1109/ase51524.2021.9678554", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678554", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678554"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678554"}
{"title": "Genetic Optimisation of C++ Applications", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rafail Giavrimis", "Alexis Butler", "Constantin Cezar Petrescu", "Michail Basios", "Santanu Kumar Dash"], "abstract": "Software developers sometimes use inefficient data structures or library interfaces without considering the potential impact they may have during the runtime of a program. This is due to the significant effort required to research and evaluate possibly more efficient alternatives. Consequently, there is a need for tooling to automate the design space exploration. Our proposed code optimisation solution, called Artemis++, tries to address this issue with automatic exploration and transformation of data structures to optimise software performance. In preliminary testing on three mainstream C++ libraries, we have observed improvements up to 16.09%, 27.90%, and 2.74% for CPU usage, runtime and memory, respectively.", "doi": "10.1109/ase51524.2021.9678650", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678650", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678650"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678650"}
{"title": "Revisiting Textual Feature of Bug-Triage Approach", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zexuan Li", "Hao Zhong"], "abstract": "With the increase of software users, programmers use issue tracking systems to manage bug reports and researchers propose bug-triage approaches that assign bug reports to programmers. Programmers assign bug reports often according to their descriptions. Based on by this observation, prior approaches typically use classic natural language processing (NLP) to analyze bug reports. Although the technical choice is straightforward, the true effectiveness of this technical choice is largely unknown. Taking a state-of-the-art approach as an example, we explore the impact of textual features in bug triage. By enabling and disabling the textual features of this approach, we analyze their impacts on assigning thousands bug reports from six widely used open source projects. Our result shows that instead of improving it, textual features in fact reduce the effectiveness. In particular, after we turn off its textual features, the f-scores of the baseline approach are improved by 8%. After manual inspection, we find two reasons to explain our result: (1) classic NLP techniques are insufficient to analyze bug reports, because they are not pure natural language texts and contain other elements (e.g., code samples); and (2) some bug reports are poorly written. Our findings reveal a strong need and sufficient opportunities to explore more advanced techniques to handle these complicated elements in bug reports.", "doi": "10.1109/ase51524.2021.9678863", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678863", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678863"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678863"}
{"title": "A First Look at the Effect of Deep Learning in Coverage-guided Fuzzing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Siqi Li", "Yun Lin", "Xiaofei Xie", "Yuekang Li", "Xiaohong Li", "Weimin Ge", "Yang Liu", "Jin Song Dong"], "abstract": "Fuzzing has been a widely-used technique for discovering software vulnerabilities. Many existing fuzzers leverage coverage-feedback to evolve seeds to maximize (optimize) program branch coverage. Recently, some techniques propose to train deep learning models to predict the branch coverage of an arbitrary input. Those techniques have proved their success in improving coverage and discovering bugs under different experimental settings. However, deep learning models, usually as a black magic box, are notoriously lack of explanation. Moreover, their performance can be sensitive to the collected runtime coverage information for training, indicating potentially unstable performance. To this end, in this work we conduct a systematic and extensive empirical study on 4 types of deep learning models across 6 projects to reproduce the actual performance of deep learning fuzzers, analyze the advantages and disadvantages of deep learning in the process of fuzzing applications, and explore the future direction of the combination of the two. Our empirical results reveal that the deep learning models can only be effective in very limited scenarios, which is largely restrained by training data imbalance, dependant labels, model over-generalization, and the insufficient expressiveness of the state-of-the-art models. Consequently, the estimated gradients by the models to cover a branch can be less helpful in many scenarios.", "doi": "10.1109/ase51524.2021.9678794", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678794", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678794"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678794"}
{"title": "Counterexample Guided Inductive Repair of Reactive Contracts", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Soha Hussein", "Vaibhav Sharma", "Stephen McCamant", "Sanjai Rayadurgam", "Mats Per Erik Heimdahl"], "abstract": "Using third-party executable components to build control systems poses challenges for verification. This is because the informal behavior descriptions that typically accompany the components often fall short of the needed rigor. Consequently, there is a need to formalize a component contract that is strong enough to help establish system properties and also weak enough to account for all potential component behaviors in the system’s context. In this paper, we present a novel approach that allows an analyst to hypothesize a component contract, explore if the component meets the contract, and, if not, have automated support to help repair the contract. Preliminary results show that, in more than 32% of the cases, the repaired contract is logically equivalent to a developer-written one; in a further 63% of cases, it is a distinct, valid, and non-trivial property of the component.", "doi": "10.1109/ase51524.2021.9678548", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678548", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678548"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678548"}
{"title": "AST-Transformer: Encoding Abstract Syntax Trees Efficiently for Code Summarization", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ze Tang", "Chuanyi Li", "Jidong Ge", "Xiaoyu Shen", "Zheling Zhu", "Bin Luo"], "abstract": "Code summarization aims to generate brief natural language descriptions for source code. As source code is highly structured and follows strict programming language grammars, its Abstract Syntax Tree (AST) is often leveraged to inform the encoder about the structural information. However, ASTs are usually much longer than the source code. Current approaches ignore the size limit and simply feed the whole linearized AST into the encoder. To address this problem, we propose AST-Transformer to efficiently encode tree-structured ASTs. Experiments show that AST-Transformer outperforms the state-of-arts by a substantial margin while being able to reduce 90 ~ 95% of the computational complexity in the encoding process.", "doi": "10.1109/ase51524.2021.9678882", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678882", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678882"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678882"}
{"title": "Detecting Adversarial Samples with Graph-Guided Testing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zuohui Chen", "Renxuan Wang", "Jingyang Xiang", "Yue Yu", "Xin Xia", "Shouling Ji", "Qi Xuan", "Xiaoniu Yang"], "abstract": "Deep Neural Networks (DNN) are known to be vulnerable to adversarial samples, the detection of which is crucial for the wide application of these DNN models. Recently, a number of deep testing methods in software engineering were proposed to find the vulnerability of DNN systems, and one of them, i.e., Model Mutation Testing (MMT), was used to successfully detect various adversarial samples generated by different kinds of adversarial attacks. However, the mutated models in MMT are always huge in number (e.g., over 100 models) and lack diversity (e.g., can be easily circumvented by high-confidence adversarial samples), which makes it less efficient in real applications and less effective in detecting high-confidence adversarial samples. In this study, we propose Graph-Guided Testing (GGT) for adversarial sample detection to overcome these aforementioned challenges. GGT generates pruned models with the guide of graph characteristics, each of them has only about 5% parameters of the mutated model in MMT, and graph guided models have higher diversity. The initial experiments on CIFAR10 validate that GGT performs much better than MMT with respect to both effectiveness and efficiency.", "doi": "10.1109/ase51524.2021.9678732", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678732", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678732"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678732"}
{"title": "Using Static Analysis to Address Microservice Architecture Reconstruction", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vincent Bushong", "Dipta Das", "Abdullah Al Maruf", "Tomás Cerný"], "abstract": "Microservice design offers many advantages for enterprise applications, including increased scalability and faster deployment times. Microservices’ independence from one another in development and deployment provides these advantages. This separation, however, results in the absence of a centralized view of the application’s functionality, and each microservice’s data model is isolated and replicated. As a result, it has the potential to deviate from the architectural design’s original intent. To address this, we offer a method for analyzing a microservice mesh and generating a communication diagram, context map, and microservice-specific limited contexts using static code analysis.", "doi": "10.1109/ase51524.2021.9678749", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678749", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678749"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678749"}
{"title": "Business Process Extraction Using Static Analysis", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Md Rofiqul Islam", "Tomás Cerný"], "abstract": "Business process mining of a large-scale project has many benefits such as finding vulnerabilities, improving processes, collecting data for data science, generating more clear and simple representation, etc. The general way of process mining is to turn event data such as application logs into insights and actions. Observing logs broad enough to depict the whole business logic scenario of a large project can become very costly due to difficult environment setup, unavailability of users, presence of not reachable or hardly reachable log statements, etc. Using static source code analysis to extract logs and arranging them perfect runtime execution order is a potential way to solve the problem and reduce the business process mining operation cost.", "doi": "10.1109/ase51524.2021.9678588", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678588", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678588"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678588"}
{"title": "Improving Mutation-Based Fault Localization with Plausible-code Generating Mutation Operators", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Juyoung Jeon", "Shin Hong"], "abstract": "This paper proposes a new mutation operator using neural network to generate plausible code elements to improve performance of mutation-based fault localization on omission faults. Unlike the existing mutation operators, the proposed mutation operator synthesizes new code elements at a given mutation site with a neural language model. We extended MUSE to use the proposed mutation operator, and conducted a case study with 3 omission faults found in JFreeChart of Defects4J. As a result, the accuracy of MUSE with the new mutation operator increased significantly in all three faults.", "doi": "10.1109/ase51524.2021.9678577", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678577", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678577"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678577"}
{"title": "Using Version Control and Issue Tickets to detect Code Debt and Economical Cost", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Abdullah Al Maruf", "Noah Lambaria", "Amr S. Abdelfattah", "Tomás Cerný"], "abstract": "Despite the fact that there are numerous classifications of technical debt based on various criteria, Code Debt or code smells is a category that appears in the majority of current research. One of the primary causes of code debt is the urgency to deliver software quickly, as well as bad coding practices. Among many approaches, static code analysis has received the most attention in studies to detect code-smell/code debt. However, most of them examine the same programming language, although today’s software company utilizes many development stacks with various languages and tools. This problem can be resolved by detecting code debt with Issue/Ticket cards. This paper presents a method for detecting code debt leveraging natural language processing on issue tickets. It also proposes a method for calculating the average amount of time that a code debt was present in the software. This method is implemented utilizing git mining.", "doi": "10.1109/ase51524.2021.9678532", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678532", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678532"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678532"}
{"title": "Human-in-the-Loop XAI-enabled Vulnerability Detection, Investigation, and Mitigation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tien N. Nguyen", "Kim-Kwang Raymond Choo"], "abstract": "The need for cyber resilience is increasingly important in our technology-dependent society, where computing systems, devices and data will continue to be the target of cyber attackers. Hence, we propose a conceptual framework called ‘Human-in-the-Loop Explainable-AI-Enabled Vulnerability Detection, Investigation, and Mitigation’ (HXAI-VDIM). Specifically, instead of resolving complex scenario of security vulnerabilities as an output of an AI/ML model, we integrate the security analyst or forensic investigator into the man-machine loop and leverage explainable AI (XAI) to combine both AI and Intelligence Assistant (IA) to amplify human intelligence in both proactive and reactive processes. Our goal is that HXAI-VDIM integrates human and machine in an interactive and iterative loop with security visualization that utilizes human intelligence to guide the XAI-enabled system and generate refined solutions.", "doi": "10.1109/ase51524.2021.9678840", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678840", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678840"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678840"}
{"title": "BeAFix: An Automated Repair Tool for Faulty Alloy Models", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Simón Gutiérrez Brida", "Germán Regis", "Guolong Zheng", "Hamid Bagheri", "ThanhVu Nguyen", "Nazareno Aguirre", "Marcelo F. Frias"], "abstract": "This paper describes BeAFix, a tool for automated repair of faulty Alloy models. The tool builds upon the Alloy Analyzer, the analysis tool for Alloy. It generates repair candidates by mutating a faulty Alloy model, and employs a bounded-exhaustive approach to traverse the space of repair candidates. Since BeAFix’s mutation operators make the space of repair candidates to quickly grow, the tool supports some sound pruning techniques, that allow it to fix Alloy models with more than one faulty line or expression. Additionally, BeAFix does not require tests as a patch acceptance criterion. Although BeAFix supports tests as oracles, our tool is also able to leverage property-based oracles, which are more commonly found in Alloy models in the form of predicate satisfiability and assertion validity checks.A video demonstration of BeAFix can be found at https://youtu.be/5RG40SmlFXQ. The tool’s binaries and further details about its usage, can all be found at https://sites.google.com/view/beafixevaluation/beafix. The tool is also available in a public archive at https://doi.org/10.5281/zenodo.5296466.", "doi": "10.1109/ase51524.2021.9678524", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678524", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678524"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678524"}
{"title": "FLACK: Localizing Faults in Alloy Models", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Guolong Zheng", "ThanhVu Nguyen", "Simón Gutiérrez Brida", "Germán Regis", "Marcelo F. Frias", "Nazareno Aguirre", "Hamid Bagheri"], "abstract": "Fault localization can help developers identify buggy statements or expressions in programs. Existing fault localization techniques are often designed for imperative programs (e.g., C and Java) and rely on tests to compare correct and incorrect execution traces to identify suspicious statements. In this demo paper, we present FLACK, a tool to automatically locate faults for models written in Alloy, a declarative language where the models are not executed but instead converted into a logical formula and solved using a SAT solver. FLACK takes as input an Alloy model that violates some assertions and returns a ranked list of suspicious expressions contributing to the violation. The key idea is to analyze the differences between counterexamples, i.e., instances of the model that do not satisfy the assertion and instances that do satisfy the assertion to find suspicious expressions in the input model. An experiment with 157 Alloy models with various bugs shows the efficiency and accuracy of FLACK in localizing the causes of these bugs. FLACK and its evaluation benchmark and results can be downloaded from https://github.com/guolong-zheng/flack. The video demonstration is available at https://youtu.be/FKa2ohqIUms.", "doi": "10.1109/ase51524.2021.9678740", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678740", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678740"], "github": ["https://github.com/guolong-zheng/flack"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678740"}
{"title": "IncBL: Incremental Bug Localization", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhou Yang", "Jieke Shi", "Shaowei Wang", "David Lo"], "abstract": "Numerous efforts have been invested in improving the effectiveness of bug localization techniques, whereas little attention is paid to making these tools run more efficiently in continuously evolving software repositories. This paper first analyzes the information retrieval model behind a classic bug localization tool, BugLocator, and builds a mathematical foundation illustrating that the model can be updated incrementally when codebase or bug reports evolve. Then, we present IncBL, a tool for Incremental Bug Localization in evolving software repositories. IncBL is evaluated on the Bugzbook dataset, and the results show that IncBL can significantly reduce the running time by 77.79% on average compared with the re-computing the model, while maintaining the same level of accuracy. We also implement IncBL as a Github App that can be easily integrated into open-source projects on GitHub. Users can deploy and use IncBL locally as well. The demo video for IncBL can be viewed at https://youtu.be/G4gMuvlJSb0, and the source code can be found at https://github.com/soarsmu/IncBL.", "doi": "10.1109/ase51524.2021.9678546", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678546", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678546"], "github": ["https://github.com/soarsmu/IncBL"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678546"}
{"title": "Q&A MAESTRO: Q&A Post Recommendation for Fixing Java Runtime Exceptions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yusuke Kimura", "Takumi Akazaki", "Shinji Kikuchi", "Sonal Mahajan", "Mukul R. Prasad"], "abstract": "Programmers often use Q&A sites (e.g., Stack Overflow) to understand a root cause of program bugs. Runtime exceptions is one of such important class of bugs that is actively discussed on Stack Overflow. However, it may be difficult for beginner programmers to come up with appropriate keywords for search. Moreover, they need to switch their attentions between IDE and browser, and it is time-consuming. To overcome these difficulties, we proposed a method, \"Q&A MAESTRO\", to find suitable Q&A posts automatically for Java runtime exception by utilizing structure information of codes described in programming Q&A website. In this paper, we describe a usage scenario of IDE-plugin, the architecture and user interface of the implementation, and results of user studies. A video is available at https://youtu.be/4X24jJrMUVw. A demo software is available at https://github.com/FujitsuLaboratories/Q-A-MAESTRO.", "doi": "10.1109/ase51524.2021.9678893", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678893", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678893"], "github": ["https://github.com/FujitsuLaboratories/Q-A-MAESTRO", "https://github.com/fujitsulaboratories/q-a-maestro"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678893"}
{"title": "GenTree: Inferring Configuration Interactions using Decision Trees", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["KimHao Nguyen", "ThanhVu Nguyen"], "abstract": "In this paper, we demonstrate the implementation details and usage of GenTree, a dynamic analysis tool for learning a program’s interactions. Configurable software systems, while providing more flexibility to the users, are harder to develop, test, and analyze. GenTree can efficiently analyze the interactions among configuration options in configurable software. These interactions compactly represent large sets of configurations and thus allow us to efficiently analyze and discover interesting properties (e.g., bugs) in configurable software. Our experiments on 17 configurable systems spanning 4 languages show that GenTree efficiently finds precise interactions using a tiny fraction of the configuration space. GenTree and its dataset are open source and available at https://github.com/unsat/gentree and a video demo is at https://youtu.be/x3eqUflvlN8.", "doi": "10.1109/ase51524.2021.9678676", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678676", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678676"], "github": ["https://github.com/unsat/gentree"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678676"}
{"title": "Quito: a Coverage-Guided Test Generator for Quantum Programs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xinyi Wang", "Paolo Arcaini", "Tao Yue", "Shaukat Ali"], "abstract": "Automation in quantum software testing is essential to support systematic and cost-effective testing. Towards this direction, we present a quantum software testing tool called Quito that can automatically generate test suites covering three coverage criteria defined on inputs and outputs of a quantum program coded in Qiskit, i.e., input coverage, output coverage, and input-output coverage. Quito also implements two types of test oracles based on program specifications, i.e., checking whether a quantum program produced a wrong output or checking a probabilistic test oracle with statistical test. We describe the architecture and methodology of the tool. We also validated the tool with one quantum program and one faulty version of it. Results indicate that Quito can generate test suites and perform test assessments that detect faults, and produce test results with a good time performance.Quito’s code: https://github.com/Simula-COMPLEX/quitoQuito’s video: https://youtu.be/kuI9QaCo8A8Artifact Available: https://doi.org/10.5281/zenodo.5288665", "doi": "10.1109/ase51524.2021.9678798", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678798", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678798"], "github": ["https://github.com/Simula-COMPLEX/quitoQuito"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678798"}
{"title": "Revizor: A Data-Driven Approach to Automate Frequent Code Changes Based on Graph Matching", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Oleg Smirnov", "Artyom Lobanov", "Yaroslav Golubev", "Elena Tikhomirova", "Timofey Bryksin"], "abstract": "Many code changes that developers make in their projects are repeated and constitute recurrent change patterns. It is of interest to collect such patterns from the version history of open-source repositories and suggest the most useful of them as quick fixes. In this paper, we present Revizor—a tool aimed to build custom plugins for PyCharm, a popular Python IDE. A Revizor-based plugin can take change patterns and highlight potential places for their application in the developer’s code editor. If the developer accepts the quick fix, the plugin automatically performs the edit. Our approach uses a graph-based representation of code changes, which allows it to support complex distributed code patterns. Experienced developers have also rated the usability and the performance of such Revizor-based plugin positively.The source code of the tool and test plugin prototype are available on GitHub: https://github.com/JetBrains-Research/revizor. A demonstration video with a short tool description can be found on YouTube: https://youtu.be/5eLs14nco7E.", "doi": "10.1109/ase51524.2021.9678635", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678635", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678635"], "github": ["https://github.com/JetBrains-Research/revizor", "https://github.com/jetbrains-research/revizor"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678635"}
{"title": "Scalable Fuzzing of Program Binaries with E9AFL", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiang Gao", "Gregory J. Duck", "Abhik Roychoudhury"], "abstract": "Greybox fuzzing is an effective method for software testing. Greybox fuzzers, such as AFL, use instrumentation that collects path coverage information in order to guide the fuzzing process. The instrumentation is usually inserted by a modified compiler toolchain, meaning that the program must be recompiled in order to be compatible with greybox fuzzing. When source code is unavailable, or for projects with complex build systems, recompilation is not always feasible. In this paper, we present E9AFL, a fast and scalable tool that automatically inserts AFL instrumentation to program binaries. E9AFL is built on top of the E9Patch static binary rewriting tool. To combat the overhead caused by binary instrumentation, E9AFL develops a set of optimization strategies. Our evaluation results show that E9AFL outperforms existing binary instrumentation tools and achieves comparable performance with the compile time instrumentation.", "doi": "10.1109/ase51524.2021.9678913", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678913", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678913"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678913"}
{"title": "EvoMe: A Software Evolution Management Engine Based on Differential Factbase", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiuheng Wu", "Mengyang Li", "Yi Li"], "abstract": "Managing large and fast-evolving software systems can be a challenging task. Numerous solutions have been developed to assist in this process, enhancing software quality and reducing development costs. These techniques—e.g., regression test selection and change impact analysis—are often built as standalone tools, unable to share or reuse information among them. In this paper, we introduce a software evolution management engine, EvoMe, to streamline and simplify the development of such tools, allowing them to be easily prototyped using an intuitive query language and quickly deployed for different types of projects. EvoMe is based on differential factbase, a uniform exchangeable representation of evolving software artifacts, and can be accessed directly through a Web interface. We demonstrate the usage and key features of EvoMe on real open-source software projects. The demonstration video can be found at: http://youtu.be/6mMgu6rfnjY.", "doi": "10.1109/ase51524.2021.9678795", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678795", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678795"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678795"}
{"title": "FixMe: A GitHub Bot for Detecting and Monitoring On-Hold Self-Admitted Technical Debt", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saranphon Phaithoon", "Supakarn Wongnil", "Patiphol Pussawong", "Morakot Choetkiertikul", "Chaiyong Ragkhitwetsagul", "Thanwadee Sunetnanta", "Rungroj Maipradit", "Hideaki Hata", "Kenichi Matsumoto"], "abstract": "Self-Admitted Technical Debt (SATD) is a special form of technical debt in which developers intentionally record their hacks in the code by adding comments for attention. Here, we focus on issue-related \"On-hold SATD\", where developers suspend proper implementation due to issues reported inside or outside the project. When the referenced issues are resolved, the On-hold SATD also need to be addressed, but since monitoring these issue reports takes a lot of time and effort, developers may not be aware of the resolved issues and leave the On-hold SATD in the code. In this paper, we propose FixMe, a GitHub bot that helps developers detecting and monitoring On-hold SATD in their repositories and notify them whenever the On-hold SATDs are ready to be fixed (i.e. the referenced issues are resolved). The bot can automatically detect On-hold SATD comments from source code using machine learning techniques and discover referenced issues. When the referenced issues are resolved, developers will be notified by FixMe bot. The evaluation conducted with 11 participants shows that our FixMe bot can support them in dealing with On-hold SATD. FixMe is available at https://www.fixmebot.app/ and FixMe's VDO is at https://youtu.be/YSz9kFxN_YQ.", "doi": "10.1109/ase51524.2021.9678680", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678680", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678680"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678680"}
{"title": "Automated Code Refactoring upon Database-Schema Changes in Web Applications", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sophie Xie", "Junwen Yang", "Shan Lu"], "abstract": "Modern web applications manipulate a large amount of user data and undergo frequent data-schema changes. These changes bring up a unique refactoring task: updating application code to be consistent with data schema. Previous study and our own investigation show that this type of refactoring is error-prone and time-consuming for developers. This paper presents EvolutionSaver, a static code analysis and transformation tool that automates schema-related code refactoring and consistency checking. EvolutionSaver is implemented as an IDE plugin that works for both Rails and Django applications. The source code of EvolutionSaver is available on Github [1] and the plugin can be downloaded from Visual Studio Marketplace [2], with its tutorial available at https://www.youtube.com/watch?v=qBiMkLFIjbE and DOI 10.5281/zenodo.5276127.", "doi": "10.1109/ase51524.2021.9678934", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678934", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678934"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678934"}
{"title": "Muskit: A Mutation Analysis Tool for Quantum Software Testing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eñaut Mendiluze", "Shaukat Ali", "Paolo Arcaini", "Tao Yue"], "abstract": "Given that quantum software testing is a new area of research, there is a lack of benchmark programs and bugs repositories to assess the effectiveness of testing techniques. To this end, quantum mutation analysis focuses on systematically generating faulty versions of Quantum Programs (QPs), called mutants, using mutation operators. Such mutants can be used as benchmarks to assess the quality of test cases in a test suite. Thus, we present Muskit - a quantum mutation analysis tool for QPs coded in IBM's Qiskit language. Muskit defines mutation operators on gates of QPs and selection criteria to reduce the number of mutants to generate. Moreover, it allows for the execution of test cases on mutants and generation of results for test analyses. Muskit is provided as command line interface, GUI, and web application. We validated Muskit by using it to generate and execute mutants for four QPs. Muskit code: https://github.com/Simula-COMPLEX/muskitWeb app: https://qiskitmutantcreatorsrl.pythonanywhere.com/YouTube Video: EbPHJOK_AEA Artifact Available: https://doi.org/10.5281/zenodo.5288917", "doi": "10.1109/ase51524.2021.9678563", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678563", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678563"], "github": ["https://github.com/Simula-COMPLEX/muskitWeb"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678563"}
{"title": "JTDog: a Gradle Plugin for Dynamic Test Smell Detection", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Masayuki Taniguchi", "Shinsuke Matsumoto", "Shinji Kusumoto"], "abstract": "The concept of the test smell represents potential problems with the readability and maintainability of the test code. Common test smells focus on static aspects of the source code, such as code length and complexity. These are easy to detect and do not cause problems in terms of test execution. On the other hand, dynamic smells, which are based on test runtime behavior, lead to misunderstanding of the test results. For example, rotten green tests give developers the false impression that the test was passed without any problems, even though the test was poorly executed. Therefore, we should detect dynamic smells and take countermeasures as early as possible through the development. In this paper, we introduce JTDog, a Gradle plugin for dynamic smell detection. JTDog has high portability due to its integration into the build tool. We applied JTDog to 150 projects on GitHub and confirmed that the JTDog plugin has high portability. In addition, JTDog detected 958 dynamic smells in 55 projects. JT-Dog is available at https://github.com/kusumotolab/JTDog, and the demo video is available at https://youtu.be/t374HYMCavI.", "doi": "10.1109/ase51524.2021.9678529", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678529", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678529"], "github": ["https://github.com/kusumotolab/JTDog"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678529"}
{"title": "RefactorInsight: Enhancing IDE Representation of Changes in Git with Refactorings Information", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zarina Kurbatova", "Vladimir Kovalenko", "Ioana Savu", "Bob Brockbernd", "Dan Andreescu", "Matei Anton", "Roman Venediktov", "Elena Tikhomirova", "Timofey Bryksin"], "abstract": "Inspection of code changes is a time-consuming task that constitutes a big part of everyday work of software engineers. Existing IDEs provide little information about the semantics of code changes within the file editor view. Therefore developers have to track changes across multiple files, which is a hard task with large codebases.In this paper, we present REFACTORINSIGHT, a plugin for IntelliJ IDEA that introduces a smart diff for code changes in Java and Kotlin where refactorings are auto-folded and provided with their description, thus allowing users to focus on changes that modify the code behavior like bug fixes and new features. REFACTORINSIGHT supports three usage scenarios: viewing smart diffs with auto-folded refactorings and hints, inspecting refactorings in pull requests and in any specific commit in the project change history, and exploring the refactoring history of methods and classes. The evaluation shows that commit processing time is acceptable: on median it is less than 0.2 seconds, which delay does not disrupt developers’ IDE workflows.Refactorinsight is available at https://github.com/JetBrains-Research/RefactorInsight. The demonstration video is available at https://youtu.be/-6L2AKQ66nA.", "doi": "10.1109/ase51524.2021.9678646", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678646", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678646"], "github": ["https://github.com/JetBrains-Research/RefactorInsight"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678646"}
{"title": "Shaker: a Tool for Detecting More Flaky Tests Faster", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marcello Cordeiro", "Denini Silva", "Leopoldo Teixeira", "Breno Miranda", "Marcelo d'Amorim"], "abstract": "A test case that intermittently passes or fails when performed under the same version of source code and test code is said to be flaky. The presence of flaky tests wastes testing time and effort. The most popular approach in industry to detect flakiness is ReRun. The idea behind ReRun is very simple: failing test cases are re-executed many times looking for inconsistencies in the output. Despite its simplicity, the ReRun strategy is very expensive both in terms of time and in terms of computational resources. This is particularly true for contexts where thousands of test cases are performed on a daily basis. Reducing the rerunning overhead is, thus, of utmost importance. This paper presents SHAKER, an open-source tool for detecting flakiness in time-constrained tests by adding noise in the execution environment. The main idea behind SHAKER is to add stressing tasks that compete with the test execution for the use of resources (CPU or memory). SHAKER is available as a GitHub Actions workflow that can be seamlessly integrated with any GitHub project. Alternatively, SHAKER can also be used via its provided Command Line Interface. In our evaluation, SHAKER was able to discover more flaky tests than ReRun and in a faster way (less re-executions); besides, our approach revealed tens of new flaky tests that went undetected by ReRun even after 50 re-executions. Thanks to its flexibility and ease of use, we believe that SHAKER can be useful for both practitioners and researchers.Demo video: https://youtu.be/7-aiQwOb4rAShaker website: https://star-rg.github.io/shaker", "doi": "10.1109/ase51524.2021.9678918", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678918", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678918"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678918"}
{"title": "DEVIATE: A Deep Learning Variance Testing Framework", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hung Viet Pham", "Mijung Kim", "Lin Tan", "Yaoliang Yu", "Nachiappan Nagappan"], "abstract": "Deep learning (DL) training is nondeterministic and such nondeterminism was shown to cause significant variance of model accuracy (up to 10.8%). Such variance may affect the validity of the comparison of newly proposed DL techniques with baselines. To ensure such validity, DL researchers and practitioners must replicate their experiments multiple times with identical settings to quantify the variance of the proposed approaches and baselines. Replicating and measuring DL variances reliably and efficiently is challenging and understudied.We propose a ready-to-deploy framework DEVIATE that (1) measures DL training variance of a DL model with minimal manual efforts, and (2) provides statistical tests of both accuracy and variance. Specifically, DEVIATE automatically analyzes the DL training code and extracts monitored important metrics (such as accuracy and loss). In addition, DEVIATE performs popular statistical tests and provides users with a report of statistical p-values and effect sizes along with various confidence levels when comparing to selected baselines.We demonstrate the effectiveness of DEVIATE by performing case studies with adversarial training. Specifically, for an adversarial training process that uses the Fast Gradient Signed Method to generate adversarial examples as the training data, DEVIATE measures a max difference of accuracy among 8 identical training runs with fixed random seeds to be up to 5.1%.Tool and demo links: https://github.com/lin-tan/DEVIATE", "doi": "10.1109/ase51524.2021.9678540", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678540", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678540"], "github": ["https://github.com/lin-tan/DEVIATE"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678540"}
{"title": "SoManyConflicts: Resolve Many Merge Conflicts Interactively and Systematically", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bo Shen", "Wei Zhang", "Ailun Yu", "Yifan Shi", "Haiyan Zhao", "Zhi Jin"], "abstract": "Code merging plays an important role in collaborative software development. However, it is often tedious and error-prone for developers to manually resolve merge conflicts, especially when there are many conflicts after merging long-lived branches or parallel versions. In this paper, we present SoManyConflicts, a language-agnostic approach to help developers resolve merge conflicts systematically, by utilizing their interrelations (e.g., dependency, similarity, etc.). SoManyConflicts employs a graph representation to model these interrelations and provides 3 major features: 1) cluster and order related conflict based on the graph connectivity; 2) suggest related conflicts of one focused conflict based on the topological sorting, 3) suggest resolution strategies for unresolved conflicts based already resolved ones. We have implemented SoManyConflicts as a Visual Studio Code extension that supports multiple languages (Java, JavaScript, and TypeScript, etc.), which is briefly introduced in the video: https://youtu.be/asWhj1KTU. The source code is publicly available at: https://github.com/Symbolk/somanyconflicts.", "doi": "10.1109/ase51524.2021.9678937", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678937", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678937"], "github": ["https://github.com/Symbolk/somanyconflicts"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678937"}
{"title": "A Mocktail of Source Code Representations", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dheeraj Vagavolu", "Karthik Chandra Swarna", "Sridhar Chimalakonda"], "abstract": "Efficient representation of source code is essential for various software engineering tasks such as code classification and code clone detection. Most recent approaches for representing source code still use AST and do not leverage semantic graphs such as CFG and PDG. One effective technique for representing source code involves extracting paths from the AST and using a learning model to capture program properties. Code2vec is one such path-based approach that uses an attention-based neural network to learn code embeddings which can then be used for various downstream tasks. However, this approach uses only AST and does not leverage CFG and PDG. Even though an integrated graph approach (Code Property Graph) exists for representing source code, it has only been explored in the domain of software security. Moreover, it does not leverage the paths from the individual graphs. Our idea is to extend the path-based approach code2vec to include the semantic graphs CFG and PDG with AST, which is largely unexplored in software engineering. We evaluate our approach on the task of METHODNAMING using a C dataset of 730K methods collected from GitHub. In comparison to code2vec, our approach improves the F1 score by 11% on the full dataset and up to 100% with individual projects. We show that semantic features from the CFG and PDG paths drastically improve the performance of the software engineering tasks. We envision that looking at a mocktail of source code representations for various software engineering tasks can lay the foundation for a new line of research and a re-haul of existing research.", "doi": "10.1109/ase51524.2021.9678551", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678551", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678551"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678551"}
{"title": "Empowering Web Applications with WebAssembly: Are We There Yet?", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Weihang Wang"], "abstract": "WebAssembly is the newest web standard. It defines a compact bytecode format that allows it to be loaded and executed fast. While WebAssembly is generally believed to be faster than JavaScript, there have been inconsistent results when it comes to showing which code is faster. Unfortunately, insufficient study has been conducted to understand the performance benefits of WebAssembly. In this paper, we investigate how browser engines optimize WebAssembly execution in comparison to JavaScript. In particular, we measure their execution time and memory usage with diverse programs. Our results show that (1) JIT optimization in Chrome significantly impacts JavaScript speed but has no discernible effect on WebAssembly speed; (2) WebAssembly uses much more memory than JavaScript. We hope that our findings can help WebAssembly virtual machine developers uncover optimization opportunities.", "doi": "10.1109/ase51524.2021.9678831", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678831", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678831"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678831"}
{"title": "Property-based Test for Part-of-Speech Tagging Tool", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shuo Jin", "Songqiang Chen", "Xiaoyuan Xie"], "abstract": "Part-of-Speech (POS) tagging for sentences is a basic and widely-used Natural Language Processing (NLP) technique. People rely heavily on it to predict POS tags that serve as the base for many advanced NLP tasks, such as sentiment analysis, word sense disambiguation, and information retrieval. However, POS tagging tools could make wrong predictions, which bring consequent error propagation to the advanced tasks and even cause serious threats in critical application domains. In this paper, we propose to test POS tagging tools with Metamorphic Testing against some properties that they should follow. The preliminary exploration with two groups of Metamorphic Relations shows that our method can effectively reveal defects of three common POS tagging tools (i.e., spaCy, NLTK, and Flair) on handling fairly simple intra- and inter-sentence transformation regarding adverbial clause and sentence appending. This demonstrates the great potential of our method to deliver a systematic test and reveal the unaware issues, which may benefit the validation, repair, and improvement, for POS tagging tools.", "doi": "10.1109/ase51524.2021.9678807", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678807", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678807"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678807"}
{"title": "Understanding Code Fragments with Issue Reports", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zexuan Li", "Hao Zhong"], "abstract": "Code comments are vital for software development and maintenance. To supplement the code comments, researchers proposed various approach that generate code comments. The prior approaches take three sources: (1) programming experience, (2) code-comment pairs in source files, and (3) comments of similar code snippets. Most of their generated comments explain code functionalities, but programmers also need comments that explain why a code fragment was developed as it is. To meet the timely needs, in this paper, we introduce a new source, issue reports (e.g. maintenance types, symptoms, and purposes of modifications), to generate code comments. Issue reports contain rich information on how code was maintained. The valuable details of issue reports are useful to understand source code, especially when programmers learn why code was developed in a specific way. Towards this research direction, we propose the first approach, called ISSUECOMM, that builds the links between code fragments and issue reports. Our results show that it links more than 70% issue numbers that are written by programmers in code comments. Furthermore, the links built by our tool covers 4× bugs, and 10× other issues than the links written in manual comments. We present samples of our built links, and explain why our links are useful to describe the functionalities and the purpose of code.", "doi": "10.1109/ase51524.2021.9678864", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678864", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678864"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678864"}
{"title": "An Empirical Study on Obsolete Issue Reports", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zexuan Li", "Hao Zhong"], "abstract": "Issue reports record valuable maintenance details. Developers write issue numbers into code comprehension and researchers mine knowledge from issue reports to assist various programming tasks. Although issue reports are useful, some of them can be obsolete, in that their corresponding commits are overwritten or rolled back, with the evolution of software. The obsolete issue reports can invalidate their references and descriptions, and can have far-reaching impacts on the approaches built on them. To explore their impacts, we conduct the first empirical study to analyze obsolete issue reports.To measure how an issue report becomes obsolete, we define an obsolete ratio of an issue report as its deleted lines over all its modified lines. To support our analysis, we build a tool, ICLINKER, that builds the links between an issue report and its commits, and calculates the obsolete ratio for each issue report. In our study, we analyze 70,180 commits and 46,257 issue reports that are collected from 5 Apache projects. We explore two research questions, which concern the distributions of obsolete issue reports and the obsolete references in code comments. Our findings to these research questions enrich the knowledge on obsolete issue reports, and some are even counterintuitive. For example, we find that obsolete issue reports are mixed with other issue reports. Even when recent issue reports are obsolete, some old issue reports keep up-to-date.", "doi": "10.1109/ase51524.2021.9678543", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678543", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678543"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678543"}
{"title": "Did You Do Your Homework? Raising Awareness on Software Fairness and Discrimination", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Max Hort", "Federica Sarro"], "abstract": "Machine Learning is a vital part of various modern day decision making software. At the same time, it has shown to exhibit bias, which can cause an unjust treatment of individuals and population groups. One method to achieve fairness in machine learning software is to provide individuals with the same degree of benefit, regardless of sensitive attributes (e.g., students receive the same grade, independent of their sex or race). However, there can be other attributes that one might want to discriminate against (e.g., students with homework should receive higher grades). We will call such attributes anti-protected attributes. When reducing the bias of machine learning software, one risks the loss of discriminatory behaviour of anti-protected attributes. To combat this, we use grid search to show that machine learning software can be debiased (e.g., reduce gender bias) while also improving the ability to discriminate against anti-protected attributes.", "doi": "10.1109/ase51524.2021.9678568", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678568", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678568"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678568"}
{"title": "Shake Those System Parameters! On the Need for Parameter Coverage for Decision Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Laurent", "Paolo Arcaini", "Fuyuki Ishikawa", "Anthony Ventresque"], "abstract": "Decision systems such as Multiple-Criteria Decision Analysis systems formulate a decision process in terms of a mathematical function that takes into consideration different aspects of a problem. Testing such systems is crucial, as they are usually employed in safety-critical systems. A good test suite for these systems should be able to exercise all the possible types of decisions that can be taken by the system. Classic structural coverage criteria do not provide good test suites in this sense, as they can be fulfilled by simple tests that only cover one possible type of decision. Thus, in this paper we discuss the need for tailored coverage criteria for this class of systems, and we propose a criterion based on the perturbation of the decision systems’ parameters. We demonstrate the effectiveness of the criterion, compared to classic structural coverage criteria, on a path planner system for autonomous driving. We also discuss other benefits, such as the criterion helping explain why a decision was made during a test.", "doi": "10.1109/ase51524.2021.9678593", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678593", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678593"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678593"}
{"title": "What do pre-trained code models know about code?", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anjan Karmakar", "Romain Robbes"], "abstract": "Pre-trained models of code built on the transformer architecture have performed well on software engineering (SE) tasks such as predictive code generation, code summarization, among others. However, whether the vector representations from these pre-trained models comprehensively encode characteristics of source code well enough to be applicable to a broad spectrum of downstream tasks remains an open question.One way to investigate this is with diagnostic tasks called probes. In this paper, we construct four probing tasks (probing for surface-level, syntactic, structural, and semantic information) for pre-trained code models. We show how probes can be used to identify whether models are deficient in (understanding) certain code properties, characterize different model layers, and get insight into the model sample-efficiency.We probe four models that vary in their expected knowledge of code properties: BERT (pre-trained on English), CodeBERT and CodeBERTa (pre-trained on source code, and natural language documentation), and GraphCodeBERT (pre-trained on source code with dataflow). While GraphCodeBERT performs more consistently overall, we find that BERT performs surprisingly well on some code tasks, which calls for further investigation.", "doi": "10.1109/ase51524.2021.9678927", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678927", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678927"], "github": ["https://github.com/giganticode/probes"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678927"}
{"title": "Towards Systematic and Dynamic Task Allocation for Collaborative Parallel Fuzzing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Van-Thuan Pham", "Manh-Dung Nguyen", "Quang-Trung Ta", "Toby Murray", "Benjamin I. P. Rubinstein"], "abstract": "Parallel coverage-guided greybox fuzzing is the most common setup for vulnerability discovery at scale. However, so far it has received little attention from the research community compared to single-mode fuzzing, leaving open several problems particularly in its task allocation strategies. Current approaches focus on managing micro tasks, at the seed input level, and their task division algorithms are either ad-hoc or static. In this paper, we leverage research on graph partitioning and search algorithms to propose a systematic and dynamic task allocation solution that works at the macro-task level. First, we design an attributed graph to capture both the program structures (e.g., program call graph) and fuzzing information (e.g., branch hit counts, bug discovery probability). Second, our graph partitioning algorithm divides the global program search space into sub-search-spaces. Finally our search algorithm prioritizes these sub-search-spaces (i.e., tasks) and explores them to maximize code coverage and number of bugs found. The results are collected to update the graph and guide further iterations of partitioning and exploration. We implemented a prototype tool called AFLTeam. In our preliminary experiments on well-tested benchmarks, AFLTeam achieved higher code coverage (up to 16.4% branch coverage improvement) compared to the default parallel mode of AFL and discovered 2 zero-day bugs in FFmpeg and JasPer toolkits.", "doi": "10.1109/ase51524.2021.9678810", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678810", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678810"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678810"}
{"title": "Systematic Testing of Autonomous Driving Systems Using Map Topology-Based Scenario Classification", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yun Tang", "Yuan Zhou", "Tianwei Zhang", "Fenghua Wu", "Yang Liu", "Gang Wang"], "abstract": "Autonomous Driving Systems (ADSs), which replace humans to drive vehicles, are complex software systems deployed in autonomous vehicles (AVs). Since the execution of ADSs highly relies on maps, it is essential to perform global map-based testing for ADSs to guarantee their correctness and AVs’ safety in different situations. Existing methods focus more on specific scenarios rather than global testing throughout the map. Testing on a global map is challenging since the complex lane connections in a map can generate enormous scenarios. In this work, we propose ATLAS, an approach to ADSs’ collision avoidance testing using map topology-based scenario classification. The core insight of ATLAS is to generate diverse testing scenarios by classifying junction lanes according to their topology-based interaction patterns. First, ATLAS divides the junction lanes into different classes such that an ADS can execute similar collision avoidance maneuvers on the lanes in the same class. Second, for each class, ATLAS selects one junction lane to construct the testing scenario and generate test cases using a genetic algorithm. Finally, we implement and evaluate ATLAS on Baidu Apollo with the LGSVL simulator on the San Francisco map. Results show that ATLAS exposes nine types of real issues in Apollo 6.0 and reduces the number of junction lanes for testing by 98%.", "doi": "10.1109/ase51524.2021.9678735", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678735", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678735"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678735"}
{"title": "Adaptation2: Adapting Specification Learners in Assured Adaptive Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dalal Alrajeh", "Patrick Benjamin", "Sebastián Uchitel"], "abstract": "Specification learning and controller synthesis are two methods that promise to provide control systems with assured adaptive capabilities at run-time. Specification learning can automatically update specifications in light of violation traces observed within the operational environment. Controller synthesis can then automatically generate implementations that are guaranteed to satisfy these specifications in every environment.Specification learning is implemented using general-purpose AI systems. These systems are highly configurable, and the configuration choice heavily affects the effectiveness. Setting configuration parameters is far from obvious as they bear no clear semantic relation with the adaptation task. State of the art requires configurations to be set by domain experts at design time for each application domain.In this paper, we argue that to create assured control systems that can effectively and efficiently adapt at run-time, the learning systems upon which they are built must also have adaptive learning strategies for determining configurations at runtime. We demonstrate this idea with a proof-of-concept that computes domain-dependent policies using reinforcement learning.", "doi": "10.1109/ase51524.2021.9678919", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678919", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678919"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678919"}
{"title": "Log Anomaly to Resolution: AI Based Proactive Incident Remediation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ruchi Mahindru", "Harshit Kumar", "Sahil Bansal"], "abstract": "Based on 2020 SRE report, 80% of SREs work on postmortem analysis of incidents due to lack of provided information and 16% of toil come from investigating false positives/negatives. As a cloud service provider, the desire is to proactively identify signals that can help reduce outages and/or reduce the mean time to resolution. By leveraging AI for Operations (AIOps), this work proposes a novel methodology for proactive identification of log anomalies and its resolutions by sifting through the log lines. Typically, relevant information to retrieve resolutions corresponding to logs is spread across multiple heterogeneous corpora that exist in silos, namely historical ticket data, historical log data, and symptom resolution available in product documentation, for example. In this paper, we focus on augmented dataset preparation from multiple heterogeneous corpora, metadata selection and prediction, and finally, using these elements during run-time to retrieve contextual resolutions for signals triggered via logs. For early evaluation, we used logs from a production middleware application server, predicted log anomalies and their resolutions, and conducted qualitative evaluation with subject matter experts; the accuracy of metadata prediction and resolution retrieval are 78.57% and 65.7%, respectively.", "doi": "10.1109/ase51524.2021.9678815", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678815", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678815"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678815"}
{"title": "HyperGI: Automated Detection and Repair of Information Flow Leakage", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ibrahim Mesecan", "Daniel Blackwell", "David Clark", "Myra B. Cohen", "Justyna Petke"], "abstract": "Maintaining confidential information control in soft-ware is a persistent security problem where failure means secrets can be revealed via program behaviors. Information flow control techniques traditionally have been based on static or symbolic analyses — limited in scalability and specialized to particular languages. When programs do leak secrets there are no approaches to automatically repair them unless the leak causes a functional test to fail. We present our vision for HyperGI, a genetic improvement framework that detects, localizes and repairs information leakage. Key elements of HyperGI include (1) the use of two orthogonal test suites, (2) a dynamic leak detection approach which estimates and localizes potential leaks, and (3) a repair component that produces a candidate patch using genetic improvement. We demonstrate the successful use of HyperGI on several programs with no failing functional test cases. We manually examine the resulting patches and identify trade-offs and future directions for fully realizing our vision.", "doi": "10.1109/ase51524.2021.9678758", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678758", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678758"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678758"}
{"title": "Privacy as first-class requirements in software development: A socio-technical approach", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yizhaq Benbenisty", "Irit Hadar", "Gil Luria", "Paola Spoletini"], "abstract": "Privacy requirements have become increasingly important as information about us is continuously accumulated and digitally stored. However, despite the many proposed methodologies and tools to address these requirements, privacy engineering is often underperformed in most domains of the software industry. Two of the major reasons underlying this under-performance are (1) the low expertise and understanding of privacy by the two main actors in requirements engineering: users and analysts, and (2) the fact that software developers often do not perceive privacy requirements as a priority for their companies, thus neglecting to meet these requirements even when they do have the required knowledge, skills, and supporting tools to do so. To address these two problems, we propose to integrate knowledge from software engineering and organizational psychology in an iterative, customizable, socio-technical environment. Such environment has the potential to support the design of systems by providing technical tools for eliciting, modeling, and designing privacy aspects, thus addressing the knowledge gap of both data subjects and analysts, and social mechanisms for achieving a supportive and sustainable organizational privacy climate within a company, thus reorienting the organizational attention and engagement toward addressing privacy requirements.", "doi": "10.1109/ase51524.2021.9678872", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678872", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678872"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678872"}
{"title": "Towards Fluid Software Architectures: Bidirectional Human-AI Interaction", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ammar Yasser", "Mervat Abu-Elkheir"], "abstract": "The research on engineering software applications that employ artificial intelligence (AI) and machine learning (ML) is at an all-time peak. However, most of the research in this area is focused on the interactions between humans and AI which, in turn, is predominantly concerned with either building immersive interfaces and user experiences that allow for increased telemetry or on handling AI and ML applications in production (MLOps). Nonetheless, the research on fundamental architectural differences between AI-powered applications and traditional ones did not receive its fair share of attention. To that end, we believe that a new take on the fundamental architecture of building software applications is needed. With the ever increasing prominence of content-driven AI-powered applications, it is our conviction that 1) content could be served by servers without clients requesting, 2) servers could (should) request data from clients without waiting for their requests, and 3) interfaces should dynamically adapt to updates that happen to the intelligence driving the application. Hence, in this paper, we propose the fluid architecture that facilitates the bidirectional interaction between clients and servers as well as accommodates the co-dependent evolution of interfaces and back-end intelligence in AI-powered systems.", "doi": "10.1109/ase51524.2021.9678647", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678647", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678647"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678647"}
{"title": "Bugs4Q: A Benchmark of Real Bugs for Quantum Programs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pengzhan Zhao", "Jianjun Zhao", "Zhongtao Miao", "Shuhan Lan"], "abstract": "Realistic benchmarks of reproducible bugs and fixes are vital to good experimental evaluation of debugging and testing approaches. However, there is no suitable benchmark suite that can systematically evaluate the debugging and testing methods of quantum programs until now. This paper proposes Bugs4Q, a benchmark of thirty-six real, manually validated Qiskit bugs from four popular Qiskit elements (Terra, Aer, Ignis, and Aqua), supplemented with the test cases for reproducing buggy behaviors. Bugs4Q also provides interfaces for accessing the buggy and fixed versions of the Qiskit programs and executing the corresponding test cases, facilitating the reproducible empirical studies and comparisons of Qiskit program debugging and testing tools. Bugs4Q is publicly available at https://github.com/Z-928/Bugs4Q", "doi": "10.1109/ase51524.2021.9678908", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678908", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678908"], "github": ["https://github.com/Z-928/Bugs4Q", "https://github.com/z-928/bugs4q"], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678908"}
{"title": "Assessing Robustness of ML-Based Program Analysis Tools using Metamorphic Program Transformations", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Leonhard Applis", "Annibale Panichella", "Arie van Deursen"], "abstract": "Metamorphic testing is a well-established testing technique that has been successfully applied in various domains, including testing deep learning models to assess their robustness against data noise or malicious input. Currently, metamorphic testing approaches for machine learning (ML) models focused on image processing and object recognition tasks. Hence, these approaches cannot be applied to ML targeting program analysis tasks. In this paper, we extend metamorphic testing approaches for ML models targeting software programs. We present LAMPION, a novel testing framework that applies (semantics preserving) metamorphic transformations on the test datasets. LAMPION produces new code snippets equivalent to the original test set but different in their identifiers or syntactic structure. We evaluate LAMPION against CodeBERT, a state-of-the-art ML model for Code-To-Text tasks that creates Javadoc summaries for given Java methods. Our results show that simple transformations significantly impact the target model behavior, providing additional information on the models reasoning apart from the classic performance metric.", "doi": "10.1109/ase51524.2021.9678706", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678706", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678706"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678706"}
{"title": "Defeating Program Analysis Techniques via Ambiguous Translation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chijung Jung", "Doowon Kim", "Weihang Wang", "Yunhui Zheng", "Kyu Hyung Lee", "Yonghwi Kwon"], "abstract": "This research explores the possibility of a new anti-analysis technique, carefully designed to attack weaknesses of the existing program analysis approaches. It encodes a program code snippet to hide, and its decoding process is implemented by a sophisticated state machine that produces multiple outputs depending on inputs. The key idea of the proposed technique is to ambiguously decode the program code, resulting in multiple decoded code snippets that are challenging to distinguish from each other. Our approach is stealthier than previous similar approaches as its execution does not exhibit different behaviors between when it decodes correctly or incorrectly. This paper also presents analyses of weaknesses of existing techniques and discusses potential improvements. We implement and evaluate the proof of concept approach, and our preliminary results show that the proposed technique imposes various new unique challenges to the program analysis technique.", "doi": "10.1109/ase51524.2021.9678912", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678912", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678912"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678912"}
{"title": "A Program Synthesis Approach for Adding Architectural Tactics to An Existing Code Base", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Shokri"], "abstract": "Automatically constructing a program based on given specifications has been studied for decades. Despite the advances in the field of Program Synthesis, the current approaches suffer from a twofold issue: highly relying on the programmer for providing the specifications, and leaving the task of incorporating the synthesized code in an existing code base to program developers. Due to its program-wide effects, synthesizing an architectural tactic and reusing it in a program is even more challenging. Architectural tactics need to be synthesized based on the context of different locations of the program, broken down to smaller pieces, and added to corresponding locations in the code. Moreover, each piece needs to establish correct data- and control-dependencies to its surrounding environment as well as to the other synthesized pieces. This is an error-prone and challenging task, especially for novice program developers. In this paper, we introduce a novel program synthesis approach that synthesizes and adds architectural tactics to an existing code base.", "doi": "10.1109/ase51524.2021.9678705", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678705", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678705", "https://arxiv.org/pdf/2108.07117"], "github": [], "is_oa": true, "sources": ["papervault", "open-arxiv"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678705", "journal_ref": "2021 36th IEEE/ACM International Conference on Automated Software\n  Engineering (ASE)", "categories": "cs.SE", "cited_by": 0}
{"title": "Program Synthesis with Algorithm Pseudocode Guidance", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zihui Wang"], "abstract": "The limitation of the current program synthesis method is that the synthesized program is small in scale and simple in logic. In this work, we introduce an effective program synthesis approach based on algorithm pseudocode. By parsing the pseudocode, critical information like control structure framework and variable names can be obtained which are used to guide the process of synthesis. Experiments show that information extracted from pseudocode helps to reduce the space of programs and enhance the ability of the synthesizer. It can synthesize some complex programs with control structures.", "doi": "10.1109/ase51524.2021.9678657", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678657", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678657"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678657"}
{"title": "py2src: Towards the Automatic (and Reliable) Identification of Sources for PyPI Package", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Duc-Ly Vu"], "abstract": "Selecting which libraries (‘dependencies’ or ‘packages’ in the industry’s jargon) to adopt in a project is an essential task in software development. The quality of the corresponding source code is a key factor behind this selection (from security to timeliness). Yet, how easy is it to find the ‘actual’ source? How reliable is this information? To address this problem, we developed an approach called py2src to automatically identify GitHub source code repositories corresponding to packages in PyPI and automatically provide an indicator of the reliability of such information. We also report a preliminary empirical evaluation of the approach on the top PyPI packages.", "doi": "10.1109/ase51524.2021.9678526", "arxiv_id": "https://doi.org/10.1109/ASE51524.2021.9678526", "pdf_urls": ["https://arxiv.org/pdf/https://doi.org/10.1109/ASE51524.2021.9678526"], "github": [], "is_oa": true, "sources": ["papervault"], "type": "conference", "landing": "https://doi.org/10.1109/ASE51524.2021.9678526"}
{"title": "Generation of coherent radiation by magnetization reversal in graphene", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov", "V.K. Henner", "and T.S. Belozerova"], "abstract": "  Local magnetic moments can be created in graphene by incorporating different\ndefects. The possibility of regulating dynamics of magnetization in graphene,\nby employing the Purcell effect, is analyzed. The role of the system parameters\nin magnetization reversal is studied. The characteristics of such a reversal\ncan be varied in a wide range, which can be used for various applications in\nspintronics. It is shown that fast magnetization reversal generates coherent\nradiation.\n", "doi": "10.1088/1612-2011/13/1/016001", "arxiv_id": "1601.00464", "pdf_urls": ["https://arxiv.org/pdf/1601.00464"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 13 (2016) 016001", "categories": "cond-mat.mes-hall"}
{"title": "Stable and mobile two-dimensional dipolar ring-dark-in-bright\n  Bose-Einstein condensate soliton", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. K. Adhikari"], "abstract": "  We demonstrate robust, stable, mobile two-dimensional (2D) dipolar\nring-dark-in-bright (RDB) Bose-Einstein condensate (BEC) solitons for repulsive\ncontact interaction, subject to a harmonic trap along the $y$ direction\nperpendicular to the polarization direction $z$. Such a RDB soliton has a\nring-shaped notch (zero in density) imprinted on a 2D bright soliton free to\nmove in the $x-z$ plane. At medium velocity the head-on collision of two such\nsolitons is found to be quasi elastic with practically no deformation. The\npossibility of creating the RDB soliton by phase imprinting is demonstrated.\nThe findings are illustrated using numerical simulation employing realistic\ninteraction parameters in a dipolar $^{164}$Dy BEC.\n", "doi": "10.1088/1612-2011/13/3/035502", "arxiv_id": "1601.01519", "pdf_urls": ["https://arxiv.org/pdf/1601.01519"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 13 (2016) 035502", "categories": "cond-mat.quant-gas nlin.PS"}
{"title": "Analytic isolation of newforms of given level", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Paul D. Nelson"], "abstract": "  We describe a method for understanding averages over newforms on\n$\\Gamma_0(q)$ in terms of averages over all forms of some level. The method is\nsimplest when $q$ is divisible by the cubes of its prime divisors.\n", "doi": null, "arxiv_id": "1601.02530", "pdf_urls": ["https://arxiv.org/pdf/1601.02530"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 108 (2017), no. 6, 555-568", "categories": "math.NT"}
{"title": "Evolution and entanglement of Gaussian states in the parametric\n  amplifier", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julio A. L\\'opez-Sald\\'ivar", "Armando Figueroa", "Octavio Casta\\~nos", "Ram\\'on L\\'opez-Pe\\~na", "Margarita A. Man'ko", "Vladimir I. Man'ko"], "abstract": "  The linear time-dependent constants of motion of the parametric amplifier are\nobtained and used to determine in the tomographic-probability representation\nthe evolution of a general two-mode Gaussian state. By means of the\ndiscretization of the continuous variable density matrix, the von Neumann and\nlinear entropies are calculated to measure the entanglement properties between\nthe modes of the amplifier. The obtained results for the nonlocal correlations\nare compared with those associated to a linear map of discretized symplectic\nGaussian-state tomogram onto a qubit tomogram. This qubit portrait procedure is\nused to establish Bell-type's inequalities, which provide a necessary condition\nto determine the separability of quantum states, which can be evaluated through\nhomodyne detection. Other no-signaling nonlocal correlations are defined\nthrough the portrait procedure for noncomposite systems.\n", "doi": "10.1007/s10946-016-9543-2", "arxiv_id": "1601.03021", "pdf_urls": ["https://arxiv.org/pdf/1601.03021"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, 37(1), 23-44, 2016", "categories": "quant-ph"}
{"title": "Photo-transmutation of long-lived radionuclide Cs-135 by laser-plasma\n  driven electron source", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["X.L. Wang", "W. Luo", "Z.C. Zhu", "X.D. Wang", "and Y.M. Song"], "abstract": "  Relativistic electrons, accelerated by the laser ponderomotive force, can be\nfocused onto a high-Z convertor to generate high-brightness beams of\ngamma-rays, which in turn can be used to induce photonuclear reactions. In this\nwork, the possibility of photo-transmutation of long-lived radionuclide Cs-135\nby laser-plasma driven electron source has been demonstrated through Geant4\nsimulations. High energy electron generation, bremsstrahlung and photonuclear\nreaction have been observed at four different laser intensities of 10^{20}\nW/cm^2, 5 times 10^{20} W/cm^2, 10^{21} W/cm^2 and 5 times 10^{21} W/cm^2,\nrespectively. It was shown that the laser intensity and the target geometry\nhave strong effect on the transmutation reaction yield. At different laser\nintensities the recommended target sizes were found to obtain the maximum\nreaction yield. The remarkable feature of this work is to evaluate the optimal\nlaser intensity to produce maximum reaction yield of 10^8 per Joule in laser\npulse energy, which is 10^{21} W/cm^2. Our study suggests photo-transmutation\ndriven by laser-based electron source as a promising approach for experimental\nresearch into transmutation reactions, with potential applications to nuclear\nwaste management.\n", "doi": "10.1017/s0263034616000318", "arxiv_id": "1601.03369", "pdf_urls": ["https://arxiv.org/pdf/1601.03369"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser and Particle Beams 34 (2016) 433", "categories": "physics.plasm-ph"}
{"title": "Hyperconcentration for multipartite entanglement via linear optics", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xihan Li and Shohini Ghose"], "abstract": "  We present a hyperconcentration scheme for nonlocal $N$-photon hyperentangled\nGreenberger-Horne-Zeilinger states. The maximally hyperentangled state, in\nwhich $N$ particles are entangled simultaneously in the polarization and the\nspatial mode, can be obtained with a certain probability from two partially\nhyperentangled states. The hyperconcentration scheme is based on one\npolarization parity check measurement, one spatial mode parity check\nmeasurement and N-2 single-photon two-qubit measurements. The concentration\nonly requires linear optical elements, which makes it feasible and practical\nwith current technology.\n", "doi": "10.1088/1612-2011/11/12/125201", "arxiv_id": "1601.03755", "pdf_urls": ["https://arxiv.org/pdf/1601.03755"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 11 (2014) 125201", "categories": "quant-ph"}
{"title": "Incommensurate phases of a bosonic two-leg ladder under a flux", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Edmond Orignac (ENS-Lyon)", "Roberta Citro (Salerno)", "Mario Di Dio\n  (Trieste)", "Stefania De Palo (Trieste)", "Maria-Luisa Chiofalo (Pisa)"], "abstract": "  A boson two--leg ladder in the presence of a synthetic magnetic flux is\ninvestigated by means of bosonization techniques and Density Matrix\nRenormalization Group (DMRG). We follow the quantum phase transition from the\ncommensurate Meissner to the incommensurate vortex phase with increasing flux\nat different fillings. When the applied flux is $\\rho \\pi$ and close to it,\nwhere $\\rho$ is the filling per rung, we find a second incommensuration in the\nvortex state that affects physical observables such as the momentum\ndistribution, the rung-rung correlation function and the spin-spin and\ncharge-charge static structure factors.\n", "doi": "10.1088/1367-2630/18/5/055017", "arxiv_id": "1601.06573", "pdf_urls": ["https://arxiv.org/pdf/1601.06573"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "New Journal of Physics, 18, 055017 (2016) : Focus on Strongly\n  Interacting Quantum Gases in One Dimension", "categories": "cond-mat.quant-gas cond-mat.str-el"}
{"title": "A First Attempt to Cloud-Based User Verification in Distributed System", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marcin Wozniak", "Dawid Polap", "Grzegorz Borowik", "Christian Napoli"], "abstract": "  In this paper, the idea of client verification in distributed systems is\npresented. The proposed solution presents a sample system where client\nverification through cloud resources using input signature is discussed. For\ndifferent signatures the proposed method has been examined. Research results\nare presented and discussed to show potential advantages.\n", "doi": "10.1109/apcase.2015.47", "arxiv_id": "1601.07446", "pdf_urls": ["https://arxiv.org/pdf/1601.07446"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Asia-Pacific Conference on Computer Aided System Engineering\n  (APCASE), pp. 226-231 (2015)", "categories": "cs.NE cs.AI cs.CR cs.DC"}
{"title": "Numerical Study of the Sedimentation of Spheroidal Particles", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mehdi Niazi Ardekani", "Pedro Costa", "Wim-Paul Breugem", "Luca Brandt"], "abstract": "  The gravity-driven motion of rigid particles in a viscous fluid is relevant\nin many natural and industrial processes, yet this has mainly been investigated\nfor spherical particles. We therefore consider the sedimentation of\nnon-spherical (spheroidal) isolated and particle pairs in a viscous fluid via\nnumerical simulations using the Immersed Boundary Method. The simulations\nperformed here show that the critical Galileo number for the onset of secondary\nmotions decreases as the spheroid aspect ratio departs from 1. Above this\ncritical threshold, oblate particles perform a zigzagging motion whereas\nprolate particles rotate around the vertical axis while having their broad side\nfacing the falling direction. Instabilities of the vortices in the wake follow\nwhen farther increasing the Galileo number. We also study the\ndrafting-kissing-tumbling associated with the settling of particle pairs. We\nfind that the interaction time increases significantly for non-spherical\nparticles and, more interestingly, spheroidal particles are attracted from\nlarger lateral displacements. This has important implications for the\nestimation of collision kernels and can result in increasing clustering in\nsuspensions of sedimenting spheroids.\n", "doi": "10.1016/j.ijmultiphaseflow.2016.08.005", "arxiv_id": "1602.05769", "pdf_urls": ["https://arxiv.org/pdf/1602.05769"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Int. J. Multiphase Flow 87 (2016) 16-34", "categories": "physics.flu-dyn"}
{"title": "Systematic reviews in paediatric multiple sclerosis and\n  Creutzfeldt-Jakob disease exemplify shortcomings in methods used to evaluate\n  therapies in rare conditions", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Steffen Unkel", "Christian R\\\"over", "Nigel Stallard", "Norbert Benda", "Martin Posch", "Sarah Zohar", "Tim Friede"], "abstract": "  BACKGROUND: Randomized controlled trials (RCTs) are the gold standard design\nof clinical research to assess interventions. However, RCTs cannot always be\napplied for practical or ethical reasons. To investigate the current practices\nin rare diseases, we review evaluations of therapeutic interventions in\npaediatric multiple sclerosis (MS) and Creutzfeldt-Jakob disease (CJD). In\nparticular, we shed light on the endpoints used, the study designs implemented\nand the statistical methodologies applied.\n  METHODS: We conducted literature searches to identify relevant primary\nstudies. Data on study design, objectives, endpoints, patient characteristics,\nrandomization and masking, type of intervention, control, withdrawals and\nstatistical methodology were extracted from the selected studies. The risk of\nbias and the quality of the studies were assessed.\n  RESULTS: Twelve (seven) primary studies on paediatric MS (CJD) were included\nin the qualitative synthesis. No double-blind, randomized placebo-controlled\ntrial for evaluating interventions in paediatric MS has been published yet.\nEvidence from one open-label RCT is available. The observational studies are\nbefore-after studies or controlled studies. Three of the seven selected studies\non CJD are RCTs, of which two received the maximum mark on the Oxford Quality\nScale. Four trials are controlled observational studies.\n  CONCLUSIONS: Evidence from double-blind RCTs on the efficacy of treatments\nappears to be variable between rare diseases. With regard to paediatric\nconditions it remains to be seen what impact regulators will have through e.g.,\npaediatric investigation plans. Overall, there is space for improvement by\nusing innovative trial designs and data analysis techniques.\n", "doi": "10.1186/s13023-016-0402-6", "arxiv_id": "1602.07207", "pdf_urls": ["https://arxiv.org/pdf/1602.07207"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Orphanet Journal of Rare Diseases, 11:16, 2016", "categories": "q-bio.QM stat.AP"}
{"title": "A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Claudio Corrodi", "Alexander Heu{\\ss}ner", "Christopher M. Poskitt"], "abstract": "  A number of novel programming languages and libraries have been proposed that\noffer simpler-to-use models of concurrency than threads. It is challenging,\nhowever, to devise execution models that successfully realise their\nabstractions without forfeiting performance or introducing unintended\nbehaviours. This is exemplified by SCOOP---a concurrent object-oriented\nmessage-passing language---which has seen multiple semantics proposed and\nimplemented over its evolution. We propose a \"semantics workbench\" with fully\nand semi-automatic tools for SCOOP, that can be used to analyse and compare\nprograms with respect to different execution models. We demonstrate its use in\nchecking the consistency of semantics by applying it to a set of representative\nprograms, and highlighting a deadlock-related discrepancy between the principal\nexecution models of the language. Our workbench is based on a modular and\nparameterisable graph transformation semantics implemented in the GROOVE tool.\nWe discuss how graph transformations are leveraged to atomically model\nintricate language abstractions, and how the visual yet algebraic nature of the\nmodel can be used to ascertain soundness.\n", "doi": "10.1007/978-3-662-49665-7_3", "arxiv_id": "1603.00307", "pdf_urls": ["https://arxiv.org/pdf/1603.00307"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. International Conference on Fundamental Approaches to\n  Software Engineering (FASE 2016), volume 9633 of LNCS, pages 31-48. Springer,\n  2016", "categories": "cs.SE cs.DC cs.LO cs.PL"}
{"title": "LOFS: Library of Online Streaming Feature Selection", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kui Yu", "Wei Ding", "Xindong Wu"], "abstract": "  As an emerging research direction, online streaming feature selection deals\nwith sequentially added dimensions in a feature space while the number of data\ninstances is fixed. Online streaming feature selection provides a new,\ncomplementary algorithmic methodology to enrich online feature selection,\nespecially targets to high dimensionality in big data analytics. This paper\nintroduces the first comprehensive open-source library for use in MATLAB that\nimplements the state-of-the-art algorithms of online streaming feature\nselection. The library is designed to facilitate the development of new\nalgorithms in this exciting research direction and make comparisons between the\nnew methods and existing ones available.\n", "doi": null, "arxiv_id": "1603.00531", "pdf_urls": ["https://arxiv.org/pdf/1603.00531"], "github": ["https://github.com/kuiy/LOFS"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-based Systems, 113(2016):1-3", "categories": "cs.LG stat.ML"}
{"title": "Classifier ensemble creation via false labelling", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["B\\'alint Antal"], "abstract": "  In this paper, a novel approach to classifier ensemble creation is presented.\nWhile other ensemble creation techniques are based on careful selection of\nexisting classifiers or preprocessing of the data, the presented approach\nautomatically creates an optimal labelling for a number of classifiers, which\nare then assigned to the original data instances and fed to classifiers. The\napproach has been evaluated on high-dimensional biomedical datasets. The\nresults show that the approach outperformed individual approaches in all cases.\n", "doi": "10.1016/j.knosys.2015.07.009", "arxiv_id": "1603.01716", "pdf_urls": ["https://arxiv.org/pdf/1603.01716"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-based Systems 89: pp. 278-287. (2015)", "categories": "cs.LG"}
{"title": "Bose-condensed atomic systems with nonlocal interaction potentials", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov and E.P. Yukalova"], "abstract": "  The general approach for describing systems with Bose-Einstein condensate,\nwhere atoms interact through nonlocal pair potentials, is presented. A special\nattention is paid to nonintegrable potentials, such as the dipolar interaction\npotential. The potentials that are not absolutely integrable can have not well\ndefined Fourier transforms. Using formally such not defined Fourier transforms\nleads to unphysical conclusions. For making the Fourier transform well defined,\nthe interaction potential has to be regularized. This is illustrated by the\nexample of dipolar interactions.\n", "doi": null, "arxiv_id": "1603.03247", "pdf_urls": ["https://arxiv.org/pdf/1603.03247"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 26 (2016) 045501", "categories": "cond-mat.quant-gas cond-mat.stat-mech"}
{"title": "The Infinitesimal Phase Response Curves of Oscillators in Piecewise\n  Smooth Dynamical Systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Youngmin Park and Kendrick M. Shaw and Hillel J. Chiel and Peter J.\n  Thomas"], "abstract": "  The asymptotic phase $\\theta$ of an initial point $x$ in the stable manifold\nof a limit cycle identifies the phase of the point on the limit cycle to which\nthe flow $\\phi_t(x)$ converges as $t\\to\\infty$. The infinitesimal phase\nresponse curve (iPRC) quantifies the change in timing due to a small\nperturbation of a limit cycle trajectory. For a stable limit cycle in a smooth\ndynamical system the iPRC is the gradient $\\nabla_x(\\theta)$ of the phase\nfunction, which can be obtained via the adjoint of the variational equation.\nFor systems with discontinuous dynamics, the standard approach to obtaining the\niPRC fails. We derive a formula for the infinitesimal phase response curves\n(iPRCs) of limit cycles occurring in piecewise smooth (Filipov) dynamical\nsystems of arbitrary dimension, subject to a transverse flow condition.\nDiscontinuous jumps in the iPRC can occur at the boundaries separating\nsubdomains, and are captured by a linear matching condition. The matching\nmatrix, $M$, can be derived from the saltation matrix arising in the associated\nvariational problem. For the special case of linear dynamics away from\nswitching boundaries, we obtain an explicit expression for the iPRC. We present\nexamples from cell biology (Glass networks) and neuroscience (central pattern\ngenerator models). We apply the iPRCs obtained to study synchronization and\nphase-locking in piecewise smooth limit cycle systems in which synchronization\narises solely due to the crossing of switching manifolds.\n", "doi": "10.1017/s0956792518000128", "arxiv_id": "1603.03503", "pdf_urls": ["https://arxiv.org/pdf/1603.03503"], "github": ["https://github.com/youngmp/pwl_iprc"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "PARK, Y., SHAW, K., CHIEL, H., & THOMAS, P. (2018). The\n  infinitesimal phase response curves of oscillators in piecewise smooth\n  dynamical systems. European Journal of Applied Mathematics, 1-36.\n  doi:10.1017/S0956792518000128", "categories": "math.DS"}
{"title": "The Fourier expansion of \\eta(z)\\eta(2z)\\eta(3z)/\\eta(6z)", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christian Kassel and Christophe Reutenauer"], "abstract": "  We compute the Fourier coefficients of the weight one modular form\n$\\eta(z)\\eta(2z)\\eta(3z)/\\eta(6z)$ in terms of the number of representations of\nan integer as a sum of two squares. We deduce a relation between this modular\nform and translates of the modular form $\\eta(z)^4/\\eta(2z)^2$. In the last\nsection we use our main result to give an elementary proof of an identity by\nVictor Kac.\n", "doi": "10.1007/s00013-017-1033-4", "arxiv_id": "1603.06357", "pdf_urls": ["https://arxiv.org/pdf/1603.06357"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 108(5) (2017), 453-463", "categories": "math.NT"}
{"title": "On the exponent of the automorphism group of a compact Riemann surface", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andreas Schweizer"], "abstract": "  Let $X$ be a compact Riemann surface of genus $g\\geq 2$, and let $Aut(X)$ be\nits group of automorphims. We show that the exponent of $Aut(X)$ is bounded by\n$42(g-1)$. We also determine explicitly the infinitely many values of $g$ for\nwhich this bound is reached and the corresponding groups. Finally we discuss\nrelated questions for subgroups $G$ of $Aut(X)$ that are subject to additional\nconditions, for example being solvable.\n", "doi": "10.1007/s00013-016-0933-z", "arxiv_id": "1603.06697", "pdf_urls": ["https://arxiv.org/pdf/1603.06697"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 107 (2016), 329-340", "categories": "math.CV math.AG math.GR"}
{"title": "Suita conjecture for a punctured torus", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Robert Xin Dong"], "abstract": "  For a once-punctured complex torus, we compare the Bergman kernel and the\nfundamental metric, by constructing explicitly the Evans-Selberg potential and\ndiscussing its asymptotic behaviors. This work aims to generalize the Suita\ntype results to potential-theoretically parabolic Riemann surfaces.\n", "doi": "10.1007/978-3-319-48812-7_25", "arxiv_id": "1603.09118", "pdf_urls": ["https://arxiv.org/pdf/1603.09118"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "New Trends in Analysis and Interdisciplinary Applications,\n  199--206, Trends in Mathematics, Birkh\\\"auser/Springer, Basel, 2017", "categories": "math.CV"}
{"title": "A Short Counterexample to the Inverse Generator Problem on\n  non-Hilbertian Reflexive $L^p$-spaces", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stephan Fackler"], "abstract": "  We show that the bilateral shift group on $L^p(\\mathbb{R})$ for $p \\in (1,\n\\infty) \\setminus \\{2\\}$ provides a counterexample to the inverse generator\nproblem.\n", "doi": "10.1007/s00013-015-0863-1", "arxiv_id": "1604.02293", "pdf_urls": ["https://arxiv.org/pdf/1604.02293"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 106 (2016), no. 4, 383-389", "categories": "math.FA"}
{"title": "Flat $\\delta$-vectors and their Ehrhart polynomials", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Takayuki Hibi", "Akiyoshi Tsuchiya"], "abstract": "  We call the $\\delta$-vector of an integral convex polytope of dimension $d$\nflat if the $\\delta$-vector is of the form\n$(1,0,\\ldots,0,a,\\ldots,a,0,\\ldots,0)$, where $a \\geq 1$. In this paper, we\ngive the complete characterization of possible flat $\\delta$-vectors. Moreover,\nfor an integral convex polytope $\\mathcal{P} \\subset \\mathbb{R}^N$ of dimension\n$d$, we let $i(\\mathcal{P},n)=|n\\mathcal{P} \\cap \\mathbb{Z}^N|$ and $\\\ni^*(\\mathcal{P},n)=|n(\\mathcal{P} \\setminus \\partial \\mathcal{P}) \\cap\n\\mathbb{Z}^N|.$ By this characterization, we show that for any $d \\geq 1$ and\nfor any $k,\\ell \\geq 0$ with $k+\\ell \\leq d-1$, there exist integral convex\npolytopes $\\mathcal{P}$ and $\\mathcal{Q}$ of dimension $d$ such that (i) For\n$t=1,\\ldots,k$, we have $i(\\mathcal{P},t)=i(\\mathcal{Q},t),$ (ii) For\n$t=1,\\ldots,\\ell$, we have $i^*(\\mathcal{P},t)=i^*(\\mathcal{Q},t)$ and (iii)\n$i(\\mathcal{P},k+1) \\neq i(\\mathcal{Q},k+1)$ and $i^*(\\mathcal{P},\\ell+1)\\neq\ni^*(\\mathcal{Q},\\ell+1).$\n", "doi": "10.1007/s00013-016-0985-0", "arxiv_id": "1604.02505", "pdf_urls": ["https://arxiv.org/pdf/1604.02505"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 108(2017), 151--157", "categories": "math.CO"}
{"title": "DISTEA: Efficient Dynamic Impact Analysis for Distributed Systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haipeng Cai and Douglas Thain"], "abstract": "  Dynamic impact analysis is a fundamental technique for understanding the\nimpact of specific program entities, or changes to them, on the rest of the\nprogram for concrete executions. However, existing techniques are either\ninapplicable or of very limited utility for distributed programs running in\nmultiple concurrent processes. This paper presents DISTEA, a technique and tool\nfor dynamic impact analysis of distributed systems. By partially ordering\ndistributed method-execution events and inferring causality from the ordered\nevents, DISTEA can predict impacts propagated both within and across process\nboundaries. We implemented DISTEA for Java and applied it to four distributed\nprograms of various types and sizes, including two enterprise systems. We also\nevaluated the precision and practical usefulness of DISTEA, and demonstrated\nits application in program comprehension, through two case studies. The results\nshow that DISTEA is highly scalable, more effective than existing alternatives,\nand instrumental to understanding distributed systems and their executions.\n", "doi": null, "arxiv_id": "1604.04638", "pdf_urls": ["https://arxiv.org/pdf/1604.04638"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "IEEE/ACM Automated Software Engineering (ASE), 2016", "categories": "cs.SE cs.DC"}
{"title": "An artificial intelligence tool for heterogeneous team formation in the\n  classroom", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Juan M. Alberola", "Elena Del Val", "Victor Sanchez-Anguix", "Alberto\n  Palomares and Maria Dolores Teruel"], "abstract": "  Nowadays, there is increasing interest in the development of teamwork skills\nin the educational context. This growing interest is motivated by its\npedagogical effectiveness and the fact that, in labour contexts, enterprises\norganize their employees in teams to carry out complex projects. Despite its\ncrucial importance in the classroom and industry, there is a lack of support\nfor the team formation process. Not only do many factors influence team\nperformance, but the problem becomes exponentially costly if teams are to be\noptimized. In this article, we propose a tool whose aim it is to cover such a\ngap. It combines artificial intelligence techniques such as coalition structure\ngeneration, Bayesian learning, and Belbin's role theory to facilitate the\ngeneration of working groups in an educational context. This tool improves\ncurrent state of the art proposals in three ways: i) it takes into account the\nfeedback of other teammates in order to establish the most predominant role of\na student instead of self-perception questionnaires; ii) it handles uncertainty\nwith regard to each student's predominant team role; iii) it is iterative since\nit considers information from several interactions in order to improve the\nestimation of role assignments. We tested the performance of the proposed tool\nin an experiment involving students that took part in three different team\nactivities. The experiments suggest that the proposed tool is able to improve\ndifferent teamwork aspects such as team dynamics and student satisfaction.\n", "doi": "10.1016/j.knosys.2016.02.010", "arxiv_id": "1604.04721", "pdf_urls": ["https://arxiv.org/pdf/1604.04721"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 2016", "categories": "cs.AI cs.CY cs.HC"}
{"title": "Nonequilibrium Kinetics of One-Dimensional Bose Gases", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["F. Baldovin", "A. Cappellaro", "E. Orlandini", "and L. Salasnich"], "abstract": "  We study cold dilute gases made of bosonic atoms, showing that in the\nmean-field one-dimensional regime they support stable out-of-equilibrium\nstates. Starting from the 3D Boltzmann-Vlasov equation with contact\ninteraction, we derive an effective 1D Landau-Vlasov equation under the\ncondition of a strong transverse harmonic confinement. We investigate the\nexistence of out-of-equilibrium states, obtaining stability criteria similar to\nthose of classical plasmas.\n", "doi": "10.1088/1742-5468/2016/06/063303", "arxiv_id": "1605.02220", "pdf_urls": ["https://arxiv.org/pdf/1605.02220"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Stat. Mech. (2016) 063303 (with the title \"Nonequilibrium\n  statistical mechanics in one-dimensional bose gases\")", "categories": "cond-mat.quant-gas cond-mat.stat-mech"}
{"title": "Verification of interlocking systems using statistical model checking", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Quentin Cappart", "Christophe Limbree", "Pierre Schaus", "Jean Quilbeuf", "Louis-Marie Traonouez", "Axel Legay"], "abstract": "  In the railway domain, an interlocking is the system ensuring safe train\ntraffic inside a station by controlling its active elements such as the signals\nor points. Modern interlockings are configured using particular data, called\napplication data, reflecting the track layout and defining the actions that the\ninterlocking can take. The safety of the train traffic relies thereby on\napplication data correctness, errors inside them can cause safety issues such\nas derailments or collisions. Given the high level of safety required by such a\nsystem, its verification is a critical concern. In addition to the safety, an\ninterlocking must also ensure that availability properties, stating that no\ntrain would be stopped forever in a station, are satisfied. Most of the\nresearch dealing with this verification relies on model checking. However, due\nto the state space explosion problem, this approach does not scale for large\nstations. More recently, a discrete event simulation approach limiting the\nverification to a set of likely scenarios, was proposed. The simulation enables\nthe verification of larger stations, but with no proof that all the interesting\nscenarios are covered by the simulation. In this paper, we apply an\nintermediate statistical model checking approach, offering both the advantages\nof model checking and simulation. Even if exhaustiveness is not obtained,\nstatistical model checking evaluates with a parametrizable confidence the\nreliability and the availability of the entire system.\n", "doi": "10.1109/hase.2017.10", "arxiv_id": "1605.02529", "pdf_urls": ["https://arxiv.org/pdf/1605.02529"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "IEEE 18th International Symposium on High Assurance Systems\n  Engineering (HASE), Singapore, pp. 61-68 (2017)", "categories": "cs.SE"}
{"title": "Recent Progress in Shearlet Theory: Systematic Construction of Shearlet\n  Dilation Groups, Characterization of Wavefront Sets, and New Embeddings", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giovanni S. Alberti", "Stephan Dahlke", "Filippo De Mari", "Ernesto De Vito", "Hartmut F\\\"uhr"], "abstract": "  The class of generalized shearlet dilation groups has recently been developed\nto allow the unified treatment of various shearlet groups and associated\nshearlet transforms that had previously been studied on a case-by-case basis.\nWe consider several aspects of these groups: First, their systematic\nconstruction from associative algebras, secondly, their suitability for the\ncharacterization of wavefront sets, and finally, the question of constructing\nembeddings into the symplectic group in a way that intertwines the\nquasi-regular representation with the metaplectic one. For all questions, it is\npossible to treat the full class of generalized shearlet groups in a\ncomprehensive and unified way, thus generalizing known results to an infinity\nof new cases. Our presentation emphasizes the interplay between the algebraic\nstructure underlying the construction of the shearlet dilation groups, the\ngeometric properties of the dual action, and the analytic properties of the\nassociated shearlet transforms.\n", "doi": "10.1007/978-3-319-55550-8_7", "arxiv_id": "1605.02873", "pdf_urls": ["https://arxiv.org/pdf/1605.02873"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Frames and Other Bases in Abstract and Function Spaces, Appl.\n  Numer. Harmon. Anal., 127-160, 2017", "categories": "math.FA"}
{"title": "Unbiased split variable selection for random survival forests using\n  maximally selected rank statistics", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marvin N. Wright", "Theresa Dankowski and Andreas Ziegler"], "abstract": "  The most popular approach for analyzing survival data is the Cox regression\nmodel. The Cox model may, however, be misspecified, and its proportionality\nassumption may not always be fulfilled. An alternative approach for survival\nprediction is random forests for survival outcomes. The standard split\ncriterion for random survival forests is the log-rank test statistics, which\nfavors splitting variables with many possible split points. Conditional\ninference forests avoid this split variable selection bias. However, linear\nrank statistics are utilized by default in conditional inference forests to\nselect the optimal splitting variable, which cannot detect non-linear effects\nin the independent variables. An alternative is to use maximally selected rank\nstatistics for the split point selection. As in conditional inference forests,\nsplitting variables are compared on the p-value scale. However, instead of the\nconditional Monte-Carlo approach used in conditional inference forests, p-value\napproximations are employed. We describe several p-value approximations and the\nimplementation of the proposed random forest approach. A simulation study\ndemonstrates that unbiased split variable selection is possible. However, there\nis a trade-off between unbiased split variable selection and runtime. In\nbenchmark studies of prediction performance on simulated and real datasets the\nnew method performs better than random survival forests if informative\ndichotomous variables are combined with uninformative variables with more\ncategories and better than conditional inference forests if non-linear\ncovariate effects are included. In a runtime comparison the method proves to be\ncomputationally faster than both alternatives, if a simple p-value\napproximation is used.\n", "doi": "10.1002/sim.7212", "arxiv_id": "1605.03391", "pdf_urls": ["https://arxiv.org/pdf/1605.03391"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Wright, M. N., Dankowski, T. & Ziegler, A. (2017). Unbiased split\n  variable selection for random survival forests using maximally selected rank\n  statistics. Statistics in Medicine 36:1272-1284", "categories": "stat.ML cs.LG"}
{"title": "Optical force on diseased blood cells: towards the optical sorting of\n  biological matter", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Juan Sebastian Totero Gongora and Andrea Fratalocchi"], "abstract": "  By employing a series of massively parallel ab-initio simulations, we study\nhow optical forces act on biological matter subject to morphological disease.\nAs a representative case study, we here consider the case of Plasmodium\nFalciparum on red blood cells (RBC) illuminated by a monochromatic plane wave.\nRealistic parameters for the geometry and the refractive index are then taken\nfrom published experiments. In our theoretical campaign, we study the\ndependence of the optical force on the disease stage for different incident\nwavelengths. We show that optical forces change significantly with the disease,\nwith amplitude variation in the hundreds of pN range. Our results open up new\navenues for the design of new optical systems for the treatment of human\ndisease.\n", "doi": "10.1016/j.optlaseng.2015.04.019", "arxiv_id": "1605.04509", "pdf_urls": ["https://arxiv.org/pdf/1605.04509"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering, Volume 76, January 2016, Pages\n  40-44, ISSN 0143-8166", "categories": "physics.optics physics.bio-ph physics.comp-ph physics.med-ph"}
{"title": "Abasy Atlas: A comprehensive inventory of systems, global network\n  properties and systems-level elements across bacteria", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Miguel A. Ibarra-Arellano", "Adri\\'an I. Campos-Gonz\\'alez", "Luis G.\n  Trevi\\~no-Quintanilla", "Andreas Tauch and Julio A. Freyre-Gonz\\'alez"], "abstract": "  The availability of databases electronically encoding curated regulatory\nnetworks and of high-throughput technologies and methods to discover regulatory\ninteractions provides an invaluable source of data to understand the principles\nunderpinning the organization and evolution of these networks responsible for\ncellular regulation. Nevertheless, data on these sources never goes beyond the\nregulon level despite the fact that regulatory networks are complex\nhierarchical-modular structures still challenging our understanding. This\nbrings the necessity for an inventory of systems across a large range of\norganisms, a key step to rendering feasible comparative systems biology\napproaches. In this work, we take the first step towards a global understanding\nof the regulatory networks organization by making a cartography of the\nfunctional architectures of diverse bacteria. Abasy (Across-bacteria systems)\nAtlas provides a comprehensive inventory of annotated functional systems,\nglobal network properties, and systems-level elements (global regulators,\nmodular genes shaping functional systems, basal machinery genes, and\nintermodular genes) predicted by the natural decomposition approach for\nreconstructed and meta-curated regulatory networks across a large range of\nbacteria, including pathogenically and biotechnologically relevant organisms.\nThe meta-curation of regulatory datasets provides the most complete and\nreliable set of regulatory interactions currently available. Abasy Atlas\ncontains systems and system-level elements for 50 regulatory networks\ncomprising 78,649 regulatory interactions covering 42 bacteria in nine taxa,\ncontaining 3,708 regulons and 1,776 systems. All this brings together a large\ncorpus of data that will surely inspire studies to generate hypothesis\nregarding the principles governing the evolution and organization of systems\nand the functional architectures controlling them.\n", "doi": "10.1093/database/baw089", "arxiv_id": "1605.04959", "pdf_urls": ["https://arxiv.org/pdf/1605.04959"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Database (2016) 2016 : baw089", "categories": "q-bio.MN q-bio.GN"}
{"title": "Quantum epistemology from subquantum ontology: quantum mechanics from\n  theory of classical random fields", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andrei Khrennikov"], "abstract": "  The scientific methodology based on two descriptive levels, ontic (reality as\nit is ) and epistemic (observational), is briefly presented. Following\nSchr\\\"odinger, we point to the possible gap between these two descriptions. Our\nmain aim is to show that, although ontic entities may be inaccessible for\nobservations, they can be useful for clarification of the physical nature of\noperational epistemic entities. We illustrate this thesis by the concrete\nexample: starting with the concrete ontic model preceding quantum mechanics\n(the latter is treated as an epistemic model), namely, prequantum classical\nstatistical field theory (PCSFT), we propose the natural physical\ninterpretation for the basic quantum mechanical entity - the quantum state\n(\"wave function\"). The correspondence PCSFT to QM is not straightforward, it\ncouples the covariance operators of classical (prequantum) random fields with\nthe quantum density operators. We use this correspondence to clarify the\nphysical meaning of the pure quantum state and the superposition principle - by\nusing the formalism of classical field correlations.\n", "doi": "10.1016/j.aop.2016.12.005", "arxiv_id": "1605.05907", "pdf_urls": ["https://arxiv.org/pdf/1605.05907"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russian Laser Research 38, 9-26 (2017)", "categories": "quant-ph physics.hist-ph physics.pop-ph"}
{"title": "Evolution of the phase singularities in edge-diffracted optical-vortex\n  beams", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Aleksandr Bekshaev", "Lidiya Mikhaylovskaya", "Aleksey Chernykh", "Anna\n  Khoroshun"], "abstract": "  We study, both theoretically and by experiment, migration of the amplitude\nzeros within a fixed cross section of the edge-diffracted optical-vortex beam,\nwhen the screen edge performs permanent translation in the transverse plane\nfrom the beam periphery towards the axis. Generally, the amplitude zeros\n(optical-vortex cores) describe spiral-like trajectories. When the screen edge\nadvances uniformly, the motion of the amplitude zeros is not smooth and\nsometimes shows anomalously high rates, which make an impression of\ninstantaneous \"jumps\" from one position to another. We analyze the nature,\nconditions and mechanism of these jumps and show that they are associated with\nthe \"birth - annihilation\" topological reactions involving the optical vortex\ndipoles.\n", "doi": "10.1109/caol.2016.7851362", "arxiv_id": "1605.06751", "pdf_urls": ["https://arxiv.org/pdf/1605.06751"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Advanced Optoelectronics and Lasers (CAOL), 2016 IEEE 7th\n  International Conference. - IEEE, 2016. - P. 23-25", "categories": "physics.optics"}
{"title": "Theory of cold atoms: Bose-Einstein statistics", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov"], "abstract": "  This Tutorial is the continuation of the previous tutorial part, published in\nLaser Phys. 23, 062001 (2013), where the basic mathematical techniques required\nfor an accurate description of cold atoms for both types of quantum statistics\nare expounded. In the present part, the specifics of the correct theoretical\ndescription of atoms obeying Bose-Einstein statistics are explained, including\ntrapped Bose atoms. In the theory of systems exhibiting the phenomenon of\nBose-Einstein condensation, there exists a number of delicate mathematical\npoints, whose misunderstanding often results in principally wrong conclusions.\nThis is why the consideration in the present Tutorial is sufficiently detailed\nin order that the reader could clearly understand the underlying mathematics\nand would avoid confusions.\n", "doi": "10.1088/1054-660x/26/6/062001", "arxiv_id": "1605.07815", "pdf_urls": ["https://arxiv.org/pdf/1605.07815"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 26 (2016) 062001", "categories": "cond-mat.quant-gas"}
{"title": "Periodic solutions of singular first-order Hamiltonian systems of\n  N-vortex type", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Bartsch"], "abstract": "  We are concerned with the dynamics of $N$ point vortices\n$z_1,\\dots,z_N\\in\\Omega\\subset\\mathbb{R}^2$ in a planar domain. This is\ndescribed by a Hamiltonian system \\[ \\Gamma_k\\dot{z}_k(t)=J\\nabla_{z_k}\nH\\big(z(t)\\big),\\quad k=1,\\dots,N, \\] where\n$\\Gamma_1,\\dots,\\Gamma_N\\in\\mathbb{R}\\setminus\\{0\\}$ are the vorticities,\n$J\\in\\mathbb{R}^{2\\times2}$ is the standard symplectic $2\\times2$ matrix, and\nthe Hamiltonian $H$ is of $N$-vortex type: \\[ H(z_1,\\dots,z_N)\n  = -\\frac1{2\\pi}\\sum_{j\\ne k}^N \\Gamma_j\\Gamma_k\\log|z_j-z_k| -\n\\sum_{j,k=1}^N\\Gamma_j\\Gamma_kg(z_j,z_k). \\] Here\n$g:\\Omega\\times\\Omega\\to\\mathbb{R}$ is an arbitrary symmetric function of class\n$C^2$, e.g.\\ the regular part of a hydrodynamic Green function. Given a\nnondegenerate critical point $a_0\\in\\Omega$ of $h(z)=g(z,z)$ and a\nnondegenerate relative equilibrium $Z(t)\\in\\mathbb{R}^{2N}$ of the Hamiltonian\nsystem in the plane with $g=0$, we prove the existence of a smooth path of\nperiodic solutions\n$z^{(r)}(t)=\\big(z^{(r)}_1(t),\\dots,z^{(r)}_N(t)\\big)\\in\\Omega^N$, $0<r<r_0$,\nwith $z^{(r)}_k(t)\\to a_0$ as $r\\to0$. In the limit $r\\to0$, and after a\nsuitable rescaling, the solutions look like $Z(t)$.\n", "doi": null, "arxiv_id": "1605.07864", "pdf_urls": ["https://arxiv.org/pdf/1605.07864"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch.Math. (Basel) 107 (2016), 413-422", "categories": "math.DS"}
{"title": "A Novel Fault Classification Scheme Based on Least Square SVM", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Harishchandra Dubey", "A.K. Tiwari", "Nandita", "P.K. Ray", "S.R. Mohanty and\n  Nand Kishor"], "abstract": "  This paper presents a novel approach for fault classification and section\nidentification in a series compensated transmission line based on least square\nsupport vector machine. The current signal corresponding to one-fourth of the\npost fault cycle is used as input to proposed modular LS-SVM classifier. The\nproposed scheme uses four binary classifier; three for selection of three\nphases and fourth for ground detection. The proposed classification scheme is\nfound to be accurate and reliable in presence of noise as well. The simulation\nresults validate the efficacy of proposed scheme for accurate classification of\nfault in a series compensated transmission line.\n", "doi": "10.1109/sces.2012.6199047", "arxiv_id": "1605.09444", "pdf_urls": ["https://arxiv.org/pdf/1605.09444"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Harishchandra Dubey etal., \"A novel fault classification scheme\n  based on least square SVM,\" Engineering and Systems (SCES), 2012 Students\n  Conference on, INDIA, 2012, pp. 1-5", "categories": "cs.SY cs.LG"}
{"title": "Approximation in M\\\"untz spaces $M_{\\Lambda ,p}$ of $L_p$ functions for\n  $1<p<\\infty $ and bases", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sergey V. Ludkowski"], "abstract": "  M\\\"untz spaces satisfying the M\\\"untz and gap conditions are considered. A\nFourier approximation of functions in the M\\\"untz spaces $M_{\\Lambda ,p}$ of\n$L_p$ functions is studied, where $1<p<\\infty $. It is proved that up to an\nisomorphism and a change of variables these spaces are contained in Weil-Nagy's\nclass. Moreover, existence of Schauder bases in the M\\\"untz spaces $M_{\\Lambda\n,p}$ is investigated.\n", "doi": "10.3390/math5010010", "arxiv_id": "1605.09665", "pdf_urls": ["https://arxiv.org/pdf/1605.09665"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Approximation in Muntz Spaces $M_{\\Lambda ,p}$ of $L_p$ Functions\n  for $1 < p < \\infty $ and Bases, Mathematics, MDPI, V. 5: 1 (2017), p. 1-14", "categories": "math.FA"}
{"title": "A Mathematical Model of the Rainwater Flows in a Green Roof", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Catherine Adley", "Mark Cooker", "Gemma Fay", "Ian Hewitt", "Andrew Lacey", "Niklas Mellgren", "Marguerite Robinson and Michael Vynnycky"], "abstract": "  A model is presented for the gravity-driven flow of rainwater descending\nthrough the soil layer of a green roof, treated as a porous medium on a flat\npermeable surface representing an efficient drainage layer. A fully saturated\nzone is shown to occur. It is typically a thin layer, relative to the total\nsoil thickness, and lies at the bottom of the soil layer. This provides a\nbottom boundary condition for the partially saturated upper zone. It is shown\nthat after the onset of rainfall, well-defined fronts of water can descend\nthrough the soil layer. Also the rainwater flow is relatively quick compared\nwith the moisture uptake by the roots of the plants in the roof. In separate\nmodels the exchanges of water are described between the (smaller-scale) porous\ngranules of soil, the roots and the rainwater in the inter-granule pores.\n", "doi": null, "arxiv_id": "1605.09727", "pdf_urls": ["https://arxiv.org/pdf/1605.09727"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Mathematics-in-Industry Case Studies, 2014, Vol. 6, pp 1 - 21", "categories": "physics.geo-ph"}
{"title": "The belief noisy-or model applied to network reliability analysis", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kuang Zhou (DRUID)", "Arnaud Martin (DRUID)", "Quan Pan"], "abstract": "  One difficulty faced in knowledge engineering for Bayesian Network (BN) is\nthe quan-tification step where the Conditional Probability Tables (CPTs) are\ndetermined. The number of parameters included in CPTs increases exponentially\nwith the number of parent variables. The most common solution is the\napplication of the so-called canonical gates. The Noisy-OR (NOR) gate, which\ntakes advantage of the independence of causal interactions, provides a\nlogarithmic reduction of the number of parameters required to specify a CPT. In\nthis paper, an extension of NOR model based on the theory of belief functions,\nnamed Belief Noisy-OR (BNOR), is proposed. BNOR is capable of dealing with both\naleatory and epistemic uncertainty of the network. Compared with NOR, more rich\ninformation which is of great value for making decisions can be got when the\navailable knowledge is uncertain. Specially, when there is no epistemic\nuncertainty, BNOR degrades into NOR. Additionally, different structures of BNOR\nare presented in this paper in order to meet various needs of engineers. The\napplication of BNOR model on the reliability evaluation problem of networked\nsystems demonstrates its effectiveness.\n", "doi": null, "arxiv_id": "1606.01116", "pdf_urls": ["https://arxiv.org/pdf/1606.01116"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Uncertainty, Fuzziness and\n  Knowledge-Based Systems, World Scientific Publishing, 2016", "categories": "cs.AI"}
{"title": "Two-dimensional bright and dark-in-bright dipolar Bose-Einstein\n  condensate solitons on a one-dimensional optical lattice", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S K Adhikari"], "abstract": "  We study the statics and dynamics of anisotropic, stable, bright and\ndark-in-bright dipolar quasi-two-dimensional Bose-Einstein condensate (BEC)\nsolitons on a one-dimensional (1D) optical-lattice (OL) potential. These\nsolitons mobile in a plane perpendicular to the 1D OL trap can have both\nrepulsive and attractive contact interactions. The dark-in-bright solitons are\nthe excited states of the bright solitons. The solitons, when subject to a\nsmall perturbation, exhibit sustained breathing oscillation. The dark-in-bright\nsolitons can be created by phase imprinting a bright soliton. At medium\nvelocities the collision between two solitons is found to be quasi elastic.The\nresults are demonstrated by a numerical simulation of the three-dimensional\nmean-field Gross-Pitaevskii equation in three spatial dimensions employing\nrealistic interaction parameters for a dipolar $^{164}$Dy BEC.\n", "doi": "10.1088/1612-2011/13/8/085501", "arxiv_id": "1606.03937", "pdf_urls": ["https://arxiv.org/pdf/1606.03937"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 13 (2016) 085501 (7pp)", "categories": "cond-mat.quant-gas nlin.PS quant-ph"}
{"title": "Regression-based reduced-order models to predict transient thermal\n  output for enhanced geothermal systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M. K. Mudunuru", "S. Karra", "D. R. Harp", "G. D. Guthrie", "H. S. Viswanathan"], "abstract": "  The goal of this paper is to assess the utility of Reduced-Order Models\n(ROMs) developed from 3D physics-based models for predicting transient thermal\npower output for an enhanced geothermal reservoir while explicitly accounting\nfor uncertainties in the subsurface system and site-specific details. Numerical\nsimulations are performed based on Latin Hypercube Sampling (LHS) of model\ninputs drawn from uniform probability distributions. Key sensitive parameters\nare identified from these simulations, which are fracture zone permeability,\nwell/skin factor, bottom hole pressure, and injection flow rate. The inputs for\nROMs are based on these key sensitive parameters. The ROMs are then used to\nevaluate the influence of subsurface attributes on thermal power production\ncurves. The resulting ROMs are compared with field-data and the detailed\nphysics-based numerical simulations. We propose three different ROMs with\ndifferent levels of model parsimony, each describing key and essential features\nof the power production curves. ROM-1 is able to accurately reproduce the power\noutput of numerical simulations for low values of permeabilities and certain\nfeatures of the field-scale data, and is relatively parsimonious. ROM-2 is a\nmore complex model than ROM-1 but it accurately describes the field-data. At\nhigher permeabilities, ROM-2 reproduces numerical results better than ROM-1,\nhowever, there is a considerable deviation at low fracture zone permeabilities.\nROM-3 is developed by taking the best aspects of ROM-1 and ROM-2 and provides a\nmiddle ground for model parsimony. It is able to describe various features of\nnumerical simulations and field-data. From the proposed workflow, we\ndemonstrate that the proposed simple ROMs are able to capture various complex\nfeatures of the power production curves of Fenton Hill HDR system. For typical\nEGS applications, ROM-2 and ROM-3 outperform ROM-1.\n", "doi": "10.1016/j.geothermics.2017.06.013", "arxiv_id": "1606.04567", "pdf_urls": ["https://arxiv.org/pdf/1606.04567"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "M.K. Mudunuru, S. Karra, D.R. Harp, G.D. Guthrie, H.S.\n  Viswanathan, Regression-based reduced-order models to predict transient\n  thermal output for enhanced geothermal systems, Geothermics, Volume 70, 2017,\n  Pages 192-205", "categories": "cs.CE math.NA physics.comp-ph stat.ML"}
{"title": "Universal, Unsupervised (Rule-Based), Uncovered Sentiment Analysis", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David Vilares and Carlos G\\'omez-Rodr\\'iguez and Miguel A. Alonso"], "abstract": "  We present a novel unsupervised approach for multilingual sentiment analysis\ndriven by compositional syntax-based rules. On the one hand, we exploit some of\nthe main advantages of unsupervised algorithms: (1) the interpretability of\ntheir output, in contrast with most supervised models, which behave as a black\nbox and (2) their robustness across different corpora and domains. On the other\nhand, by introducing the concept of compositional operations and exploiting\nsyntactic information in the form of universal dependencies, we tackle one of\ntheir main drawbacks: their rigidity on data that are structured differently\ndepending on the language concerned. Experiments show an improvement both over\nexisting unsupervised methods, and over state-of-the-art supervised models when\nevaluating outside their corpus of origin. Experiments also show how the same\ncompositional operations can be shared across languages. The system is\navailable at http://www.grupolys.org/software/UUUSA/\n", "doi": "10.1016/j.knosys.2016.11.014", "arxiv_id": "1606.05545", "pdf_urls": ["https://arxiv.org/pdf/1606.05545"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 118:45-55, 2017", "categories": "cs.CL"}
{"title": "Active and passive stabilization of a high-power UV frequency-doubled\n  diode laser", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ulrich Eismann", "Martin Enderlein", "Konstantinos Simeonidis", "Felix\n  Keller", "Felix Rohde", "Dmitrijs Opalevs", "Matthias Scholz", "Wilhelm Kaenders", "J\\\"urgen Stuhler"], "abstract": "  We present a resonantly frequency-doubled tapered amplified semiconductor\nlaser system emitting up to 2.6 W blue light at 400 nm. The output power is\nstable on both short and long timescales with 0.12% RMS relative intensity\nnoise, and less than 0.15%/h relative power loss over 16 hours of free running\ncontinuous operation. Furthermore, the output power can be actively stabilized,\nand the alignment of the input beams of the tapered amplifier chip, the\nfrequency doubling cavity and-in case of fiber output-the fiber can be\noptimized automatically using computer-controlled mirrors.\n", "doi": "10.1364/cleo_at.2016.jtu5a.65", "arxiv_id": "1606.07670", "pdf_urls": ["https://arxiv.org/pdf/1606.07670"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Conference on Lasers and Electro-OpticsConference on Lasers and\n  Electro-Optics, OSA Technical Digest (online) (Optical Society of America,\n  2016), 2016", "categories": "physics.atom-ph cond-mat.quant-gas physics.optics"}
{"title": "Robust Spin Squeezing Preservation in Photonic Crystal Cavities", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wo-Jun Zhong", "Yan-Ling Li", "Xing Xiao and Ying-Mao Xie"], "abstract": "  We show that the robust spin squeezing preservation can be achieved by\nutilizing detuning modification for an ensemble of N separate two-level atoms\nembedded in photonic crystal cavities (PCC). In particular, we explore the\ndifferent dynamical behaviors of spin squeezing between isotropic and\nanisotropic PCC cases when the atomic frequency is inside the band gap. In both\ncases, it is shown that the robust preservation of spin squeezing is completely\ndetermined by the formation of bound states. Intriguingly, we find that unlike\nthe isotropic case where steady-state spin squeezing varies smoothly when the\natomic frequency moves from the inside to the outside band edge, a sudden\ntransition occurs for the anisotropic case. The present results may be of\ndirect importance for, e.g., quantum metrology in open quantum systems.\n", "doi": "10.1088/1612-2011/13/8/085205", "arxiv_id": "1606.08236", "pdf_urls": ["https://arxiv.org/pdf/1606.08236"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 13: 085205 (2016)", "categories": "quant-ph"}
{"title": "Empirical correlation of the surface tension versus the viscosity for\n  saturated normal liquids", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xia Li", "Jianxiang Tian", "A. Mulero"], "abstract": "  In 1966 Pelofsky proposed an empirical linear correlation between the natural\nlogarithm of the surface tension and the reciprocal viscosity, which seems to\nwork adequately for a wide range of fluids. In particular, it has been shown\nthat it is useful in the case of n-alkanes and their binary and ternary\nmixtures. More recently however, it has been found not to work for several\nionic liquids unless the reciprocal viscosity is raised to a power. The\nexponent of this power was fixed to be 0.3, at least for the studied ionic\nfluids. In the present work, the performance and accuracy of both the original\nPelofsky correlation and the modified expression including the exponent are\nstudied for 56 non-ionic fluids of different kinds over a broad range of\ntemperatures. Also, the temperature range is delimited for which each\nexpression reproduces the surface tension values with average absolute\ndeviations below 1%. The needed coefficients are given for both the broad and\nthe delimited temperature range for each expression. Unfortunately, the results\nshow that the value of the exponent in the modified Pelofsky expression is\nsubstance-dependent for the normal fluids studied.\n", "doi": "10.1016/j.fluid.2013.05.003", "arxiv_id": "1606.09102", "pdf_urls": ["https://arxiv.org/pdf/1606.09102"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Fluid Phase Equilibria, 352: 54-63, 2013", "categories": "physics.chem-ph cond-mat.soft"}
{"title": "New correlations between viscosity and surface tension for saturated\n  normal fluids", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mengmeng Zheng", "Jianxiang Tian", "A. Mulero"], "abstract": "  New correlations between viscosity and surface tension are proposed and\nchecked for saturated normal fluids. The proposed correlations contain three or\nfour adjustable coefficients for every fluid. They were obtained by fitting 200\ndata points, ranging from the triple point to a point very near to the critical\none. Forty substances were considered, including simple fluids (such as rare\ngases), simple hydrocarbons, refrigerants, and some other substances such as\ncarbon dioxide and water. Two correlation models with three adjustable\ncoefficients were checked, and the results showed that the one based on the\nmodified Pelofsky expression gives the better overall results. A new\n4-coefficient correlation is then proposed which clearly improves the results,\ngiving the lowest overall deviations for 32 out of the 40 substances considered\nand absolute average deviations below 10% for all of them.\n", "doi": "10.1016/j.fluid.2013.09.045", "arxiv_id": "1606.09105", "pdf_urls": ["https://arxiv.org/pdf/1606.09105"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Fluid Phase Equilibria, 360: 298-304, 2013", "categories": "physics.chem-ph"}
{"title": "Quantum simulation of Abelian Wu-Yang monopoles in spin-1/2 systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ze-Lin Zhang", "Ming-Feng Chen", "Huai-Zhi Wu", "and Zhen-Biao Yang"], "abstract": "  With the help of the Berry curvature and the first Chern number\n$($$\\textit{C}_1$$)$, we both analytically and numerically investigate and thus\nsimulate artificial magnetic monopoles formed in parameter space of the\nHamiltonian of a driven superconducting qubit. The topological structure of a\nspin-1/2 system $($qubit$)$ can be captured by the distribution of Berry\ncurvature, which describes the geometry of eigenstates of the Hamiltonian.\nDegeneracy points in parameter space act as sources $($$\\textit{C}_1$ = $1$$)$\nor sinks $($$\\textit{C}_1$ = $-1$$)$ of the magnetic field. We note that the\nstrength of the magnetic field $($described by Berry curvature$)$ has an\napparent impact on the quantum states during the process of topological\ntransition. It exhibits an unusual property that the transition of the quantum\nstates is asymmetric when the degenerate point passes from outside to inside\nand again outside the manifold spanned by system parameters. Our results also\npave the way to explore intriguing properties of magnetic monopoles in other\nspin-1/2 systems.\n", "doi": "10.1088/1612-202x/aa622b", "arxiv_id": "1606.09360", "pdf_urls": ["https://arxiv.org/pdf/1606.09360"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14, 045205 (2017)", "categories": "quant-ph"}
{"title": "Discretization of the density matrix as a nonlinear positive map and\n  entanglement", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julio A. L\\'opez-Sald\\'ivar", "Armando Figueroa", "Octavio Casta\\~nos", "Ram\\'on L\\'opez--Pe\\~na", "Margarita A. Man'ko and Vladimir I. Man'ko"], "abstract": "  The discretization of the density matrix is proposed as a nonlinear positive\nmap for systems with continuous variables. This procedure is used to calculate\nthe entanglement between two modes through different criteria, such as Tsallis\nentropy, von Neumann entropy and linear entropy and the logarithmic negativity.\nAs an example, we study the dynamics of entanglement for the two-mode squeezed\nvacuum state in the parametric amplifier and show good agreement with the\nanalytic results. The loss of information on the system state due to the\ndiscretization of the density matrix is also addressed.\n", "doi": "10.1007/s10946-016-9578-4", "arxiv_id": "1607.00982", "pdf_urls": ["https://arxiv.org/pdf/1607.00982"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J Russ Laser Res, 37: 313 (2016)", "categories": "quant-ph"}
{"title": "HIRAX: A Probe of Dark Energy and Radio Transients", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["L.B. Newburgh", "K. Bandura", "M. A. Bucher", "T.-C. Chang", "H.C. Chiang", "J.F. Cliche", "R. Dave", "M. Dobbs", "C. Clarkson", "K. M. Ganga", "T. Gogo", "A. Gumba", "N. Gupta", "M. Hilton", "B. Johnstone", "A. Karastergiou", "M. Kunz", "D. Lokhorst", "R.\n  Maartens", "S. Macpherson", "M. Mdlalose", "K. Moodley", "L. Ngwenya", "J.M. Parra", "J.\n  Peterson", "O. Recnik", "B. Saliwanchik", "M. G. Santos", "J.L. Sievers", "O. Smirnov"], "abstract": "  The Hydrogen Intensity and Real-time Analysis eXperiment (HIRAX) is a new\n400-800MHz radio interferometer under development for deployment in South\nAfrica. HIRAX will comprise 1024 six meter parabolic dishes on a compact grid\nand will map most of the southern sky over the course of four years. HIRAX has\ntwo primary science goals: to constrain Dark Energy and measure structure at\nhigh redshift, and to study radio transients and pulsars. HIRAX will observe\nunresolved sources of neutral hydrogen via their redshifted 21-cm emission line\n(`hydrogen intensity mapping'). The resulting maps of large-scale structure at\nredshifts 0.8-2.5 will be used to measure Baryon Acoustic Oscillations (BAO).\nHIRAX will improve upon current BAO measurements from galaxy surveys by\nobserving a larger cosmological volume (larger in both survey area and redshift\nrange) and by measuring BAO at higher redshift when the expansion of the\nuniverse transitioned to Dark Energy domination. HIRAX will complement CHIME, a\nhydrogen intensity mapping experiment in the Northern Hemisphere, by completing\nthe sky coverage in the same redshift range. HIRAX's location in the Southern\nHemisphere also allows a variety of cross-correlation measurements with\nlarge-scale structure surveys at many wavelengths. Daily maps of a few thousand\nsquare degrees of the Southern Hemisphere, encompassing much of the Milky Way\ngalaxy, will also open new opportunities for discovering and monitoring radio\ntransients. The HIRAX correlator will have the ability to rapidly and\neXperimentciently detect transient events. This new data will shed light on the\npoorly understood nature of fast radio bursts (FRBs), enable pulsar monitoring\nto enhance long-wavelength gravitational wave searches, and provide a rich data\nset for new radio transient phenomena searches. This paper discusses the HIRAX\ninstrument, science goals, and current status.\n", "doi": "10.1117/12.2234286", "arxiv_id": "1607.02059", "pdf_urls": ["https://arxiv.org/pdf/1607.02059"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9906, Ground-based and Airborne Telescopes VI (2016)", "categories": "astro-ph.IM astro-ph.CO"}
{"title": "Evaluating Random Mutant Selection at Class-Level in Projects with\n  Non-Adequate Test Suites", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Parsai", "Alessandro Murgia", "Serge Demeyer"], "abstract": "  Mutation testing is a standard technique to evaluate the quality of a test\nsuite. Due to its computationally intensive nature, many approaches have been\nproposed to make this technique feasible in real case scenarios. Among these\napproaches, uniform random mutant selection has been demonstrated to be simple\nand promising. However, works on this area analyze mutant samples at project\nlevel mainly on projects with adequate test suites. In this paper, we fill this\nlack of empirical validation by analyzing random mutant selection at class\nlevel on projects with non-adequate test suites. First, we show that uniform\nrandom mutant selection underachieves the expected results. Then, we propose a\nnew approach named weighted random mutant selection which generates more\nrepresentative mutant samples. Finally, we show that representative mutant\nsamples are larger for projects with high test adequacy.\n", "doi": "10.1145/2915970.2915992", "arxiv_id": "1607.02453", "pdf_urls": ["https://arxiv.org/pdf/1607.02453"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 20th International Conference on Evaluation and\n  Assessment in Software Engineering (EASE '16). ACM, New York, NY, USA, 2016", "categories": "cs.SE"}
{"title": "Locally 2-fold symmetric manifolds are locally symmetric", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shaoqiang Deng and Vladimir S. Matveev"], "abstract": "  A manifold is locally \\emph{$k$-fold symmetric}, if for any point and any\n$k$-dimensional vector subspace tangent to this point there exists a local\nisometry such that this point is a fixed point and the differential of the\nisometry restricted to that $k$-dimensional vector subspace is minus the\nidentity. We show that for $k \\ge 2$, Riemannian, pseudoriemannian and\nFinslerian locally $k$-fold symmetric manifolds are locally symmetric.\n", "doi": "10.1007/s00013-017-1036-1", "arxiv_id": "1607.05644", "pdf_urls": ["https://arxiv.org/pdf/1607.05644"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 108 (2017), 521-525", "categories": "math.DG"}
{"title": "Broad-band dielectric response of BTZ-BCT piezoceramics: soft and\n  central mode behaviour", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. Kamba", "E. Simon", "V. Skoromets", "V. Bovtun", "M. Kempa", "J. Pokorny", "M.\n  Savinov", "J. Koruza", "B. Malic"], "abstract": "  Dielectric properties of BTZ-BCT ceramics were probed in the frequency range\nfrom 10 Hz to 100 THz in a broad temperature range (10-900 K). Polar soft\nphonon observed in infrared spectra softens with cooling, however below 500 K\nits frequency becomes temperature independent. Simultaneously, a central mode\nactivates in terahertz and microwave spectra; and it actually drives the\nferroelectric phase transitions. Consequently, the phase transition strongly\nresemble a crossover between the dispacive and order-disorder type. The central\nmode vanishes below 200 K. The dielectric relaxation in the radiofrequency and\nmicrowave range anomalously broadens on cooling below T$_{C1}$ resulting in the\nnearly frequency independent dielectric loss bleow 200 K. This broadening comes\nfrom a broad frequency distribution of ferroelectric domain wall vibrations.\nRaman spectra reveal new phonons below 400 K, i.e. already 15 K above T$_{C1}$.\nSeveral weak modes are detected in the paraelectric phase up to 500 K in the\nRaman spectra. Activation of these modes is ascribed to the presence of polar\nnanoclusters in the material.\n", "doi": "10.1080/01411594.2016.1199800", "arxiv_id": "1607.05914", "pdf_urls": ["https://arxiv.org/pdf/1607.05914"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Phase Transitions 89, 785-793 (2016)", "categories": "cond-mat.mtrl-sci"}
{"title": "Current Status of the Facility Instrumentation Suite at The Large\n  Binocular Telescope Observatory", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Barry Rothberg", "Olga Kuhn", "Michelle L. Edwards", "John M. Hill", "David\n  Thompson", "Christian Veillet", "and R. Mark Wagner"], "abstract": "  We review the current status of the facility instrumentation for the Large\nBinocular Telescope (LBT). The LBT has 2x 8.4m primary mirrors on a single\nmount with an effective collecting area of 11.8m or 23m when\ninterferometrically combined. The facility instruments are: 1) the Large\nBinocular Cameras (LBCs), each with a 23'x25' field of view (FOV). The blue and\nred optimized optical LBCs are mounted at the prime focus of the left and right\nprimary mirrors, respectively. The filter suite of the two LBCs covers\n0.3-1.1{\\mu}m, including the new TiO (0.78{\\mu}m) and CN (0.82{\\mu}m) filters;\n2) the Multi-Object Double Spectrograph (MODS), two identical optical\nspectrographs each mounted at a straight through f/15 Gregorian mount. MODS-1 &\n-2 can do imaging with Sloan filters and medium resolution (R~2000)\nspectroscopy, each with 24 interchangeable masks (multi-object or longslit)\nover a 6'x6' FOV. Each MODS is capable of blue (0.32-0.6{\\mu}m) and red\n(0.5-1.05{\\mu}m) wavelength only coverage or, using a dichroic, 0.32-1.05{\\mu}m\ncoverage; and 3) the two LBT Utility Camera in the Infrared instruments\n(LUCIs), each mounted at a bent-front Gregorian f/15 port. LUCI-1 & 2 are\ndesigned for seeing-limited (4'x4'FOV) and AO (0.5'x0.5' FOV) imaging &\nspectroscopy over 0.95-2.5{\\mu}m with spectroscopic resolutions of R~400-11000,\nincluding 32 interchangeable cryogenically cooled masks. All facility\ninstruments are on the LBT and, for the first time, have been on-sky for\nscience. We also report on the first science use of \"mixed-mode\" (differently\npaired instruments). While both primary mirrors reside on a single fixed mount,\nthey are capable of operating independently within a defined \"co-pointing\"\nlimit. This provides users with the additional capability to independently\ndither each mirror or center observations on two different sets of spatial\ncoordinates within this limit. (ABRIDGED)\n", "doi": "10.1117/12.2233245", "arxiv_id": "1608.00037", "pdf_urls": ["https://arxiv.org/pdf/1608.00037"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the SPIE 9906, Ground-based and Airborne Telescopes\n  VI, 990622, July 27 2016", "categories": "astro-ph.IM astro-ph.GA"}
{"title": "Semi-classical Dynamics of Superradiant Rayleigh Scattering in a\n  Bose-Einstein Condensate", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J. H. M\\\"uller", "D. Witthaut", "R. le Targat", "J. J. Arlt", "E. S. Polzik", "and A. J. Hilliard"], "abstract": "  Due to its coherence properties and high optical depth, a Bose-Einstein\ncondensate provides an ideal setting to investigate collective atom-light\ninteractions. Superradiant light scattering in a Bose-Einstein condensate is a\nfascinating example of such an interaction. It is an analogous process to Dicke\nsuperradiance, in which an electronically inverted sample decays collectively,\nleading to the emission of one or more light pulses in a well-defined\ndirection. Through time-resolved measurements of the superradiant light pulses\nemitted by an end-pumped BEC, we study the close connection of superradiant\nlight scattering with Dicke superradiance. A 1D model of the system yields good\nagreement with the experimental data and shows that the dynamics results from\nthe structures that build up in the light and matter-wave fields along the BEC.\nThis paves the way for exploiting the atom-photon correlations generated by the\nsuperradiance.\n", "doi": "10.1080/09500340.2016.1207815", "arxiv_id": "1608.00425", "pdf_urls": ["https://arxiv.org/pdf/1608.00425"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Modern Optics, Volume 63, Issue 18, pages 1886-1897,\n  2016 Special Issue: 20 years of Bose-Einstein Condensates: Current trends and\n  applications of ultracold quantum gases", "categories": "quant-ph cond-mat.quant-gas physics.atom-ph"}
{"title": "Operator ultra-amenability", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Brian E. Forrest", "Volker Runde", "Kyle Schlitt"], "abstract": "  Extending M.\\ Daws' definition of ultra-amenable Banach algebras, we\nintroduce the notion of operator ultra-amenability for completely contractive\nBanach algebras. For a locally compact group $G$, we show that the operator\nultra-amenability of $A(G)$ imposes severe restrictions on $G$. In particular,\nit forces $G$ to be a discrete, amenable group with no infinite abelian\nsubgroups. For various classes of such groups, this means that $G$ is finite.\n", "doi": null, "arxiv_id": "1608.01153", "pdf_urls": ["https://arxiv.org/pdf/1608.01153"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel), 108 (2017), 465-471", "categories": "math.FA"}
{"title": "Computational study of atomic mobility in HCP Mg-Al-Zn ternary alloys", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J. Wang", "N. Li", "C. Wang", "J. I. Beltran", "J. LLorca", "Y. Cui"], "abstract": "  The experimental data in the literature for the hcp phase of the Mg-Al-Zn\nternary system have been critically reviewed. Based on the concentration\nprofiles from the literature, the diffusion coefficients have been re-extracted\nusing the Hall method for the impurity diffusion, and the Sauer-Freise and the\nWhittle-Green strategies for interdiffusion coefficients in binary and ternary\nsystems, respectively. Moreover, extra interdiffusion coefficients were\nobtained from the Darken-type couples, which present relative maxima or/and\nminima at the concentration profiles. This information was assessed to obtain\nan atomic mobility database, by means of DICTRA software in conjunction with\nthe CALPHAD thermodynamic description that is able to reproduce the diffusion\ncouple experiments. Comprehensive comparisons between the calculated results\nand experimental values show an excellent agreement not only for the diffusion\ncoefficient data, but also for the concentration profiles and the diffusion\npaths.\n", "doi": "10.1016/j.calphad.2016.07.003", "arxiv_id": "1608.02349", "pdf_urls": ["https://arxiv.org/pdf/1608.02349"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "CALPHAD: Computer Coupling of Phase Diagrams and Thermochemistry,\n  54, 134-143, 2016", "categories": "cond-mat.mtrl-sci"}
{"title": "Making SPIFFI SPIFFIER: Upgrade of the SPIFFI instrument for use in ERIS\n  and performance analysis from re-commissioning", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["E. M. George", "D. Gr\\\"aff", "H. Feuchtgruber", "M. Hartl", "F. Eisenhauer", "A.\n  Buron", "R. Davies", "R. Genzel", "H. Huber", "C. Rau", "M. Plattner", "E. Wiezorrek", "H.\n  Weisz", "P. Amico", "A. Glindeman", "G. Hau", "H. Kuntschner", "A. Modigliani"], "abstract": "  SPIFFI is an AO-fed integral field spectrograph operating as part of SINFONI\non the VLT, which will be upgraded and reused as SPIFFIER in the new VLT\ninstrument ERIS. In January 2016, we used new technology developments to\nperform an early upgrade to optical subsystems in the SPIFFI instrument so\nongoing scientific programs can make use of enhanced performance before ERIS\narrives in 2020. We report on the upgraded components and the performance of\nSPIFFI after the upgrade, including gains in throughput and spatial and\nspectral resolution. We show results from re-commissioning, highlighting the\npotential for scientific programs to use the capabilities of the upgraded\nSPIFFI. Finally, we discuss the additional upgrades for SPIFFIER which will be\nimplemented before it is integrated into ERIS.\n", "doi": "10.1117/12.2231285", "arxiv_id": "1608.02457", "pdf_urls": ["https://arxiv.org/pdf/1608.02457"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 99080G (August 3, 2016)", "categories": "astro-ph.IM"}
{"title": "Semigroups --- A Computational Approach", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Florian Kohl", "Yanxi Li", "Johannes Rauh", "Ruriko Yoshida"], "abstract": "  The question whether there exists an integral solution to the system of\nlinear equations with non-negative constraints, $A\\x = \\b, \\, \\x \\ge 0$, where\n$A \\in \\Z^{m\\times n}$ and ${\\mathbf b} \\in \\Z^m$, finds its applications in\nmany areas, such as operation research, number theory and statistics. In order\nto solve this problem, we have to understand the semigroup generated by the\ncolumns of the matrix $A$ and the structure of the \"holes\" which are the\ndifference between the semigroup generated by the columns of the matrix $A$ and\nits saturation. In this paper, we discuss the implementation of an algorithm by\nHemmecke, Takemura, and Yoshida that computes the set of holes of a semigroup,\n% generated by the columns of $A$ and we discuss applications to problems in\ncombinatorics. Moreover, we compute the set of holes for the common diagonal\neffect model, and we show that the $n$th linear ordering polytope has the\ninteger-decomposition property for $n\\leq 7$. The software is available at\n  \\url{http://ehrhart.math.fu-berlin.de/People/fkohl/HASE/}.\n", "doi": "10.2969/aspm/07710155", "arxiv_id": "1608.03297", "pdf_urls": ["https://arxiv.org/pdf/1608.03297"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "The 50th Anniversary of Groebner Bases, T. Hibi, ed. (Tokyo:\n  Mathematical Society of Japan, 2018), 155-170", "categories": "math.CO math.AC"}
{"title": "Nominal Unification of Higher Order Expressions with Recursive Let", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Manfred Schmidt-Schau{\\ss} and Temur Kutsia and Jordi Levy and Mateu\n  Villaret"], "abstract": "  A sound and complete algorithm for nominal unification of higher-order\nexpressions with a recursive let is described, and shown to run in\nnon-deterministic polynomial time. We also explore specializations like nominal\nletrec-matching for plain expressions and for DAGs and determine the complexity\nof corresponding unification problems.\n", "doi": "10.1007/978-3-319-63139-4_19", "arxiv_id": "1608.03771", "pdf_urls": ["https://arxiv.org/pdf/1608.03771"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Logic-Based Program Synthesis and Transformation, LNCS 10184, pp\n  328-344, Springer (2016)", "categories": "cs.PL cs.LO"}
{"title": "Study of extreme states of matter at high energy densities and high\n  strain rates with powerful lasers", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Igor K. Krasyuk", "Pavel P. Pashinin", "Andrey Yu. Semenov", "Konstantin V.\n  Khishchenko", "Vladimir E. Fortov"], "abstract": "  In the paper, a review of most important results of experimental studies of\nthermonuclear plasma in conical targets, generation of shock waves and\nspallation phenomena in different materials, which were carried out at laser\nfacilities of the A M Prokhorov General Physics Institute RAS since 1977, is\npresented.\n", "doi": "10.1088/1054-660x/26/9/094001", "arxiv_id": "1608.03822", "pdf_urls": ["https://arxiv.org/pdf/1608.03822"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 26, 094001 (2016)", "categories": "physics.plasm-ph cond-mat.mtrl-sci"}
{"title": "Design and modeling of a moderate-resolution astronomic spectrograph\n  with volume-phase holographic gratings", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eduard R. Muslimov", "Gennady G. Valyavin", "Sergey N. Fabrika and\n  Nadezhda K. Pavlycheva"], "abstract": "  We present an optical design of astronomic spectrograph based on a cascade of\nvolume-phase holographic gratings. The cascade consists of three gratings. Each\nof them provides moderately high spectral resolution in a narrow range of 83\nnm. Thus the spectrum image represents three lines covering region 430-680 nm.\nTwo versions of the scheme are described: a full-scale one with estimated\nresolving power of 5300-7900 and a small-sized one intended for creation of a\nlab prototype, which provides the resolving power of 1500-3000. Diffraction\nefficiency modeling confirms that the system throughput can reach 75 %, while\nstray light caused by the gratings crosstalk is negligible. We also propose a\ndesign of image slicer and focal reducer allowing to couple the instrument with\nthe 6-m telescope. Finally, we present concept of the opto-mechanical design.\n", "doi": "10.1117/12.2231985", "arxiv_id": "1608.04110", "pdf_urls": ["https://arxiv.org/pdf/1608.04110"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 990842 (August 9, 2016)", "categories": "astro-ph.IM"}
{"title": "HARPS3 for a Roboticized Isaac Newton Telescope", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Samantha J. Thompson", "Didier Queloz", "Isabelle Baraffe", "Martyn Brake", "Andrey Dolgopolov", "Martin Fisher", "Michel Fleury", "Joost Geelhoed", "Richard\n  Hall", "Jonay I. Gonzalez Hernandez", "Rik ter Horst", "Jan Kragt", "Ramon Navarro", "Tim Naylor", "Francesco Pepe", "Nikolai Piskunov", "Rafael Rebolo", "Louis Sander", "Damien Segransan", "Eugene Seneta", "David Sing", "Ignas Snellen", "Frans Snik", "Julien Spronck", "Eric Stempels", "Xiaowei Sun", "Samuel Santana Tschudi", "John\n  Young"], "abstract": "  We present a description of a new instrument development, HARPS3, planned to\nbe installed on an upgraded and roboticized Isaac Newton Telescope by end-2018.\nHARPS3 will be a high resolution (R = 115,000) echelle spectrograph with a\nwavelength range from 380-690 nm. It is being built as part of the Terra\nHunting Experiment - a future 10 year radial velocity measurement programme to\ndiscover Earth-like exoplanets. The instrument design is based on the\nsuccessful HARPS spectrograph on the 3.6m ESO telescope and HARPS-N on the TNG\ntelescope. The main changes to the design in HARPS3 will be: a customised fibre\nadapter at the Cassegrain focus providing a stabilised beam feed and on-sky\nfibre diameter ~ 1.4 arcsec, the implementation of a new continuous flow\ncryostat to keep the CCD temperature very stable, detailed characterisation of\nthe HARPS3 CCD to map the effective pixel positions and thus provide an\nimproved accuracy wavelength solution, an optimised integrated polarimeter and\nthe instrument integrated into a robotic operation. The robotic operation will\noptimise our programme which requires our target stars to be measured on a\nnightly basis. We present an overview of the entire project, including a\ndescription of our anticipated robotic operation.\n", "doi": "10.1117/12.2232111", "arxiv_id": "1608.04611", "pdf_urls": ["https://arxiv.org/pdf/1608.04611"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 99086F (August 9, 2016)", "categories": "astro-ph.IM"}
{"title": "Commissioning and First Observations with Wide FastCam at the Telescopio\n  Carlos S\\'anchez", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sergio Velasco", "Urtats Etxegarai", "Alejandro Oscoz", "Roberto L. L\\'opez", "Marta Puga", "Gaizka Murga", "Antonio P\\'erez-Garrido", "Enric Pall\\'e", "Davide\n  Ricci", "Ismael Ayuso", "M\\'onica Hern\\'andez-S\\'anchez", "and Nicola Truant"], "abstract": "  The FastCam instrument platform, jointly developed by the IAC and the UPCT,\nallows, in real-time, acquisition, selection and storage of images with a\nresolution that reaches the diffraction limit of medium-sized telescopes.\nFastCam incorporates a specially designed software package to analyse series of\ntens of thousands of images in parallel with the data acquisition at the\ntelescope. Wide FastCam is a new instrument that, using the same software for\ndata acquisition, does not look for lucky imaging but fast observations in a\nmuch larger field of view. Here we describe the commissioning process and first\nobservations with Wide FastCam at the Telescopio Carlos S\\'anchez (TCS) in the\nObservatorio del Teide.\n", "doi": "10.1117/12.2233023", "arxiv_id": "1608.04807", "pdf_urls": ["https://arxiv.org/pdf/1608.04807"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 99082O (August 9, 2016)", "categories": "astro-ph.IM"}
{"title": "The Cherenkov Telescope Array On-Site integral sensitivity: observing\n  the Crab", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Valentina Fioretti", "Andrea Bulgarelli", "Fabian Schussler (the CTA\n  Consortium)"], "abstract": "  The Cherenkov Telescope Array (CTA) is the future large observatory in the\nvery high energy (VHE) domain. Operating from 20 GeV to 300 TeV, it will be\ncomposed of tens of Imaging Air Cherenkov Telescopes (IACTs) displaced in a\nlarge area of a few square kilometers in both the southern and northern\nhemispheres. The CTA/DATA On-Site Analysis (OSA) is the system devoted to the\ndevelopment of dedicated pipelines and algorithms to be used at the CTA site\nfor the reconstruction, data quality monitoring, science monitoring and\nrealtime science alerting during observations. The OSA integral sensitivity is\ncomputed here for the most studied source at Gamma-rays, the Crab Nebula, for a\nset of exposures ranging from 1000 seconds to 50 hours, using the full CTA\nSouthern array. The reason for the Crab Nebula selection as the first example\nof OSA integral sensitivity is twofold: (i) this source is characterized by a\nbroad spectrum covering the entire CTA energy range; (ii) it represents, at the\ntime of writing, the standard candle in VHE and it is often used as unit for\nthe IACTs sensitivity. The effect of different Crab Nebula emission models on\nthe CTA integral sensitivity is evaluated, to emphasize the need for\nrepresentative spectra of the CTA science targets in the evaluation of the OSA\nuse cases. Using the most complete model as input to the OSA integral\nsensitivity, we obtain a significant detection of the Crab nebula (about 10% of\nflux) even for a 1000 second exposure, for an energy threshold less than 10\nTeV.\n", "doi": "10.1117/12.2231398", "arxiv_id": "1608.04992", "pdf_urls": ["https://arxiv.org/pdf/1608.04992"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9906, Ground-based and Airborne Telescopes VI, 99063O\n  (July 27, 2016)", "categories": "astro-ph.IM astro-ph.HE"}
{"title": "Balloon UV Experiments for Astronomical and Atmospheric Observations", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.G. Sreejith", "Joice Mathew", "Mayuresh Sarpotdar", "K. Nirmal", "S. Ambily", "Ajin Prakash", "Margarita Safonova", "and Jayant Murthy"], "abstract": "  The ultraviolet (UV) window has been largely unexplored through balloons for\nastronomy. We discuss here the development of a compact near-UV spectrograph\nwith fiber optics input for balloon ights. It is a modified Czerny-Turner\nsystem built using off-the-shelf components. The system is portable and\nscalable to different telescopes. The use of re ecting optics reduces the\ntransmission loss in the UV. It employs an image-intensified CMOS sensor,\noperating in photon counting mode, as the detector of choice. A lightweight\npointing system developed for stable pointing to observe astronomical sources\nis also discussed, together with the methods to improve its accuracy, e.g.\nusing the in-house build star sensor and others. Our primary scientific\nobjectives include the observation of bright Solar System objects such as\nvisible to eye comets, Moon and planets. Studies of planets can give us\nvaluable information about the planetary aurorae, helping to model and compare\natmospheres of other planets and the Earth. The other major objective is to\nlook at the diffuse UV atmospheric emission features (airglow lines), and at\ncolumn densities of trace gases. This UV window includes several lines\nimportant to atmospheric chemistry, e.g. SO2, O3, HCHO, BrO. The spectrograph\nenables simultaneous measurement of various trace gases, as well as provides\nbetter accuracy at higher altitudes compared to electromechanical trace gas\nmeasurement sondes. These lines contaminate most astronomical observations but\nare poorly characterized. Other objectives may include sprites in the\natmosphere and meteor ashes from high altitude burn-outs. Our recent\nexperiments and observations with high-altitude balloons are discussed.\n", "doi": "10.1117/12.2232246", "arxiv_id": "1608.06385", "pdf_urls": ["https://arxiv.org/pdf/1608.06385"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 99084E (August 9, 2016)", "categories": "astro-ph.IM"}
{"title": "Query Optimization Techniques In Graph Databases", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Ben Ammar"], "abstract": "  Graph databases (GDB) have recently been arisen to overcome the limits of\ntraditional databases for storing and managing data with graph-like structure.\nToday, they represent a requirement for many applications that manage\ngraph-like data, like social networks. Most of the techniques, applied to\noptimize queries in graph databases, have been used in traditional databases,\ndistribution systems... or they are inspired from graph theory. However, their\nreuse in graph databases should take care of the main characteristics of graph\ndatabases, such as dynamic structure, highly interconnected data, and ability\nto efficiently access data relationships. In this paper, we survey the query\noptimization techniques in graph databases. In particular, we focus on the\nfeatures they have introduced to improve querying graph-like data.\n", "doi": null, "arxiv_id": "1609.01893", "pdf_urls": ["https://arxiv.org/pdf/1609.01893"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Database Management Systems ( IJDMS )\n  Vol.8, No.4, August 2016", "categories": "cs.DB"}
{"title": "The iLocater cryostat: design and thermal control strategy for precision\n  radial velocity measurements", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jonathan Crass", "Louis G. Fantano", "Frederick R. Hearty", "Justin R.\n  Crepp", "Matthew J. Nelson", "Sheila M. Wall", "David A. Cavalieri", "Corina Koca", "David L. King", "Robert O. Reynolds", "Karl R. Stapelfeldt"], "abstract": "  The current generation of precision radial velocity (RV) spectrographs are\nseeing-limited instruments. In order to achieve high spectral resolution on 8m\nclass telescopes, these spectrographs require large optics and in turn, large\ninstrument volumes. Achieving milli-Kelvin thermal stability for these systems\nis challenging but is vital in order to obtain a single measurement RV\nprecision of better than 1m/s. This precision is crucial to study Earth-like\nexoplanets within the habitable zone. iLocater is a next generation RV\ninstrument being developed for the Large Binocular Telescope. Unlike\nseeing-limited RV instruments, iLocater uses adaptive optics (AO) to inject a\ndiffraction-limited beam into single-mode fibers. These fibers illuminate the\ninstrument spectrograph, facilitating a diffraction-limited design and a small\ninstrument volume compared to present-day instruments. This enables intrinsic\ninstrument stability and facilitates precision thermal control. We present the\ncurrent design of the iLocater cryostat which houses the instrument\nspectrograph and the strategy for its thermal control. The spectrograph is\nsituated within a pair of radiation shields mounted inside an MLI lined vacuum\nchamber. The outer radiation shield is actively controlled to maintain\ninstrument stability at the sub-mK level and minimize effects of thermal\nchanges from the external environment. An inner shield passively dampens any\nresidual temperature fluctuations and is radiatively coupled to the optical\nboard. To provide intrinsic stability, the optical board and optic mounts will\nbe made from Invar and cooled to 58K to benefit from a zero coefficient of\nthermal expansion (CTE) value at this temperature. Combined, the small\nfootprint of the instrument spectrograph, the use of Invar, and precision\nthermal control will allow long-term sub-milliKelvin stability to facilitate\nprecision RV measurements.\n", "doi": "10.1117/12.2233617", "arxiv_id": "1609.04411", "pdf_urls": ["https://arxiv.org/pdf/1609.04411"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 990873 (9 August 2016)", "categories": "astro-ph.IM astro-ph.EP astro-ph.SR"}
{"title": "iLocater: A Diffraction-limited Doppler Spectrometer for the Large\n  Binocular Telescope", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Justin R. Crepp", "Jonathan Crass", "David King", "Andrew Bechter", "Eric\n  Bechter", "Ryan Ketterer", "Robert Reynolds", "Philip Hinz", "Derek Kopon", "David\n  Cavalieri", "Louis Fantano", "Corina Koca", "Eleanya Onuma", "Karl Stapelfeldt", "Joseph Thomes", "Sheila Wall", "Steven Macenka", "James McGuire", "Ronald Korniski", "Leonard Zugby", "Joshua Eisner", "B. Scott Gaudi", "Fred Hearty", "Kaitlin Kratter", "Marc Kuchner", "Giusi Micela", "Matthew Nelson", "Isabella Pagano", "Andreas\n  Quirrenbach", "Christian Schwab"], "abstract": "  We are developing a stable and precise spectrograph for the Large Binocular\nTelescope (LBT) named \"iLocater.\" The instrument comprises three principal\ncomponents: a cross-dispersed echelle spectrograph that operates in the\nYJ-bands (0.97-1.30 microns), a fiber-injection acquisition camera system, and\na wavelength calibration unit. iLocater will deliver high spectral resolution\n(R~150,000-240,000) measurements that permit novel studies of stellar and\nsubstellar objects in the solar neighborhood including extrasolar planets.\nUnlike previous planet-finding instruments, which are seeing-limited, iLocater\noperates at the diffraction limit and uses single mode fibers to eliminate the\neffects of modal noise entirely. By receiving starlight from two 8.4m diameter\ntelescopes that each use \"extreme\" adaptive optics (AO), iLocater shows promise\nto overcome the limitations that prevent existing instruments from generating\nsub-meter-per-second radial velocity (RV) precision. Although optimized for the\ncharacterization of low-mass planets using the Doppler technique, iLocater will\nalso advance areas of research that involve crowded fields, line-blanketing,\nand weak absorption lines.\n", "doi": "10.1117/12.2233135", "arxiv_id": "1609.04412", "pdf_urls": ["https://arxiv.org/pdf/1609.04412"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 990819 (4 August 2016)", "categories": "astro-ph.IM astro-ph.EP astro-ph.SR"}
{"title": "On-sky tests of sky-subtraction methods for fiber-fed spectrographs", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Myriam Rodrigues", "Michele Cirasuolo", "Francois Hammer", "Frederic Royer", "C. J. Evans", "Mathieu Puech", "Hector Flores", "Isabelle Guinouard", "Gianluca Li\n  Causi", "Karen Disseau", "Yanbin Yang"], "abstract": "  We present preliminary results on on-sky test of sky subtraction methods for\nfiber-fed spectrograph. Using dedicated observation with FLAMES/VLT in I-band,\nwe have tested the accuracy of the sky subtraction for 4 sky subtraction\nmethods: mean sky, closest sky, dual stare and cross-beam switching. The cross\nbeam-switching and dual stare method reach accuracy and precision of the sky\nsubtraction under 1%. In contrast to the commonly held view in the literature,\nthis result points out that fiber-fed spectrographs are adapted for the\nobservations of faint targets.\n", "doi": "10.1117/12.924878", "arxiv_id": "1609.06142", "pdf_urls": ["https://arxiv.org/pdf/1609.06142"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Modern Technologies in Space- and Ground-based Telescopes and\n  Instrumentation II. Proceedings of the SPIE, Volume 8450, article id. 84503H,\n  7 pp. (2012)", "categories": "astro-ph.IM"}
{"title": "On Data-Independent Properties for Density-Based Dissimilarity Measures\n  in Hybrid Clustering", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kajsa M{\\o}llersen", "Subhra S. Dhar", "Fred Godtliebsen"], "abstract": "  Hybrid clustering combines partitional and hierarchical clustering for\ncomputational effectiveness and versatility in cluster shape. In such\nclustering, a dissimilarity measure plays a crucial role in the hierarchical\nmerging. The dissimilarity measure has great impact on the final clustering,\nand data-independent properties are needed to choose the right dissimilarity\nmeasure for the problem at hand. Properties for distance-based dissimilarity\nmeasures have been studied for decades, but properties for density-based\ndissimilarity measures have so far received little attention. Here, we propose\nsix data-independent properties to evaluate density-based dissimilarity\nmeasures associated with hybrid clustering, regarding equality, orthogonality,\nsymmetry, outlier and noise observations, and light-tailed models for\nheavy-tailed clusters. The significance of the properties is investigated, and\nwe study some well-known dissimilarity measures based on Shannon entropy,\nmisclassification rate, Bhattacharyya distance and Kullback-Leibler divergence\nwith respect to the proposed properties. As none of them satisfy all the\nproposed properties, we introduce a new dissimilarity measure based on the\nKullback-Leibler information and show that it satisfies all proposed\nproperties. The effect of the proposed properties is also illustrated on\nseveral real and simulated data sets.\n", "doi": "10.4236/am.2016.715143", "arxiv_id": "1609.06533", "pdf_urls": ["https://arxiv.org/pdf/1609.06533"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "M{\\o}llersen, K., Dhar, S.S. and Godtliebsen, F. (2016) On\n  Data-Independent Properties for Density-Based Dissimilarity Measures in\n  Hybrid Clustering. Applied Mathematics, 7, 1674-1706", "categories": "stat.ML cs.LG"}
{"title": "Developing an integrated concept for the E-ELT Multi-Object Spectrograph\n  (MOSAIC): design issues and trade-offs", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Myriam Rodrigues", "Gavin Dalton", "Ewan Fitzsimons", "Fanny Chemla", "Tim\n  Morris", "Francois Hammer", "Mathieu Puech", "Christopher Evans", "Pascal Jagourel"], "abstract": "  We present a discussion of the design issues and trade-offs that have been\nconsidered in putting together a new concept for MOSAIC, the multi-object\nspectrograph for the E-ELT. MOSAIC aims to address the combined science cases\nfor E-ELT MOS that arose from the earlier studies of the multi-object and\nmulti-adaptive optics instruments. MOSAIC combines the advantages of a\nhighly-multiplexed instrument targeting single-point objects with one which has\na more modest multiplex but can spatially resolve a source with high resolution\n(IFU). These will span across two wavebands: visible and near-infrared.\n", "doi": "10.1117/12.2232562", "arxiv_id": "1609.06610", "pdf_urls": ["https://arxiv.org/pdf/1609.06610"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 99089S , 2016", "categories": "astro-ph.IM"}
{"title": "SPHERE IRDIS and IFS astrometric strategy and calibration", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anne-Lise Maire", "Maud Langlois", "Kjetil Dohlen", "Anne-Marie Lagrange", "Raffaele Gratton", "Gael Chauvin", "Silvano Desidera", "Julien H. Girard", "Julien\n  Milli", "Arthur Vigan", "Gerard Zins", "Philippe Delorme", "Jean-Luc Beuzit", "Riccardo\n  U. Claudi", "Markus Feldt", "David Mouillet", "Pascal Puget", "Massimo Turatto", "Francois Wildi"], "abstract": "  We present the current results of the astrometric characterization of the VLT\nplanet finder SPHERE over 2 years of on-sky operations. We first describe the\ncriteria for the selection of the astrometric fields used for calibrating the\nscience data: binaries, multiple systems, and stellar clusters. The analysis\nincludes measurements of the pixel scale and the position angle with respect to\nthe North for both near-infrared subsystems, the camera IRDIS and the integral\nfield spectrometer IFS, as well as the distortion for the IRDIS camera. The\nIRDIS distortion is shown to be dominated by an anamorphism of 0.60+/-0.02%\nbetween the horizontal and vertical directions of the detector, i.e. 6 mas at\n1\". The anamorphism is produced by the cylindrical mirrors in the common path\nstructure hence common to all three SPHERE science subsystems (IRDIS, IFS, and\nZIMPOL), except for the relative orientation of their field of view. The\ncurrent estimates of the pixel scale and North angle for IRDIS are\n12.255+/-0.009 milliarcseconds/pixel for H2 coronagraphic images and\n-1.75+/-0.08 deg. Analyses of the IFS data indicate a pixel scale of\n7.46+/-0.02 milliarcseconds/pixel and a North angle of -102.18+/-0.13 deg. We\nfinally discuss plans for providing astrometric calibration to the SPHERE users\noutside the instrument consortium.\n", "doi": "10.1117/12.2233013", "arxiv_id": "1609.06681", "pdf_urls": ["https://arxiv.org/pdf/1609.06681"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 990834 (August 9, 2016)", "categories": "astro-ph.IM astro-ph.EP"}
{"title": "First results of the Test-Bed Telescopes (TBT) project: Cebreros\n  telescope commissioning", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Francisco Oca\\~na", "Aitor Ibarra", "Elena Racero", "\\'Angel Montero", "Ji\\~r\\'i Doubek and Vicente Ruiz"], "abstract": "  The TBT project is being developed under ESA's General Studies and Technology\nProgramme (GSTP), and shall implement a test-bed for the validation of an\nautonomous optical observing system in a realistic scenario within the Space\nSituational Awareness (SSA) programme of the European Space Agency (ESA). The\ngoal of the project is to provide two fully robotic telescopes, which will\nserve as prototypes for development of a future network. The system consists of\ntwo telescopes, one in Spain and the second one in the Southern Hemisphere. The\ntelescope is a fast astrograph with a large Field of View of 2.5 x 2.5\nsquare-degrees and a plate scale of 2.2 arcsec/pixel. The tube is mounted on a\nfast direct-drive mount moving with speed up to 20 degrees per second. The\nfocal plane hosts a 2-port 4K x 4K back-illuminated CCD with readout speeds up\nto 1MHz per port. Detection software and hardware are optimised for the\ndetection of NEOs and objects in high Earth orbits (objects moving from 0.1-40\narcsec/second). Every night it takes all the input needed and prepares a\nschedule following predefined rules allocating tasks for the telescopes.\nTelescopes are managed by RTS2 control software, that performs the real-time\nscheduling of the observation and manages all the devices at the observatory.1\nAt the end of the night the observing systems report astrometric positions and\nphotometry of the objects detected. The first telescope was installed in\nCebreros Satellite Tracking Station in mid-2015. We evaluate the site\ncharacteristics and the performance of the TBT Cebreros telescope in the\ndifferent modes and strategies. Average residuals for asteroids are under 0.5\narcsecond, while they are around 1 arcsecond for upper-MEO and GEO satellites.\nThe survey depth is dimmer than magnitude 18.5 for 30-second exposures with the\nusual seeing around 4 arcseconds.\n", "doi": "10.1117/12.2233142", "arxiv_id": "1609.07943", "pdf_urls": ["https://arxiv.org/pdf/1609.07943"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the SPIE Astronomical Instrumentation and\n  Telescopes conference, Ground-based and Airborne Telescopes VI (9906), 2016", "categories": "astro-ph.IM astro-ph.EP"}
{"title": "Low cost multi-purpose balloon-borne platform for wide-field imaging and\n  video observation", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Francisco Oca\\~na", "Alejandro S\\'anchez de Miguel", "Aitor Conde and\n  Daedalus Team"], "abstract": "  Atmosphere layers, especially the troposphere, hinder the astronomical\nobservation. For more than 100 years astronomers have tried observing from\nballoons to avoid turbulence and extinction. New developments in cardsize\ncomputers, RF equipment and satellite navigation have democratised the access\nto the stratosphere. As a result of a ProAm collaboration with the Daedalus\nTeam we have developed a low-cost multi-purpose platform with stratospheric\nballoons carrying up to 3 kg of scientific payload. The Daedalus Team is an\namateur group that has been launching sounding probes since 2010. Since then\nthe first two authors have provided scienti fic payloads for nighttime flights\nwith the purpose of technology demonstration for astronomical observation. We\nhave successfully observed meteor showers (Geminids 2012, Camelopardalis 2014,\nQuadrantids 2016 and Lyrids 2016) and city light pollution emission with image\nand video sensors covering the 400-1000nm range.\n", "doi": "10.1117/12.2233001", "arxiv_id": "1609.07952", "pdf_urls": ["https://arxiv.org/pdf/1609.07952"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the SPIE Astronomical Instrumentation and\n  Telescopes conference, Ground-based and Airborne Telescopes VI (9906), 2016", "categories": "astro-ph.IM astro-ph.EP"}
{"title": "Gemini Planet Imager Observational Calibrations XIV: Polarimetric\n  Contrasts and New Data Reduction Techniques", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Maxwell A. Millar-Blanchaer", "Marshall D. Perrin", "Li-Wei Hung", "Michael\n  P. Fitzgerald", "Jason J. Wang", "Jeffrey Chilcote", "James R. Graham", "Sebastian\n  Bruzzone", "Paul G. Kalas", "and the GPI collaboration"], "abstract": "  The Gemini Planet Imager (GPI) has been designed for the direct detection and\ncharacterization of exoplanets and circumstellar disks. GPI is equipped with a\ndual channel polarimetry mode designed to take advantage of the inherently\npolarized light scattered off circumstellar material to further suppress the\nresidual seeing halo left uncorrected by the adaptive optics. We explore how\nrecent advances in data reduction techniques reduce systematics and improve the\nachievable contrast in polarimetry mode. In particular, we consider different\nflux extraction techniques when constructing datacubes from raw data, division\nby a polarized flat-field and a method for subtracting instrumental\npolarization. Using observations of unpolarized standard stars we find that\nGPI's instrumental polarization is consistent with being wavelength independent\nwithin our errors. In addition, we provide polarimetry contrast curves that\ndemonstrate typical performance throughout the GPIES campaign.\n", "doi": "10.1117/12.2233071", "arxiv_id": "1609.08691", "pdf_urls": ["https://arxiv.org/pdf/1609.08691"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 990836 (August 9, 2016)", "categories": "astro-ph.IM"}
{"title": "Gemini Planet Imager Observational Calibration XIII: Wavelength\n  Calibration Improvements, Stability, and Nonlinearity", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Schuyler G. Wolff", "Kimberly Ward-Duong", "Joe Zalesky", "Alex Z.\n  Greenbaum", "Marshall D. Perrin", "and James Graham (the GPI team)"], "abstract": "  We present improvements to the wavelength calibration for the lenslet-based\nIntegral Field Spectrograph (IFS), that serves as the science instrument for\nthe Gemini Planet Imager (GPI). The GPI IFS features a 2.7\" $\\times$ 2.7\" field\nof view and a 190 $\\times$ 190 lenslet array (14.1 mas/lenslet) with spectral\nresolving power ranging from R $\\sim$ 35 to 78. A unique wavelength solution is\ndetermined for each lenslet characterized by a two-dimensional position, an\nn-dimensional polynomial describing the spectral dispersion, and the rotation\nof the spectrum with respect to the detector axis. We investigate the\nnon-linearity of the spectral dispersion across all Y, J, H, and K bands\nthrough both on-sky arc lamp images and simulated IFS images using a model of\nthe optical path. Additionally, the 10-hole non-redundant masking mode on GPI\nprovides an alternative measure of wavelength dispersion within a datacube by\ncross-correlating reference PSFs with science images. This approach can be used\nto confirm deviations from linear dispersion in the reduced datacubes. We find\nthat the inclusion of a quadratic term provides a factor of 10 improvement in\nwavelength solution accuracy over the linear solution and is necessary to\nachieve uncertainties of a few hundredths of a pixel in J band to a few\nthousands of a pixel in the K bands. This corresponds to a wavelength\nuncertainty of $\\sim$0.2 nm across all filters.\n", "doi": "10.1117/12.2233644", "arxiv_id": "1609.08693", "pdf_urls": ["https://arxiv.org/pdf/1609.08693"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 990838 (9 August 2016)", "categories": "astro-ph.IM"}
{"title": "Hydrogen atom in a Laser-Plasma", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Babatunde James Falaye", "Guo-Hua Sun", "Muhammed S. Liman", "K. J. Oyewumi\n  and Shi-Hai Dong"], "abstract": "  We scrutinize the behaviour of hydrogen atom's eigenvalues in a quantum\nplasma as it interacts with electric field directed along $\\theta=\\pi$ and\nexposed to linearly polarized intense laser field radiation. Using the\nKramers-Henneberger (KH) unitary transformation, which is semiclassical\ncounterpart of the Block-Nordsieck transformation in the quantized field\nformalism, the squared vector potential that appears in the equation of motion\nis eliminated and the resultant equation is expressed in KH frame. Within this\nframe, the resulting potential and the corresponding wavefunction have been\nexpanded in Fourier series and using Ehlotzky's approximation, we obtain a\nlaser-dressed potential to simulate intense laser field. By fitting the\nexponential-cosine-screened Coulomb potential into the laser-dressed potential,\nand then expanding it in Taylor series up to $\\mathcal{O}(r^4,\\alpha_0^9)$, we\nobtain the eigensolution (eigenvalues and wavefunction) of hydrogen atom in\nlaser-plasma encircled by electric field, within the framework of perturbation\ntheory formalism. Our numerical results show that for a weak external electric\nfield and gargantuan length of Debye screening parameter, the system is\nstrongly repulsive in contrast for strong external electric field and small\nlength of Debye screening parameter, the system is very attractive. This work\nhas potential application in the areas of atomic and molecular processes in\nexternal fields including interactions with strong fields and short pulses.\n", "doi": "10.1088/1612-2011/13/11/116003", "arxiv_id": "1610.01120", "pdf_urls": ["https://arxiv.org/pdf/1610.01120"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 13 (2016) 116003", "categories": "quant-ph physics.plasm-ph"}
{"title": "A mechanical erosion model for two-phase mass flows", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shiva P. Pudasaini and Jan-Thomas Fischer"], "abstract": "  Erosion, entrainment and deposition are complex and dominant, but yet poorly\nunderstood, mechanical processes in geophysical mass flows. Here, we propose a\nnovel, process-based, two-phase, erosion-deposition model capable of adequately\ndescribing these complex phenomena commonly observed in landslides, avalanches,\ndebris flows and bedload transport. The model is based on the jump in the\nmomentum flux including changes of material and flow properties along the\nflow-bed interface and enhances an existing general two-phase mass flow model\n(Pudasaini, 2012). A two-phase variably saturated erodible basal morphology is\nintroduced and allows for the evolution of erosion-deposition-depths,\nincorporating the inherent physical process including momentum and rheological\nchanges of the flowing mixture. By rigorous derivation, we show that\nappropriate incorporation of the mass and momentum productions or losses in\nconservative model formulation is essential for the physically correct and\nmathematically consistent description of erosion-entrainment-deposition\nprocesses. We show that mechanically deposition is the reversed process of\nerosion. We derive mechanically consistent closures for coefficients emerging\nin the erosion rate models. We prove that effectively reduced friction in\nerosion is equivalent to the momentum production. With this, we solve the long\nstanding dilemma of mass mobility, and show that erosion enhances the mass flow\nmobility. The novel enhanced real two-phase model reveals some major aspects of\nthe mechanics associated with erosion, entrainment and deposition. The model\nappropriately captures the emergence and propagation of complex frontal surge\ndynamics associated with the frontal ambient-drag with erosion.\n", "doi": "10.1016/j.ijmultiphaseflow.2020.103416", "arxiv_id": "1610.01806", "pdf_urls": ["https://arxiv.org/pdf/1610.01806"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, 132, 103416, 2020", "categories": "physics.flu-dyn"}
{"title": "Tunable metasurfaces via subwavelength phase shifters with uniform\n  amplitude", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shane Colburn", "Alan Zhan", "Arka Majumdar"], "abstract": "  Metasurfaces with tunable spatial phase functions could benefit numerous\napplications. Currently, most approaches to tuning rely on mechanical\nstretching which cannot control phase locally, or by modulating the refractive\nindex to exploit rapid phase changes with the drawback of also modulating\namplitude. Here, we propose a method to realize phase modulation at\nsubwavelength length scales while maintaining unity amplitude. Our device is\ninspired by an asymmetric Fabry-Perot resonator, with pixels comprising a\nscattering nanopost on top of a distributed Bragg reflector, capable of\nproviding a nearly 2{\\pi} nonlinear phase shift with less than 2% refractive\nindex modulation. Using the designed pixels, we simulate a tunable metasurface\ncomposed of an array of moderately coupled nanopost resonators, realizing\naxicons, vortex beam generators, and aspherical lenses with both variable focal\nlength and in-plane scanning capability, achieving nearly diffraction-limited\nperformance. The experimental feasibility of the proposed method is also\ndiscussed.\n", "doi": "10.1038/srep40174", "arxiv_id": "1610.01966", "pdf_urls": ["https://arxiv.org/pdf/1610.01966"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Colburn, S. et al. Tunable metasurfaces via subwavelength phase\n  shifters with uniform amplitude. Sci. Rep. 7, 40174; doi: 10.1038/srep40174\n  (2017)", "categories": "physics.optics"}
{"title": "A mechanical model for phase-separation in debris flow", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shiva P. Pudasaini and Jan-Thomas Fischer"], "abstract": "  Understanding the physics of phase-separation between solid and fluid phases\nas a mixture mass moves down slope is a long-standing challenge. Here, we\npropose an extension of the two phase mass flow model (Pudasaini, 2012) by\nincluding a new mechanism, called separation-flux, that leads to strong\nphase-separation in avalanche and debris flows while balancing the enhanced\nsolid flux with the reduced fluid flux. The separation flux mechanism is\ncapable of describing the dynamically evolving phase-separation and levee\nformation in a multi-phase, geometrically three-dimensional debris flow. These\nare often observed phenomena in natural debris flows and industrial processes\nthat involve the transportation of particulate solid-fluid mixture material.\nThe novel separation-flux model includes several dominant physical and\nmechanical aspects such as pressure gradients, volume fractions of solid and\nfluid phases and their gradients, shear-rates, flow depth, material friction,\nviscosity, material densities, topographic constraints, grain size, etc. Due to\nthe inherent separation mechanism, as the mass moves down slope, more and more\nsolid particles are transported to the front and the sides, resulting in\nsolid-rich and mechanically strong frontal surge head, and lateral levees\nfollowed by a weaker tail largely consisting of viscous fluid. The primary\nfrontal solid-rich surge head followed by secondary fluid-rich surges is the\nconsequence of phase-separation. Such typical and dominant phase-separation\nphenomena are revealed for two-phase debris flow simulations. Finally, changes\nin flow composition, that are explicitly considered by the new modelling\napproach, result in significant changes of impact pressure estimates. These are\nhighly important in hazard assessment and mitigation planning and highlight the\napplication potential of the new approach.\n", "doi": "10.1016/j.ijmultiphaseflow.2020.103292", "arxiv_id": "1610.03649", "pdf_urls": ["https://arxiv.org/pdf/1610.03649"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, 129, 103292, 2020", "categories": "physics.geo-ph cond-mat.soft physics.flu-dyn"}
{"title": "Information processing using three-qubit and qubit-qutrit encodings of\n  noncomposite quantum systems", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.A. Popov", "E.O. Kiktenko", "A.K. Fedorov", "V.I. Man'ko"], "abstract": "  We study quantum information properties of a seven-level system realized by a\nparticle in an one-dimensional square-well trap. Features of encodings of\nseven-level systems in a form of three-qubit or qubit-qutrit systems are\ndiscussed. We use the three-qubit encoding of the system in order to\ninvestigate subadditivity and strong subadditivity conditions for the thermal\nstate of the particle. The qubit-qutrit encoding is employed to suggest a\nsingle qudit algorithm for calculation of parity of a bit string. Obtained\nresults indicate on the potential resource of multilevel systems for\nrealization of quantum information processing.\n", "doi": "10.1007/s10946-016-9610-8", "arxiv_id": "1610.05576", "pdf_urls": ["https://arxiv.org/pdf/1610.05576"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser Res. 37, 581 (2016)", "categories": "quant-ph"}
{"title": "Robust quantum state transfer between two superconducting qubits via\n  partial measurement", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yan-Ling Li", "Yao Yao", "Xing Xiao"], "abstract": "  We develop a potentially practical proposal for robust quantum state transfer\n(QST) between two superconducting qubits coupled by a coplanar waveguide (CPW)\nresonator. We show that the partial measurement could drastically enhance the\nfidelity even when the dissipation of qubits and CPW is considered. Unlike many\nother schemes for QST, our proposal does not require the couplings between the\nqubits and the CPW resonator to be strong. In fact, our method works much more\nefficiently in the weak coupling regime. The underlying mechanism is attributed\nto the probabilistic nature of partial measurement.\n", "doi": "10.1088/1612-2011/13/12/125202", "arxiv_id": "1610.06257", "pdf_urls": ["https://arxiv.org/pdf/1610.06257"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 13: 125202 (2016)", "categories": "quant-ph"}
{"title": "Detecting functional decline from normal ageing to dementia: development\n  and validation of a short version of the Amsterdam IADL Questionnaire", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Roos J. Jutten", "Carel F.W. Peeters", "Sophie M. J. Leijdesdorff", "Pieter\n  Jelle Visser", "Andrea B. Maier", "Caroline B. Terwee", "Philip Scheltens", "Sietske\n  A. M. Sikkes"], "abstract": "  INTRODUCTION: Detecting functional decline from normal ageing to dementia is\nrelevant for diagnostic and prognostic purposes. Therefore, the Amsterdam IADL\nQuestionnaire (A-IADL-Q) was developed: a 70-item proxy-based tool with good\npsychometric properties. We aimed to design a short version whilst preserving\nits psychometric quality. METHODS: Study partners of subjects (n=1355), ranging\nfrom cognitively normal to dementia subjects, completed the original A-IADL-Q.\nWe selected the short version items using a stepwise procedure combining\nmissing data, Item Response Theory and input from respondents and experts. We\ninvestigated internal consistency of the short version as well as concordance\nwith the original version. To assess its construct validity, we additionally\ninvestigated concordance between the short version and the Mini-Mental State\nExamination (MMSE) and Disability Assessment for Dementia (DAD). Lastly, we\ninvestigated differences in IADL scores between diagnostic groups across the\ndementia spectrum. RESULTS: We selected 30 items covering the entire spectrum\nof IADL functioning. Internal consistency (.98) and concordance with the\noriginal version (.97) were very high. Concordance with the MMSE (.72) and DAD\n(.87) scores was high. IADL impairment scores increased across the spectrum\nfrom normal cognition to dementia. DISCUSSION: The A-IADL-Q Short Version\n(A-IADL-Q-SV) consists of 30 items. The A-IADL-Q-SV has maintained the\npsychometric quality of the original A-IADL-Q. As such, it is a concise measure\nof functional decline.\n", "doi": "10.1016/j.dadm.2017.03.002", "arxiv_id": "1610.06762", "pdf_urls": ["https://arxiv.org/pdf/1610.06762"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Alzheimer's & Dementia: Diagnosis, Assessment & Disease\n  Monitoring, 8 (2017): 26-35", "categories": "q-bio.NC"}
{"title": "Scientific Literature Text Mining and the Case for Open Access", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gopal P. Sarma"], "abstract": "  \"Open access\" has become a central theme of journal reform in academic\npublishing. In this article, I examine the relationship between open access\npublishing and an important infrastructural element of a modern research\nenterprise, scientific literature text mining, or the use of data analytic\ntechniques to conduct meta-analyses and investigations into the scientific\ncorpus. I give a brief history of the open access movement, discuss novel\njournalistic practices, and an overview of data-driven investigation of the\nscientific corpus. I argue that particularly in an era where the veracity of\nmany research studies has been called into question, scientific literature text\nmining should be one of the key motivations for open access publishing, not\nonly in the basic sciences, but in the engineering and applied sciences as\nwell. The enormous benefits of unrestricted access to the research literature\nshould prompt scholars from all disciplines to lend their vocal support to\nenabling legal, wholesale access to the scientific literature as part of a data\nscience pipeline.\n", "doi": "10.21428/14888", "arxiv_id": "1611.00097", "pdf_urls": ["https://arxiv.org/pdf/1611.00097"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Sarma G. Scientific Literature Text Mining and the Case for Open\n  Access. The Journal of Open Engineering [Internet]. 2017 Dec 8; Available\n  from:\n  https://www.tjoe.org/pub/scientific-literature-text-mining-and-the-case-for-open-access", "categories": "cs.CY cs.DL physics.soc-ph"}
{"title": "The Land Surface Temperature Synergistic Processor in BEAM: A Prototype\n  towards Sentinel-3", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ana Belen Ruescas", "Olaf Danne", "Norman Fomferra and Carsten Brockmann"], "abstract": "  Land Surface Temperature (LST) is one of the key parameters in the physics of\nland-surface processes on regional and global scales, combining the results of\nall surface-atmosphere interactions and energy fluxes between the surface and\nthe atmosphere. With the advent of the European Space Agency (ESA) Sentinel 3\n(S3) satellite, accurate LST retrieval methodologies are being developed by\nexploiting the synergy between the Ocean and Land Colour Instrument (OLCI) and\nthe Sea and Land Surface Temperature Radiometer (SLSTR). In this paper we\nexplain the implementation in the Basic ENVISAT Toolbox for (A)ATSR and MERIS\n(BEAM) and the use of one LST algorithm developed in the framework of the\nSynergistic Use of The Sentinel Missions For Estimating And Monitoring Land\nSurface Temperature (SEN4LST) project. The LST algorithm is based on the\nsplit-window technique with an explicit dependence on the surface emissivity.\nPerformance of the methodology is assessed by using MEdium Resolution Imaging\nSpectrometer/Advanced Along-Track Scanning Radiometer (MERIS/AATSR) pairs,\ninstruments with similar characteristics than OLCI/ SLSTR, respectively. The\nLST retrievals were properly validated against in situ data measured along one\nyear (2011) in three test sites, and inter-compared to the standard AATSR\nlevel-2 product with satisfactory results. The algorithm is implemented in BEAM\nusing as a basis the MERIS/AATSR Synergy Toolbox. Specific details about the\nprocessor validation can be found in the validation report of the SEN4LST\nproject.\n", "doi": "10.3390/data1030018", "arxiv_id": "1611.00557", "pdf_urls": ["https://arxiv.org/pdf/1611.00557"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Data 2016, 1, 18; (MDPI) Basel, Switzerland", "categories": "physics.geo-ph"}
{"title": "Interfacial-state coupling induced topological phase transitions in SnTe\n  (110) thin film", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiao Li and Qian Niu"], "abstract": "  A defining feature of topological insulating phases is symmetry-protected\ninterfacial Dirac states. SnTe is a representative topological crystalline\ninsulator, of which (110) thin films have two symmetry-unrelated valleys of\ninterfacial states. With the help of valley-contrasting couplings of\ninterfacial states, we design various two-dimensional topological phases in\n(110) SnTe thin film systems. Our first-principles calculations demonstrate\nthat surface-state coupling strengths of two valleys independently vary with\nthe thickness of the thin film, leading to both two-dimensional topological\ncrystalline insulator and quantum spin Hall insulator. Most interestingly, by\nconstructing a nanoribbon array of SnTe thin film, edge-state couplings of\nnanoribbons can further induce topological phase transition between the above\ntopological phases with high tunability, which offers multi-mode quantum\ntransport with potential use in electronic and spintronic devices.\n", "doi": "10.1103/physrevb.95.241411", "arxiv_id": "1611.03151", "pdf_urls": ["https://arxiv.org/pdf/1611.03151"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Phys. Rev. B 95, 241411(R) (2017) with title \"Topological phase\n  transitions in thin films by tuning multivalley boundary-state couplings\"", "categories": "cond-mat.mtrl-sci"}
{"title": "Estimation of teleported and gained parameters in a non-inertial frame", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["N. Metwally"], "abstract": "  We estimate the teleported and the gained parameters by means of Fisher\ninformation in a non-inertial frame. The sender and the receiver share an\naccelerated maximum or partial entangled state. The estimation degree of these\nparameters depends on Unruh acceleration, the used single mode\napproximation(within/ beyond), the structure of the initial teleported state,\nand the entanglement of the initial communication channel. The maximization and\nminimization estimation degree of the teleported parameters depend on the\ninitial encoded information. The estimation degree of the parameters can be\nmaximized if the partners teleport classical information.\n", "doi": "10.1088/1612-202x/aa5d2a", "arxiv_id": "1611.03460", "pdf_urls": ["https://arxiv.org/pdf/1611.03460"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14 (2017) 045202", "categories": "quant-ph"}
{"title": "Naming the Pain in Requirements Engineering: Design of a Global Family\n  of Surveys and First Results from Germany", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniel M\\'endez Fern\\'andez and Stefan Wagner"], "abstract": "  Context: For many years, we have observed industry struggling in defining a\nhigh quality requirements engineering (RE) and researchers trying to understand\nindustrial expectations and problems. Although we are investigating the\ndiscipline with a plethora of empirical studies, those studies either\nconcentrate on validating specific methods or on single companies or countries.\nTherefore, they allow only for limited empirical generalisations. Objective: To\nlay an empirical and generalisable foundation about the state of the practice\nin RE, we aim at a series of open and reproducible surveys that allow us to\nsteer future research in a problem-driven manner. Method: We designed a\nglobally distributed family of surveys in joint collaborations with different\nresearchers from different countries. The instrument is based on an initial\ntheory inferred from available studies. As a long-term goal, the survey will be\nregularly replicated to manifest a clear understanding on the status quo and\npractical needs in RE. In this paper, we present the design of the family of\nsurveys and first results of its start in Germany. Results: Our first results\ncontain responses from 30 German companies. The results are not yet\ngeneralisable, but already indicate several trends and problems. For instance,\na commonly stated problem respondents see in their company standards are\nartefacts being underrepresented, and important problems they experience in\ntheir projects are incomplete and inconsistent requirements. Conclusion: The\nresults suggest that the survey design and instrument are well-suited to be\nreplicated and, thereby, to create a generalisable empirical basis of RE in\npractice.\n", "doi": "10.1145/2460999.2461027", "arxiv_id": "1611.04976", "pdf_urls": ["https://arxiv.org/pdf/1611.04976"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. 17th International Conference on Evaluation and Assessment\n  in Software Engineering (EASE'13). ACM, 2013", "categories": "cs.SE"}
{"title": "A Prudent-Precedence Concurrency Control Protocol for High Data\n  Contention Database Enviornments", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Weidong Xiong", "Feng Yu", "Mohammed Hamdi and Wen-Chi Hou"], "abstract": "  In this paper, we propose a concurrency control protocol, called the\nPrudent-Precedence Concurrency Control (PPCC) protocol, for high data\ncontention database environments. PPCC is prudently more aggressive in\npermitting more serializable schedules than two-phase locking. It maintains a\nrestricted precedence among conflicting transactions and commits the\ntransactions according to the serialization order established in the\nexecutions. A detailed simulation model has been constructed and extensive\nexperiments have been conducted to evaluate the performance of the proposed\napproach. The results demonstrate that the proposed algorithm outperforms the\ntwo-phase locking and optimistic concurrency control in all ranges of system\nworkload.\n", "doi": "10.5121/ijdms.2016.8501", "arxiv_id": "1611.05557", "pdf_urls": ["https://arxiv.org/pdf/1611.05557"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Database Management Systems (IJDMS),\n  8(5), 1-14 (2016)", "categories": "cs.DB"}
{"title": "Large bipolarons and oxide superconductivity", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["David Emin"], "abstract": "  Large-bipolaron superconductivity is plausible with carrier densities well\nbelow those of conventional metals. Bipolarons form when carriers self-trap in\npairs. Coherently moving large-bipolarons require extremely large ratios of\nstatic to optical dielectric-constants. The mutual Coulomb repulsion of a\nplanar large-bipolarons paired carriers drives it to a four-lobed shape. A\nphonon-mediated attraction among large-bipolarons propels their condensation\ninto a liquid. This liquids excitations move slowly with a huge effective mass.\nExcitations concomitant weak scattering by phonons produces a moderate\nlow-temperature dc resistivity that increases linearly with rising temperature.\nWith falling temperature an energy gap opens between large-bipolarons\nexcitations and those of their self-trapped electronic carriers.\n", "doi": "10.1117/12.2261717", "arxiv_id": "1611.05813", "pdf_urls": ["https://arxiv.org/pdf/1611.05813"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10105, Oxide-based Materials and Devices VIII, 1010505\n  (February 28, 2017)", "categories": "cond-mat.supr-con"}
{"title": "ResFeats: Residual Network Based Features for Image Classification", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ammar Mahmood", "Mohammed Bennamoun", "Senjian An", "Ferdous Sohel"], "abstract": "  Deep residual networks have recently emerged as the state-of-the-art\narchitecture in image segmentation and object detection. In this paper, we\npropose new image features (called ResFeats) extracted from the last\nconvolutional layer of deep residual networks pre-trained on ImageNet. We\npropose to use ResFeats for diverse image classification tasks namely, object\nclassification, scene classification and coral classification and show that\nResFeats consistently perform better than their CNN counterparts on these\nclassification tasks. Since the ResFeats are large feature vectors, we propose\nto use PCA for dimensionality reduction. Experimental results are provided to\nshow the effectiveness of ResFeats with state-of-the-art classification\naccuracies on Caltech-101, Caltech-256 and MLC datasets and a significant\nperformance improvement on MIT-67 dataset compared to the widely used CNN\nfeatures.\n", "doi": "10.1109/icip.2017.8296551", "arxiv_id": "1611.06656", "pdf_urls": ["https://arxiv.org/pdf/1611.06656"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "A. Mahmood, M. Bennamoun, S. An and F. Sohel, \"Resfeats: Residual\n  network based features for image classification,\" 2017 IEEE International\n  Conference on Image Processing (ICIP), Beijing, 2017, pp. 1597-1601", "categories": "cs.CV"}
{"title": "Benchmarking OODBs with a Generic Tool", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J\\'er\\^ome Darmont (LIMOS)", "Michel Schneider (LIMOS)"], "abstract": "  We present in this paper a generic object-oriented benchmark (OCB: the Object\nClustering Benchmark) that has been designed to evaluate the performances of\nObject-Oriented Data-bases (OODBs), and more specifically the performances of\nclustering policies within OODBs. OCB is generic because its sample database\nmay be customized to fit any of the databases in-troduced by the main existing\nbenchmarks, e.g., OO1 (Object Operation 1) or OO7. The first version of OCB was\npurposely clustering-oriented due to a clustering-oriented workload, but OCB\nhas been thoroughly extended to be able to suit other purposes. Eventually,\nOCB's code is compact and easily portable. OCB has been validated through two\nimplementations: one within the O2 OODB and another one within the Texas\npersistent object store. The perfor-mances of a specific clustering policy\ncalled DSTC (Dynamic, Statistical, Tunable Clustering) have also been evaluated\nwith OCB.\n", "doi": null, "arxiv_id": "1611.09172", "pdf_urls": ["https://arxiv.org/pdf/1611.09172"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Database Management, IGI Global, 2000, 11 (3), pp.16-27", "categories": "cs.DB"}
{"title": "A Guide to Localized Frames and Applications to Galerkin-like\n  Representations of Operators", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Peter Balazs and Karlheinz Gr\\\"ochenig"], "abstract": "  This chapter offers a detailed survey on intrinsically localized frames and\nthe corresponding matrix representation of operators. We re-investigate the\nproperties of localized frames and the associated Banach spaces in full detail.\nWe investigate the representation of operators using localized frames in a\nGalerkin-type scheme. We show how the boundedness and the invertibility of\nmatrices and operators are linked and give some sufficient and necessary\nconditions for the boundedness of operators between the associated Banach\nspaces.\n", "doi": "10.1007/978-3-319-55550-8_4", "arxiv_id": "1611.09692", "pdf_urls": ["https://arxiv.org/pdf/1611.09692"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In: Frames and Other Bases in Abstract and Function Space, Isaac\n  Pesenson and Hrushikesh Mhaskar and Azita Mayeli and Quoc T. Le Gia and\n  Ding-Xuan Zhou (Ed.) Birkh\\\"auser, Cham 2017", "categories": "math.FA"}
{"title": "Effect of Strontium substitution on the structural and magnetic\n  properties of La1.8Sr0.2MMnO6 (M = Ni, Co) layered manganites", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Syeda Karimunnesa", "Bashir Ahmmad and M. A. Basith"], "abstract": "  Sr substituted perovskites La1.8Sr0.2MMnO6 (M = Ni, Co) were synthesized\nusing solid state reaction technique to present a systematic study on their\nmorphological, structural and magnetic properties. The average grain size of\nthe as-prepared La1.8Sr0.2NiMnO6 samples are in the range of 0.2-0.7 {\\mu}m and\nthose for La1.8Sr0.2CoMnO6 manganites are 0.1-2.8 {\\mu}m, which is\nsignificantly less than that of unsubstituted La2NiMnO6 (LNMO) and La2CoMnO6\n(LCMO) manganites. The XPS analysis enlightened about phase purity, binding\nenergy and oxygen vacancy of La1.8Sr0.2MMnO6 manganites. The Sr substituted\nLNMO has revealed a sharp ferromagnetic to paramagnetic phase transition at 160\nK which is about 120 K less than that of parent LNMO. The Sr substituted LCMO\nexhibited such a transition at 220 K which is 8 K less than that of parent\nLCMO. The temperature dependent magnetization measurements suggest that the\neffect of Sr on the transition temperature in LNMO is more significant than\nthat of LCMO.\n", "doi": "10.1080/01411594.2016.1260723", "arxiv_id": "1611.10127", "pdf_urls": ["https://arxiv.org/pdf/1611.10127"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Phase Transitions, November, 2016", "categories": "cond-mat.str-el cond-mat.mtrl-sci"}
{"title": "Protection of entanglement between two two-level atoms", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anwei Zhang"], "abstract": "  The dynamical evolution of entanglement between two polarizable two-level\natoms in weak interaction with electromagnetic vacuum fluctuations is\ninvestigated. We find that, for initial Bell state $\\psi^{\\pm}$, the decay rate\nof entanglement between atoms is just the superradiant spontaneous emission\nrate, which depends not only on the spontaneous emission rate of atom but also\non the modulation of the spontaneous emission rate due to the presence of\nanother atom. It is shown that, with the presence of a boundary, the\nentanglement between transversely polarizable atoms can be protected for a very\nlong time. It is pointed out that when the two atoms in initial Bell state\n$\\psi^{-}$ are put close enough , the entanglement between them can also be\nprotected.\n", "doi": "10.1088/1612-202x/aa77c1", "arxiv_id": "1612.00442", "pdf_urls": ["https://arxiv.org/pdf/1612.00442"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14, 085201(2017 )", "categories": "quant-ph"}
{"title": "Predicting Melting point and Viscosity of Ionic Liquids Using New\n  Quantum Chemistry Descriptors", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A. Mehrkesh and A. T. Karunanithi"], "abstract": "  Ionic liquids (ILs) are an emerging group of chemical compounds which possess\npromising properties such as having negligible vapor pressure. These so called\ndesigner solvents have the potential to replace volatile organic compounds in\nindustrial applications. A large number of ILs, through the combination of\ndifferent cations and anions, can potentially be synthesized. In this context,\nit will be useful to intelligently design customized ILs through computer-aided\nmethods. Practical limitations dictate that any successful attempt to design\nnew ILs for industrial applications requires the ability to accurately predict\ntheir melting point and viscosity as experimental data will not be available\nfor designed structures. In this paper, we present two new correlation\nequations towards the more precise prediction of melting point and viscosity of\nILs solely based on the inputs from quantum chemistry calculations (no\nexperimental data or simulation results are needed). To develop these\ncorrelations we utilized data related to size, shape, and electrostatic\nproperties of cations and anions that constitutes ILs. In this work, new\ndescriptors such as dielectric energy of cations and anions as well as the\nvalues predicted by an ad-hoc model for the radii of cations and anions\n(instead of their van der waals radii) were used. An enormous form of\ncorrelation equations constituent of all different combinations of descriptors\n(as the inputs to the model) were tested. The average relative errors were\nmeasured to be 3.16% and 6.45% for the melting point, Tm, and ln(vis),\nrespectively.\n", "doi": "10.1016/j.fluid.2016.07.006", "arxiv_id": "1612.00879", "pdf_urls": ["https://arxiv.org/pdf/1612.00879"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Fluid Phase Equilibria, 427, 498-503 (2016)", "categories": "physics.chem-ph cond-mat.mtrl-sci"}
{"title": "Different models of gravitating Dirac fermions in optical lattices", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alessio Celi"], "abstract": "  In this paper I construct the naive lattice Dirac Hamiltonian describing the\npropagation of fermions in a generic 2D optical metric for different lattice\nand flux-lattice geometries. First, I apply a top-down constructive approach\nthat we first proposed in [Boada {\\it et al.,New J. Phys.} {\\bf 13} 035002\n(2011)] to the honeycomb and to the brickwall lattices. I carefully discuss how\ngauge transformations that generalize momentum (and Dirac cone) shifts in the\nBrillouin zone in the Minkowski homogeneous case can be used in order to change\nthe phases of the hopping. In particular, I show that lattice Dirac Hamiltonian\nfor Rindler spacetime in the honeycomb and brickwall lattices can be realized\nby considering real and isotropic (but properly position dependent) tunneling\nterms. For completeness, I also discuss a suitable formulation of Rindler Dirac\nHamiltonian in semi-synthetic brickwall and $\\pi$-flux square lattices (where\none of the dimension is implemented by using internal spin states of atoms as\nwe originally proposed in [Boada {\\it et al.,Phys. Rev. Lett. } {\\bf 108}\n133001 (2012)] and [Celi {\\it et al.,Phys. Rev. Lett. } {\\bf 112} 043001\n(2012)]).\n", "doi": "10.1140/epjst/e2016-60390-y", "arxiv_id": "1612.03076", "pdf_urls": ["https://arxiv.org/pdf/1612.03076"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Euro. J. Phys.J. Special Topics \"Quantum Gases and Quantum\n  Coherence\" 226, 2729 (2017)", "categories": "cond-mat.quant-gas"}
{"title": "Non-Redundant Spectral Dimensionality Reduction", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yochai Blau and Tomer Michaeli"], "abstract": "  Spectral dimensionality reduction algorithms are widely used in numerous\ndomains, including for recognition, segmentation, tracking and visualization.\nHowever, despite their popularity, these algorithms suffer from a major\nlimitation known as the \"repeated Eigen-directions\" phenomenon. That is, many\nof the embedding coordinates they produce typically capture the same direction\nalong the data manifold. This leads to redundant and inefficient\nrepresentations that do not reveal the true intrinsic dimensionality of the\ndata. In this paper, we propose a general method for avoiding redundancy in\nspectral algorithms. Our approach relies on replacing the orthogonality\nconstraints underlying those methods by unpredictability constraints.\nSpecifically, we require that each embedding coordinate be unpredictable (in\nthe statistical sense) from all previous ones. We prove that these constraints\nnecessarily prevent redundancy, and provide a simple technique to incorporate\nthem into existing methods. As we illustrate on challenging high-dimensional\nscenarios, our approach produces significantly more informative and compact\nrepresentations, which improve visualization and classification tasks.\n", "doi": "10.1007/978-3-319-71249-9_16", "arxiv_id": "1612.03412", "pdf_urls": ["https://arxiv.org/pdf/1612.03412"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "European Conference on Machine Learning and Knowledge Discovery in\n  Databases (ECML PKDD), Part I, LNAI 10534, pp. 256-271, 2017", "categories": "cs.LG stat.ML"}
{"title": "An electron of helium atom under a high-intensity laser field", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Babatunde James Falaye", "Guo-Hua Sun", "Adenike Grace Adepoju", "Muhammed\n  S. Liman", "K. J. Oyewumi and Shi-Hai Dong"], "abstract": "  We scrutinize the behavior of eigenvalues of an electron of Helium atom as it\ninteracts with electric field directed along $z$-axis and exposed to linearly\npolarized intense laser field radiation. In order to achieve this, we freeze\none electron of the helium atom at its ionic ground state and the motion of the\nsecond electron in the ion core is treated via a more general case of screened\nCoulomb potential model. Using the Kramers-Henneberger (KH) unitary\ntransformation, which is semiclassical counterpart of the Block-Nordsieck\ntransformation in the quantized field formalism, the squared vector potential\nthat appears in the equation of motion is eliminated and the resultant equation\nis expressed in KH frame. Within this frame, the resulting potential and the\ncorresponding wave function have been expanded in Fourier series and using\nEhlotzkys approximation, we obtain a laser-dressed potential to simulate\nintense laser field. By fitting the more general case of screened Coulomb\npotential model into the laser-dressed potential, and then expanding it in\nTaylor series up to $\\mathcal{O}(r^4,\\alpha_0^9)$, we obtain the solution\n(eigenvalues and wave function) of an electron of Helium atom under the\ninfluence of external electric field and high-intensity laser field, within the\nframework of perturbation theory formalism. We found that the variation in\nfrequency of laser radiation has no effect on the eigenvalues of an electron of\nhelium for a particular electric field intensity directed along $z$-axis. Also,\nfor a very strong external electric field and an infinitesimal screening\nparameter, the system is strongly bound. This work has potential application in\nthe areas of atomic and molecular processes in external fields including\ninteractions with strong fields and short pulses.\n", "doi": "10.1088/1555-6611/aa5338", "arxiv_id": "1612.03439", "pdf_urls": ["https://arxiv.org/pdf/1612.03439"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 27 (2017) 026004", "categories": "physics.atom-ph physics.plasm-ph quant-ph"}
{"title": "Modular quantum key distribution setup for research and development\n  applications", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.E. Rodimin", "E.O. Kiktenko", "V.V. Usova", "M.Yu. Ponomarev", "T.V.\n  Kazieva", "A.V. Miller", "A.S. Sokolov", "A.A. Kanapin", "A.V. Losev", "A.S.\n  Trushechkin", "M.N. Anufriev", "N.O. Pozhar", "V.L. Kurochkin", "Y.V. Kurochkin", "and\n  A.K. Fedorov"], "abstract": "  Quantum key distribution (QKD), ensuring the unconditional security of\ninformation, attracts a significant deal of interest. An important task is to\ndesign QKD systems as a platform for education as well as for research and\ndevelopment applications and fast prototyping new QKD protocols. Here we\npresent a modular QKD setup driven by National Instruments (NI) cards with open\nsource LabView code, open source Python code for post-processing procedures,\nand open source protocol for external applications. An important feature of the\ndeveloped apparatus is its flexibility offering possibilities to modify optical\nschemes and verify novel QKD protocols. Another distinctive feature of the\ndeveloped setup is the implementation of the decoy-state protocol, which is a\nstandard tool for secure long-distance quantum communications. By testing the\nplug-and-play scheme realizing BB84 and decoy-state BB84 QKD protocols, we\ndemonstrate that developed QKD setup shows a high degree of robustness beyond\nlaboratory conditions. We demonstrate the results of the use of the developed\nmodular setup for urban QKD experiments.\n", "doi": "10.1007/s10946-019-09793-5", "arxiv_id": "1612.04168", "pdf_urls": ["https://arxiv.org/pdf/1612.04168"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser Res. 40, 221 (2019)", "categories": "quant-ph"}
{"title": "Quantum state conversion in opto-electro-mechanical systems via shortcut\n  to adiabaticity", "year": 2016, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xiao Zhou", "Bao-Jie Liu", "L.-B. Shao", "Xin-Ding Zhang", "Zheng-Yuan Xue"], "abstract": "  Adiabatic process has found many important applications in modern physics,\nthe distinct merit of which is that it does not need accurate control over the\ntiming of the process. However, it is a slow process, which limits the\napplication in quantum computation, due to the limited coherent times of\ntypical quantum systems. Here, we propose a scheme to implement quantum state\nconversion in opto-electro-mechanical systems via shortcut to adiabaticity,\nwhere the process can be greatly speeded up while the precise timing control is\nstill not necessary. In our scheme, only by modifying the coupling strength, we\ncan achieve fast quantum state conversion with high fidelity, where the\nadiabatic condition does not need to be met. In addition, the population of the\nunwanted intermediate state can be further suppressed. Therefore, our protocol\npresents an important step towards practical state conversion between optical\nand microwave photons, and thus may find many important applications in hybrid\nquantum information processing.\n", "doi": "10.1088/1612-202x/aa7d2f", "arxiv_id": "1612.05927", "pdf_urls": ["https://arxiv.org/pdf/1612.05927"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14, 095202 (2017); Chosen as IOPSelect", "categories": "quant-ph"}
{"title": "Gateway schemes of quantum control for spin networks", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Koji Maruyama and Daniel Burgarth"], "abstract": "  Towards the full-fledged quantum computing, what do we need? Obviously, the\nfirst thing we need is a (many-body) quantum system, which is reasonably\nisolated from its environment in order to reduce the unwanted effect of noise,\nand the second might be a good technique to fully control it. Although we would\nalso need a well-designed quantum code for information processing for\nfault-tolerant computation, from a physical point of view, the primary\nrequisites are a system and a full control for it. Designing and fabricating a\ncontrollable quantum system is a hard work in the first place, however, we\nshall focus on the subsequent steps that cannot be skipped and are highly\nnontrivial.\n", "doi": null, "arxiv_id": "1701.00216", "pdf_urls": ["https://arxiv.org/pdf/1701.00216"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Chapter 6 in T. Takui, L. J. Berliner, and G. Hanson (eds.),\n  Electron Spin Resonance (ESR) Based Quantum Computing, Springer New York, pp\n  167--192 (2016)", "categories": "quant-ph"}
{"title": "Evaluating the Dynamic Behavior of Database Applications", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhen He", "J\\'er\\^ome Darmont (ERIC)"], "abstract": "  This paper explores the effect that changing access patterns has on the\nperformance of database management systems. Changes in access patterns play an\nimportant role in determining the efficiency of key performance optimization\ntechniques, such as dynamic clustering, prefetching, and buffer replacement.\nHowever, all existing benchmarks or evaluation frameworks produce static access\npatterns in which objects are always accessed in the same order repeatedly.\nHence, we have proposed the Dynamic Evaluation Framework (DEF) that simulates\naccess pattern changes using configurable styles of change. DEF has been\ndesigned to be open and fully extensible (e.g., new access pattern change\nmodels can be added easily). In this paper, we instantiate DEF into the Dynamic\nobject Evaluation Framework (DoEF) which is designed for object databases,\ni.e., object-oriented or object-relational databases such as multi-media\ndatabases or most XML databases.The capabilities of DoEF have been evaluated by\nsimulating the execution of four different dynamic clustering algorithms. The\nresults confirm our analysis that flexible conservative re-clustering is the\nkey in determining a clustering algorithm's ability to adapt to changes in\naccess pattern. These results show the effectiveness of DoEF at determining the\nadaptability of each dynamic clustering algorithm to changes in access pattern\nin a simulation environment. In a second set of experiments, we have used DoEF\nto compare the performance of two real-life object stores : Platypus and SHORE.\nDoEF has helped to reveal the poor swapping performance of Platypus.\n", "doi": "10.4018/jdm.2005040102", "arxiv_id": "1701.00400", "pdf_urls": ["https://arxiv.org/pdf/1701.00400"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Database Management, IGI Global, 2005, 16 (2), pp.21 -\n  45", "categories": "cs.DB"}
{"title": "Hamiltonian of mean force and a damped harmonic oscillator in an\n  anisotropic medium", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marjan Jafari", "Fardin Kheirandish"], "abstract": "  The quantum dynamics of a damped harmonic oscillator is investigated in the\npresence of an anisotropic heat bath. The medium is modeled by a continuum of\nthree dimensional harmonic oscillators and anisotropic coupling is treated by\nintroducing tensor coupling functions. Starting from a classical Lagrangian,\nthe total system is quantized in the framework of the canonical quantization.\nFollowing Fano technique, Hamiltonian of the system is diagonalized in terms of\ncreation and annihilation operators that are linear combinations of the basic\ndynamical variables. Using the diagonalized Hamiltonian, the mean force\ninternal energy, free energy and entropy of the damped oscillator are\ncalculated.\n", "doi": "10.1088/1054-660x/27/1/015201", "arxiv_id": "1701.00964", "pdf_urls": ["https://arxiv.org/pdf/1701.00964"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 27 (2017) 015201", "categories": "quant-ph"}
{"title": "A model-based approach to assist variety evaluation in sunflower crop", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pierre Casadebaig and Emmanuelle Mestries and Philippe Debaeke"], "abstract": "  Assessing the performance and the characteristics (e.g. yield, quality,\ndisease resistance, abiotic stress tolerance) of new varieties is a key\ncomponent of crop performance improvement. However, the variety testing process\nis presently exclusively based on experimental field approaches which\ninherently reduces the number and the diversity of experienced combinations of\nvarieties x environmental conditions in regard of the multiplicity of growing\nconditions within the cultivation area. Our aim is to make a greater and faster\nuse of the information issuing from these trials using crop modeling and\nsimulation to amplify the environmental and agronomic conditions in which the\nnew varieties are tested.\n  In this study, we present a model-based approach to assist variety testing\nand implement this approach on sunflower crop, using the SUNFLO simulation\nmodel and a subset of 80 trials from a large multi-environment trial (MET)\nconducted each year by agricultural extension services to compare newly\nreleased sunflower hybrids. After estimating parameter values (using plant\nphenotyping) to account for new genetic material, we independently evaluated\nthe model prediction capacity on the MET (model accuracy was 54.4 %) and its\ncapacity to rank commercial hybrids for performance level (Kendall's $\\tau$ =\n0.41, P < 0.01). We then designed a numerical experiment by combining the\npreviously tested genetic and new cropping conditions (2100 virtual trials) to\ndetermine the best varieties and related management in representative French\nproduction regions.\n  We suggest that this approach could find operational outcomes to recommend\nvarieties according to environment types. Such spatial management of genetic\nresources could potentially improve crop performance by reducing the\ngenotype-phenotype mismatch in farming environments.\n", "doi": "10.1016/j.eja.2016.09.001", "arxiv_id": "1701.00987", "pdf_urls": ["https://arxiv.org/pdf/1701.00987"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Casadebaig, P.; Mestries, E. & Debaeke, P. (2016), 'A model-based\n  approach to assist variety assessment in sunflower crop', European Journal of\n  Agronomy 81, 92--105", "categories": "q-bio.QM"}
{"title": "Nonlinear reflection from the surface of neutron stars and puzzles of\n  radio emission from the pulsar in the Crab nebula", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Victor M. Kontorovich"], "abstract": "  Having no any explanations the radiation of high-frequency components of the\npulsar in the Crab Nebula can be a manifestation of instability in the\nnonlinear reflection from the neutron star surface. Reflected radiation it is\nthe radiation of relativistic positrons flying from the magnetosphere to the\nstar and accelerated by the electric field of the polar gap. The discussed\ninstability it is a stimulated scattering by surface waves, predicted more than\nforty years ago and still nowhere and by no one had been observed.\n", "doi": "10.1063/1.4961488", "arxiv_id": "1701.02304", "pdf_urls": ["https://arxiv.org/pdf/1701.02304"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Based on publication in Low temperature physics, Volume 42, No 8,\n  pp. 672-678 (2016) with author's corrections", "categories": "astro-ph.HE physics.class-ph"}
{"title": "Statics and dynamics of a self-bound dipolar matter-wave droplet", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. K. Adhikari"], "abstract": "  We study the statics and dynamics of a stable, mobile, self-bound\nthree-dimensional dipolar matter-wave droplet created in the presence of a tiny\nrepulsive three-body interaction. In frontal collision with an impact parameter\nand in angular collision at large velocities {along all directions} two\ndroplets behave like quantum solitons. Such collision is found to be quasi\nelastic and the droplets emerge undeformed after collision without any change\nof velocity. However, in a collision at small velocities the axisymmeric\ndipolar interaction plays a significant role and the collision dynamics is\nsensitive to the direction of motion. For an encounter along the $z$ direction\nat small velocities, two droplets, polarized along the $z$ direction, coalesce\nto form a larger droplet $-$ a droplet molecule. For an encounter along the $x$\ndirection at small velocities, the same droplets stay apart and never meet each\nother due to the dipolar repulsion. The present study is based on an analytic\nvariational approximation and a numerical solution of the mean-field\nGross-Pitaevskii equation using the parameters of $^{52}$Cr atoms.\n", "doi": "10.1088/1612-202x/aa532e", "arxiv_id": "1701.03762", "pdf_urls": ["https://arxiv.org/pdf/1701.03762"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14 (2017) 025501", "categories": "cond-mat.quant-gas nlin.PS"}
{"title": "Investigating the Application of Common-Sense Knowledge-Base for\n  Identifying Term Obfuscation in Adversarial Communication", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Swati Agarwal and Ashish Sureka"], "abstract": "  Word obfuscation or substitution means replacing one word with another word\nin a sentence to conceal the textual content or communication. Word obfuscation\nis used in adversarial communication by terrorist or criminals for conveying\ntheir messages without getting red-flagged by security and intelligence\nagencies intercepting or scanning messages (such as emails and telephone\nconversations). ConceptNet is a freely available semantic network represented\nas a directed graph consisting of nodes as concepts and edges as assertions of\ncommon sense about these concepts. We present a solution approach exploiting\nvast amount of semantic knowledge in ConceptNet for addressing the technically\nchallenging problem of word substitution in adversarial communication. We frame\nthe given problem as a textual reasoning and context inference task and utilize\nConceptNet's natural-language-processing tool-kit for determining word\nsubstitution. We use ConceptNet to compute the conceptual similarity between\nany two given terms and define a Mean Average Conceptual Similarity (MACS)\nmetric to identify out-of-context terms. The test-bed to evaluate our proposed\napproach consists of Enron email dataset (having over 600000 emails generated\nby 158 employees of Enron Corporation) and Brown corpus (totaling about a\nmillion words drawn from a wide variety of sources). We implement word\nsubstitution techniques used by previous researches to generate a test dataset.\nWe conduct a series of experiments consisting of word substitution methods used\nin the past to evaluate our approach. Experimental results reveal that the\nproposed approach is effective.\n", "doi": null, "arxiv_id": "1701.04934", "pdf_urls": ["https://arxiv.org/pdf/1701.04934"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "S. Agarwal and A. Sureka, \"Using common-sense knowledge-base for\n  detecting word obfuscation in adversarial communication,\" 2015 7th\n  International Conference on Communication Systems and Networks (COMSNETS),\n  Bangalore, 2015, pp. 1-6", "categories": "cs.IR"}
{"title": "Coherent backscattering of light from ultracold and optically dense\n  atomic ensembles", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["I.M. Sokolov", "D.V. Kupriyanov", "C.I. Sukenik", "M.D. Havey"], "abstract": "  We review experimental and theoretical studies of coherent backscattering of\nnear resonant radiation from an ultracold atomic gas in the weak localization\nregime. Recent accomplishments in high resolution spectroscopy of atomic\nensembles based on the coherent backscattering process are discussed. We also\npropose several new experimental schemes for time-dependent spectroscopy as\napplied to multiple scattering in the regime of weak localization.\n", "doi": "10.1002/lapl.200510059", "arxiv_id": "1701.06714", "pdf_urls": ["https://arxiv.org/pdf/1701.06714"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 3, 223-243 (2006)", "categories": "physics.atom-ph physics.optics quant-ph"}
{"title": "Index and Materialized View Selection in Data Warehouses", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kamel Aouiche (Centre LICEF - T\\'ELUQ)", "J\\'er\\^ome Darmont (ERIC)"], "abstract": "  The aim of this article is to present an overview of the major families of\nstate-of-the-art index and materialized view selection methods, and to discuss\nthe issues and future trends in data warehouse performance optimization. We\nparticularly focus on data mining-based heuristics we developed to reduce the\nselection problem complexity and target the most pertinent candidate indexes\nand materialized views.\n", "doi": null, "arxiv_id": "1701.08029", "pdf_urls": ["https://arxiv.org/pdf/1701.08029"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Handbook of Research on Innovations in Database Technologies and\n  Applications, II, pp.693-700, 2009", "categories": "cs.DB"}
{"title": "Indices in XML Databases", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hadj Mahboubi (ERIC)", "J\\'er\\^ome Darmont (ERIC)"], "abstract": "  With XML becoming a standard for business information representation and\nexchange, stor-ing, indexing, and querying XML documents have rapidly become\nmajor issues in database research. In this context, query processing and\noptimization are primordial, native-XML data-bases not being mature yet. Data\nstructures such as indices, which help enhance performances substantially, are\nextensively researched, especially since XML data bear numerous specifici-ties\nwith respect to relational data. In this paper, we survey state-of-the-art XML\nindices and discuss the main issues, tradeoffs and future trends in XML\nindexing. We also present an in-dex that we specifically designed for the\nparticular architecture of XML data warehouses.\n", "doi": "10.4018/978-1-60566-242-8.ch072", "arxiv_id": "1701.08054", "pdf_urls": ["https://arxiv.org/pdf/1701.08054"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Handbook of Research on Innovations in Database Technologies and\n  Applications, II, IGI Global, pp.674-681, 2009", "categories": "cs.DB"}
{"title": "Anomalous enhancement of nanodiamond luminescence upon heating", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.A. Khomich", "O.S. Kudryavtsev", "T.A. Dolenko", "A.A. Shiryaev", "A.V.\n  Fisenko", "V.I. Konov", "I.I. Vlasov"], "abstract": "  Characteristic photoluminescence (PL) of nanodiamonds (ND) of very different\norigin (detonation, HPHT, extracted from meteorite) was studied in situ at high\ntemperatures in the range 20-450C. Luminescence was excited using 473 nm laser\nand recorded in the range 500-800 nm. In contrast to decrease of point defect\nPL in bulk diamond with temperature, we found that the nanodiamond luminescence\nrelated to ND surface defects increases almost an order of magnitude upon\nheating to 200-250 C. The observed effect reveals that water adsorbed on ND\nsurfaces efficiently quenches photoluminescence, water desorption on heating\nleads to dramatic increase of the radiative de-excitation.\n", "doi": "10.1088/1612-202x/aa52f5", "arxiv_id": "1702.01302", "pdf_urls": ["https://arxiv.org/pdf/1702.01302"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 14(2): 025702 (2017)", "categories": "cond-mat.mtrl-sci"}
{"title": "A cascade of $e^-e^+$ pair production by a photon with subsequent\n  annihilation to a single photon in a strong magnetic field", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M. M. Diachenko", "O. P. Novak", "and R. I. Kholodov"], "abstract": "  The process of electron-positron pair production by a photon with subsequent\nannihilation to a single photon in a strong magnetic field has been studied.\nThe general amplitude has been calculated and the process rate have been found\nin the low Landau levels approximation (resonant and nonresonant cases). The\ncomparison of resonant and nonresonant cases shows a significant excess of the\nresonant rate. The polarization of the final photon in a strong magnetic field\nhas also been found. It has been shown that polarizations of the initial and\nthe final photons are independent except for the case of normal linear\npolarization of the initial photon.\n", "doi": "10.1088/1054-660x/26/6/066001", "arxiv_id": "1702.03699", "pdf_urls": ["https://arxiv.org/pdf/1702.03699"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2016 Laser Phys.26 066001", "categories": "hep-ph"}
{"title": "Modeling the Throughput of the Linux-Based Agile-SD Transmission Control\n  Protocol", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohamed A. Alrshah", "Mohamed Othman", "Borhanuddin Ali", "Zurina Hanapi"], "abstract": "  Agile-SD is one of the latest versions of loss-based congestion control\nalgorithm (CCA), which has been proposed to improve the total performance of\ntransmission control protocol (TCP) over high-speed and short-distance\nnetworks. It has introduced a new mechanism, called agility factor mechanism,\nwhich shortens the epoch time to reduce the sensitivity to packet losses and in\nturn to increase the average throughput. Agile-SD has only been tested via\nsimulation; however, it has not been mathematically proven or evaluated. The\ncontribution of this paper is twofold. First, a new mathematical model for the\nthroughput of NewReno and Agile-SD is proposed. This model is designed using\nthe well-known Markov chains to validate the correctness of Agile-SD and to\nshow the impact of buffer size, multiplicative decrease factor, and maximum\nlimit of agility factor ({\\lambda}max ) on the total performance. Second, an\nautomated algorithm configuration and parameter tuning (AACPT) technique is\nemployed to optimize and automate the configuration of {\\lambda}max .\nFurthermore, the numerical results for both NewReno and Agile-SD are compared\nwith the simulation results, in which the validity of the proposed model is\nconfirmed. Moreover, the output of the AACPT is exploited to formulate a new\nequation, which calculates the optimal {\\lambda}max from a given \\b{eta} in\norder to conserve the standard interface of the TCP. This equation increases\nthe scalability of Agile-SD and improves its total performance.\n", "doi": "10.1109/access.2016.2647237", "arxiv_id": "1702.04861", "pdf_urls": ["https://arxiv.org/pdf/1702.04861"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Mohamed Alrshah, Mohamed Othman, Borhanuddin Ali and Zurina\n  Hanapi, \"Modeling the Throughput of the Linux-Based Agile-SD Transmission\n  Control Protocol,\" in IEEE Access 4 (2016): 9724-9732", "categories": "cs.NI"}
{"title": "Influence of multi-line CO laser focusing on broadband sum-frequency\n  generation in ZnGeP2", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.A. Ionin", "I.O. Kinyaevskiy", "Yu.M. Klimachev", "A.A. Kotkov", "and L.V.\n  Seleznev"], "abstract": "  An influence of multi-line CO laser focusing on spectral characteristics of\nbroadband sum-frequency generation in ZnGeP2 nonlinear crystal was\nexperimentally and numerically studied. Maximal frequency conversion was\nexperimentally observed under tight focusing of the multi-line rather than\nsingle-line CO laser. The tight focusing resulted in broadening sum-frequency\ngeneration spectrum and increasing total, i.e. integrated over the spectrum,\nfrequency conversion efficiency. These effects were due to increasing\nphase-matching bandwidth and angular dispersion. Maximal conversion efficiency\nof the multi-line CO laser was numerically demonstrated to take place at the\nfocal length of 0.4 times that for the single-line one.\n", "doi": "10.1088/1612-202x/aa6b1e", "arxiv_id": "1702.05348", "pdf_urls": ["https://arxiv.org/pdf/1702.05348"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14 065401 (2017)", "categories": "physics.optics"}
{"title": "Towards a Unified Taxonomy of Biclustering Methods", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dmitry I. Ignatov and Bruce W. Watson"], "abstract": "  Being an unsupervised machine learning and data mining technique,\nbiclustering and its multimodal extensions are becoming popular tools for\nanalysing object-attribute data in different domains. Apart from conventional\nclustering techniques, biclustering is searching for homogeneous groups of\nobjects while keeping their common description, e.g., in binary setting, their\nshared attributes. In bioinformatics, biclustering is used to find genes, which\nare active in a subset of situations, thus being candidates for biomarkers.\nHowever, the authors of those biclustering techniques that are popular in gene\nexpression analysis, may overlook the existing methods. For instance, BiMax\nalgorithm is aimed at finding biclusters, which are well-known for decades as\nformal concepts. Moreover, even if bioinformatics classify the biclustering\nmethods according to reasonable domain-driven criteria, their classification\ntaxonomies may be different from survey to survey and not full as well. So, in\nthis paper we propose to use concept lattices as a tool for taxonomy building\n(in the biclustering domain) and attribute exploration as means for\ncross-domain taxonomy completion.\n", "doi": null, "arxiv_id": "1702.05376", "pdf_urls": ["https://arxiv.org/pdf/1702.05376"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Russian and South African Workshop on Knowledge Discovery\n  Techniques Based on Formal Concept Analysis (RuZA 2015), November 30 -\n  December 5, 2015, Stellenbosch, South Africa, In CEUR Workshop Proceedings,\n  Vol. 1552, p. 23-39", "categories": "cs.AI cs.DM stat.ML"}
{"title": "Ionic vibration induced transparency and Autler-Townes splitting", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wenjun Shao", "Fei Wang", "Xun-Li Feng and C. H. Oh"], "abstract": "  In this work, the absorption spectrum of a two-level ion in a linear Paul\ntrap is investigated, the ion is supposed to be driven by two orthogonal laser\nbeams, the one along the axial of the trap acts as the control light beam, the\nother as probe beam. When the frequency of the control laser is tuned to the\nfirst red sideband of the ionic transition, the coupling between the internal\nstates of the ion and vibrational mode turns out to be a Jaynes-Cummings (JC)\nHamiltonian, which together with the coupling between the probe beam and the\ntwo-level ion constructs a {\\Lambda}-type three-level structure. In this case\nthe transparency window may appear in the absorption spectrum of the probe\nlight, which is induced by the ionic vibration and is very similar to the\ncavity induced transparency [1996 Opt. Commun. 126 230-235]. On the other hand,\nwhen the frequency of the control laser is tuned to the first blue sideband of\nthe ionic transition, the two-level ion and vibrational mode are governed by an\nanti-Jaynes-Cummings (anti-JC) Hamiltonian, the total system including the\nprobe beam forms a V -type threelevel structure. And the Autler-Townes\nsplitting in the absorption spectrum is found.\n", "doi": "10.1088/1612-202x/aa621e", "arxiv_id": "1702.07972", "pdf_urls": ["https://arxiv.org/pdf/1702.07972"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14, 045203 (2017)", "categories": "quant-ph"}
{"title": "Energy-Aware Disk Storage Management: Online Approach with Application\n  in DBMS", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Peyman Behzadnia", "Yi-Cheng Tu", "Bo Zeng and Wei Yuan"], "abstract": "  Energy consumption has become a first-class optimization goal in design and\nimplementation of data-intensive computing systems. This is particularly true\nin the design of database management systems (DBMS), which was found to be the\nmajor consumer of energy in the software stack of modern data centers. Among\nall database components, the storage system is one of the most power-hungry\nelements. In previous work, dynamic power management (DPM) techniques that make\nreal-time decisions to transition the disks to low-power modes are normally\nused to save energy in storage systems. In this paper, we tackle the\nlimitations of DPM proposals in previous contributions. We introduced a DPM\noptimization model integrated with model predictive control (MPC) strategy to\nminimize power consumption of the disk-based storage system while satisfying\ngiven performance requirements. It dynamically determines the state of disks\nand plans for inter-disk data fragment migration to achieve desirable balance\nbetween power consumption and query response time. Via analyzing our\noptimization model to identify structural properties of optimal solutions, we\npropose a fast-solution heuristic DPM algorithm that can be integrated in\nlarge-scale disk storage systems for efficient state configuration and data\nmigration. We evaluate our proposed ideas by running simulations using\nextensive set of synthetic workloads based on popular TPC benchmarks. Our\nresults show that our solution significantly outperforms the best existing\nalgorithm in both energy savings and response time.\n", "doi": null, "arxiv_id": "1703.02591", "pdf_urls": ["https://arxiv.org/pdf/1703.02591"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Database Management Systems (IJDMS)\n  Vol.9, No.1, Pages 1-22, February 2017", "categories": "cs.DB"}
{"title": "Generation of isolated attosecond pulses by polarization gating of\n  high-order harmonic emission from H$_2^+$ in intense ultrashort laser fields", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nehzat Safaei"], "abstract": "  Quantum-mechanical investigation is presented to study single attosecond\npulse generation by gating high-order harmonic emission from H$_2^+$ molecule\nin intense laser pulses with time-dependent ellipticity. The high-order\nharmonic generation from H$_2^+$ molecule in superposition of a left and a\nright-hand circularly polarized Gaussian pulse is studied and the effect of\ntime duration and carrier-envelope phase of laser field on single attosecond\npulse generation is investigated. Using laser field formed by combination of a\nleft and a right-hand elliptically polarized Gaussian pulse, the effect of\nellipticity of field on duration and intensity of generated attosecond pulses\nis studied. The numerical calculations show that, with the conventional\npolarization gating, an intense single attosecond pulse can be isolated from\nthe pulse train emitted by H$_2^+$ molecule in the laser field.\n", "doi": "10.1088/1612-202x/aa9318", "arxiv_id": "1703.02888", "pdf_urls": ["https://arxiv.org/pdf/1703.02888"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 15 (2018) 015202 (7pp)", "categories": "physics.atom-ph quant-ph"}
{"title": "A Meshless-based Local Reanalysis Method for Structural Analysis", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhenxing Cheng", "Hu Wang"], "abstract": "  This study presents a meshless-based local reanalysis (MLR) method. The\npurpose of this study is to extend reanalysis methods to the Kriging\ninterpolation meshless method due to its high efficiency. In this study, two\nreanalysis methods: combined approximations CA) and indirect factorization\nupdating (IFU) methods are utilized. Considering the computational cost of\nmeshless methods, the reanalysis method improves the efficiency of the full\nmeshless method significantly. Compared with finite element method (FEM)-based\nreanalysis methods, the main superiority of meshless-based reanalysis method is\nto break the limitation of mesh connection. The meshless-based reanalysis is\nmuch easier to obtain the stiffness matrix even for solving the mesh distortion\nproblems. However, compared with the FEM-based reanalysis method, the critical\nchallenge is to use much more nodes in the influence domain due to high order\ninterpolation. Therefore, a local reanalysis method which only needs to\ncalculate the local stiffness matrix in the influence domain is suggested to\nimprove the efficiency further. Several typical numerical examples are tested\nand the performance of the suggested method is verified.\n", "doi": "10.1016/j.compstruc.2017.07.011", "arxiv_id": "1703.04355", "pdf_urls": ["https://arxiv.org/pdf/1703.04355"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Cheng, Z. X., & Wang, H. (2017). A meshless-based local reanalysis\n  method for structural analysis. Computers & Structures, 192, 126-143", "categories": "cs.CE"}
{"title": "On the Unhappiness of Software Developers", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniel Graziotin", "Fabian Fagerholm", "Xiaofeng Wang", "Pekka Abrahamsson"], "abstract": "  The happy-productive worker thesis states that happy workers are more\nproductive. Recent research in software engineering supports the thesis, and\nthe ideal of flourishing happiness among software developers is often expressed\namong industry practitioners. However, the literature suggests that a\ncost-effective way to foster happiness and productivity among workers could be\nto limit unhappiness. Psychological disorders such as job burnout and anxiety\ncould also be reduced by limiting the negative experiences of software\ndevelopers. Simultaneously, a baseline assessment of (un)happiness and\nknowledge about how developers experience it are missing. In this paper, we\nbroaden the understanding of unhappiness among software developers in terms of\n(1) the software developer population distribution of (un)happiness, and (2)\nthe causes of unhappiness while developing software. We conducted a large-scale\nquantitative and qualitative survey, incorporating a psychometrically validated\ninstrument for measuring (un)happiness, with 2220 developers, yielding a rich\nand balanced sample of 1318 complete responses. Our results indicate that\nsoftware developers are a slightly happy population, but the need for limiting\nthe unhappiness of developers remains. We also identified 219 factors\nrepresenting causes of unhappiness while developing software. Our results,\nwhich are available as open data, can act as guidelines for practitioners in\nmanagement positions and developers in general for fostering happiness on the\njob. We suggest considering happiness in future studies of both human and\ntechnical aspects in software engineering.\n", "doi": "10.1145/3084226.3084242", "arxiv_id": "1703.04993", "pdf_urls": ["https://arxiv.org/pdf/1703.04993"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In Proceedings of the 21st International Conference on Evaluation\n  and Assessment in Software Engineering (EASE'17), 2017. ACM, New York, NY,\n  USA, 324-333", "categories": "cs.SE cs.CY"}
{"title": "Unitary Groups as Stabilizers of Orbits", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Erik Friese"], "abstract": "  We show that a finite unitary group which has orbits spanning the whole space\nis necessarily the setwise stabilizer of a certain orbit.\n", "doi": "10.1007/s00013-017-1065-9", "arxiv_id": "1703.05288", "pdf_urls": ["https://arxiv.org/pdf/1703.05288"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 109.2 (2017), pp. 101-103", "categories": "math.GR"}
{"title": "Mass Defect Effects in Atomic Clocks", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V. I. Yudin", "A. V. Taichenachev"], "abstract": "  We consider some implications of the mass defect on the frequency of atomic\ntransitions. We have found that some well-known frequency shifts (gravitational\nshift and motion-induced shifts such as: quadratic Doppler and micromotion\nshifts) can be interpreted as consequences of the mass defect in quantum atomic\nphysics, i.e., without the need for the concept of time dilation used in\nspecial and general relativity theories. Moreover, we show that the inclusion\nof the mass defect leads to previously unknown shifts for clocks based on\ntrapped ions.\n", "doi": "10.1088/1612-202x/aa9aa5", "arxiv_id": "1703.05290", "pdf_urls": ["https://arxiv.org/pdf/1703.05290"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 15, 035703 (2018)", "categories": "physics.atom-ph physics.optics quant-ph"}
{"title": "Semiclassical rates for tunnel ionization from power-law potentials\n  induced by a constant or low-frequency electric field", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.M. Ishkhanyan and V. P. Krainov"], "abstract": "  The probabilities of tunnel ionization of particles confined by\none-dimensional power-law and logarithmic potentials are calculated for\nconstant and low-frequency electric fields.\n", "doi": "10.1088/1612-202x/aa7422", "arxiv_id": "1703.08452", "pdf_urls": ["https://arxiv.org/pdf/1703.08452"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14, 076001 (2017)", "categories": "quant-ph"}
{"title": "Universal behaviour of 3D loop soup models", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniel Ueltschi"], "abstract": "  These notes describe several loop soup models and their {\\it universal\nbehaviour} in dimensions greater or equal to 3. These loop models represent\ncertain classical or quantum statistical mechanical systems. These systems\nundergo phase transitions that are characterised by changes in the structures\nof the loops. Namely, long-range order is equivalent to the occurrence of\nmacroscopic loops. There are many such loops, and the joint distribution of\ntheir lengths is always given by a {\\it Poisson-Dirichlet distribution}.\n  This distribution concerns random partitions and it is not widely known in\nstatistical physics. We introduce it explicitly, and we explain that it is the\ninvariant measure of a mean-field split-merge process. It is relevant to\nspatial models because the macroscopic loops are so intertwined that they\nbehave effectively in mean-field fashion. This heuristics can be made exact and\nit allows to calculate the parameter of the Poisson-Dirichlet distribution. We\ndiscuss consequences about symmetry breaking in certain quantum spin systems.\n", "doi": null, "arxiv_id": "1703.09503", "pdf_urls": ["https://arxiv.org/pdf/1703.09503"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "in \"6th Warsaw School of Statistical Physics\", B. Cichocki, M.\n  Napiorkowski, J. Piasecki, P. Szymczak eds, pp 65-100, Warsaw University\n  Press (2017)", "categories": "cond-mat.stat-mech"}
{"title": "Why only hole conductors can be superconductors", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J. E. Hirsch"], "abstract": "  The conventional theory of superconductivity says that charge carriers in a\nmetal that becomes superconducting can be either electrons or holes. I argue\nthat this is incorrect. In order to satisfy conservation of mechanical momentum\nand of entropy of the universe in the superconductor to normal transition in\nthe presence of a magnetic field it is necessary that the normal state charge\ncarriers are holes. I will also review the empirical evidence in favor of the\nhypothesis that all superconductors are hole superconductors, and discuss the\nimplications of this for the search for higher $T_c$ superconductors.\n", "doi": "10.1117/12.2269644", "arxiv_id": "1703.09777", "pdf_urls": ["https://arxiv.org/pdf/1703.09777"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10105, Oxide-based Materials and Devices VIII, 101051V\n  (March 7, 2017)", "categories": "cond-mat.supr-con"}
{"title": "A Framework for Evaluating Epidemic Forecasts", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Farzaneh Sadat Tabataba", "Prithwish Chakraborty", "Naren Ramakrishnan", "Srinivasan Venkatramanan", "Jiangzhuo Chen", "Bryan Lewis", "Madhav Marathe"], "abstract": "  Background: Over the past few decades, numerous forecasting methods have been\nproposed in the field of epidemic forecasting. Such methods can be classified\ninto different categories such as deterministic vs. probabilistic, comparative\nmethods vs. generative methods, and so on. In some of the more popular\ncomparative methods, researchers compare observed epidemiological data from\nearly stages of an outbreak with the output of proposed models to forecast the\nfuture trend and prevalence of the pandemic. A significant problem in this area\nis the lack of standard well-defined evaluation measures to select the best\nalgorithm among different ones, as well as for selecting the best possible\nconfiguration for a particular algorithm.\n  Results: In this paper, we present an evaluation framework which allows for\ncombining different features, error measures, and ranking schema to evaluate\nforecasts. We describe the various epidemic features (Epi-features) included to\ncharacterize the output of forecasting methods and provide suitable error\nmeasures that could be used to evaluate the accuracy of the methods with\nrespect to these Epi-features. We focus on long-term predictions rather than\nshort-term forecasting and demonstrate the utility of the framework by\nevaluating six forecasting methods for predicting influenza in the United\nStates. Our results demonstrate that different error measures lead to different\nrankings even for a single Epi-feature. Further, our experimental analyses show\nthat no single method dominates the rest in predicting all Epi-features, when\nevaluated across error measures. As an alternative, we provide various\nconsensus ranking schema that summarizes individual rankings, thus accounting\nfor different error measures. We believe that a comprehensive evaluation\nframework, as presented in this paper, will add value to the computational\nepidemiology community.\n", "doi": null, "arxiv_id": "1703.09828", "pdf_urls": ["https://arxiv.org/pdf/1703.09828"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "BMC infectious disease, 2017", "categories": "cs.SI physics.soc-ph q-bio.PE"}
{"title": "Multi-wavelength observations of vortex-like flows in the photosphere\n  using ground-based and space-borne telescopes", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J. Palacios", "S. Vargas Dom\\'inguez", "L. A. Balmaceda", "I. Cabello and V.\n  Domingo"], "abstract": "  In this work we follow a series of papers on high-resolution observations of\nsmall-scale structures in the solar atmosphere \\citep[][Cabello et al., in\nprep]{Balmaceda2009, Balmaceda2010, Vargas2011, Palacios2012, Domingo2012,\nVargas2015}, combining several multi-wavelength data series. These were\nacquired by both ground-based (SST) and space-borne (Hinode) instruments during\nthe joint campaign of the Hinode Operation Program 14, in September 2007.\nDiffraction-limited SST data were taken in the G-band and G-cont, and were\nrestored by the MFBD technique. Hinode instruments, on the other hand, provided\nmultispectral data from SOT-FG in the CN band, and Mg~{\\sc I} and Ca {\\sc\nII}~lines, as well as from SOT-SP in the Fe~{\\sc I} line. In this series of\nworks we have thoroughly studied vortex flows and their statistical\noccurrences, horizontal velocity fields by means of Local Correlation Tracking\n(LCT), divergence and vorticity. Taking advantage of the high-cadence and high\nspatial resolution data, we have also studied bright point statistics and\nmagnetic field intensification, highlighting the importance of the\nsmallest-scale magnetic element observations.\n", "doi": null, "arxiv_id": "1704.00660", "pdf_urls": ["https://arxiv.org/pdf/1704.00660"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ASP Conference Series, 2016, Volume 504: Ground-based solar\n  observations in the space instrumentation era", "categories": "astro-ph.SR"}
{"title": "The Spanish Space Weather Service SeNMEs. A case study on the Sun-Earth\n  chain", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J. Palacios", "C. Cid", "A. Guerrero", "E. Saiz", "Y. Cerrato", "M.\n  Rodr\\'iguez-Bouza", "I. Rodr\\'iguez-Bilbao", "M. Herraiz", "and G.\n  Rodr\\'iguez-Caderot"], "abstract": "  The Spanish Space Weather Service SeNMEs, \\url{www.senmes.es}, is a portal\ncreated by the SRG-SW of the Universidad de Alcal\\'a, Spain, to meet societal\nneeds of near real-time space weather services. This webpage-portal is divided\nin different sections to fulfill users needs about space weather effects: radio\nblackouts, solar energetic particle events, geomagnetic storms and presence of\ngeomagnetically induced currents. In less than one year of activity, this\nservice has released a daily report concerning the solar current status and\ninterplanetary medium, informing about the chances of a solar perturbation to\nhit the Earth's environment. There are also two different forecasting tools for\ngeomagnetic storms, and a daily ionospheric map. These tools allow us to\nnowcast a variety of solar eruptive events and forecast geomagnetic storms and\ntheir recovery, including a new local geomagnetic index, LDi{\\~n}, along with\nsome specific new scaling. In this paper we also include a case study analysed\nby SeNMEs. Using different high resolution and cadence data from space-borne\nsolar telescopes SDO, SOHO and GOES, along with ionospheric and geomagnetic\ndata, we describe the Sun-Earth feature chain for the event.\n", "doi": null, "arxiv_id": "1704.00684", "pdf_urls": ["https://arxiv.org/pdf/1704.00684"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ASP Conference Series, 2016, volume 504: Ground based solar\n  observations in the space instrumentation era", "categories": "astro-ph.SR physics.space-ph"}
{"title": "Elastic collision and breather formation of spatiotemporal vortex light\n  bullets in a cubic-quintic nonlinear medium", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S K Adhikari"], "abstract": "  The statics and dynamics of a stable, mobile three-dimensional (3D)\nspatiotemporal vortex light bullet in a cubic-quintic nonlinear medium with a\nfocusing cubic nonlinearity above a critical value and any defocusing quintic\nnonlinearity is considered. The present study is based on an analytic\nvariational approximation and a full numerical solution of the 3D nonlinear\nSchr\\\"odinger equation. The 3D vortex bullet can propagate with a constant\nvelocity. Stability of the vortex bullet is established numerically and\nvariationally. The collision between two vortex bullets moving along the\nangular momentum axis is considered. At large velocities the collision is quasi\nelastic with the bullets emerging after collision with practically no\ndistortion. At small velocities two bullets coalesce to form a single entity\ncalled a breather.\n", "doi": "10.1088/1612-202x/aa6c1c", "arxiv_id": "1704.00714", "pdf_urls": ["https://arxiv.org/pdf/1704.00714"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14 (2017) 065402", "categories": "nlin.PS physics.optics"}
{"title": "Frequency doubling of temporally incoherent light from a\n  superluminescent diode in a periodically poled lithium niobate waveguide\n  crystal", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Henning Kurzke", "Jan Kiethe", "Axel Heuer", "Andreas Jechow"], "abstract": "  The amplified spontaneous emission from a superluminescent diode was\nfrequency doubled in a periodically poled lithium niobate waveguide crystal.\nThe temporally incoherent radiation of such a superluminescent diode is\ncharacterized by a relatively broad spectral bandwidth and thermal-like photon\nstatistics, as the measured degree of second order coherence,\ng$^{(2)}$(0)=1.9$\\pm$0.1, indicates. Despite the non-optimized scenario in the\nspectral domain, we achieve six orders of magnitude higher conversion\nefficiency than previously reported with truly incoherent light. This is\npossible by using single spatial mode radiation and quasi phase matched\nmaterial with a waveguide architecture. This work is a principle step towards\nefficient frequency conversion of temporally incoherent radiation in one\nspatial mode to access wavelengths where no radiation from superluminescent\ndiodes is available, especially with tailored quasi phase matched crystals. The\nfrequency doubled light might find use in applications and quantum optics\nexperiments.\n", "doi": "10.1088/1612-202x/aa6889", "arxiv_id": "1704.01096", "pdf_urls": ["https://arxiv.org/pdf/1704.01096"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters, 2017, Volume 14, Number 5, 055402", "categories": "physics.optics quant-ph"}
{"title": "Joint Semi-supervised RSS Dimensionality Reduction and Fingerprint Based\n  Algorithm for Indoor Localization", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Caifa Zhou", "Lin Ma", "and Xuezhi Tan"], "abstract": "  With the recent development in mobile computing devices and as the ubiquitous\ndeployment of access points(APs) of Wireless Local Area Networks(WLANs), WLAN\nbased indoor localization systems(WILSs) are of mounting concentration and are\nbecoming more and more prevalent for they do not require additional\ninfrastructure. As to the localization methods in WILSs, for the approaches\nused to localization in satellite based global position systems are difficult\nto achieve in indoor environments, fingerprint based localization\nalgorithms(FLAs) are predominant in the RSS based schemes. However, the\nperformance of FLAs has close relationship with the number of APs and the\nnumber of reference points(RPs) in WILSs, especially as the redundant\ndeployment of APs and RPs in the system. There are two fatal problems, curse of\ndimensionality (CoD) and asymmetric matching(AM), caused by increasing number\nof APs and breaking down APs during online stage. In this paper, a\nsemi-supervised RSS dimensionality reduction algorithm is proposed to solve\nthese two dilemmas at the same time and there are numerous analyses about the\ntheoretical realization of the proposed method. Another significant innovation\nof this paper is jointing the fingerprint based algorithm with CM-SDE algorithm\nto improve the localization accuracy of indoor localization.\n", "doi": null, "arxiv_id": "1704.03639", "pdf_urls": ["https://arxiv.org/pdf/1704.03639"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Zhou, C.F. et al., 2016. Joint Semi-supervised RSS Dimensionality\n  Reduction and Fingerprint Based Algorithm for Indoor Localization. ,\n  (SEPTEMBER 2014)", "categories": "stat.ML stat.ME"}
{"title": "Arguing from Hazard Analysis in Safety Cases: A Modular Argument Pattern", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mario Gleirscher and Carmen Carlan"], "abstract": "  We observed that safety arguments are prone to stay too abstract, e.g.\nsolutions refer to large packages, argument strategies to complex reasoning\nsteps, contexts and assumptions lack traceability. These issues can reduce the\nconfidence we require of such arguments. In this paper, we investigate the\nconstruction of confident arguments from (i) hazard analysis (HA) results and\n(ii) the design of safety measures, i.e., both used for confidence evaluation.\nWe present an argument pattern integrating three HA techniques, i.e., FTA,\nFMEA, and STPA, as well as the reactions on the results of these analyses,\ni.e., safety requirements and design increments. We provide an example of how\nour pattern can help in argument construction and discuss steps towards using\nour pattern in formal analysis and computer-assisted construction of safety\ncases.\n", "doi": "10.1109/hase.2017.15", "arxiv_id": "1704.03672", "pdf_urls": ["https://arxiv.org/pdf/1704.03672"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "18th IEEE Int. Symp. on High Assurance Systems Engineering (HASE),\n  2017", "categories": "cs.SE cs.SY"}
{"title": "Extended depth-range profilometry using the phase-difference and\n  phase-sum of two close-sensitivity projected fringes", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Manuel Servin", "Moises Padilla", "and Guillermo Garnica"], "abstract": "  A far-ultraviolet (FUV) equivalent-wavelength super-resolution\ninterferometric technique is proposed. This FUV equivalent-wavelength\ninterferometric method combines four demodulated phases from four temporal-sets\nof visible interferograms. Here FUV super-resolution interferometry is defined\nas the estimation of a modulating phase coming from an FUV\nequivalent-wavelength illumination laser. To this end we need to combine the\ndemodulated phase of four visible-wavelength interferograms. FUV\nequivalent-wavelength phase-sensitivity is of course beyond the\nphase-information capacity of a single visible-wavelength interferogram. To\nbreak this visible-wavelength barrier we use the phase-information provided by\nfour or more interferograms in the visible range. Having the four demodulated\nphases we calculate a phase-difference and the sum of the four phases which is\nthe FUV-equivalent super-resolution phase. The phase-difference is in the\ninfrared phase-sensitivity range and it is assumed non-wrapped. On the other\nhand the phase-sum is in the FUV phase-sensitivity range and it is\nhighly-wrapped. As shown herein it is possible to unwrap the phase-sum in the\ntemporal domain using the phase-difference and our previously reported\nextended-range 2-step temporal phase-unwrapper. Of course higher than FUV\nequivalent phase-sensitivity interferometry may be obtained by increasing the\nnumber of independent estimated phases from visible-wavelength interferograms.\nAs far as we know, this FUV equivalent-wavelength super-resolution\ninterferometric technique has the highest phase-sensitivity and highest\nsignal-to-noise ratio ever reported to this date.\n", "doi": "10.1016/j.optlaseng.2018.02.012", "arxiv_id": "1704.04662", "pdf_urls": ["https://arxiv.org/pdf/1704.04662", "https://arxiv.org/pdf/1704.04700", "https://arxiv.org/pdf/1706.04039"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering 106, Pages 68-74, July 2018", "categories": "physics.optics", "cited_by": 0}
{"title": "All-optical photon echo and memory on a chip", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["E.S.Moiseev and S.A. Moiseev"], "abstract": "  We demonstrate that a photon echo can be implemented by all-optical means\nusing an array of on-chip high-finesse ring cavities whose parameters are\nchirped in such a way as to support equidistant spectra of cavity modes. When\nlaunched into such a system, a classical or quantum optical signal -- even a\nsingle-photon field -- becomes distributed between individual cavities, giving\nrise to prominent coherence echo revivals at well-defined delay times,\ncontrolled by the chirp of cavity parameters. This effect enables long storage\ntimes for high-throughput broadband optical delay and quantum memory.\n", "doi": "10.1088/1612-202x/aa4fc2", "arxiv_id": "1704.06471", "pdf_urls": ["https://arxiv.org/pdf/1704.06471"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14 015202 (2017)", "categories": "quant-ph"}
{"title": "Development and properties of composite cement reinforced coconut fiber\n  with the addition of fly ash", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["N. I. M. Nadzri", "J. B. Shamsul", "M. N. Mazlee"], "abstract": "  In this paper, the effectiveness utilization of agriculture wastes and\nindustrial wastes in the composites cement has been studied in terms of\nphysical and mechanical properties. Twenty weight percent of fly ash and eighty\nweight percent of sand were added to the composite cement. The different weight\npercent of coconut fiber (3 wt. %, 6 wt. %, 9 wt. %, 12 wt. % and 15 wt. %) was\nadded in the composition as reinforcement for cement composites. Water to\ncement ratio ranging from 0.55 to 0.70 was added into the cement composites\naccordingly to maintain its workability. Then the cement composites were cured\nin water for 7, 14 and 28 days respectively. Results for physical properties\n(density, moisture content, water absorption) and mechanical properties\n(compressive strength, modulus of rupture) are presented.\n", "doi": null, "arxiv_id": "1705.00179", "pdf_urls": ["https://arxiv.org/pdf/1705.00179"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Sustainable Cement-Based Materials, 1(4), 186-191\n  (2012)", "categories": "cond-mat.mtrl-sci"}
{"title": "Characterization of nonequilibrium states of trapped Bose-Einstein\n  condensates", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov", "A.N. Novikov", "and V.S. Bagnato"], "abstract": "  Generation of different nonequilibrium states in trapped Bose-Einstein\ncondensates is studied by numerically solving nonlinear Schrodinger equation.\nInducing nonequilibrium states by shaking the trap, the following states are\ncreated: weak nonequilibrium, the state of vortex germs, the state of vortex\nrings, the state of straight vortex lines, the state of deformed vortices,\nvortex turbulence, grain turbulence, and wave turbulence. A characterization of\nnonequilibrium states is advanced by introducing effective temperature, Fresnel\nnumber, and Mach number.\n", "doi": "10.1088/1612-202x/aa99fa", "arxiv_id": "1705.01768", "pdf_urls": ["https://arxiv.org/pdf/1705.01768"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 15 (2018) 065501", "categories": "cond-mat.quant-gas cond-mat.stat-mech"}
{"title": "Graph Embedding Techniques, Applications, and Performance: A Survey", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Palash Goyal", "Emilio Ferrara"], "abstract": "  Graphs, such as social networks, word co-occurrence networks, and\ncommunication networks, occur naturally in various real-world applications.\nAnalyzing them yields insight into the structure of society, language, and\ndifferent patterns of communication. Many approaches have been proposed to\nperform the analysis. Recently, methods which use the representation of graph\nnodes in vector space have gained traction from the research community. In this\nsurvey, we provide a comprehensive and structured analysis of various graph\nembedding techniques proposed in the literature. We first introduce the\nembedding task and its challenges such as scalability, choice of\ndimensionality, and features to be preserved, and their possible solutions. We\nthen present three categories of approaches based on factorization methods,\nrandom walks, and deep learning, with examples of representative algorithms in\neach category and analysis of their performance on various tasks. We evaluate\nthese state-of-the-art methods on a few common datasets and compare their\nperformance against one another. Our analysis concludes by suggesting some\npotential applications and future directions. We finally present the\nopen-source Python library we developed, named GEM (Graph Embedding Methods,\navailable at https://github.com/palash1992/GEM), which provides all presented\nalgorithms within a unified interface to foster and facilitate research on the\ntopic.\n", "doi": "10.1016/j.knosys.2018.03.022", "arxiv_id": "1705.02801", "pdf_urls": ["https://arxiv.org/pdf/1705.02801"], "github": ["https://github.com/olekscode/Power2TheWiki", "https://github.com/agoodweathercc/EmbeddingEval", "https://github.com/palash1992/GEM"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge Based Systems, Volume 151, 1 July 2018, Pages 78-94,\n  2018", "categories": "cs.SI cs.LG physics.data-an"}
{"title": "Estimation of pulsed driven qubit parameters via quantum Fisher\n  information", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["N. Metwally and S. S. Hassan"], "abstract": "  We estimate the initial weight and phase parameters ($\\theta, \\phi)$ of a\nsingle qubit system initially prepared in the coherent state\n$\\ket{\\theta,\\phi}$ and interacts with three different shape of pulses;\nrectangular, exponential, and $sin^2$-pulses. In general, we show that the\nestimation degree of the weight parameter depends on the pulse shape and the\ninitial phase angle, $(\\phi)$. For the rectangular pulse case, increasing the\nestimating rate of the weight parameter via the Fisher information function\n$(\\mathcal{F}_\\theta)$ is possible with small values of the atomic detuning\nparameter and larger values of the pulse strength.\n  Fisher information $(\\mathcal{F}_\\phi)$ increases suddenly at resonant case\nto reach its maximum value if the initial phase $\\phi=\\pi/2$ and consequently\none may estimate the phase parameter with high degree of precision. If the\ninitial system is coded with classical information, the upper bounds of Fisher\ninformation for resonant and non-resonant cases are much larger and\nconsequently one may estimate the pahse parameter with high degree of\nestimation. Similarly as the detuning increases the Fisher information\ndecreases and therefore the possibility of estimating the phase parameter\ndecreases. For exponential, and $sin^2$-pulses the Fisher information is\nmaximum ($\\mathcal{F}_{\\theta,\\phi}=1$) and consequently one can always\nestimate the weight and the phase parameters $(\\theta,\\phi)$ with high degree\nof precision.\n", "doi": "10.1088/1612-202x/aa86e4", "arxiv_id": "1705.04516", "pdf_urls": ["https://arxiv.org/pdf/1705.04516"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14 115204 (2017)", "categories": "quant-ph"}
{"title": "Bose-Einstein condensation temperature of weakly interacting atoms", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov and E.P. Yukalova"], "abstract": "  The critical temperature of Bose-Einstein condensation essentially depends on\ninternal properties of the system as well as on the geometry of a trapping\npotential. The peculiarities of defining the phase transition temperature of\nBose-Einstein condensation for different systems are reviewed, including\nhomogenous Bose gas, trapped Bose atoms, and bosons in optical lattices. The\nmethod of self-similar approximants, convenient for calculating critical\ntemperature, is briefly delineated.\n", "doi": "10.1088/1612-202x/aa6eed", "arxiv_id": "1705.09309", "pdf_urls": ["https://arxiv.org/pdf/1705.09309"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 14 (2017) 073001", "categories": "cond-mat.quant-gas"}
{"title": "Driven spin wave modes in XY ferromagnet: Nonequilibrium phase\n  transition", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Muktish Acharyya"], "abstract": "  The dynamical responses of XY ferromagnet driven by linearly polarised\npropagating and standing magnetic field wave have been studied by Monte Carlo\nsimulation in three dimensions. In the case of propagating magnetic field wave\n(with specified amplitude, frequency and the wavelength), the low temperature\ndynamical mode is a propagating spin wave and the system becomes structureless\n(or random) in the high temperature. A dynamical symmetry breaking phase\ntransition is observed at a finite (nonzero) temperature. This symmetry\nbreaking is confirmed by studying the statistical distribution of the angle of\nthe spin vector. The dynamic nonequilibrium transition temperature was found to\ndecrease as the amplitude of the propagating magnetic field wave increased. A\ncomprehensive phase boundary is drawn in the plane formed by temperature and\namplitude of propagating field wave. The phase boundary was observed to shrink\n(in the low temperature side) for longer wavelength of the propagating magnetic\nwave. In the case of standing magnetic field wave, the low temperature\nexcitation is a standing spin wave which becomes structureless (or random) in\nthe high temperature. Here also, like the case of propagating magnetic wave, a\ndynamical symmetry breaking nonequilibrium phase transition was observed. A\ncomprehensive phase boundary is drawn. Unlike the case of propagating magnetic\nwave, the phase boundary does not show any systematic variation with the\nwavelength of the standing magnetic field wave. In the limit of vanishingly\nsmall amplitude of the field, the phase boundaries approach the recent Monte\nCarlo estimate of equilibrium transition temperature.\n", "doi": "10.1080/01411594.2018.1506878", "arxiv_id": "1706.01619", "pdf_urls": ["https://arxiv.org/pdf/1706.01619"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Phase Transitions (Taylor & Francis) 91 (2018) 793", "categories": "cond-mat.stat-mech"}
{"title": "Experiments of posture estimation on vehicles using wearable\n  acceleration sensors", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yoji Yamato"], "abstract": "  In this paper, we study methods to estimate drivers' posture in vehicles\nusing acceleration data of wearable sensor and conduct a field test. Recently,\nsensor technologies have been progressed. Solutions of safety management to\nanalyze vital data acquired from wearable sensor and judge work status are\nproposed. To prevent huge accidents, demands for safety management of bus and\ntaxi are high. However, acceleration of vehicles is added to wearable sensor in\nvehicles, and there is no guarantee to estimate drivers' posture accurately.\nTherefore, in this paper, we study methods to estimate driving posture using\nacceleration data acquired from T-shirt type wearable sensor hitoe, conduct\nfield tests and implement a sample application.\n  Y. Yamato, \"Experiments of Posture Estimation on Vehicles Using Wearable\nAcceleration Sensors,\" The 3rd IEEE International Conference on Big Data\nSecurity on Cloud (BigDataSecurity 2017), pp.14-17, DOI:\n10.1109/BigDataSecurity.2017.8, May 2017.\n  \"(c) 2017 IEEE. Personal use of this material is permitted. Permission from\nIEEE must be obtained for all other uses, in any current or future media,\nincluding reprinting/republishing this material for advertising or promotional\npurposes, creating new collective works, for resale or redistribution to\nservers or lists, or reuse of any copyrighted component of this work in other\nworks.\"\n", "doi": null, "arxiv_id": "1706.02149", "pdf_urls": ["https://arxiv.org/pdf/1706.02149"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "The 3rd IEEE International Conference on Big Data Security on\n  Cloud (BigDataSecurity 2017), pp.14-17, May 2017", "categories": "cs.HC cs.DC"}
{"title": "Weakly supervised training of deep convolutional neural networks for\n  overhead pedestrian localization in depth fields", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alessandro Corbetta", "Vlado Menkovski", "Federico Toschi"], "abstract": "  Overhead depth map measurements capture sufficient amount of information to\nenable human experts to track pedestrians accurately. However, fully automating\nthis process using image analysis algorithms can be challenging. Even though\nhand-crafted image analysis algorithms are successful in many common cases,\nthey fail frequently when there are complex interactions of multiple objects in\nthe image. Many of the assumptions underpinning the hand-crafted solutions do\nnot hold in these cases and the multitude of exceptions are hard to model\nprecisely. Deep Learning (DL) algorithms, on the other hand, do not require\nhand crafted solutions and are the current state-of-the-art in object\nlocalization in images. However, they require exceeding amount of annotations\nto produce successful models. In the case of object localization these\nannotations are difficult and time consuming to produce. In this work we\npresent an approach for developing pedestrian localization models using DL\nalgorithms with efficient weak supervision from an expert. We circumvent the\nneed for annotation of large corpus of data by annotating only small amount of\npatches and relying on synthetic data augmentation as a vehicle for injecting\nexpert knowledge in the model training. This approach of weak supervision\nthrough expert selection of representative patches, suitable transformations\nand synthetic data augmentations enables us to successfully develop DL models\nfor pedestrian localization efficiently.\n", "doi": "10.1109/avss.2017.8078490", "arxiv_id": "1706.02850", "pdf_urls": ["https://arxiv.org/pdf/1706.02850"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Advanced Video and Signal Based Surveillance (AVSS), 2017 14th\n  IEEE International Conference on", "categories": "cs.CV cs.NE physics.soc-ph"}
{"title": "Extension of a Reduced Entropic Model of Electron Transport to\n  Magnetized Nonlocal Regimes of High-Energy-Density Plasmas", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["D. Del Sorbo", "J.-L. Feugeas", "Ph. Nicola\\\"i", "M. Olazabal-Loum\\'e", "B.\n  Dubroca", "V. Tikhonchuk"], "abstract": "  Laser produced high-energy-density plasmas may contain strong magnetic fields\nthat affect the energy transport, which can be nonlocal. Models which describe\nthe magnetized nonlocal transport are formally complicated and based on many\napproximations. This paper presents a more straightforward approach to the\ndescription of the electron transport in this regime, based on the extension of\na reduced entropic model. The calculated magnetized heat fluxes are compared\nwith the known asymptotic limits and applied for studying of a magnetized\nnonocal plasma thermalization.\n", "doi": "10.1017/s0263034616000252", "arxiv_id": "1706.04171", "pdf_urls": ["https://arxiv.org/pdf/1706.04171"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser and Particle Beams 34.03 (2016): 412-425", "categories": "physics.plasm-ph"}
{"title": "Generalising Random Forest Parameter Optimisation to Include Stability\n  and Cost", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["C.H. Bryan Liu", "Benjamin Paul Chamberlain", "Duncan A. Little", "Angelo\n  Cardoso"], "abstract": "  Random forests are among the most popular classification and regression\nmethods used in industrial applications. To be effective, the parameters of\nrandom forests must be carefully tuned. This is usually done by choosing values\nthat minimize the prediction error on a held out dataset. We argue that error\nreduction is only one of several metrics that must be considered when\noptimizing random forest parameters for commercial applications. We propose a\nnovel metric that captures the stability of random forests predictions, which\nwe argue is key for scenarios that require successive predictions. We motivate\nthe need for multi-criteria optimization by showing that in practical\napplications, simply choosing the parameters that lead to the lowest error can\nintroduce unnecessary costs and produce predictions that are not stable across\nindependent runs. To optimize this multi-criteria trade-off, we present a new\nframework that efficiently finds a principled balance between these three\nconsiderations using Bayesian optimisation. The pitfalls of optimising forest\nparameters purely for error reduction are demonstrated using two publicly\navailable real world datasets. We show that our framework leads to parameter\nsettings that are markedly different from the values discovered by error\nreduction metrics.\n", "doi": "10.1007/978-3-319-71273-4_9", "arxiv_id": "1706.09865", "pdf_urls": ["https://arxiv.org/pdf/1706.09865"], "github": ["https://github.com/liuchbryan/generalised_forest_tuning"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Machine Learning and Knowledge Discovery in Databases. ECML PKDD\n  2017. LNCS vol 10536, pp. 102-113 (2017)", "categories": "stat.ML cs.CY cs.LG"}
{"title": "An incremental-stencil WENO reconstruction for simulation of\n  compressible two-phase flows", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bing Wang", "Gaoming Xiang", "Xiangyu Y. Hu"], "abstract": "  An incremental-stencil WENO reconstruction method, which uses low-order\ncandidate stencils with incrementally increasing width, is proposed for\nfinite-volume simulation of compressible two-phase flow with the\nquasi-conservative interface model. While recovering the original 5th-order\nWENO reconstruction in smooth region of the solution, due to the presence of\n2-point candidate stencils, the present method is able to handle closely\nlocated discontinuities, which is a typical scenario of shock-interface\ninteraction. Furthermore, a MOOD-type positivity preserving approach is applied\nto ensure physical meaningful reconstruction. Compared with the hybrid method\nwhich switches between with the 5th-order WENO and 2nd-order reconstructions,\nthe present method is free of problem-dependent tunable parameters. A number of\nnumerical examples show that the present method achieves small numerical\ndissipation and good robustness for simulating two-phase flow problems with\nstrong shock-interface interaction and large density ratio.\n", "doi": "10.1016/j.ijmultiphaseflow.2018.03.013", "arxiv_id": "1707.00592", "pdf_urls": ["https://arxiv.org/pdf/1707.00592"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 2018", "categories": "physics.comp-ph"}
{"title": "Leaderboard Effects on Player Performance in a Citizen Science Game", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mads Kock Pedersen", "Nanna Ravn Rasmussen", "Jacob F. Sherson", "and Rajiv\n  Vaid Basaiawmoit"], "abstract": "  Quantum Moves is a citizen science game that investigates the ability of\nhumans to solve complex physics challenges that are intractable for computers.\nDuring the launch of Quantum Moves in April 2016 the game's leaderboard\nfunction broke down resulting in a \"no leaderboard\" game experience for some\nplayers for a couple of days (though their scores were still displayed). The\nsubsequent quick fix of an all-time Top 5 leaderboard, and the following\nlong-term implementation of a personalized relative-position (infinite)\nleaderboard provided us with a unique opportunity to compare and investigate\nthe effect of different leaderboard implementations on player performance in a\npoints-driven citizen science game.\n  All three conditions were live sequentially during the game's initial influx\nof more than 150.000 players that stemmed from global press attention on\nQuantum Moves due the publication of a Nature paper about the use of Quantum\nMoves in solving a specific quantum physics problem. Thus, it has been possible\nto compare the three conditions and their influence on the performance (defined\nas a player's quality of game play related to a high-score) of over 4500 new\nplayers. These 4500 odd players in our three leaderboard-conditions have a\nsimilar demographic background based upon the time-window over which the\nimplementations occurred and controlled against Player ID tags. Our results\nplaced Condition 1 experience over condition 3 and in some cases even over\ncondition 2 which goes against the general assumption that leaderboards enhance\ngameplay and its subsequent overuse as a an oft-relied upon element that\ndesigners slap onto a game to enhance said appeal. Our study thus questions the\nuse of leaderboards as general performance enhancers in gamification contexts\nand brings some empirical rigor to an often under-reported but overused\nphenomenon.\n", "doi": null, "arxiv_id": "1707.03704", "pdf_urls": ["https://arxiv.org/pdf/1707.03704"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 11th European Conference on Game Based\n  Learning, 531 (2017)", "categories": "physics.soc-ph physics.pop-ph"}
{"title": "Multigrid-based inversion for volumetric radar imaging with asteroid\n  interior reconstruction as a potential application", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mika Takala and Defne Us and Sampsa Pursiainen"], "abstract": "  This study concentrates on advancing mathematical and computational\nmethodology for radar tomography imaging in which the unknown volumetric\nvelocity distribution of a wave within a bounded domain is to be reconstructed.\nOur goal is to enable effective simulation and inversion of a large amount of\nfull-wave data within a realistic 2D or 3D geometry. For propagating and\ninverting the wave, we present a rigorous multigrid-based forward approach\nwhich utilizes the finite-difference time-domain method and a nested finite\nelement grid structure. Based on the multigrid approach, we introduce and\nvalidate a multiresolution algorithm which allows regularization of the unknown\ndistribution through a coarse-to-fine inversion scheme. In this approach,\nsparse signals can be effectively inverted, as the coarse fluctuations are\nreconstructed before the finer ones. Furthermore, the number of nonzero entries\nin the system matrix can be compressed and thus the inversion procedure can be\nspeeded up. As a test scenario we investigate satellite-based asteroid interior\nreconstruction. We use both full-wave and projected wave data and estimate the\naccuracy of the inversion under different error sources: noise and positioning\ninaccuracies. The results suggest that the present full-wave inversion approach\nallows recovering the interior with a single satellite recording backscattering\ndata. It seems that robust results can be achieved, when the peak-to-peak\nsignal-to-noise ratio is above 10 dB. Furthermore, it seems that reconstructing\nthe deep interior can be enhanced if two satellites can be utilized in the\nmeasurements.\n", "doi": "10.1109/tci.2018.2811908", "arxiv_id": "1707.04605", "pdf_urls": ["https://arxiv.org/pdf/1707.04605"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "M. Takala, D. Us and S. Pursiainen, \"Multigrid-based inversion for\n  volumetric radar imaging with asteroid interior reconstruction as a potential\n  application,\" in IEEE Transactions on Computational Imaging, vol. PP, no. 99,\n  pp. 1-1, 2018", "categories": "astro-ph.IM astro-ph.EP"}
{"title": "A generic framework for adaptive EEG-based BCI training and operation", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jelena Mladenovi\\'c (1)", "J\\'er\\'emie Mattout", "Fabien Lotte (1) ((1)\n  LaBRI", "Potioc)"], "abstract": "  There are numerous possibilities and motivations for an adaptive BCI, which\nmay not be easy to clarify and organize for a newcomer to the field. To our\nknowledge, there has not been any work done in classifying the literature on\nadaptive BCI in a comprehensive and structured way. We propose a conceptual\nframework, a taxonomy of adaptive BCI methods which encompasses most important\napproaches to fit them in such a way that a reader can clearly visualize which\nelements are being adapted and for what reason. In the interest of having a\nclear review of existing adaptive BCIs, this framework considers adaptation\napproaches for both the user and the machine, i.e., using instructional design\nobservations as well as the usual machine learning techniques. This framework\nnot only provides a coherent review of such extensive literature but also\nenables the reader to perceive gaps and flaws in the current BCI systems, which\nwould hopefully bring novel solutions for an overall improvement.\n", "doi": null, "arxiv_id": "1707.07935", "pdf_urls": ["https://arxiv.org/pdf/1707.07935"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Chapter 33: ''A generic framework for adaptive EEG-based BCI\n  training and operation'' , 1, CRC Press: Taylor \\& Francis Group, 2017,\n  Brain-Computer Interfaces Handbook: Technological and Theoretical Advances", "categories": "cs.HC q-bio.QM"}
{"title": "Comparison of predictions of the PC-SAFT equation of state and molecular\n  simulations for the metastable region of binary mixtures", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alexander Keller", "Kai Langenbach", "Hans Hasse"], "abstract": "  The metastable region of binary mixtures is examined with the PC-SAFT\nequa-tion of state (EOS) and compared to molecular simulations. The studied\nmixtures are Methane + Ethane, Methanol + Ethanol, Carbon Dioxide + Toluene,\nCarbon Dioxide + Hydrogen Chloride and Hydrogen Chloride + Toluene. In order to\ncal-culate the spinodal, the second partial derivatives with respect to the\ncomponents molarities are analytically determined for the PC-SAFT EOS. Thermal\nproperties as well as the spinodal points determined using PC-SAFT and\nmolecular simula-tion are compared. For the studied metastable gas phases the\nresults obtained with PC-SAFT and the molecular simulations agree well. For\nliquid phases the meta-stable region calculated with the PC-SAFT EOS is\ntypically broader than that ob-tained from the molecular simulations. No\nunphysical results were obtained with PC-SAFT for metastable states. Hence,\nPC-SAFT EOS is found to be principally suitable for predicting metastable\nstates and spinodals of mixtures.\n", "doi": "10.1016/j.fluid.2017.04.009", "arxiv_id": "1708.00256", "pdf_urls": ["https://arxiv.org/pdf/1708.00256"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Fluid Phase Equilibria, 444, 31-36", "categories": "physics.comp-ph physics.chem-ph"}
{"title": "On a relation between the volume of fluid, level-set and phase field\n  interface models", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tomasz Wac{\\l}awczyk"], "abstract": "  This paper discusses a relation between the re-initialization equation of the\nlevel-set functions derived by Wac{\\l}awczyk [J.Comp.Phys., 299, (2015)] and\nthe condition for the phase equilibrium provided by the stationary solution to\nthe modified Allen-Cahn equation [Acta Metall., 27, (1979)]. As a consequence,\nthe statistical model of the non-flat interface in the state of phase\nequilibrium is postulated. This new physical model of the non-flat interface is\nintroduced based on the statistical picture of the sharp interface disturbed by\nthe field of stochastic forces, it yields the relation between the sharp and\ndiffusive interface models. Furthermore, the new techniques required for the\naccurate solution of the model equations are proposed. First it is shown, the\nconstrained interpolation improves re-initialization of the level-set functions\nas it avoids oscillatory numerical errors typical for the second-order accurate\ninterpolation schemes. Next, the new semi-analytical, second order accurate\nLagrangian scheme is put forward to integrate the advection equation in time\navoiding interface curvature oscillations introduced by the second-order\naccurate flux limiters. These techniques provide means to obtain complete,\nsecond-order convergence during advection and re-initialization of the\ninterface in the state of phase equilibrium.\n", "doi": "10.1016/j.ijmultiphaseflow.2017.08.003", "arxiv_id": "1708.01805", "pdf_urls": ["https://arxiv.org/pdf/1708.01805"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow vol. 97, 2017", "categories": "physics.flu-dyn physics.comp-ph"}
{"title": "On the entropy gain under the action of amplitude damping channel on\n  qutrit", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Grigori G. Amosov", "Andrey I. Dnestryan"], "abstract": "  After realising qutrit in the form of bipartite system we estimate from below\nthe entropy gain under the action of the amplitude damping channel.\n", "doi": null, "arxiv_id": "1708.07710", "pdf_urls": ["https://arxiv.org/pdf/1708.07710"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russian Laser Research 35 (2014) 291-294", "categories": "quant-ph"}
{"title": "Isotopies vis-\\`a-vis level-preserving embeddings", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hansj\\\"org Geiges"], "abstract": "  Various standard texts on differential topology maintain that the\nlevel-preserving map defined by the track of an isotopy of embeddings is itself\nan embedding. This note describes a simple counterexample to this assertion.\n", "doi": null, "arxiv_id": "1708.09703", "pdf_urls": ["https://arxiv.org/pdf/1708.09703"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 110 (2018), 197-200", "categories": "math.GT"}
{"title": "Schur-type invariants of branched G-covers of surfaces", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eric Samperton (UC Davis)"], "abstract": "  Fix a finite group $G$ and a conjugacy invariant subset $C\\subseteq G$. Let\n$\\Sigma$ be an oriented surface, possibly with punctures. We consider the\nquestion of when two homomorphisms $\\pi_1(\\Sigma) \\to G$ taking punctures into\n$C$ are equivalent up to an orientation preserving diffeomorphism of $\\Sigma$.\nWe provide an answer to this question in a stable range, meaning that $\\Sigma$\nhas enough genus and enough punctures of every conjugacy type in $C$. If $C$\ngenerates $G$, then we can assume $\\Sigma$ has genus 0 (or any other constant).\nThe main tool is a classifying space for (framed) $C$-branched $G$-covers, and\nrelated homology classes we call branched Schur invariants, since they take\nvalues in a torsor over a quotient of the Schur multiplier $H_2(G)$. We\nconclude with a brief discussion of applications to $(2+1)$-dimensional\n$G$-equivariant TQFT and symmetry-enriched topological phases.\n", "doi": "10.1090/conm/747/15045", "arxiv_id": "1709.03182", "pdf_urls": ["https://arxiv.org/pdf/1709.03182"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Topological Phases of Matter and Quantum Computation (2020),\n  Contemp. Math., Volume 747, pp.173-197", "categories": "math.GT math.QA"}
{"title": "A remark on Leclerc's Frobenius categories", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Kalck"], "abstract": "  Leclerc recently studied certain Frobenius categories in connection with\ncluster algebra structures on coordinate rings of intersections of opposite\nSchubert cells. We show that these categories admit a description as Gorenstein\nprojective modules over an Iwanaga-Gorenstein ring of virtual dimension at most\ntwo. This is based on a Morita type result for Frobenius categories.\n", "doi": "10.1007/978-3-319-45441-2", "arxiv_id": "1709.04785", "pdf_urls": ["https://arxiv.org/pdf/1709.04785"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Research Perspectives CRM Barcelona, Spring 2015, vol. 5, in\n  Trends in Mathematics Springer-Birkh\\\"auser, Basel", "categories": "math.RT math.CT"}
{"title": "Increased stability of CuZrAl metallic glasses prepared by physical\n  vapor deposition", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["G.B. Bokas", "L. Zhao", "D. Morgan and I. Szlufarska"], "abstract": "  We carried out molecular dynamics simulations (MD) using realistic empirical\npotentials for the vapor deposition (VD) of CuZrAl glasses. VD glasses have\nhigher densities and lower potential and inherent structure energies than the\nmelt-quenched glasses for the same alloys. The optimal substrate temperature\nfor the deposition process is 0.625$\\times T_\\mathrm{g}$. In VD metallic\nglasses (MGs), the total number of icosahedral like clusters is higher than in\nthe melt-quenched MGs. Surprisingly, the VD glasses have a lower degree of\nchemical mixing than the melt-quenched glasses. The reason for it is that the\nmelt-quenched MGs can be viewed as frozen liquids, which means that their\nchemical order is the same as in the liquid state. In contrast, during the\nformation of the VD MGs, the absence of the liquid state results in the\ncreation of a different chemical order with more Zr-Zr homonuclear bonds\ncompared with the melt-quenched MGs. In order to obtain MGs from melt-quench\ntechnique with similarly low energies as in the VD process, the cooling rate\nduring quenching would have to be many orders of magnitude lower than currently\naccessible to MD simulations. The method proposed in this manuscript is a more\nefficient way to create MGs by using MD simulations.\n", "doi": "10.1016/j.jallcom.2017.09.068", "arxiv_id": "1709.04797", "pdf_urls": ["https://arxiv.org/pdf/1709.04797"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "G.B. Bokas, L. Zhao, D. Morgan and I. Szlufarska, Increased\n  stability of CuZrAl metallic glasses prepared by physical vapor deposition,\n  Journal of Alloys and Compounds 728 (2017) 1110-15", "categories": "physics.comp-ph cond-mat.soft physics.chem-ph"}
{"title": "Second-order coherence properties of amplified spontaneous emission from\n  a high-power tapered superluminescent diode", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jan Kiethe", "Axel Heuer", "Andreas Jechow"], "abstract": "  We study the degree of second-order coherence of the emission of a high-power\nmulti-quantum well superluminescent diode with a lateral tapered amplifier\nsection with and without feedback. When operated in an external cavity, the\ndegree of second-order coherence changed from the almost thermal case of\ng$^{(2)}$(0)$\\approx$1.9 towards the mostly coherent case of\ng$^{(2)}$(0)$\\approx$1.2 when the injection current at the tapered section was\nincreased. We found good agreement with semi-classical laser theory near and\nbelow threshold while above laser threshold a slightly higher g$^{(2)}$(0) was\nobserved. As a free running device, the superluminescent diode yielded more\nthan 400 mW of optical output power with good spatial beam quality of\n$M^2_{slow} < 1.6$. In this case, the DSOC dropped only slightly from 1.9 at\nlow powers to 1.6 at the maximum output power. To our knowledge, this is the\nfirst investigation of a high-power tapered superluminescent diode concerning\nthe degree of second-order coherence. Such a device might be useful for\nreal-world applications probing the second order coherence function, such as\nghost imaging.\n", "doi": "10.1088/1612-202x/aa772c", "arxiv_id": "1709.05798", "pdf_urls": ["https://arxiv.org/pdf/1709.05798"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters, 14, 086201 (2017)", "categories": "quant-ph physics.optics"}
{"title": "Blood-based metabolic signatures in Alzheimer's disease", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Francisca A. de Leeuw", "Carel F.W. Peeters", "Maartje I. Kester", "Amy C.\n  Harms", "Eduard A. Struys", "Thomas Hankemeier", "Herman W.T. van Vlijmen", "Sven J.\n  van der Lee", "Cornelia M. van Duijn", "Philip Scheltens", "Ay\\c{s}e Demirkan", "Mark\n  A. van de Wiel", "Wiesje M. van der Flier", "Charlotte E. Teunissen"], "abstract": "  Introduction: Identification of blood-based metabolic changes might provide\nearly and easy-to-obtain biomarkers.\n  Methods: We included 127 AD patients and 121 controls with\nCSF-biomarker-confirmed diagnosis (cut-off tau/A$\\beta_{42}$: 0.52). Mass\nspectrometry platforms determined the concentrations of 53 amine, 22 organic\nacid, 120 lipid, and 40 oxidative stress compounds. Multiple signatures were\nassessed: differential expression (nested linear models), classification\n(logistic regression), and regulatory (network extraction).\n  Results: Twenty-six metabolites were differentially expressed. Metabolites\nimproved the classification performance of clinical variables from 74% to 79%.\nNetwork models identified 5 hubs of metabolic dysregulation: Tyrosine,\nglycylglycine, glutamine, lysophosphatic acid C18:2 and platelet activating\nfactor C16:0. The metabolite network for APOE $\\epsilon$4 negative AD patients\nwas less cohesive compared to the network for APOE $\\epsilon$4 positive AD\npatients.\n  Discussion: Multiple signatures point to various promising peripheral markers\nfor further validation. The network differences in AD patients according to\nAPOE genotype may reflect different pathways to AD.\n", "doi": "10.1016/j.dadm.2017.07.006", "arxiv_id": "1709.07285", "pdf_urls": ["https://arxiv.org/pdf/1709.07285"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Alzheimer's & Dementia: Diagnosis, Assessment & Disease\n  Monitoring, 8 (2017): 196-207", "categories": "q-bio.NC q-bio.MN stat.AP"}
{"title": "On the pointwise domination of a function by its maximal function", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J. M. Aldaz"], "abstract": "  We show that under rather general circumstances, the almost everywhere\npointwise inequality $|f|(x) \\le Mf (x)$ is equivalent to a weak form of the\nLebesgue density theorem, for totally bounded closed sets. We derive both\npositive and negative results from this characterization.\n", "doi": null, "arxiv_id": "1710.02033", "pdf_urls": ["https://arxiv.org/pdf/1710.02033"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 111 (2018), no. 3, 299-311", "categories": "math.CA"}
{"title": "Strong electromagnetic pulses generated in high-intensity short-pulse\n  laser interactions with thin foil targets", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["P. R\\k{a}czka", "J.-L. Dubois", "S. Hulin", "V. Tikhonchuk", "M. Rosi\\'nski", "A. Zara\\'s-Szyd{\\l}owska", "and J. Badziak"], "abstract": "  Measurements are reported of the target neutralization current, the target\ncharge, and the tangential component of the magnetic field generated as a\nresult of laser-target interaction by pulses with the energy in the range of 45\nmJ to 92 mJ on target and the pulse duration from 39 fs to 1000 fs. The\nexperiment was performed at the Eclipse facility in CELIA, Bordeaux. The aim of\nthe experiment was to extend investigations performed for the thick (mm scale)\ntargets to the case of thin (micrometer thickness) targets in a way that would\nallow for a straightforward comparison of the results. We found that thin foil\ntargets tend to generate 20 to 50 percent higher neutralization current and the\ntarget charge than the thick targets. The measurement of the tangential\ncomponent of the magnetic field had shown that the initial spike is dominated\nby the 1 ns pulse consistent with the 1 ns pulse of the neutralization current,\nbut there are some differences between targets of different type on sub-ns\nscale, which is an effect going beyond a simple picture of the target acting as\nan antenna. The sub-ns structure appears to be reproducible to surprising\ndegree. We found that there is in general a linear correlation between the\nmaximum value of the magnetic field and the maximum neutralization current,\nwhich supports the target-antenna picture, except for pulses hundreds of fs\nlong.\n", "doi": "10.1017/s026303461700074x", "arxiv_id": "1710.03709", "pdf_urls": ["https://arxiv.org/pdf/1710.03709"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser and Particle Beams 35, 677 (2017)", "categories": "physics.plasm-ph"}
{"title": "Statistical modeling of the gas-liquid interface using geometrical\n  variables: toward a unified description of the disperse and separated phase\n  flows", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohamed Essadki", "Florence Drui", "St\\'ephane de Chaisemartin", "Adam\n  Larat", "Thibault M\\'enard", "Marc Massot"], "abstract": "  In this work, we investigate an original strategy in order to derive a\nstatistical modeling of the interface in gas-liquid two-phase flows through\ngeometrical variables. The con- tribution is two-fold. First it participates in\nthe theoretical design of a unified reduced- order model for the description of\ntwo regimes: a disperse phase in a carrier fluid and two separated phases. The\nfirst idea is to propose a statistical description of the in- terface relying\non geometrical properties such as the mean and Gauss curvatures and define a\nSurface Density Function (SDF). The second main idea consists in using such a\nformalism in the disperse case, where a clear link is proposed between local\nstatistics of the interface and the statistics on objects, such as the number\ndensity function in Williams-Boltzmann equation for droplets. This makes\nessential the use of topolog- ical invariants in geometry through the\nGauss-Bonnet formula and allows to include the works conducted on sprays of\nspherical droplets. It yields a statistical treatment of populations of\nnon-spherical objects such as ligaments, as long as they are home- omorphic to\na sphere. Second, it provides an original angle and algorithm in order to build\nstatistics from DNS data of interfacial flows. From the theoretical approach,\nwe identify a kernel for the spatial averaging of geometrical quantities\npreserving the topological invariants. Coupled to a new algorithm for the\nevaluation of curvatures and surface that preserves these invariants, we\nanalyze two sets of DNS results conducted with the ARCHER code from CORIA with\nand without topological changes and assess the approach.\n", "doi": "10.1016/j.ijmultiphaseflow.2019.103084", "arxiv_id": "1710.04585", "pdf_urls": ["https://arxiv.org/pdf/1710.04585"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, Vol 120 (2019) 103084", "categories": "physics.flu-dyn"}
{"title": "Community Aware Random Walk for Network Embedding", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Mehdi Keikha", "Maseud Rahgozar", "Masoud Asadpour"], "abstract": "  Social network analysis provides meaningful information about behavior of\nnetwork members that can be used for diverse applications such as\nclassification, link prediction. However, network analysis is computationally\nexpensive because of feature learning for different applications. In recent\nyears, many researches have focused on feature learning methods in social\nnetworks. Network embedding represents the network in a lower dimensional\nrepresentation space with the same properties which presents a compressed\nrepresentation of the network. In this paper, we introduce a novel algorithm\nnamed \"CARE\" for network embedding that can be used for different types of\nnetworks including weighted, directed and complex. Current methods try to\npreserve local neighborhood information of nodes, whereas the proposed method\nutilizes local neighborhood and community information of network nodes to cover\nboth local and global structure of social networks. CARE builds customized\npaths, which are consisted of local and global structure of network nodes, as a\nbasis for network embedding and uses the Skip-gram model to learn\nrepresentation vector of nodes. Subsequently, stochastic gradient descent is\napplied to optimize our objective function and learn the final representation\nof nodes. Our method can be scalable when new nodes are appended to network\nwithout information loss. Parallelize generation of customized random walks is\nalso used for speeding up CARE. We evaluate the performance of CARE on multi\nlabel classification and link prediction tasks. Experimental results on various\nnetworks indicate that the proposed method outperforms others in both Micro and\nMacro-f1 measures for different size of training data.\n", "doi": "10.1016/j.knosys.2018.02.028", "arxiv_id": "1710.05199", "pdf_urls": ["https://arxiv.org/pdf/1710.05199"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems Volume 148, 15 May 2018, Pages 47-54", "categories": "cs.SI cs.AI cs.LG"}
{"title": "Cluster Generation Under Pulsed Laser Ablation Of Compound\n  Semiconductors", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alexander Bulgakov (Institut de Thermophysique", "Novossibirsk", "Russie)", "Anton Evtushenko (Institut de Thermophysique", "Novossibirsk", "Russie)", "Yuri\n  Shukhov (Institut de Thermophysique", "Novossibirsk", "Russie)", "Igor Ozerov\n  (CINaM)", "Wladimir Marine (CINaM)"], "abstract": "  A comparative experimental study of pulsed laser ablation in vacuum of two\nbinary semiconductors, zinc oxide and indium phosphide, has been performed\nusing IR-and visible laser pulses with particular attention to cluster\ngeneration. Neutral and cationic Zn\\_n O\\_m and In\\_n P\\_m particles of various\nstoichiometry have been produced and investigated by time-of-flight mass\nspectrometry. At ZnO ablation, large cationic (n>9) and all neutral clusters\nare mainly stoichiometric in the ablation plume. In contrast, indium phosphide\nclusters are strongly indium-rich with In\\_4 P being a magic cluster. Analysis\nof the plume composition upon laser exposure has revealed congruent\nvaporization of ZnO and a disproportionate loss of phosphorus by the irradiated\nInP surface. Plume expansion conditions under ZnO ablation are shown to be\nfavourable for stoichiometric cluster formation. A delayed vaporization of\nphosphorus under InP ablation has been observed that results in generation of\noff-stoichiometric clusters.\n", "doi": "10.1063/1.3507174", "arxiv_id": "1710.08215", "pdf_urls": ["https://arxiv.org/pdf/1710.08215"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Claude Phipps (Editor). International Symposium on High Power\n  Laser Ablation, 2010, Santa Fe, United States. vol. 1278, pp.78-89, 2010, AIP\n  Conference Proceedings", "categories": "cond-mat.mtrl-sci"}
{"title": "Frequency conversion efficiency of CO- and CO2- laser radiation in\n  BaGa2GeSe6 crystal", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A. A. Ionin", "I. O. Kinyaevskiy", "V. A. Mozhaeva"], "abstract": "  Non-linear optical characteristics of a new BaGa2GeSe6 crystal were\nnumerically studied and compared with well-known mid-IR nonlinear crystals\nZnGeP2, GaSe, and AgGaSe2.The calculations demonstrated for the new crystal to\nbe probably the most efficient crystal for second harmonic generation of CO and\nCO2laser radiation. It was found that a broadband two-stage frequency\nconversion of multi-line CO-laser radiation in this crystal is possible within\n2.5-9.0 {\\mu}m wavelength range with higher efficiency than in ZnGeP2 and\nAgGaSe2 crystals.\n", "doi": "10.1088/1555-6611/aa9bfc", "arxiv_id": "1710.09601", "pdf_urls": ["https://arxiv.org/pdf/1710.09601"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "A A Ionin et al 2018 Laser Phys. 28 035401", "categories": "physics.optics"}
{"title": "Symmetric groups and checker triangulated surfaces", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yury A. Neretin"], "abstract": "  We consider triangulations of surfaces with edges painted three colors so\nthat edges of each triangle have different colors. Such structures arise as\nBelyi data (or Grothendieck dessins d'enfant), on the other hand they enumerate\npairs of permutations determined up to a common conjugation. The topic of these\nnotes is links of such combinatorial structures with infinite symmetric groups\nand their representations.\n", "doi": null, "arxiv_id": "1710.11565", "pdf_urls": ["https://arxiv.org/pdf/1710.11565"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Teichmuller Theory and Grothendieck-Teichmuller Theory (eds.\n  Lizhen Ji, Athanase Papadopoulos, Weixu Su), 169-190, Higher Education Press,\n  China, 2022", "categories": "math.RT math.CT math.GR math.GT"}
{"title": "Dual-decomposition-based peer-to-peer voltage control for distribution\n  networks", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hamada Almasalma", "Jonas Engels and Geert Deconinck"], "abstract": "  The increasing penetration of distributed energy resources (DERs) creates new\nvoltage issues in distribution networks. This study proposes an algorithm that\nmitigates these issues, by actively managing the active and reactive power of\nthose DERs. The control problem is formulated as an optimisation problem. The\nstudy proposes solving the problem in a fully distributed manner and presents a\nmethodology to convert a centralised constraint optimisation problem into a\nfully distributed constraint optimisation problem based on dual decomposition,\nlinearised model of the distribution network and peer-to-peer communication\nprotocol. A real low voltage residential semi-urban feeder from the region of\nFlanders, Belgium has been used as a case study. The simulation results show\nthe ability of the proposed peer-to-peer control algorithm to control the\nvoltage effectively within limits.\n", "doi": "10.1049/oap-cired.2017.0282", "arxiv_id": "1711.04055", "pdf_urls": ["https://arxiv.org/pdf/1711.04055"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "H. Almasalma, J. Engels and G. Deconinck,\n  \"Dual-decomposition-based peer-to-peer voltage control for distribution\n  networks,\" in CIRED - Open Access Proceedings Journal, vol. 2017, no. 1, pp.\n  1718-1721, 10 2017", "categories": "math.OC"}
{"title": "A distributed system for SearchOnMath based on the Microsoft BizSpark\n  program", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ricardo M. Oliveira", "Flavio B. Gonzaga", "Valmir C. Barbosa", "Geraldo B.\n  Xex\\'eo"], "abstract": "  Mathematical information retrieval is a relatively new area, so the first\nsearch tools capable of retrieving mathematical formulas began to appear only a\nfew years ago. The proposals made public so far mostly implement searches on\ninternal university databases, small sets of scientific papers, or Wikipedia in\nEnglish. As such, only modest computing power is required. In this context,\nSearchOnMath has emerged as a pioneering tool in that it indexes several\ndifferent databases and is compatible with several mathematical representation\nlanguages. Given the significantly greater number of formulas it handles, a\ndistributed system becomes necessary to support it. The present study is based\non the Microsoft BizSpark program and has aimed, for 38 different\ndistributed-system scenarios, to pinpoint the one affording the best response\ntimes when searching the SearchOnMath databases for a collection of 120\nformulas.\n", "doi": null, "arxiv_id": "1711.04189", "pdf_urls": ["https://arxiv.org/pdf/1711.04189"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 33rd Brazilian Symposium on Databases, 289-294,\n  2018", "categories": "cs.IR cs.DC"}
{"title": "Programming Bots by Synthesizing Natural Language Expressions into API\n  Invocations", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shayan Zamanirad", "Boualem Benatallah", "Moshe Chai Barukh", "Fabio Casati", "Carlos Rodriguez"], "abstract": "  At present, bots are still in their preliminary stages of development. Many\nare relatively simple, or developed ad-hoc for a very specific use-case. For\nthis reason, they are typically programmed manually, or utilize\nmachine-learning classifiers to interpret a fixed set of user utterances. In\nreality, real world conversations with humans require support for dynamically\ncapturing users expressions. Moreover, bots will derive immeasurable value by\nprogramming them to invoke APIs for their results. Today, within the Web and\nMobile development community, complex applications are being stringed together\nwith a few lines of code -- all made possible by APIs. Yet, developers today\nare not as empowered to program bots in much the same way. To overcome this, we\nintroduce BotBase, a bot programming platform that dynamically synthesizes\nnatural language user expressions into API invocations. Our solution is two\nfaceted: Firstly, we construct an API knowledge graph to encode and evolve\nAPIs; secondly, leveraging the above we apply techniques in NLP, ML and Entity\nRecognition to perform the required synthesis from natural language user\nexpressions into API calls.\n", "doi": null, "arxiv_id": "1711.05410", "pdf_urls": ["https://arxiv.org/pdf/1711.05410"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 32nd IEEE/ACM International Conference on\n  Automated Software Engineering (ASE), 2017, 832-837", "categories": "cs.SE"}
{"title": "Addressing Expensive Multi-objective Games with Postponed Preference\n  Articulation via Memetic Co-evolution", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Adam \\.Zychowski", "Abhishek Gupta", "Jacek Ma\\'ndziuk", "Yew Soon Ong"], "abstract": "  This paper presents algorithmic and empirical contributions demonstrating\nthat the convergence characteristics of a co-evolutionary approach to tackle\nMulti-Objective Games (MOGs) with postponed preference articulation can often\nbe hampered due to the possible emergence of the so-called Red Queen effect.\nAccordingly, it is hypothesized that the convergence characteristics can be\nsignificantly improved through the incorporation of memetics (local solution\nrefinements as a form of lifelong learning), as a promising means of mitigating\n(or at least suppressing) the Red Queen phenomenon by providing a guiding hand\nto the purely genetic mechanisms of co-evolution. Our practical motivation is\nto address MOGs of a time-sensitive nature that are characterized by\ncomputationally expensive evaluations, wherein there is a natural need to\nreduce the total number of true function evaluations consumed in achieving good\nquality solutions. To this end, we propose novel enhancements to\nco-evolutionary approaches for tackling MOGs, such that memetic local\nrefinements can be efficiently applied on evolved candidate strategies by\nsearching on computationally cheap surrogate payoff landscapes (that preserve\npostponed preference conditions). The efficacy of the proposal is demonstrated\non a suite of test MOGs that have been designed.\n", "doi": "10.1016/j.knosys.2018.05.012", "arxiv_id": "1711.06763", "pdf_urls": ["https://arxiv.org/pdf/1711.06763"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 2018, vol. 154, 17-31", "categories": "cs.NE"}
{"title": "Laboratory simulation of field aligned currents in experiment on\n  laser-produced plasma interacting with magnetic dipole", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["I F Shaikhislamov", "V M Antonov", "Yu P Zakharov", "E L Boyarintsev", "A V\n  Melekhov", "V G Posukh and A G Ponomarenko"], "abstract": "  In an experiment on a magnetic dipole interacting with a laser-produced\nplasma the generation of an intense field aligned current (FAC) system was\nobserved for the first time in a laboratory. The detailed measurements of the\ntotal value and local current density, of the magnetic field at the poles and\nin the equatorial magnetopause, and particular features of electron motion in\nthe current channels revealed its similarity to the Region-1 current system in\nthe Earth magnetosphere. Such currents were found to exist only if they can\nclose via conductive cover of the dipole. Comparison of conductive and\ndielectric cases revealed specific magnetic features produced by FACand their\nconnection with electric potential generated in the equatorial part of the\nmagnetopause. To interpret the data we consider a model of electric potential\ngeneration in the boundary layer which agrees with experiment and with\nmeasurements of the Earth transpolar potential in the absence of an\ninterplanetary magnetic field as well. The results could be of importance for\nthe investigation of Mercury as a magnetic disturbance due to FAC could be\nespecially large because of the small size of the Hermean magnetosphere.\n", "doi": "10.1088/0741-3335/51/10/105005", "arxiv_id": "1711.08154", "pdf_urls": ["https://arxiv.org/pdf/1711.08154"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Shaikhislamov et al. Laboratory simulation of field aligned\n  currents in an experiment on laser-produced plasma interacting with a\n  magnetic dipole. Plasma Physics and Controlled Fusion, 51(10), 105005, 2009", "categories": "physics.plasm-ph"}
{"title": "Influence of surfactants on the electrohydrodynamic stretching of water\n  drops in oil", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["{\\AA}smund Ervik", "Torstein Eidsnes Penne", "Svein Magne Helles{\\o}", "Svend Tollak Munkejord", "Bernhard M\\\"uller"], "abstract": "  In this paper we present experimental and numerical studies of the\nelectrohydrodynamic stretching of a sub-millimetre-sized salt water drop,\nimmersed in oil with added non-ionic surfactant, and subjected to a suddenly\napplied electric field of magnitude approaching 1 kV/mm. By varying the drop\nsize, electric field strength and surfactant concentration we cover the whole\nrange of electric capillary numbers ($Ca_E$) from 0 up to the limit of drop\ndisintegration. The results are compared with the analytical result by Taylor\n(1964) which predicts the asymptotic deformation as a function of $Ca_E$. We\nfind that the addition of surfactant damps the transient oscillations and that\nthe drops may be stretched slightly beyond the stability limit found by Taylor.\nWe proceed to study the damping of the oscillations, and show that increasing\nthe surfactant concentration has a dual effect of first increasing the damping\nat low concentrations, and then increasing the asymptotic deformation at higher\nconcentrations. We explain this by comparing the Marangoni forces and the\ninterfacial tension as the drops deform. Finally, we have observed in the\nexperiments a significant hysteresis effect when drops in oil with large\nconcentration of surfactant are subjected to repeated deformations with\nincreasing electric field strengths. This effect is not attributable to the\nflow nor the interfacial surfactant transport.\n", "doi": "10.1016/j.ijmultiphaseflow.2017.08.011", "arxiv_id": "1711.08969", "pdf_urls": ["https://arxiv.org/pdf/1711.08969"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Int. J. Multiphase Flow 98 (2018) 96-109", "categories": "physics.flu-dyn"}
{"title": "Phase Transitions in Dense and Hot Matter", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Veronica Dexheimer"], "abstract": "  In this conference proceeding, I discuss in detail the deconfinement to quark\nmatter that takes place at large densities and/or temperatures. The first-order\nphase transition that is assumed to appear beyond a critical point gives rise\nto mixtures of phases when more than one globally conserved quantity (such as\ncharge fraction) is imposed. The modifications caused by these mixtures of\nphases in the QCD phase diagram can have consequences on signals of the\nexistence of quark matter expected to be created in heavy-ion collisions, as\nwell as supernova explosions and neutron-star mergers.\n", "doi": null, "arxiv_id": "1711.09030", "pdf_urls": ["https://arxiv.org/pdf/1711.09030"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "V. Dexheimer, \"Phase Transitions in Dense and Hot Matter\", in\n  proceedings of \"Critical Point and Onset of Deconfinement\" PoS(CPOD2017)033", "categories": "nucl-th astro-ph.HE"}
{"title": "Trajectory-based interpretation of laser light diffraction by a sharp\n  edge", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Milena D. Davidovi\\'c", "Milo\\v{s} D. Davidovi\\'c", "Angel S. Sanz", "Mirjana Bo\\v{z}i\\'c", "Darko Vasiljevi\\'c"], "abstract": "  In the diffraction pattern produced by a half-plane sharp edge when it\nobstructs the passage of a laser beam, two characteristic regions are\nnoticeable. There is a central region, where it can be noticed the diffraction\nof laser light in the region of geometric shadow, while intensity oscillations\nare observed in the non-obstructed area. On both sides of the edge, there are\nalso very long light traces along the normal to the edge of the obstacle. The\ntheoretical explanation to this phenomenon is based on the Fresnel-Kirchhoff\ndiffraction theory applied to the Gaussian beam propagation behind the\nobstacle. Here we have supplemented this explanation by considering\nelectromagnetic flow lines, which provide a more complete interpretation of the\nphenomenon in terms of electric and magnetic fields and flux lines, and that\ncan be related, at the same time, with average photon paths.\n", "doi": "10.1007/s10946-018-9738-9", "arxiv_id": "1711.09662", "pdf_urls": ["https://arxiv.org/pdf/1711.09662"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser Res. 39, 438 (2018)", "categories": "physics.optics quant-ph"}
{"title": "Enhancing Path-Oriented Test Data Generation Using Adaptive Random\n  Testing Techniques", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Esmaeel Nikravan", "Farid Feyzi", "Saeed Parsa"], "abstract": "  In this paper, we have developed an approach to generate test data for path\ncoverage based testing. The main challenge of this kind testing lies in its\nability to build efficiently such a test suite in order to minimize the number\nof rejects. We address this problem with a novel divide-and-conquer approach\nbased on adaptive random testing strategy. Our approach takes as input the\nconstraints of an executable path and computes a tight over-approximation of\ntheir associated sub-domain by using a dynamic domain partitioning approach. We\nimplemented this approach and got experimental results that show the practical\nbenefits compared to existing approaches. Our method generates less invalid\ninputs and is capable of obtaining the sub-domain of many complex constraints.\n", "doi": "10.1109/kbei.2015.7436097", "arxiv_id": "1711.10850", "pdf_urls": ["https://arxiv.org/pdf/1711.10850"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Nikravan, E., Feyzi, F., & Parsa, S. Enhancing path-oriented test\n  data generation using adaptive random testing techniques. In Knowledge-Based\n  Engineering and Innovation, 2015, pp. 510-513", "categories": "cs.SE"}
{"title": "An Empirical Study of Teaching Methodologies and Learning Outcomes for\n  Online and in-class Networking Course Sections", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pouyan Ahmadi", "Khondkar Islam. Salman Yousaf"], "abstract": "  To enhance student learning, we demonstrate an experimental study to analyze\nstudent learning outcomes in online and in-class sections of a core data\ncommunications course of the Undergraduate IT program in the Information\nSciences and Technology (IST) Department at George Mason University (GMU). In\nthis study, student performance is evaluated based on course assessments. This\nincludes home and lab assignments, skill-based assessment, and traditional\nmidterm exam across all 4 sections of the course. All sections have analogous\ncontent, assessment plan and teaching methodologies. Student demographics such\nas exam type and location preferences that may play an important role in their\nlearning process are considered in our study. We had to collect vast amount of\ndata from the learning management system (LMS), Blackboard (BB) Learn, in order\nto compare and study the results of several assessment outcomes for all\nstudents within their respective section and amongst students of other\nsections. We then tried to understand whether demographics have any influence\non student performance by correlating individual student survey response to\nhis/her performance in the class. The numerical results up to mid-semester\nreveal remarkable insights on student success in the online and face-to-face\n(F2F) sections.\n", "doi": null, "arxiv_id": "1711.11411", "pdf_urls": ["https://arxiv.org/pdf/1711.11411"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of 2017 ASEE Zone 2 Spring Conference", "categories": "physics.ed-ph cs.CY stat.AP"}
{"title": "A Deep Network Model for Paraphrase Detection in Short Text Messages", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Basant Agarwal", "Heri Ramampiaro", "Helge Langseth", "Massimiliano Ruocco"], "abstract": "  This paper is concerned with paraphrase detection. The ability to detect\nsimilar sentences written in natural language is crucial for several\napplications, such as text mining, text summarization, plagiarism detection,\nauthorship authentication and question answering. Given two sentences, the\nobjective is to detect whether they are semantically identical. An important\ninsight from this work is that existing paraphrase systems perform well when\napplied on clean texts, but they do not necessarily deliver good performance\nagainst noisy texts. Challenges with paraphrase detection on user generated\nshort texts, such as Twitter, include language irregularity and noise. To cope\nwith these challenges, we propose a novel deep neural network-based approach\nthat relies on coarse-grained sentence modeling using a convolutional neural\nnetwork and a long short-term memory model, combined with a specific\nfine-grained word-level similarity matching model. Our experimental results\nshow that the proposed approach outperforms existing state-of-the-art\napproaches on user-generated noisy social media data, such as Twitter texts,\nand achieves highly competitive performance on a cleaner corpus.\n", "doi": "10.1016/j.ipm.2018.06.005", "arxiv_id": "1712.02820", "pdf_urls": ["https://arxiv.org/pdf/1712.02820"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "B Agarwal, H. Ramampiaro, H Langseth, M Ruocco, (2018), \"A Deep\n  Network Model for Paraphrase Detection in Short Text Messages\". In\n  Information Processing & Management Journal (IPM), 54(6), pp. 922-937.\n  Elsevier", "categories": "cs.IR cs.AI cs.CL"}
{"title": "Time dependent Faraday rotation", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhyrair Gevorkian", "Vladimir Gasparian and Josh Lofy"], "abstract": "  Faraday rotation in a magnetoactive medium with time dependent dielectric\npermittivity tensor is analyzed through both its diagonal and non-diagonal\nelements. Continuous and pulse incident laser field cases are considered. In a\ncontinuous case linear increasing of Faraday rotation angle with time is\nobtained.In the continuous laser field case Faraday angle of rotation in both\ntime dependent diagonal and non-diagonal element cases shows an increase with\nperiodic oscillations as either positive (time-dependent dielectric\npermittivity case) or negative (time dependent gyration vector case) and\nfollows a general pattern. Ultrashort pulse can scan the time dependent\ndielectric permittivity through the Faraday rotation angle.\n", "doi": "10.1088/1555-6611/aa94de", "arxiv_id": "1712.03678", "pdf_urls": ["https://arxiv.org/pdf/1712.03678"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics, v.28, 016001 (2018)", "categories": "physics.optics cond-mat.other"}
{"title": "Ultra-Large Repair Search Space with Automatically Mined Templates: the\n  Cardumen Mode of Astor", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Matias Martinez and Martin Monperrus"], "abstract": "  Astor is a program repair library which has different modes. In this paper,\nwe present the Cardumen mode of Astor, a repair approach based mined templates\nthat has an ultra-large search space. We evaluate the capacity of Cardumen to\ndiscover test-suite adequate patches (aka plausible patches) over the 356 real\nbugs from Defects4J. Cardumen finds 8935 patches over 77 bugs of Defects4J.\nThis is the largest number of automatically synthesized patches ever reported,\nall patches being available in an open-science repository. Moreover, Cardumen\nidentifies 8 unique patches, that are patches for Defects4J bugs that were\nnever repaired in the whole history of program repair.\n", "doi": "10.1007/978-3-319-99241-9_3", "arxiv_id": "1712.03854", "pdf_urls": ["https://arxiv.org/pdf/1712.03854"], "github": ["https://github.com/kimdh1011/KK", "https://github.com/SpoonLabs/astor"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the International Symposium on Search Based\n  Software Engineering, 2018", "categories": "cs.SE"}
{"title": "Grand Challenge: Optimized Stage Processing for Anomaly Detection on\n  Numerical Data Streams", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ciprian Amariei", "Paul Diac", "Emanuel Onica"], "abstract": "  The 2017 Grand Challenge focused on the problem of automatic detection of\nanomalies for manufacturing equipment. This paper reports the technical details\nof a solution focused on particular optimizations of the processing stages.\nThese included customized input parsing, fine tuning of a k-means clustering\nalgorithm and probability analysis using a lazy flavor of a Markov chain. We\nhave observed in our custom implementation that carefully tweaking these\nprocessing stages at single node level by leveraging various data stream\ncharacteristics can yield good performance results. We start the paper with\nseveral observations concerning the input data stream, following with our\nsolution description with details on particular optimizations, and we conclude\nwith evaluation and a discussion of obtained results.\n", "doi": "10.1145/3093742.3095101", "arxiv_id": "1712.08285", "pdf_urls": ["https://arxiv.org/pdf/1712.08285"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "DEBS 2017, Proceedings of the 11th ACM International Conference on\n  Distributed and Event-based Systems, Pages 286-291", "categories": "cs.PF cs.DS cs.SE"}
{"title": "Towards Collaborative Conceptual Exploration", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tom Hanika and Jens Zumbr\\\"agel"], "abstract": "  In domains with high knowledge distribution a natural objective is to create\nprinciple foundations for collaborative interactive learning environments. We\npresent a first mathematical characterization of a collaborative learning\ngroup, a consortium, based on closure systems of attribute sets and the\nwell-known attribute exploration algorithm from formal concept analysis. To\nthis end, we introduce (weak) local experts for subdomains of a given knowledge\ndomain. These entities are able to refute and potentially accept a given\n(implicational) query for some closure system that is a restriction of the\nwhole domain. On this we build up a consortial expert and show first insights\nabout the ability of such an expert to answer queries. Furthermore, we depict\ntechniques on how to cope with falsely accepted implications and on combining\ncounterexamples. Using notions from combinatorial design theory we further\nexpand those insights as far as providing first results on the decidability\nproblem if a given consortium is able to explore some target domain.\nApplications in conceptual knowledge acquisition as well as in collaborative\ninteractive ontology learning are at hand.\n", "doi": "10.1007/978-3-319-91379-7_10", "arxiv_id": "1712.08858", "pdf_urls": ["https://arxiv.org/pdf/1712.08858"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Graph-Based Representation and Reasoning, 120-134, LNAI 10872,\n  Springer", "categories": "cs.AI cs.LO"}
{"title": "Observation and investigation of narrow optical transitions of 167Er3+\n  ions in femtosecond laser printed waveguides in 7LiYF4 crystal", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M. M. Minnegaliev", "I. V. Dyakonov", "K. I. Gerasimov", "A. A. Kalinkin", "S.\n  P. Kulik", "S. A. Moiseev", "Saygin M. Yu", "R. V. Urmancheev"], "abstract": "  We produced optical waveguides in the 167Er3+ :7LiYF4 crystal with diameters\nranging from 30 to 100 mkm by using the depressed-cladding approach with\nfemtosecond laser. These waveguides were studied (both inside and outside) by\nstationary and coherent spectroscopy on the 809 nm optical transitions between\nthe hyperfine sublevels of 4I15/2 and 4I9/2 multiplets of 167Er3+ ions. It was\nfound that the spectra of 167Er3+ were slightly broadened and shifted inside\nthe waveguides compared to the bulk crystal spectra. We managed to observe a\ntwo-pulse photon echo on this transition and determined phase relaxation times\nfor each of waveguides. The experimental results show that the created crystal\nwaveguides doped by rare-earth ions can be used in optical quantum memory and\nintegrated quantum schemes.\n", "doi": "10.1088/1612-202x/aaa6a6", "arxiv_id": "1712.09607", "pdf_urls": ["https://arxiv.org/pdf/1712.09607"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters. 15, 045207 (2018)", "categories": "quant-ph cond-mat.other"}
{"title": "Quantum-secured data transmission in urban fibre-optic communication\n  lines", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.V. Duplinskiy", "E.O. Kiktenko", "N.O. Pozhar", "M.N. Anufriev", "R.P.\n  Ermakov", "A.I. Kotov", "A.V. Brodskiy", "R.R. Yunusov", "V.L. Kurochkin", "A.K.\n  Fedorov", "and Y.V. Kurochkin"], "abstract": "  Quantum key distribution (QKD) provides theoretic information security in\ncommunications based on the laws of quantum physics. In this work, we report an\nimplementation of quantum-secured data transmission in the infrastructure of\nSberbank of Russia in standard communication lines in Moscow. The experiment is\nrealized on the basis of already deployed urban fiber-optics communication\nchannels with significant losses. We realize the decoy-state BB84 QKD protocol\nusing the one-way scheme with polarization encoding for generating keys.\nQuantum-generated keys are then used for continuous key renewal in the hardware\ndevices for establishing a quantum-secured VPN Tunnel between two offices of\nSberbank. The hybrid approach used offers possibilities for long-term\nprotection of the transmitted data; it is promising for integrating into the\nalready existing information security infrastructure.\n", "doi": "10.1007/s10946-018-9697-1", "arxiv_id": "1712.09831", "pdf_urls": ["https://arxiv.org/pdf/1712.09831"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser Res. 39, 113 (2018)", "categories": "quant-ph cs.CR"}
{"title": "Extrema of the two-dimensional Discrete Gaussian Free Field", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marek Biskup"], "abstract": "  These lecture notes offer a gentle introduction to the two-dimensional\nDiscrete Gaussian Free Field with particular attention paid to the scaling\nlimits of the level sets at heights proportional to the absolute maximum. The\nbulk of the text is based on recent joint papers with O. Louidor and with J.\nDing and S. Goswami. Still, new proofs of the tightness and distributional\nconvergence of the centered DGFF maximum are presented that by-pass the use of\nthe modified Branching Random Walk. The text contains a wealth of instructive\nexercises and a list of open questions and conjectures for future research.\n", "doi": "10.1007/978-3-030-32011-9", "arxiv_id": "1712.09972", "pdf_urls": ["https://arxiv.org/pdf/1712.09972"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In: M. Barlow and G. Slade (eds.): Random Graphs, Phase\n  Transitions, and the Gaussian Free Field. SSPROB 2017. Springer Proceedings\n  in Mathematics & Statistics, 304 (2020) 163--407. Springer, Cham", "categories": "math.PR math-ph math.MP"}
{"title": "Secret Sharing for Cloud Data Security", "year": 2017, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Varunya Attasena", "J\\'er\\^ome Darmont (ERIC)", "Nouria Harbi (ERIC)"], "abstract": "  Cloud computing helps reduce costs, increase business agility and deploy\nsolutions with a high return on investment for many types of applications.\nHowever, data security is of premium importance to many users and often\nrestrains their adoption of cloud technologies. Various approaches, i.e., data\nencryption, anonymization, replication and verification, help enforce different\nfacets of data security. Secret sharing is a particularly interesting\ncryptographic technique. Its most advanced variants indeed simultaneously\nenforce data privacy, availability and integrity, while allowing computation on\nencrypted data. The aim of this paper is thus to wholly survey secret sharing\nschemes with respect to data security, data access and costs in the\npay-as-you-go paradigm.\n", "doi": "10.1007/s00778-017-0470-9", "arxiv_id": "1712.10155", "pdf_urls": ["https://arxiv.org/pdf/1712.10155"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "The International Journal on Very Large Databases,\n  Springer-Verlag, 2017, 26 (5), pp.657-681", "categories": "cs.DB cs.CR"}
{"title": "Graphene-Based terahertz antennas for area-constrained applications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sergi Abadal", "Seyed E. Hosseininejad", "Albert Cabellos-Aparicio", "Eduard\n  Alarc\\'on"], "abstract": "  Terahertz technology has made significant advances in the fields of\nspectroscopy, imaging and, more recently, wireless communications. In the\nlatter, the use of this frequency band between 0.1 and 10 THz becomes extremely\nattractive due to the abundance of bandwidth and the potential for low area and\npower footprints, yet challenging given the large propagation losses and the\nlack of mature devices and circuits for terahertz operation. Maturity issues\naside, this combination of features renders terahertz wireless communications\ndesirable for highly integrated applications where area may be a decisive\nmetric.\n", "doi": "10.1109/tsp.2017.8076102", "arxiv_id": "1801.03695", "pdf_urls": ["https://arxiv.org/pdf/1801.03695"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "S. Abadal, S. E. Hosseininejad, A. Cabellos-Aparicio and E.\n  Alarc\\'on, \"Graphene-Based terahertz antennas for area-constrained\n  applications,\" Proceedings of the TSP '17, Barcelona, 2017, pp. 817-820", "categories": "cs.ET physics.app-ph"}
{"title": "Optimizing deep-space optical communication under power constraints", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marcin Jarzyna", "Wojciech Zwoli\\'nski", "Micha{\\l} Jachura", "Konrad\n  Banaszek"], "abstract": "  We investigate theoretically the efficiency of deep-space optical\ncommunication in the presence of background noise. With decreasing average\nsignal power spectral density, a scaling gap opens up between optimized\nsimple-decoded pulse position modulation and generalized on-off keying with\ndirect detection. The scaling of the latter follows the quantum mechanical\ncapacity of an optical channel with additive Gaussian noise. Efficient\ncommunication is found to require a highly imbalanced distribution of\ninstantaneous signal power. This condition can be alleviated through the use of\nstructured receivers which exploit optical interference over multiple time bins\nto concentrate the signal power before the detection stage.\n", "doi": "10.1117/12.2289653", "arxiv_id": "1801.03947", "pdf_urls": ["https://arxiv.org/pdf/1801.03947"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10524, Free-Space Laser Communication and Atmospheric\n  Propagation XXX, 105240A (15 February 2018)", "categories": "quant-ph"}
{"title": "Disseminacao de mensagens DTN com base em grupos de interesses", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eric V. das Neves", "Ronaldo N. Martins", "Celso B. Carvalho and Edjair\n  Mota"], "abstract": "  Recent works explore social characteristics of nodes to improve message\ndelivery rate in Delay Tolerant Networks (DTN). This work uses machine learning\ntechniques to create node groups organized by common interests. Messages are\nsent to target groups, and from there to the final destination. Simulation\nresults using The ONE simulator show that the larger the group size the higher\nthe message delivery rate, that reaches 100% in some cases. The paper also\npresents results related to the groups of interest such as message delivery\nrat, delivery delay and an average number of hops to deliver messages. The\noverall results indicate that group-based routing is a promising research\nfiled.\n", "doi": null, "arxiv_id": "1801.04837", "pdf_urls": ["https://arxiv.org/pdf/1801.04837"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Eric V. Das Neves, Ronaldo Martins, Celso B. Carvalho and Edjair\n  Mota. Disseminacao de mensagens DTN com base em grupos de interesses. IV\n  Escola Regional de Informatica - ERIN, 2017", "categories": "cs.NI"}
{"title": "Region of Interest (ROI) Coding for Aerial Surveillance Video using AVC\n  & HEVC", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Holger Meuel", "Florian Kluger", "J\\\"orn Ostermann"], "abstract": "  Aerial surveillance from Unmanned Aerial Vehicles (UAVs), i.e. with moving\ncameras, is of growing interest for police as well as disaster area monitoring.\nFor more detailed ground images the camera resolutions are steadily increasing.\nSimultaneously the amount of video data to transmit is increasing\nsignificantly, too. To reduce the amount of data, Region of Interest (ROI)\ncoding systems were introduced which mainly encode some regions in higher\nquality at the cost of the remaining image regions. We employ an existing ROI\ncoding system relying on global motion compensation to retain full image\nresolution over the entire image. Different ROI detectors are used to\nautomatically classify a video image on board of the UAV in ROI and non-ROI. We\npropose to replace the modified Advanced Video Coding (AVC) video encoder by a\nmodified High Efficiency Video Coding (HEVC) encoder. Without any change of the\ndetection system itself, but by replacing the video coding back-end we are able\nto improve the coding efficiency by 32% on average although regular HEVC\nprovides coding gains of 12-30% only for the same test sequences and similar\nPSNR compared to regular AVC coding. Since the employed ROI coding mainly\nrelies on intra mode coding of new emerging image areas, gains of HEVC-ROI\ncoding over AVC-ROI coding compared to regular coding of the entire frames\nincluding predictive modes (inter) depend on sequence characteristics. We\npresent a detailed analysis of bit distribution within the frames to explain\nthe gains. In total we can provide coding data rates of 0.7-1.0 Mbit/s for full\nHDTV video sequences at 30 fps at reasonable quality of more than 37 dB.\n", "doi": "10.1017/atsip.2015.12", "arxiv_id": "1801.06442", "pdf_urls": ["https://arxiv.org/pdf/1801.06442"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "See also our extended OpenAccess article \"Mesh-based Piecewise\n  Planar Motion Compensation and Optical Flow Clustering for ROI Coding\",\n  APSIPA Transact. on Sig.&Inform. Proc., 2015", "categories": "eess.IV"}
{"title": "KRISM --- Krylov Subspace-based Optical Computing of Hyperspectral\n  Images", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vishwanath Saragadam", "Aswin C. Sankaranarayanan"], "abstract": "  We present an adaptive imaging technique that optically computes a low-rank\napproximation of a scene's hyperspectral image, conceptualized as a matrix.\nCentral to the proposed technique is the optical implementation of two\nmeasurement operators: a spectrally-coded imager and a spatially-coded\nspectrometer. By iterating between the two operators, we show that the top\nsingular vectors and singular values of a hyperspectral image can be adaptively\nand optically computed with only a few iterations. We present an optical design\nthat uses pupil plane coding for implementing the two operations and show\nseveral compelling results using a lab prototype to demonstrate the\neffectiveness of the proposed hyperspectral imager.\n", "doi": "10.1145/3345553", "arxiv_id": "1801.09343", "pdf_urls": ["https://arxiv.org/pdf/1801.09343"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Vishwanath Saragadam and Aswin C. Sankaranarayanan, \"KRISM ---\n  Krylov Subspace-based Optical Computing of Hyperspectral Images\", ACM Trans.\n  Graphics 38, 5 (2019), 148:1-14", "categories": "eess.IV cs.AI cs.CV"}
{"title": "Bose Metal as a Disruption of the Berezinskii-Kosterlitz-Thouless\n  Transition in 2D Superconductors", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Philip W. Phillips"], "abstract": "  Destruction of superconductivity in thin films was thought to be a simple\ninstance of Berezinskii-Kosterlitz-Thouless physics in which only two phases\nexist: a superconductor with algebraic long range order in which the vortices\ncondense and an insulator where the vortex-antivortex pairs proliferate.\nHowever, since 1989 this view has been challenged as now a preponderance of\nexperiments indicate that an intervening bosonic metallic state obtains upon\nthe destruction of superconductivity. We review here a glassy model which is\ncapable of capturing both of these features. The finite resistance arises from\nthree features. First, the disordered insulator-superconductor transition in\nthe absence of fermionic degrees of freedom (Cooper pairs only), is controlled\nby a diffusive fixed point\\cite{CN} rather than the critical point of the clean\nsystem. Hence, the relevant physics that generates the Bose metal should arise\nfrom a term in the action in which different replicas are mixed. We show\nexplicitly how such physics arises in the phase glass. Second, in 2D (not in\n3D) the phase stiffness of the glass phase vanishes explicitly as has been\nshown in extensive numerical simulations\\cite{ky,kosterlitz1,kosterlitz2}.\nThird, bosons moving in such a glassy environment fail to localize as a result\nof the false minima in the landscape. We calculate the conductivity explicitly\nusing Kubo response and show that it turns on as a power law and has a\nvanishing Hall response as a result of underlying particle-hole symmetry. We\nshow that when particle-hole symmetry is broken, the Hall conductance turns on\nwith the same power law as does the longitudinal conductance.\n", "doi": "10.1142/11016", "arxiv_id": "1802.00451", "pdf_urls": ["https://arxiv.org/pdf/1802.00451"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Topological Phase transitions and New Developments, L. Brink, M.\n  Gunn, J. Jose, J. M. Kosterlitz,and K. K. Phua, Eds. World Scientiific Press,\n  Singapore, 2019", "categories": "cond-mat.str-el"}
{"title": "Compression of CEP-stable multi-mJ laser pulses down to 4 fs in long\n  hollow fibers", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Frederik Bohle", "Martin Kretschmar", "Aurelie Jullien", "Mate Kovacs", "Miguel Miranda", "Rosa Romero", "Helder Crespo", "Uwe Morgner", "Peter Simon", "Rodrigo\n  Lopez-Martens and Tamas Nagy"], "abstract": "  Carrier envelope phase stable 4 fs near-IR pulses with 3 mJ energy were\ngenerated by spectral broadening of circularly polarized 8 mJ pulses in a\ndifferentially pumped 2 m long composite stretched exible hollow ber. The\npulses were characterized using both second-harmonic generation\nfrequency-resolved optical gating (SHG-FROG) and SHG d-scan methods\n", "doi": "10.1088/1612-2011/11/9/095401", "arxiv_id": "1802.00599", "pdf_urls": ["https://arxiv.org/pdf/1802.00599"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 11 (2014) 095401 (6pp)", "categories": "physics.optics"}
{"title": "Manuscripts in Time and Space: Experiments in Scriptometrics on an Old\n  French Corpus", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jean-Baptiste Camps (CJM (EA 3624))"], "abstract": "  Witnesses of medieval literary texts, preserved in manuscript, are layered\nobjects , being almost exclusively copies of copies. This results in multiple\nand hard to distinguish linguistic strata -- the author's scripta interacting\nwith the scriptae of the various scribes -- in a context where literary written\nlanguage is already a dialectal hybrid. Moreover, no single linguistic\nphenomenon allows to distinguish between different scriptae, and only the\ncombination of multiple characteristics is likely to be significant [9] -- but\nwhich ones? The most common approach is to search for these features in a set\nof previously selected texts, that are supposed to be representative of a given\nscripta. This can induce a circularity, in which texts are used to select\nfeatures that in turn characterise them as belonging to a linguistic area. To\ncounter this issue, this paper offers an unsupervised and corpus-based\napproach, in which clustering methods are applied to an Old French corpus to\nidentify main divisions and groups. Ultimately, scriptometric profiles are\nbuilt for each of them.\n", "doi": "10.5281/zenodo.1117924", "arxiv_id": "1802.01429", "pdf_urls": ["https://arxiv.org/pdf/1802.01429"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Second Workshop on Corpus-Based Research in the\n  Humanities CRH-2, 25-26 January 2018, Vienna, Austria, pp.55-64, 2018", "categories": "cs.CL stat.AP"}
{"title": "Anomalous Spectral Characteristics of Ultrathin sub-nm Colloidal CdSe\n  Nanoplatelets", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sumanta Bose", "Savas Delikanli", "Aydan Yeltik", "Manoj Sharma", "Onur Erdem", "Cuong Dang", "Weijun Fan", "Dao Hua Zhang", "Hilmi Volkan Demir"], "abstract": "  We demonstrate high quantum yield broad photoluminescence emission of\nultrathin sub-nanometer CdSe nanoplatelets (two-monolayer). They also exhibit\npolarization-characterized lateral size dependent anomalous heavy hole and\nlight/split-off hole absorption intensities.\n", "doi": "10.1364/cleo_si.2017.sm1k.2", "arxiv_id": "1802.01470", "pdf_urls": ["https://arxiv.org/pdf/1802.01470"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "S. Bose, S. Delikanli, A. Yeltik, M. Sharma, O. Erdem, C. Dang, W.\n  Fan, D. H. Zhang, and H. V. Demir, in Conference on Lasers and\n  Electro-Optics, OSA Technical Digest (online) (Optical Society of America,\n  2017), paper SM1K.2", "categories": "physics.app-ph cond-mat.mes-hall physics.optics"}
{"title": "A distinguishable single excited-impurity in a Bose-Einstein condensate", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Javed Akram"], "abstract": "  We investigate the properties of a distinguishable single excited state\nimpurity pinned in the center of a trapped Bose-Einstein condensate (BEC) in a\none-dimensional harmonic trapping potential by changing the bare mass of the\nimpurity and its interspecies interaction strength with the BEC. We model our\nsystem by using two coupled differential equations for the condensate and the\nsingle excited-impurity wave function, which we solve numerically. For\nequilibrium, we obtain that an excited-impurity induces two bumps or dips on\nthe condensate for the attractive- or repulsive-interspecies coupling\nstrengths, respectively. Afterwards, we show that the excited-impurity induced\nimprint upon the condensate wave function remains present during a\ntime-of-flight (TOF) expansion after having switched off the harmonic\nconfinement. We also investigate shock-waves or gray-solitons by switching off\nthe interspecies coupling strength in the presence of harmonic trapping\npotential. During this process, we found out that the generation of gray\nbi-soliton or gray quad-solitons (four-solitons) depends on the bare mass of\nthe excited-impurity in a harmonic trap.\n", "doi": "10.1088/1612-202x/aa8ec4", "arxiv_id": "1802.01897", "pdf_urls": ["https://arxiv.org/pdf/1802.01897"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 15, 025501 (2018)", "categories": "quant-ph"}
{"title": "Causal Classical Physics in Time Symmetric Quantum Mechanics", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fritz W. Bopp"], "abstract": "  The letter submitted is an executive summary of our previous paper. To solve\nthe Einstein Podolsky Rosen 'paradox' the two boundary quantum mechanics is\ntaken as self consistent interpretation of quantum dynamics. The difficulty\nwith this interpretation is to reconcile it with classical physics. To avoid\nmacroscopic backward causation two 'corresponding transition rules' are\nformulated which specify needed properties of macroscopic observations and\nmanipulations. The apparent classical causal decision tree requires to\nunderstand the classically unchosen options. They are taken to occur with an\n'incomplete knowledge' of the boundary states typically in macroscopic\nconsiderations. The precise boundary conditions with given phases then select\nthe actual measured path and this selection is mistaken to happen at the time\nof measurement. The apparent time direction of the decision tree originates in\nan assumed relative proximity to the initial state. Only the far away final\nstate allows for classically distinct options to be selected from.\nCosmologically the picture could correspond to a big bang initial and a hugely\nextended final state scenario. It is speculated that it might also hold for a\nbig bang/big crunch world. If this would be the case the Born probability\npostulate could find a natural explanation if we coexist in the expanding and\nthe correlated CPT conjugate contracting world.\n", "doi": "10.3390/ecea-4-05010", "arxiv_id": "1802.02090", "pdf_urls": ["https://arxiv.org/pdf/1802.02090"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 4th International Electronic Conference on\n  Entropy and Its Applications, Basel, Switzerland, 2017. DOI:", "categories": "quant-ph hep-ph physics.hist-ph"}
{"title": "A necessary condition for quantum adiabaticity applied to the adiabatic\n  Grover search", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Oleg Lychkovskiy"], "abstract": "  Numerous sufficient conditions for adiabaticity of the evolution of a driven\nquantum system have been known for quite a long time. In contrast, necessary\nadiabatic conditions are scarce. A practicable necessary condition well-suited\nfor many-body systems has been proven recently in [Phys. Rev. Lett. 119, 200401\n(2017)]. Here we tailor this condition for estimating run times of quantum\nadiabatic algorithms. As an illustration, the condition is applied to the\nadiabatic algorithm for searching in an unstructured database (adiabatic Grover\nsearch algorithm). We find that thus obtained lower bound on the run time of\nthis algorithm reproduces $\\sqrt N$ scaling ($N$ being the number of database\nentries) of the explicitly known optimal run time. This observation highlights\nthe merits of the new adiabatic condition and its potential relevance to\nadiabatic quantum computing.\n", "doi": "10.1007/s10946-018-9751-z", "arxiv_id": "1802.06011", "pdf_urls": ["https://arxiv.org/pdf/1802.06011"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser Res. 39, 552 (2018)", "categories": "quant-ph"}
{"title": "Revisiting Transmission Scheduling in RF Energy Harvesting Wireless\n  Communications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yu Luo", "Lina Pu", "Yanxiao Zhao", "Wei Wang", "Qing Yang"], "abstract": "  The transmission scheduling is a critical problem in radio frequency (RF)\nenergy harvesting communications. Existing transmission strategies in an\nRF-based energy harvesting system is mainly based on a classic model, in which\nthe data transmission is scheduled in a fixed feasible energy tunnel. In this\npaper, we re-examine the classic energy harvesting model and show through the\ntheoretical analysis and experimental results that the bounds of feasible\nenergy tunnel are dynamic, which can be affected by the transmission scheduling\ndue to the impact of residual energy on the harvested one. To describe a\npractical energy harvesting process more accurately, a new model is proposed by\nadding a feedback loop that reflects the interplay between the energy harvest\nand the data transmission. Furthermore, to improve network performance, we\nrevisit the design of an optimal transmission scheduling strategy based on the\nnew model. To handle the challenge of the endless feedback loop in the new\nmodel, a recursive algorithm is developed. The simulation results reveal that\nthe new transmission scheduling strategy can balance the efficiency of energy\nreception and energy utilization regardless of the length of energy packets,\nachieving improved throughput performance for wireless communications.\n", "doi": "10.1109/twc.2020.2973967", "arxiv_id": "1802.09328", "pdf_urls": ["https://arxiv.org/pdf/1802.09328"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "A Nonlinear Recursive Model based Optimal Transmission Scheduling\n  in RF Energy Harvesting Wireless Communications, IEEE Transactions on\n  Wireless Communications, 2020", "categories": "eess.SP"}
{"title": "A Multi-Disciplinary Review of Knowledge Acquisition Methods: From Human\n  to Autonomous Eliciting Agents", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["George Leu and Hussein Abbass"], "abstract": "  This paper offers a multi-disciplinary review of knowledge acquisition\nmethods in human activity systems. The review captures the degree of\ninvolvement of various types of agencies in the knowledge acquisition process,\nand proposes a classification with three categories of methods: the human\nagent, the human-inspired agent, and the autonomous machine agent methods. In\nthe first two categories, the acquisition of knowledge is seen as a cognitive\ntask analysis exercise, while in the third category knowledge acquisition is\ntreated as an autonomous knowledge-discovery endeavour. The motivation for this\nclassification stems from the continuous change over time of the structure,\nmeaning and purpose of human activity systems, which are seen as the factor\nthat fuelled researchers' and practitioners' efforts in knowledge acquisition\nfor more than a century.\n  We show through this review that the KA field is increasingly active due to\nthe higher and higher pace of change in human activity, and conclude by\ndiscussing the emergence of a fourth category of knowledge acquisition methods,\nwhich are based on red-teaming and co-evolution.\n", "doi": "10.1016/j.knosys.2016.02.012", "arxiv_id": "1802.09669", "pdf_urls": ["https://arxiv.org/pdf/1802.09669"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 105, Elsevier, 2016", "categories": "cs.AI"}
{"title": "A survey on the unconditional convergence and the invertibility of\n  multipliers with implementation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Diana T. Stoeva and Peter Balazs"], "abstract": "  The paper presents a survey over frame multipliers and related concepts. In\nparticular, it includes a short motivation of why multipliers are of interest\nto consider, a review as well as extension of recent results, devoted to the\nunconditional convergence of multipliers, sufficient and/or necessary\nconditions for the invertibility of multipliers, and representation of the\ninverse via Neumann-like series and via multipliers with particular parameters.\nMultipliers for frames with specific structure, namely, Gabor and wavelet\nmultipliers, are also considered. Some of the results for the representation of\nthe inverse multiplier are implemented in Matlab codes and the algorithms are\ndescribed.\n", "doi": null, "arxiv_id": "1803.00415", "pdf_urls": ["https://arxiv.org/pdf/1803.00415"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In: Casey, S. D., Okoudjou, K., Robinson, M., Sadler, B. (eds.),\n  Sampling - Theory and Applications, Applied and Numerical Harmonic Analysis,\n  2020, 169-192", "categories": "math.FA"}
{"title": "God plays coins or superposition principle for classical probabilities\n  in quantum suprematism representation of qubit states", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir N. Chernega", "Olga V. Man'ko", "Vladimir I. Man'ko"], "abstract": "  For three given probability distributions describing positions of three\nclassical coins the quantum density matrix of spin-$1/2$ state is constructed\nand its matrix elements are associated with triada of Malevich's squares. The\nsuperposition principle of spin-$1/2$ states is presented in the form of\nnonlinear addition rule for these classical coin probabilities. We illustrate\nthe formulas by the statement\"God does not play dice - God plays coins\".\n", "doi": "10.1007/s10946-018-9699-z", "arxiv_id": "1803.00929", "pdf_urls": ["https://arxiv.org/pdf/1803.00929"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, v. 39, N 2 pp.128-139 (2018)", "categories": "quant-ph"}
{"title": "Secondary breakup of drops at moderate Weber numbers: Effect of Density\n  ratio and Reynolds number", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Suhas S Jain", "Neha Tyagi", "R. Surya Prakash", "R. V. Ravikrishna", "Gaurav\n  Tomar"], "abstract": "  Breakup of liquid drops occurs in several natural and industrial settings.\nFully resolved Volume of Fluid based simulations presented in this study reveal\nthe complete flow physics and droplet dynamics that lead to the breakup of a\ndrop in a particular mode. We have investigated the effects of density ratio\nand Reynolds number on the dynamics of drop deformation and subsequent breakup.\nA density ratio-Weber number phase plot is presented that indicates the\nvariation in the deformation of the drop at various density ratios and Weber\nnumbers. We show that the breakup dynamics of the droplets at low density\nratios is significantly different to that observed at high density ratios. We\nalso study the temporal characteristics of the droplet deformation and motion.\n", "doi": "10.1016/j.ijmultiphaseflow.2019.04.026", "arxiv_id": "1803.02989", "pdf_urls": ["https://arxiv.org/pdf/1803.02989"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 2019", "categories": "physics.flu-dyn"}
{"title": "Influence of the Event Rate on Discrimination Abilities of Bankruptcy\n  Prediction Models", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lili Zhang", "Jennifer Priestley and Xuelei Ni"], "abstract": "  In bankruptcy prediction, the proportion of events is very low, which is\noften oversampled to eliminate this bias. In this paper, we study the influence\nof the event rate on discrimination abilities of bankruptcy prediction models.\nFirst the statistical association and significance of public records and\nfirmographics indicators with the bankruptcy were explored. Then the event rate\nwas oversampled from 0.12% to 10%, 20%, 30%, 40%, and 50%, respectively. Seven\nmodels were developed, including Logistic Regression, Decision Tree, Random\nForest, Gradient Boosting, Support Vector Machine, Bayesian Network, and Neural\nNetwork. Under different event rates, models were comprehensively evaluated and\ncompared based on Kolmogorov-Smirnov Statistic, accuracy, F1 score, Type I\nerror, Type II error, and ROC curve on the hold-out dataset with their best\nprobability cut-offs. Results show that Bayesian Network is the most\ninsensitive to the event rate, while Support Vector Machine is the most\nsensitive.\n", "doi": "10.5121/ijdms.2018.10101", "arxiv_id": "1803.03756", "pdf_urls": ["https://arxiv.org/pdf/1803.03756"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Database Management Systems. 2018\n  February 10(1): 1-14", "categories": "stat.ML cs.LG"}
{"title": "Solving Markov decision processes for network-level post-hazard recovery\n  via simulation optimization and rollout", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yugandhar Sarkale", "Saeed Nozhati", "Edwin K.P. Chong", "Bruce Ellingwood", "Hussam Mahmoud"], "abstract": "  Computation of optimal recovery decisions for community resilience assurance\npost-hazard is a combinatorial decision-making problem under uncertainty. It\ninvolves solving a large-scale optimization problem, which is significantly\naggravated by the introduction of uncertainty. In this paper, we draw upon\nestablished tools from multiple research communities to provide an effective\nsolution to this challenging problem. We provide a stochastic model of damage\nto the water network (WN) within a testbed community following a severe\nearthquake and compute near-optimal recovery actions for restoration of the\nwater network. We formulate this stochastic decision-making problem as a Markov\nDecision Process (MDP), and solve it using a popular class of heuristic\nalgorithms known as rollout. A simulation-based representation of MDPs is\nutilized in conjunction with rollout and the Optimal Computing Budget\nAllocation (OCBA) algorithm to address the resulting stochastic simulation\noptimization problem. Our method employs non-myopic planning with efficient use\nof simulation budget. We show, through simulation results, that rollout fused\nwith OCBA performs competitively with respect to rollout with total equal\nallocation (TEA) at a meagre simulation budget of 5-10% of rollout with TEA,\nwhich is a crucial step towards addressing large-scale community recovery\nproblems following natural disasters.\n", "doi": "10.1109/coase.2018.8560473", "arxiv_id": "1803.04144", "pdf_urls": ["https://arxiv.org/pdf/1803.04144"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2018 IEEE 14th Int. Conf. Autom. Sci. and Eng. (CASE) 906 - 912", "categories": "math.OC cs.CE cs.SY"}
{"title": "Optimal estimators in misspecified linear regression model with an\n  application to real-world data", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Manickavasagar Kayanan and Pushpakanthie Wijekoon"], "abstract": "  In this article, we propose the Sample Information Optimal Estimator (SIOE)\nand the Stochastic Restricted Optimal Estimator (SROE) for misspecified linear\nregression model when multicollinearity exists among explanatory variables.\nFurther, we obtain the superiority conditions of proposed estimators over some\nother existing estimators in the Mean Square Error Matrix (MSEM) criterion in a\nstandard form which can apply to all estimators considered in this study.\nFinally, a real world example and a Monte Carlo simulation study are presented\nfor the proposed estimators to illustrate the theoretical results.\n", "doi": "10.1080/23737484.2018.1536863", "arxiv_id": "1803.04839", "pdf_urls": ["https://arxiv.org/pdf/1803.04839"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Kayanan M. & Wijekoon P. (2018). Optimal estimators in\n  misspecified linear regression model with an application to real-world data,\n  Communications in Statistics: Case Studies, Data Analysis and Applications,\n  4:3-4, 151-163", "categories": "math.ST stat.ME stat.TH"}
{"title": "Identifying Components from Object-Oriented APIs Based on Dynamic\n  Analysis", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anas Shatnawi", "Hudhaifa Shatnawi", "Mohamed Aymen Saied", "Zakarea Al\n  Shara", "Houari Sahraoui", "Abdelhak Seriai"], "abstract": "  The reuse at the component level is generally more effective than the one at\nthe object-oriented class level. This is due to the granularity level where\ncomponents expose their functionalities at an abstract level compared to the\nfine-grained object-oriented classes. Moreover, components clearly define their\ndependencies through their provided and required interfaces in an explicit way\nthat facilitates the understanding of how to reuse these components. Therefore,\nseveral component identification approaches have been proposed to identify\ncomponents based on the analysis object-oriented software applications.\nNevertheless, most of the existing component identification approaches did not\nconsider co-usage dependencies between API classes to identify classes/methods\nthat can be reused to implement a specific scenario. In this paper, we propose\nan approach to identify reusable software components in object-oriented APIs,\nbased on the interactions between client applications and the targeted API. As\nwe are dealing with actual clients using the API, dynamic analysis allows to\nbetter capture the instances of API usage. Approaches using static analysis are\nusually limited by the difficulty of handling dynamic features such as\npolymorphism and class loading. We evaluate our approach by applying it to\nthree Java APIs with eight client applications from the DaCapo benchmark.\nDaCapo provides a set of pre-defined usage scenarios. The results show that our\ncomponent identification approach has a very high precision.\n", "doi": "10.1145/3196321.3196349", "arxiv_id": "1803.06235", "pdf_urls": ["https://arxiv.org/pdf/1803.06235"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Anas Shatnawi, Hudhaifa Shatnawi, Mohamed Aymen Saied, Zakarea Al\n  Shara, Houari Sahraoui, and Abdelhak Seriai. 2018. Identifying Software\n  Components from Object-Oriented APIs Based on Dynamic Analysis. In ICPC18,\n  2018, Gothenburg, Sweden", "categories": "cs.SE"}
{"title": "Analysis and calibration of star sensor's image plane displacement", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yahui Sun", "Yunhai Geng", "Shuang Wang"], "abstract": "  Star sensor's image plane can have three kinds of displacement after a long\ntime working in space, and the displacements are the principal point drift,\nincline displacement and rotation displacement. These displacements can\nseverely decrease star sensor's measuring accuracy, therefore it's necessary to\nanalyze and calibrate them. The previous researches have only considered the\nprincipal point drift of image plane, which is three-degree-of-freedom. In\ncontrast, the image plane displacements under the rest three degrees of\nfreedom, that are the incline displacement and the rotation displacement, have\nbeen modeled in this paper. These two kinds of displacement's influences on\nstar sensor's accuracy have been analyzed. And the necessity to calibrate them\nhas been pointed out. At last, the Extended Kalman Filter has been used to\non-orbit calibrate the six-degree-of-freedom image plane displacement. And the\nsimulation results reveal that the on-orbit calibration algorithm can\neffectively calibrate the image plane displacement of star sensor. The\nmeasuring accuracy of star sensor has been increased to 0.23'' after the\ncalibration. Therefore the new six-degree-of-freedom image plane displacement\nmodel has made up the deficiency of the conventional displacement model and\nenhance the performance of star sensor greatly.\n", "doi": null, "arxiv_id": "1804.00363", "pdf_urls": ["https://arxiv.org/pdf/1804.00363"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Infrared and Laser Engineering, Vol.43 No.10, 2014", "categories": "astro-ph.IM"}
{"title": "A novel pulsed fiber laser: Further study on the bias-pumped\n  gain-switched fiber laser", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fuyong Wang"], "abstract": "  The bias-pumped gain-switched fiber laser proposed by us is considered a\nnovel pulsed fiber laser based on a new pulsing mechanism. With a certain\nsignal power seeding, synchronization of temporal evolution can be kept between\nthe output signal laser and the pump. The seed laser can be supplied\nconveniently by a CW pump power which is named bias pump power. A pulsed pump\nis responsible for shaping the output pulse. Stable pulsed lasers with tunable\ndurations can be achieved under bias pump combined with pulsed pump. In\naddition, the temporal shape of output pulses can be controllable based on this\nnew pulsing mechanism. Compared with conventional gain-switched fiber laser, a\nmuch simpler pulsed laser design can be provided by this novel pulsed fiber\nlaser because it is no need to add a control unit to realize fast\ngain-switching.\n", "doi": "10.1088/1612-202x/aac426", "arxiv_id": "1804.00444", "pdf_urls": ["https://arxiv.org/pdf/1804.00444"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 15 (2018) 085105", "categories": "physics.optics"}
{"title": "Dipolar and spinor bosonic systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov"], "abstract": "  The main properties and methods of describing dipolar and spinor atomic\nsystems, composed of bosonic atoms or molecules, are reviewed. The general\napproach for the correct treatment of Bose-condensed atomic systems with\nnonlocal interaction potentials is explained. The approach is applied to\nBose-condensed systems with dipolar interaction potentials. The properties of\nsystems with spinor interaction potentials are described. Trapped atoms and\natoms in optical lattices are considered. Effective spin Hamiltonians for atoms\nin optical lattices are derived. The possibility of spintronics with cold atom\nis emphasized. The present review differs from the previous review articles by\nconcentrating on a thorough presentation of basic theoretical points, helping\nthe reader to better follow mathematical details and to make clearer physical\nconclusions.\n", "doi": "10.1088/1555-6611/aa9150", "arxiv_id": "1804.04873", "pdf_urls": ["https://arxiv.org/pdf/1804.04873"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 28 (2018) 053001", "categories": "cond-mat.quant-gas cond-mat.mes-hall"}
{"title": "Triangle geometry for qutrit states in the probability representation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir N. Chernega", "Olga V. Man'ko", "Vladimir I. Man'ko"], "abstract": "  We express the matrix elements of the density matrix of the qutrit state in\nterms of probabilities associated with artificial qubit states. We show that\nthe quantum statistics of qubit states and observables is formally equivalent\nto the statistics of classical systems with three random vector variables and\nthree classical probability distributions obeying special constrains found in\nthis study. The Bloch spheres geometry of qubit states is mapped onto triangle\ngeometry of qubits. We investigate the triada of Malevich's squares describing\nthe qubit states in quantum suprematism picture and the inequalities for the\nareas of the squares for qutrit (spin-1 system). We expressed quantum channels\nfor qutrit states in terms of a linear transform of the probabilities\ndetermining the qutrit-state density matrix.\n", "doi": null, "arxiv_id": "1804.04886", "pdf_urls": ["https://arxiv.org/pdf/1804.04886"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, v. 38, N 5, pp.416-425 (2017)", "categories": "quant-ph"}
{"title": "ShapeShifter: Robust Physical Adversarial Attack on Faster R-CNN Object\n  Detector", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shang-Tse Chen", "Cory Cornelius", "Jason Martin", "Duen Horng Chau"], "abstract": "  Given the ability to directly manipulate image pixels in the digital input\nspace, an adversary can easily generate imperceptible perturbations to fool a\nDeep Neural Network (DNN) image classifier, as demonstrated in prior work. In\nthis work, we propose ShapeShifter, an attack that tackles the more challenging\nproblem of crafting physical adversarial perturbations to fool image-based\nobject detectors like Faster R-CNN. Attacking an object detector is more\ndifficult than attacking an image classifier, as it needs to mislead the\nclassification results in multiple bounding boxes with different scales.\nExtending the digital attack to the physical world adds another layer of\ndifficulty, because it requires the perturbation to be robust enough to survive\nreal-world distortions due to different viewing distances and angles, lighting\nconditions, and camera limitations. We show that the Expectation over\nTransformation technique, which was originally proposed to enhance the\nrobustness of adversarial perturbations in image classification, can be\nsuccessfully adapted to the object detection setting. ShapeShifter can generate\nadversarially perturbed stop signs that are consistently mis-detected by Faster\nR-CNN as other objects, posing a potential threat to autonomous vehicles and\nother safety-critical computer vision systems.\n", "doi": "10.1007/978-3-030-10925-7_4", "arxiv_id": "1804.05810", "pdf_urls": ["https://arxiv.org/pdf/1804.05810"], "github": ["https://github.com/shangtse/robust-physical-attack", "https://github.com/AishrithRao/robust-physical-attack", "https://github.com/eetkim/physatt"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Joint European Conference on Machine Learning and Knowledge\n  Discovery in Databases, pp. 52-68, 2018", "categories": "cs.CV cs.CR cs.LG stat.ML"}
{"title": "Scheduling Intelligent System for Time Shortening", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gabriela Prostean", "Octavian Prostean", "Iosif Szeidert", "Ioan Filip"], "abstract": "  The paper presents a scheduling intelligent system intended for the project\nmanagement and for the operation management as well, having integrated a\nplanner time buffer method combined with the PERT (Programme Evaluation and\nReview Technique) method which can drastically short the planned time. The\nsystem also adjusts if necessary the duration for the un-expecting situations\nduring the evolution of the planner recalculating the probability to reach the\ndeadline. The system is developed with a friendly graphical interface, which\nguide the user during the progress of the project providing warnings and\nsuggestions for adjusting in real time the planner. Once the scheduling\nintelligent system is launched in progress, its functions are combined at the\ndifferent levels, depending of the user needs. The base functions of the system\nare: planning, diagnosis, supervising and forecast. A real implementation is\nshowed as a study case, is related to a software development planner.\n", "doi": null, "arxiv_id": "1804.06664", "pdf_urls": ["https://arxiv.org/pdf/1804.06664"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "anagement International Conference (MIC '06), Advancing Business\n  and Management in Knowledge-based Society, November, 23-25, 2006, Portoroz,\n  Slovenia,ISBN 916-6573-43-8, ISSN 1854-4312", "categories": "cs.SE"}
{"title": "Entropy Dynamics in the System of Interacting Qubits", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["N.S. Kirsanov", "A.V. Lebedev", "M.V. Suslov", "V.M. Vinokur", "G. Blatter", "G.B. Lesovik"], "abstract": "  The classical Second Law of Thermodynamics demands that an isolated system\nevolves with a non-diminishing entropy. This holds as well in quantum mechanics\nif the evolution of the energy-isolated system can be described by a unital\nquantum channel. At the same time, the entropy of a system evolving via a\nnon-unital channel can, in principle, decrease. Here, we analyze the behavior\nof the entropy in the context of the H-theorem. As exemplary phenomena, we\ndiscuss the action of a Maxwell demon (MD) operating a qubit and the processes\nof heating and cooling in a two-qubit system. We further discuss how small\ninitial correlations between a quantum system and a reservoir affect the\nincrease in the entropy under the evolution of the quantum system.\n", "doi": "10.1007/s10946-018-9698-0", "arxiv_id": "1804.06873", "pdf_urls": ["https://arxiv.org/pdf/1804.06873"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, Volume 39, Number 2, March,\n  2018", "categories": "quant-ph"}
{"title": "Evaluation of IEEE 802.11ad for mmWave V2V Communications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Baldomero Coll-Perales", "Marco Gruteser and Javier Gozalvez"], "abstract": "  Autonomous vehicles can construct a more accurate perception of their\nsurrounding environment by exchanging rich sensor data with nearby vehicles.\nSuch exchange can require larger bandwidths than currently provided by\nITS-G5/DSRC and Cellular V2X. Millimeter wave (mmWave) communications can\nprovide higher bandwidth and could complement current V2X standards. Recent\nstudies have started investigating the potential of IEEE 802.11ad to support\nhigh bandwidth vehicular communications. This paper introduces the first\nperformance evaluation of the IEEE 802.11ad MAC (Medium Access Control) and\nbeamforming mechanism for mmWave V2V communications. The study highlights\nexisting opportunities and shortcomings that should guide the development of\nmmWave communications for V2V communications.\n", "doi": "10.1109/wcncw.2018.8369031", "arxiv_id": "1804.07233", "pdf_urls": ["https://arxiv.org/pdf/1804.07233"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 2018 IEEE Wireless Communications and\n  Networking Conference Workshops (WCNCW) - Centimetre and Millimetre Wave\n  based communications for 5G Networks (CmMmW5G), pp. 215-220, 15th April 2018,\n  Barcelona, Spain", "categories": "cs.NI"}
{"title": "Nonlinear system modeling based on constrained Volterra series estimates", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["P. \\'Sliwi\\'nski", "A. Marconato", "P. Wachel", "G. Birpoutsoukis"], "abstract": "  A simple nonlinear system modeling algorithm designed to work with limited\n\\emph{a priori }knowledge and short data records, is examined. It creates an\nempirical Volterra series-based model of a system using an $l_{q}$-constrained\nleast squares algorithm with $q\\geq 1$. If the system $m\\left( \\cdot \\right) $\nis a continuous and bounded map with a finite memory no longer than some known\n$\\tau$, then (for a $D$ parameter model and for a number of measurements $N$)\nthe difference between the resulting model of the system and the best possible\ntheoretical one is guaranteed to be of order $\\sqrt{N^{-1}\\ln D}$, even for\n$D\\geq N$. The performance of models obtained for $q=1,1.5$ and $2$ is tested\non the Wiener-Hammerstein benchmark system. The results suggest that the models\nobtained for $q>1$ are better suited to characterize the nature of the system,\nwhile the sparse solutions obtained for $q=1$ yield smaller error values in\nterms of input-output behavior.\n", "doi": "10.1049/iet-cta.2016.1360", "arxiv_id": "1804.07258", "pdf_urls": ["https://arxiv.org/pdf/1804.07258"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "\\'Sliwi\\'nski, P., Marconato, A., Wachel, P., & Birpoutsoukis, G.\n  (2017). Non-linear system modelling based on constrained Volterra series\n  estimates. IET Control Theory & Applications, 11(15), 2623-2629", "categories": "cs.SY"}
{"title": "A novel method for depicting academic disciplines through Google Scholar\n  Citations: The case of Bibliometrics", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alberto Mart\\'in-Mart\\'in", "Enrique Orduna-Malea", "Emilio Delgado\n  L\\'opez-C\\'ozar"], "abstract": "  This article describes a procedure to generate a snapshot of the structure of\na specific scientific community and their outputs based on the information\navailable in Google Scholar Citations (GSC). We call this method MADAP\n(Multifaceted Analysis of Disciplines through Academic Profiles). The\ninternational community of researchers working in Bibliometrics,\nScientometrics, Informetrics, Webometrics, and Altmetrics was selected as a\ncase study. The records of the top 1,000 most cited documents by these authors\naccording to GSC were manually processed to fill any missing information and\ndeduplicate fields like the journal titles and book publishers. The results\nsuggest that it is feasible to use GSC and the MADAP method to produce an\naccurate depiction of the community of researchers working in Bibliometrics\n(both specialists and occasional researchers) and their publication habits\n(main publication venues such as journals and book publishers). Additionally,\nthe wide document coverage of Google Scholar (specially books and book\nchapters) enables more comprehensive analyses of the documents published in a\nspecific discipline than were previously possible with other citation indexes,\nfinally shedding light on what until now had been a blind spot in most citation\nanalyses.\n", "doi": "10.1007/s11192-017-2587-4", "arxiv_id": "1804.11209", "pdf_urls": ["https://arxiv.org/pdf/1804.11209"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Mart\\'in-Mart\\'in, A., Orduna-Malea, E., & Delgado\n  L\\'opez-C\\'ozar, E. (2018). A novel method for depicting academic disciplines\n  through Google Scholar Citations: The case of Bibliometrics. Scientometrics,\n  114(3), 1251-1273", "categories": "cs.DL"}
{"title": "Practical quantum oblivious transfer with a single photon", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Guang Ping He"], "abstract": "  Quantum oblivious transfer (QOT) is an essential cryptographic primitive. But\nunconditionally secure QOT is known to be impossible. Here we propose a\npractical QOT protocol, which is perfectly secure against dishonest sender\nwithout relying on any technological assumption. Meanwhile, it is also secure\nagainst dishonest receiver in the absence of long-term quantum memory and\ncomplicated collective measurements. The protocol is extremely feasible, as it\ncan be implemented using currently available Mach-Zehnder interferometer, and\nno quantum memory, collective measurements nor entanglement are needed for\nhonest participants. More importantly, comparing with other practical QOT\nschemes, our protocol has an unbeatable efficiency since it requires the\ntransmission of a single photon only.\n", "doi": "10.1088/1555-6611/aafd28", "arxiv_id": "1805.00513", "pdf_urls": ["https://arxiv.org/pdf/1805.00513"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 29, 035201 (2019)", "categories": "quant-ph"}
{"title": "Bolzano's measurable numbers: are they real?", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Steve Russ", "Kate\\v{r}ina Trlifajov\\'a"], "abstract": "  During the early 1830's Bernard Bolzano, working in Prague, wrote a\nmanuscript giving a foundational account of numbers and their properties. In\nthe final section of his work he described what he called `infinite number\nexpressions' and `measurable numbers'. This work was evidently an attempt to\nprovide an improved proof of the sufficiency of the criterion usually known as\nthe `Cauchy criterion' for the convergence of an infinite sequence. Bolzano had\nin fact published this criterion four years earlier than Cauchy who, in his\nwork of 1821, made no attempt at a proof. Any such proof required the\nconstruction or definition of real numbers and this, in essence, was what\nBolzano achieved in his work on measurable numbers. It therefore pre-dates the\nwell-known constructions of Dedekind, Cantor and many others by several\ndecades. Bolzano's manuscript was partially published in 1962 and more fully\npublished in 1976. We give an account of measurable numbers, the properties\nBolzano proved about them, and the controversial reception they have prompted\nsince their publication.\n", "doi": null, "arxiv_id": "1805.02237", "pdf_urls": ["https://arxiv.org/pdf/1805.02237"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Research in History and Philosophy of Mathematics. Basel:\n  Birkhauser, 2016. pp. 39-56", "categories": "math.HO"}
{"title": "Game Development-Based Learning Experience: Gender Differences in Game\n  Design", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bernadette Spieler and Wolfgang Slany"], "abstract": "  Learning theories emphasize the importance of intrinsic and extrinsic\nmotivators in curricula, and games are a promising way to provide both while\nconstructing the game and presenting or sharing it in public or with a\ncommunity. New technologies and the emerging mobile gaming sector further the\ncase that learning should be promoted everywhere and anytime. What seems to be\na promising opportunity for all pupils to learn coding in an entertaining way\nraises the question of whether such game based concepts also help to fix the\ngender gap of women in IT related fields. Gender differences are already\npresent in secondary schools. These are the years where first career choices\nbut also low levels of participation in technical subjects occur. To address\nthis gender bias, a goal of the European project No One Left Behind (NOLB) was\nto integrate Pocket Code, an app developed by Catrobat, a free open source\nnon-profit project at the University of Technology in Graz/Austria, into\ndifferent school subjects, thus making coding more accessible and attractive to\nfemale pupils. During the period of this project (2015-2017), teachers were\nsupported to guide their pupils in the learning processes by constructing ideas\nand realizing them through game design. For this paper an analysis of submitted\nprograms according to their game design has been performed. In detail, the\nevaluation considered formal game elements, gaming structures, and used\ngraphics, as well as Pocket Code specific aspects. The programs analysis showed\ncommonly used design patterns by genders and suggests preferred game design\ncharacteristics of female teenagers. This analysis helps to build a more\ncreative and inclusive Game Development-Based Learning (GDBL) environment that\nprovides room for self-expression and inspires by building on intrinsic and\nextrinsic motivators by constructing personal experiences.\n", "doi": null, "arxiv_id": "1805.04457", "pdf_urls": ["https://arxiv.org/pdf/1805.04457"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "European Conference of Game-based Learning 2018", "categories": "cs.CY cs.SE"}
{"title": "Pocket Code: a mobile app for game jams to facilitate classroom learning\n  through game creation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bernadette Spieler and Anja Petri and Christian Schindler and Wolfgang\n  Slany and Maria Betran and Helen Boulton and Eugenio Gaeta and Jonathan Smith"], "abstract": "  Game jams are a way to create games under fast-paced conditions and certain\nconstraints. The increase in game jam events all over the world, their engaging\nand creative nature, with the aim of sharing results among players can be seen\nin the high participation rate of such events (2013: 16,705 participants from\n319 jam sites in 63 countries produced 3248 games) . This promising concept can\nbe easily transferred to a classroom setting.\n", "doi": null, "arxiv_id": "1805.04461", "pdf_urls": ["https://arxiv.org/pdf/1805.04461"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Conference of Game Based Learning 2016", "categories": "cs.CY cs.HC"}
{"title": "Evaluation of Game Templates to support Programming Activities in\n  Schools", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bernadette Spieler and Christian Schindler and Wolfgang Slany and\n  Olena Mashkina and Maria Eugenia Beltran and Helen Boulton and David Brown"], "abstract": "  Game creation challenges in schools potentially provide engaging,\ngoal-oriented, and interactive experiences in classes; thereby supporting the\ntransfer of knowledge for learning in a fun and pedagogic manner. A key element\nof the ongoing European project No One Left Behind (NOLB) is to integrate a\ngame-making teaching framework (GMTF) into the educational app Pocket Code.\nPocket Code allows learners to create programs in a visual Lego-style way to\nfacilitate learning how to code at secondary high schools. The concept of the\nNOLB GMTF is based on principles of the Universal Design for Learning (UDL)\nmodel. This framework provides a coherent approach to learning and teaching by\nintegrating leisure oriented gaming methods into multi-discipline curricula.\nOne output of this framework is the integration of game-based methods via game\ntemplates that refer to didactical scenarios that include a refined set of\ngenres, assets, rules, challenges, and strategies. These templates allows: 1)\nteachers to start with a well-structured program, and 2) pupils to add content\nand adjust the code to integrate their own ideas. During the project game\ngenres such as adventure, action, and quiz, as well as rewards or victory point\nmechanisms, have been embedded into different subjects, e.g., science,\nmathematics, and arts. The insights gained during the class hours were used to\ngenerate 13 game templates, which are integrated in Create@School (a new\nversion of the Pocket Code app which targets schools). To test the efficiency\nof these templates, user experience (UX) tests were conducted during classes to\ncompare games created by pupils who used templates and those who started to\ncreate a game from scratch. Preliminary results showed that these templates\nallow learners to focus on subject-relevant problem solving activities rather\nthan on understanding the functionality of the app.\n", "doi": null, "arxiv_id": "1805.04517", "pdf_urls": ["https://arxiv.org/pdf/1805.04517"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "11th European Conference on Game Based Learning isbn =\n  9781510850446 issn = 2049-0992", "categories": "cs.CY cs.HC"}
{"title": "reclaimID: Secure, Self-Sovereign Identities using Name Systems and\n  Attribute-Based Encryption", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Schanzenbach", "Georg Bramm", "Julian Sch\\\"utte"], "abstract": "  In this paper we present reclaimID: An architecture that allows users to\nreclaim their digital identities by securely sharing identity attributes\nwithout the need for a centralised service provider. We propose a design where\nuser attributes are stored in and shared over a name system under user-owned\nnamespaces. Attributes are encrypted using attribute-based encryption (ABE),\nallowing the user to selectively authorize and revoke access of requesting\nparties to subsets of his attributes. We present an implementation based on the\ndecentralised GNU Name System (GNS) in combination with ciphertext-policy ABE\nusing type-1 pairings. To show the practicality of our implementation, we\ncarried out experimental evaluations of selected implementation aspects\nincluding attribute resolution performance. Finally, we show that our design\ncan be used as a standard OpenID Connect Identity Provider allowing our\nimplementation to be integrated into standard-compliant services.\n", "doi": "10.1109/trustcom/bigdatase.2018.00134", "arxiv_id": "1805.06253", "pdf_urls": ["https://arxiv.org/pdf/1805.06253"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "TrustCom/BigDataSE 2018: 946-957", "categories": "cs.CR"}
{"title": "Practical Decentralized Attribute-Based Delegation using Secure Name\n  Systems", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Schanzenbach", "Christian Banse", "Julian Sch\\\"utte"], "abstract": "  Identity and trust in the modern Internet are centralized around an oligopoly\nof identity service providers consisting solely of major tech companies. The\nproblem with centralizing trust has become evident in recent discoveries of\nmass surveillance and censorship programs as well as information leakage\nthrough hacking incidents. One approach to decentralizing trust is distributed,\nattribute-based access control via attribute-based delegation (ABD).\nAttribute-based delegation allows a large number of cross-domain attribute\nissuers to be used in making authorization decisions. Attributes are not only\nissued to identities, but can also be delegated to other attributes issued by\ndifferent entities in the system. The resulting trust chains can then be\nresolved by any entity given an appropriate attribute storage and resolution\nsystem. While current proposals often fail at the practicability, we show how\nattribute-based delegation can be realized on top of the secure GNU Name System\n(GNS) to solve an authorization problem in a real-world scenario.\n", "doi": "10.1109/trustcom/bigdatase.2018.00046", "arxiv_id": "1805.06398", "pdf_urls": ["https://arxiv.org/pdf/1805.06398"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "TrustCom/BigDataSE 2018: 244-251", "categories": "cs.CR"}
{"title": "Extraction and Analysis of Dynamic Conversational Networks from TV\n  Series", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xavier Bost (LIA)", "Vincent Labatut (LIA)", "Serigne Gueye (LIA)", "Georges\n  Linar\\`es (LIA)"], "abstract": "  Identifying and characterizing the dynamics of modern tv series subplots is\nan open problem. One way is to study the underlying social network of\ninteractions between the characters. Standard dynamic network extraction\nmethods rely on temporal integration, either over the whole considered period,\nor as a sequence of several time-slices. However, they turn out to be\ninappropriate in the case of tv series, because the scenes shown onscreen\nalternatively focus on parallel storylines, and do not necessarily respect a\ntraditional chronology. In this article, we introduce Narrative Smoothing, a\nnovel network extraction method taking advantage of the plot properties to\nsolve some of their limitations. We apply our method to a corpus of 3 popular\nseries, and compare it to both standard approaches. Narrative smoothing leads\nto more relevant observations when it comes to the characterization of the\nprotagonists and their relationships, confirming its appropriateness to model\nthe intertwined storylines constituting the plots.\n", "doi": "10.1007/978-3-319-78196-9_3", "arxiv_id": "1805.06782", "pdf_urls": ["https://arxiv.org/pdf/1805.06782"], "github": ["https://github.com/bostxavier/Narrative-Smoothing", "https://github.com/bostxavier/TV-Series-Processing-Tool"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In: Social Network Based Big Data Analysis and Applications,\n  p.55-84, Springer, 2018", "categories": "cs.MM"}
{"title": "A self-bound matter-wave boson-fermion quantum ball", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S K Adhikari"], "abstract": "  We demonstrate the possibility of creating a self-bound stable\nthree-dimensional matter-wave spherical boson-fermion quantum ball in the\npresence of an attractive boson-fermion interaction and a small repulsive\nthree-boson interaction. The three-boson interaction could be attractive or\nrepulsive whereas the fermions are taken to be in a fully-paired super-fluid\nstate in the Bardeen- Cooper-Schreifer ( quasi-noninteracting weak-coupling)\nlimit. We also include the Lee-Huang-Yang (LHY) correction to a repulsive\nbosonic interaction term. The repulsive three-boson interaction and the LHY\ncorrection can stop a global collapse while acting jointly or separately. The\npresent study is based on a mean-field model, where the bosons are subject to a\nGross-Pitaevskii (GP) Lagrangian functional and the fully-paired fermions are\ndescribed by a Galilean-invariant density functional Lagrangian. The\nboson-fermion interaction is taken to be the mean-field Hartree interaction,\nquite similar to the interaction term in the GP equation. The study is\nillustrated by a variational and a numerical solution of the mean-field model\nfor the boson-fermion $^7$Li- $^6$Li system.\n", "doi": "10.1088/1612-202x/aacb0a", "arxiv_id": "1805.10331", "pdf_urls": ["https://arxiv.org/pdf/1805.10331"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 15 (2018) 095501", "categories": "cond-mat.quant-gas"}
{"title": "Novel and Improved Stage Estimation in Parkinson's Disease using\n  Clinical Scales and Machine Learning", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["R. Prashanth", "Sumantra Dutta Roy"], "abstract": "  The stage and severity of Parkinson's disease (PD) is an important factor to\nconsider for taking effective therapeutic decisions. Although the Movement\nDisorder Society-Unified Parkinson's Disease Rating Scale (MDS-UPDRS) provides\nan effective instrument evaluating the most pertinent features of PD, it does\nnot allow PD staging. On the other hand, the Hoehn and Yahr (HY) scale which\nprovides staging, does not evaluate many relevant features of PD. In this\npaper, we propose a novel and improved staging for PD using the MDS-UPDRS\nfeatures and the HY scale, and developing prediction models to estimate the\nstage (normal, early or moderate) and severity of PD using machine learning\ntechniques such as ordinal logistic regression (OLR), support vector machine\n(SVM), AdaBoost- and RUSBoost-based classifiers. Along with this, feature\nimportance in PD is also estimated using Random forests. We observe that the\npredictive models of SVM, Adaboost-based ensemble, Random forests and\nprobabilistic generative model performed well with the AdaBoost-based ensemble\ngiving the highest accuracy of 97.46%. Body bradykinesia, tremor, facial\nexpression (hypomimia), constancy of rest tremor and handwriting (micrographia)\nwere observed to be the most important features in PD. It is inferred that\nMDS-UPDRS combined with classifiers can form effective tools to predict PD\nstaging which can aid clinicians in the diagnostic process.\n", "doi": "10.1016/j.neucom.2018.04.049", "arxiv_id": "1805.11524", "pdf_urls": ["https://arxiv.org/pdf/1805.11524"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "R Prashanth, S. Dutta Roy, \"Novel and improved stage estimation in\n  Parkinson's disease using clinical scales and machine learning\",\n  Neurocomputing, 305, pp. 78-103, 2018", "categories": "stat.AP"}
{"title": "Parallelized aperture synthesis using multi-aperture Fourier\n  ptychographic microscopy", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pavan Chandra Konda", "Jonathan M. Taylor", "Andrew R. Harvey"], "abstract": "  We report a novel microscopy platform, termed Multi-Aperture Fourier\nptychographic microscopy (MA-FPM), capable of realizing gigapixel complex field\nimages with large data acquisition bandwidths - in gigapixels per second.\nMA-FPM is a synthetic aperture technique- an array of objectives together with\ntilt-shift illumination are used to synthesize high-resolution, wide\nfield-of-view images. Here, the phase is recovered using Fourier ptychography\n(FP) algorithms, unlike conventional optical synthetic aperture techniques\nwhere holographic measurements are used. The parallel data-acquisition\ncapability due to multiple objectives provides unprecedented bandwidth enabling\nimaging of high-speed in vitro processes over extended depth-of-field. Here, we\npresent a proof-of-concept experiment demonstrating high-quality imaging\nperformance despite using nine-fold fewer illumination angles compared to an\nequivalent FP setup. Calibration procedures and reconstruction algorithm were\ndeveloped to address the challenges of multiple imaging systems. Our technique\nprovides a new imaging tool to study cell cultures, offering new insights into\nthese processes.\n", "doi": "10.1016/j.optlaseng.2020.106410", "arxiv_id": "1806.02317", "pdf_urls": ["https://arxiv.org/pdf/1806.02317"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering Volume 138, March 2021, 106410", "categories": "physics.optics eess.IV physics.ins-det"}
{"title": "Quantum Spin Fragmentation in Kagome Ice Ho3Mg2Sb3O14", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhiling Dun", "Xiaojian Bai", "Joseph A. M. Paddison", "Nicholas P. Butch", "Clarina D. Cruz", "Matthew B. Stone", "Tao Hong", "Martin Mourigal", "Haidong Zhou"], "abstract": "  A promising route to realize entangled magnetic states combines geometrical\nfrustration with quantum-tunneling effects. Spin-ice materials are canonical\nexamples of frustration, and Ising spins in a transverse magnetic field are the\nsimplest many-body model of quantum tunneling. Here, we show that the tripod\nkagome lattice material Ho3Mg2Sb3O14 unites an ice-like magnetic degeneracy\nwith quantum-tunneling terms generated by an intrinsic splitting of the Ho3+\nground-state doublet, realizing a frustrated transverse Ising model. Using\nneutron scattering and thermodynamic experiments, we observe a\nsymmetry-breaking transition at T*~0.32 K to a remarkable quantum state with\nthree peculiarities: a continuous magnetic excitation spectrum down to T~0.12K;\na macroscopic degeneracy of ice-like states; and a fragmentation of the spin\ninto periodic and aperiodic components strongly affected by quantum\nfluctuations. Our results establish that Ho3Mg2Sb3O14 realizes a\nspin-fragmented state on the kagome lattice, with intrinsic quantum dynamics\ngenerated by a homogeneous transverse field.\n", "doi": null, "arxiv_id": "1806.04081", "pdf_urls": ["https://arxiv.org/pdf/1806.04081"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Please see [arXiv: 1912.11229] for an updated version", "categories": "cond-mat.str-el"}
{"title": "Novel Convolution Kernels for Computer Vision and Shape Analysis based\n  on Electromagnetism", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dominique Beaini", "Sofiane Achiche", "Yann-Seing Law-Kam Cio", "Maxime\n  Raison"], "abstract": "  Computer vision is a growing field with a lot of new applications in\nautomation and robotics, since it allows the analysis of images and shapes for\nthe generation of numerical or analytical information. One of the most used\nmethod of information extraction is image filtering through convolution\nkernels, with each kernel specialized for specific applications. The objective\nof this paper is to present a novel convolution kernels, based on principles of\nelectromagnetic potentials and fields, for a general use in computer vision and\nto demonstrate its usage for shape and stroke analysis. Such filtering\npossesses unique geometrical properties that can be interpreted using well\nunderstood physics theorems. Therefore, this paper focuses on the development\nof the electromagnetic kernels and on their application on images for shape and\nstroke analysis. It also presents several interesting features of\nelectromagnetic kernels, such as resolution, size and orientation independence,\nrobustness to noise and deformation, long distance stroke interaction and\nability to work with 3D images\n", "doi": null, "arxiv_id": "1806.07996", "pdf_urls": ["https://arxiv.org/pdf/1806.07996"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Beaini, D., Achiche, S., Law-Kam Cio, Y.-S. & Raison, M. (2018).\n  Novel convolution kernels for computer vision and shape analysis based on\n  electromagnetism (Report). https://publications.polymtl.ca/3162/", "categories": "cs.CV"}
{"title": "Independence of Sources in Social Networks", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Manel Chehibi", "Mouna Chebbah (LARODEC)", "Arnaud Martin (DRUID)"], "abstract": "  Online social networks are more and more studied. The links between users of\na social network are important and have to be well qualified in order to detect\ncommunities and find influencers for example. In this paper, we present an\napproach based on the theory of belief functions to estimate the degrees of\ncognitive independence between users in a social network. We experiment the\nproposed method on a large amount of data gathered from the Twitter social\nnetwork.\n", "doi": null, "arxiv_id": "1806.09959", "pdf_urls": ["https://arxiv.org/pdf/1806.09959"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Information Processing and Management of Uncertainty in\n  Knowledge-Based Systems. Theory and Foundations - 17th International\n  Conference, IPMU, Jun 2018, Cadiz, Spain", "categories": "cs.AI cs.SI"}
{"title": "A Tensor Based Data Model for Polystore: An Application to Social\n  Networks Data", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eric Leclercq", "Marinette Savonnet"], "abstract": "  In this article, we show how the mathematical object tensor can be used to\nbuild a multi-paradigm model for the storage of social data in data warehouses.\nFrom an architectural point of view, our approach allows to link different\nstorage systems (polystore) and limits the impact of ETL tools performing model\ntransformations required to feed different analysis algorithms. Therefore,\nsystems can take advantage of multiple data models both in terms of query\nexecution performance and the semantic expressiveness of data representation.\nThe proposed model allows to reach the logical independence between data and\nprograms implementing analysis algorithms. With a concrete case study on\nmessage virality on Twitter during the French presidential election of 2017, we\nhighlight some of the contributions of our model.\n", "doi": null, "arxiv_id": "1806.09967", "pdf_urls": ["https://arxiv.org/pdf/1806.09967"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "IDEAS 2018 22nd International Database Engineering \\& Applications\n  Symposium}{June 18--20, 2018}{Villa San Giovanni, Italy", "categories": "cs.DB"}
{"title": "Probability representation of quantum observable and quantum states", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir N. Chernega", "Olga V. Man'ko", "Vladimir I. Man'ko"], "abstract": "  We introduce the probability distributions describing quantum observables in\nconventional quantum mechanics and clarify their relations to the tomographic\nprobability distributions describing quantum states. We derive the evolution\nequation for quantum observables (Heisenberg equation) in the probability\nrepresentation and give examples of the spin-1/2 (qubit) states and the spin\nobservables. We present quantum channels for qubits in the probability\nrepresentation.\n", "doi": "10.1007/s10946-017-9648-2", "arxiv_id": "1806.10381", "pdf_urls": ["https://arxiv.org/pdf/1806.10381"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "published in Journal of Russian Laser Research, v.38, N 4,\n  pp.324-333 (2017)", "categories": "quant-ph"}
{"title": "Effects of an attractive three body interaction on a spin-1 Bose Hubbard\n  model", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sk Noor Nabi and Saurabh Basu"], "abstract": "  We study the effects of an attractive three body interaction potential on a\nspin-1 ultracold Bose gas using mean field approach (MFA). For an\nantiferromagnetic (AF) interaction, the third MI lobe is predominantly\naffected, where it completely engulfs the second and the fourth MI lobes at\nlarge values of the interaction strength. Albeit no significant change is\nobserved beyond the fourth MI lobe. The formation of the spin singlet (nematic)\nMI phase and the different order of phase transitions to the SF phase have been\ncarefully scrutinized with the help of spin eigenvalues and spin nematic order\nparameter. In the ferromagnetic case, the phase diagram shows similar features\nas that of a scalar Bose gas. We have compared our results on the MFA phase\ndiagrams for both types of the interaction potential via a perturbation\nexpansion in both the cases.\n", "doi": "10.1088/1555-6611/ab174b", "arxiv_id": "1806.11450", "pdf_urls": ["https://arxiv.org/pdf/1806.11450"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 29 075501 (2019)", "categories": "cond-mat.quant-gas"}
{"title": "Tomographic representation of ECG-signal", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yu.M. Belousov", "N.N. Elkin", "V.I. Man'ko", "E.G. Popov", "and S.V. Revenko"], "abstract": "  Tomographic representation of an arbitrary nature signal is considered.\nComparison of a tomographic representation and a fractional Fourier transform\nis carried out. Application of tomogram representation or identical to it the\nRadon transform for processing medical ECG signals is illustrated. The first\nresults show that in contrast to routine Fourier analysis, the Radon transform\nrevealed an additional information for patients with the early signs of\nischemic heart disease (IHD) with respect to healthy persons.\n", "doi": "10.1007/s10946-018-9722-4", "arxiv_id": "1807.01155", "pdf_urls": ["https://arxiv.org/pdf/1807.01155"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser. Res. Vol.39, issue 3 (2018)", "categories": "physics.med-ph quant-ph"}
{"title": "Qos-Based Web Service Discovery And Selection Using Machine Learning", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sarathkumar Rangarajan"], "abstract": "  In service computing, the same target functions can be achieved by multiple\nWeb services from different providers. Due to the functional similarities, the\nclient needs to consider the non-functional criteria. However, Quality of\nService provided by the developer suffers from scarcity and lack of\nreliability. In addition, the reputation of the service providers is an\nimportant factor, especially those with little experience, to select a service.\nMost of the previous studies were focused on the user's feedbacks for\njustifying the selection. Unfortunately, not all the users provide the feedback\nunless they had extremely good or bad experience with the service. In this\nvision paper, we propose a novel architecture for the web service discovery and\nselection. The core component is a machine learning based methodology to\npredict the QoS properties using source code metrics. The credibility value and\nprevious usage count are used to determine the reputation of the service.\n", "doi": "10.4108/eai.29-5-2018.154809", "arxiv_id": "1807.01439", "pdf_urls": ["https://arxiv.org/pdf/1807.01439"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Rangarajan, S. (2018) Qos-based web service discovery and\n  selection using machine learning. EAI Endorsed Transactions on Scalable\n  Information Systems 18. doi:10.4108/eai.29-5-2018.154809", "categories": "cs.CY cs.DC"}
{"title": "Logistic Regression, Neural Networks and Dempster-Shafer Theory: a New\n  Perspective", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thierry Denoeux"], "abstract": "  We revisit logistic regression and its nonlinear extensions, including\nmultilayer feedforward neural networks, by showing that these classifiers can\nbe viewed as converting input or higher-level features into Dempster-Shafer\nmass functions and aggregating them by Dempster's rule of combination. The\nprobabilistic outputs of these classifiers are the normalized plausibilities\ncorresponding to the underlying combined mass function. This mass function is\nmore informative than the output probability distribution. In particular, it\nmakes it possible to distinguish between lack of evidence (when none of the\nfeatures provides discriminant information) from conflicting evidence (when\ndifferent features support different classes). This expressivity of mass\nfunctions allows us to gain insight into the role played by each input feature\nin logistic regression, and to interpret hidden unit outputs in multilayer\nneural networks. It also makes it possible to use alternative decision rules,\nsuch as interval dominance, which select a set of classes when the available\nevidence does not unambiguously point to a single class, thus trading reduced\nerror rate for higher imprecision.\n", "doi": "10.1016/j.knosys.2019.03.030", "arxiv_id": "1807.01846", "pdf_urls": ["https://arxiv.org/pdf/1807.01846"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Vol. 176, Pages 54-67, 2019", "categories": "cs.LG stat.ML"}
{"title": "Modeling Data Lake Metadata with a Data Vault", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Iuri Nogueira (UL2)", "Maram Romdhane (UL2)", "J\\'er\\^ome Darmont (ERIC)"], "abstract": "  With the rise of big data, business intelligence had to find solutions for\nmanaging even greater data volumes and variety than in data warehouses, which\nproved ill-adapted. Data lakes answer these needs from a storage point of view,\nbut require managing adequate metadata to guarantee an efficient access to\ndata. Starting from a multidimensional metadata model designed for an\nindustrial heritage data lake presenting a lack of schema evolutivity, we\npropose in this paper to use ensemble modeling, and more precisely a data\nvault, to address this issue. To illustrate the feasibility of this approach,\nwe instantiate our metadata conceptual model into relational and\ndocument-oriented logical and physical models, respectively. We also compare\nthe physical models in terms of metadata storage and query response time.\n", "doi": null, "arxiv_id": "1807.04035", "pdf_urls": ["https://arxiv.org/pdf/1807.04035"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "22nd International Database Engineering & Applications Symposium\n  (IDEAS 2018), Jun 2018, Villa San Giovanni, Italy. ACM, pp.253-261, 2018,\n  http://confsys.encs.concordia.ca/IDEAS/ideas18/ideas18.php", "categories": "cs.DB"}
{"title": "Improved Query Reformulation for Concept Location using CodeRank and\n  Document Structures", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Masudur Rahman and Chanchal K. Roy"], "abstract": "  During software maintenance, developers usually deal with a significant\nnumber of software change requests. As a part of this, they often formulate an\ninitial query from the request texts, and then attempt to map the concepts\ndiscussed in the request to relevant source code locations in the software\nsystem (a.k.a., concept location). Unfortunately, studies suggest that they\noften perform poorly in choosing the right search terms for a change task. In\nthis paper, we propose a novel technique --ACER-- that takes an initial query,\nidentifies appropriate search terms from the source code using a novel term\nweight --CodeRank, and then suggests effective reformulation to the initial\nquery by exploiting the source document structures, query quality analysis and\nmachine learning. Experiments with 1,675 baseline queries from eight subject\nsystems report that our technique can improve 71% of the baseline queries which\nis highly promising. Comparison with five closely related existing techniques\nin query reformulation not only validates our empirical findings but also\ndemonstrates the superiority of our technique.\n", "doi": null, "arxiv_id": "1807.04488", "pdf_urls": ["https://arxiv.org/pdf/1807.04488"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. ASE 2017, pp. 428-439", "categories": "cs.SE"}
{"title": "One-Log Call Iterative Solution of the Colebrook Equation for Flow\n  Friction Based on Pade Polynomials", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pavel Praks and Dejan Brkic"], "abstract": "  The 80 year-old empirical Colebrook function, widely used as an informal\nstandard for hydraulic resistance, relates implicitly the unknown flow friction\nfactor, with the known Reynolds number and the known relative roughness of a\npipe inner surface. It is based on logarithmic law in the form that captures\nthe unknown flow friction factor in a way that it cannot be extracted\nanalytically. As an alternative to the explicit approximations or to the\niterative procedures that require at least a few evaluations of computationally\nexpensive logarithmic function or non-integer powers, this paper offers an\naccurate and computationally cheap iterative algorithm based on Pade\npolynomials with only one log-call in total for the whole procedure (expensive\nlog-calls are substituted with Pade polynomials in each iteration with the\nexception of the first). The proposed modification is computationally less\ndemanding compared with the standard approaches of engineering practice, but\ndoes not influence the accuracy or the number of iterations required to reach\nthe final balanced solution.\n", "doi": "10.3390/en11071825", "arxiv_id": "1807.04655", "pdf_urls": ["https://arxiv.org/pdf/1807.04655"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Praks, P.; Brkic, D. One-Log Call Iterative Solution of the\n  Colebrook Equation for Flow Friction Based on Pade Polynomials. Energies\n  2018, 11, 1825", "categories": "cs.CE"}
{"title": "Utilizing Smartphone-Based Machine Learning in Medical Monitor Data\n  Collection: Seven Segment Digit Recognition", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Varun N. Shenoy and Oliver O. Aalami"], "abstract": "  Biometric measurements captured from medical devices, such as blood pressure\ngauges, glucose monitors, and weighing scales, are essential to tracking a\npatient's health. Trends in these measurements can accurately track diabetes,\ncardiovascular issues, and assist medication management for patients.\nCurrently, patients record their results and data of measurement in a physical\nnotebook. It may be weeks before a doctor sees a patient's records and can\nassess the health of the patient. With a predicted 6.8 billion smartphones in\nthe world by 2022, health monitoring platforms, such as Apple's HealthKit, can\nbe leveraged to provide the right care at the right time. This research\npresents a mobile application that enables users to capture medical monitor\ndata and send it to their doctor swiftly. A key contribution of this paper is a\nrobust engine that can recognize digits from medical monitors with an accuracy\nof 98.2%.\n", "doi": null, "arxiv_id": "1807.04888", "pdf_urls": ["https://arxiv.org/pdf/1807.04888"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Shenoy VN, Aalami OO. Utilizing Smartphone-Based Machine Learning\n  in Medical Monitor Data Collection: Seven Segment Digit Recognition. AMIA\n  Annual Symposium Proceedings. 2017;2017:1564-1570", "categories": "cs.CV"}
{"title": "Analysis Acoustic Features for Acoustic Scene Classification and Score\n  fusion of multi-classification systems applied to DCASE 2016 challenge", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sangwook Park", "Seongkyu Mun", "Younglo Lee", "David K. Han", "and Hanseok Ko"], "abstract": "  This paper describes an acoustic scene classification method which achieved\nthe 4th ranking result in the IEEE AASP challenge of Detection and\nClassification of Acoustic Scenes and Events 2016. In order to accomplish the\nensuing task, several methods are explored in three aspects: feature\nextraction, feature transformation, and score fusion for final decision. In the\npart of feature extraction, several features are investigated for effective\nacoustic scene classification. For resolving the issue that the same sound can\nbe heard in different places, a feature transformation is applied for better\nseparation for classification. From these, several systems based on different\nfeature sets are devised for classification. The final result is determined by\nfusing the individual systems. The method is demonstrated and validated by the\nexperiment conducted using the Challenge database.\n", "doi": null, "arxiv_id": "1807.04970", "pdf_urls": ["https://arxiv.org/pdf/1807.04970"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Park, S., Mun, S., Lee, Y., and Ko, H. (2016). Score fusion of\n  classification systems for acoustic scene classification. IEEE AASP Challenge\n  on Detection and Classification of Acoustic Scenes and Events (DCASE)", "categories": "cs.SD eess.AS"}
{"title": "News-based trading strategies", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stefan Feuerriegel and Helmut Prendinger"], "abstract": "  The marvel of markets lies in the fact that dispersed information is\ninstantaneously processed and used to adjust the price of goods, services and\nassets. Financial markets are particularly efficient when it comes to\nprocessing information; such information is typically embedded in textual news\nthat is then interpreted by investors. Quite recently, researchers have started\nto automatically determine news sentiment in order to explain stock price\nmovements. Interestingly, this so-called news sentiment works fairly well in\nexplaining stock returns. In this paper, we design trading strategies that\nutilize textual news in order to obtain profits on the basis of novel\ninformation entering the market. We thus propose approaches for automated\ndecision-making based on supervised and reinforcement learning. Altogether, we\ndemonstrate how news-based data can be incorporated into an investment system.\n", "doi": "10.1016/j.dss.2016.06.020", "arxiv_id": "1807.06824", "pdf_urls": ["https://arxiv.org/pdf/1807.06824"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Feuerriegel, Stefan, and Helmut Prendinger. \"News-based trading\n  strategies.\" Decision Support Systems 90 (2016): 65-74", "categories": "q-fin.TR cs.LG stat.ML"}
{"title": "Evolving Large-Scale Data Stream Analytics based on Scalable PANFIS", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mahardhika Pratama", "Choiru Za'in", "Eric Pardede"], "abstract": "  Many distributed machine learning frameworks have recently been built to\nspeed up the large-scale data learning process. However, most distributed\nmachine learning used in these frameworks still uses an offline algorithm model\nwhich cannot cope with the data stream problems. In fact, large-scale data are\nmostly generated by the non-stationary data stream where its pattern evolves\nover time. To address this problem, we propose a novel Evolving Large-scale\nData Stream Analytics framework based on a Scalable Parsimonious Network based\non Fuzzy Inference System (Scalable PANFIS), where the PANFIS evolving\nalgorithm is distributed over the worker nodes in the cloud to learn\nlarge-scale data stream. Scalable PANFIS framework incorporates the active\nlearning (AL) strategy and two model fusion methods. The AL accelerates the\ndistributed learning process to generate an initial evolving large-scale data\nstream model (initial model), whereas the two model fusion methods aggregate an\ninitial model to generate the final model. The final model represents the\nupdate of current large-scale data knowledge which can be used to infer future\ndata. Extensive experiments on this framework are validated by measuring the\naccuracy and running time of four combinations of Scalable PANFIS and other\nSpark-based built in algorithms. The results indicate that Scalable PANFIS with\nAL improves the training time to be almost two times faster than Scalable\nPANFIS without AL. The results also show both rule merging and the voting\nmechanisms yield similar accuracy in general among Scalable PANFIS algorithms\nand they are generally better than Spark-based algorithms. In terms of running\ntime, the Scalable PANFIS training time outperforms all Spark-based algorithms\nwhen classifying numerous benchmark datasets.\n", "doi": null, "arxiv_id": "1807.06996", "pdf_urls": ["https://arxiv.org/pdf/1807.06996"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-based System, 2018", "categories": "cs.AI cs.DB"}
{"title": "Models of using cloud technologies at the IT professionals training", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["O. N. Markova"], "abstract": "  The article is devoted to the rationale of the use of cloud technologies in\nteaching mathematical informatics students of technical universities. Purpose\nof the article - the analysis of domestic and foreign experience in the use of\ncloud-oriented ICT in the training of future professionals in the field of\ninformation technology. Based on a review of experiences and comparisons tools\nof distance learning technologies and cloud technologies identified the\nadvantages of using cloud technologies for different categories of the learning\nprocess participants and models of cloud services, which should be used in\ntraining the regulatory academic disciplines cycles of mathematical, scientific\nand vocational & practical training of the future IT professionals.\n", "doi": null, "arxiv_id": "1807.08460", "pdf_urls": ["https://arxiv.org/pdf/1807.08460"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Scientific journal of National Drahomanov Pedagogical University.\n  Series 2, Computer-based learning systems (2016) 85-94", "categories": "cs.CY"}
{"title": "Overview of the Dark Energy Spectroscopic Instrument", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Paul Martini", "Stephen Bailey", "Robert W. Besuner", "David Brooks", "Peter\n  Doel", "Jerry Edelstein", "Daniel Eisenstein", "Brenna Flaugher", "Gaston Gutierrez", "Stewart E. Harris", "Klaus Honscheid", "Patrick Jelinsky", "Richard Joyce", "Stephen\n  Kent", "Michael Levi", "Francisco Prada", "Claire Poppett", "David Rabinowitz", "Constance Rockosi", "Laia Cardiel Sas", "David J. Schlegel", "Michael Schubnell", "Ray Sharples", "Joseph H. Silber", "David Sprayberry", "and Risa Wechsler"], "abstract": "  The Dark Energy Spectroscopic Instrument (DESI) is under construction to\nmeasure the expansion history of the Universe using the Baryon Acoustic\nOscillation technique. The spectra of 35 million galaxies and quasars over\n14000 square degrees will be measured during the life of the experiment. A new\nprime focus corrector for the KPNO Mayall telescope will deliver light to 5000\nfiber optic positioners. The fibers in turn feed ten broad-band spectrographs.\nWe present an overview of the instrumentation, the main technical requirements\nand challenges, and the current status of the project.\n", "doi": "10.1117/12.2313063", "arxiv_id": "1807.09287", "pdf_urls": ["https://arxiv.org/pdf/1807.09287"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE Vol. 10702, Ground-based and Airborne Instrumentation\n  for Astronomy VII (2018)", "categories": "astro-ph.IM"}
{"title": "Characterization of atmospheric turbulence for the Large Synoptic Survey\n  Telescope", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Claire-Alice H\\'ebert", "Bruce Macintosh", "Patricia R. Burchat"], "abstract": "  One of the scientific goals of the Large Synoptic Survey Telescope (LSST) is\nto measure the evolution of dark energy by measuring subtle distortions of\ngalaxy shapes due to weak gravitational lensing caused by the evolving dark\nmatter distribution. Understanding the point spread function (PSF) for LSST is\na crucial step to accurate measurements of weak gravitational lensing.\nAtmospheric contributions dominate the LSST PSF. Simulations of Kolmogorov\nturbulence models are commonly used to characterize and correct for these\natmospheric effects. In order to validate these simulations, we compare the\npredicted atmospheric behavior to empirical data. The simulations are carried\nout in GalSim, an open-source software package for simulating images of\nastronomical objects and PSFs. Atmospheric simulations are run by generating\nlarge phase screens at varying altitude and evolving them over long time\nscales. We compare the turbulence strength and temporal behavior of atmospheres\ngenerated from simulations to those from reconstructed telemetry data from the\nGemini Planet Imager (GPI). GPI captures a range of spatial frequencies by\nsampling the atmosphere with 18-cm subapertures. The LSST weak lensing analysis\nwill measure correlations of galaxy ellipticity, requiring very accurate\nknowledge of the magnitude and correlations of PSF shape parameters. Following\nfrom the first analysis, we use simulations and sequential short exposure\nobservations from the Differential Speckle Survey Instrument (DSSI) to study\nthe behavior of PSF parameters - e.g., ellipticity and size - as a function of\nexposure time. These studies could help inform discussions of possible variable\nexposure times for LSST visits for example, to provide more uniform depth of\nvisits.\n", "doi": "10.1117/12.2314311", "arxiv_id": "1807.09337", "pdf_urls": ["https://arxiv.org/pdf/1807.09337"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc SPIE 10700, Ground-based and Airborne Telescopes VII 2018,\n  107005E", "categories": "astro-ph.IM"}
{"title": "Auto-tuned thermal control on stratospheric balloon experiments", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. Redmond", "S. J. Benton", "A. M. Brown", "P. Clark", "C. J. Damaren", "T.\n  Eifler", "A. A. Fraisse", "M. N. Galloway", "J. W. Hartley", "M. Jauzac", "W. C. Jones", "L. Li", "T. V. T. Luu", "R. J. Massey", "J. Mccleary", "C. B. Netterfield", "I. L.\n  Padilla", "J. D. Rhodes", "L. J. Romualdez", "J. Schmoll and S. Tam"], "abstract": "  Balloon-borne telescopes present unique thermal design challenges which are a\ncombination of those present for both space and ground telescopes. At altitudes\nof 35-40 km, convection effects are minimal and difficult to characterize.\nRadiation and conduction are the predominant heat transfer mechanisms reducing\nthe thermal design options. For long duration flights payload mass is a\nfunction of power consumption making it an important optimization parameter.\nSuperBIT, or the Super-pressure Balloon-borne Imaging Telescope, aims to study\nweak lensing using a 0.5m modified Dall-Kirkham telescope capable of achieving\n0.02\" stability and capturing deep exposures from visible to near UV\nwavelengths. To achieve the theoretical stratospheric diffraction-limited\nresolution of 0.25\", mirror deformation gradients must be kept to within 20nm.\nThe thermal environment must thus be stable on time scales of an hour and the\nthermal gradients must be minimized on the telescope. SuperBIT plans to\nimplement two types of parameter solvers; one to validate the thermal design\nand the other to tightly control the thermal environment.\n", "doi": "10.1117/12.2312339", "arxiv_id": "1807.09869", "pdf_urls": ["https://arxiv.org/pdf/1807.09869"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10700, Ground-based and Airborne Telescopes VII,\n  107005R (6 July 2018)", "categories": "astro-ph.IM"}
{"title": "FPGA-Based CNN Inference Accelerator Synthesized from Multi-Threaded C\n  Software", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jin Hee Kim", "Brett Grady", "Ruolong Lian", "John Brothers", "Jason H.\n  Anderson"], "abstract": "  A deep-learning inference accelerator is synthesized from a C-language\nsoftware program parallelized with Pthreads. The software implementation uses\nthe well-known producer/consumer model with parallel threads interconnected by\nFIFO queues. The LegUp high-level synthesis (HLS) tool synthesizes threads into\nparallel FPGA hardware, translating software parallelism into spatial\nparallelism. A complete system is generated where convolution, pooling and\npadding are realized in the synthesized accelerator, with remaining tasks\nexecuting on an embedded ARM processor. The accelerator incorporates reduced\nprecision, and a novel approach for zero-weight-skipping in convolution. On a\nmid-sized Intel Arria 10 SoC FPGA, peak performance on VGG-16 is 138 effective\nGOPS.\n", "doi": "10.1109/socc.2017.8226056", "arxiv_id": "1807.10695", "pdf_urls": ["https://arxiv.org/pdf/1807.10695"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. H. Kim, B. Grady, R. Lian, J. Brothers and J. H. Anderson,\n  \"FPGA-based CNN inference accelerator synthesized from multi-threaded C\n  software,\" 2017 30th IEEE International System-on-Chip Conference (SOCC),\n  Munich, 2017, pp. 268-273", "categories": "cs.LG cs.AR cs.PF cs.PL stat.ML"}
{"title": "Correlations of multiplexed quantum ghost images and improvement of the\n  quality of restored image", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dmitriy Balakin", "Alexander Belinsky and Anatoly S. Chirkin"], "abstract": "  The currently used ghost image schemes traditionally involve two-mode\nentangled light states or incoherent radiation. Here, application of four-mode\nentangled light states is considered. It is shown that multiplexed ghost images\n(MGI) formed by four-mode entangled quantum light states have mutual spatial\ncorrelations determined by the 8th order field correlation functions. A special\nalgorithm to calculate high-order correlations of Bose operators was developed.\nWe also demonstrate that the accounting of MGI correlations allows us to\nimprove the quality of the restored image of an object when processing MGI by\nmeasurement reduction method. Computer modelling of recovery of the image from\nMGI was carried out. It is established that in the considered example the\nsignal-to-noise ratio of the reduced ghost image is $4.6$ times higher than the\nbest signal-to-noise ratio for the ghost images themselves.\n", "doi": "10.1007/s10946-017-9630-z", "arxiv_id": "1808.00091", "pdf_urls": ["https://arxiv.org/pdf/1808.00091"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Balakin, D.A., Belinsky, A.V., Chirkin, A.S. Correlations of\n  multiplexed quantum ghost images and improvement of the quality of restored\n  image // Journal of Russian Laser Research. 2017. Vol. 38, N 2. P. 164-172", "categories": "quant-ph"}
{"title": "Standards-Based Worldwide Semantic Interoperability for IoT", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Erno Kovacs", "Martin Bauer", "Jaeho Kim", "Jaeseok Yun", "Franck Le Gall", "Mengxuan Zhao"], "abstract": "  Global IoT services (GIoTS) are combining locally available IoT resources\nwith Cloud-based services. They are targeting world-wide services. GIoTS\nrequire interoperability between the locally installed heterogeneous IoT\nsystems. Semantic processing is an important technology to enable data\nmediation as well as knowledge-based processing. This paper explains a system\narchitecture for achieving world-wide semantic interoperability using\ninternational standards like oneM2M and the OMA NGSI-9/10 context interfaces\n(as used in the European Future Internet Platform FIWARE). Semantics also\nenables the use of Knowledge-based Semantic Processing Agents. Furthermore, we\nexplain how semantic verification enables the testing of such complex systems.\n", "doi": "10.1109/mcom.2016.1600460cm", "arxiv_id": "1808.00386", "pdf_urls": ["https://arxiv.org/pdf/1808.00386"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "E. Kovacs, M. Bauer, J. Kim, J. Yun, F. Le Gall and M. Zhao,\n  \"Standards-Based Worldwide Semantic Interoperability for IoT,\" in IEEE\n  Communications Magazine, vol. 54, no. 12, pp. 40-46, December 2016", "categories": "cs.DC cs.SE"}
{"title": "Composite {\\alpha}-{\\mu} Based DSRC Channel Model Using Large Data Set\n  of RSSI Measurements", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hossein Nourkhiz Mahjoub", "Amin Tahmasbi-Sarvestani", "S M Osman Gani", "and Yaser P. Fallah"], "abstract": "  Channel modeling is essential for design and performance evaluation of\nnumerous protocols in vehicular networks. In this work, we study and provide\nresults for largescale and small-scale modeling of communication channel in\ndense vehicular networks. We first propose an approach to remove the effect of\nfading on deterministic part of the large-scale model and verify its accuracy\nusing a single transmitter-receiver scenario. Two-ray model is then utilized\nfor path-loss characterization and its parameters are derived from the\nempirical data based on a newly proposed method. Afterward, we use\n{\\alpha}-{\\mu} distribution to model the fading behavior of vehicular networks\nfor the first time, and validate its precision by Kolmogorov-Smirnov (K-S)\ngoodness-of-fit test. To this end, the significantly better performance of\nutilizing {\\alpha}-{\\mu} distribution over the most adopted fading distribution\nin the vehicular channels literature, i.e. Nakagami-m, in terms of passing K-S\ntest has been investigated and statistically verified in this paper. A large\nreceived signal strength indicator (RSSI) dataset from a measurement campaign\nis used to evaluate our claims. Moreover, the whole model is implemented in a\nreliable discrete event network simulator which is widely used in the academic\nand industrial research for network analysis, i.e. network simulator-3 (ns-3),\nto show the outcome of the proposed model in the presence of upper layer\nnetwork protocols.\n", "doi": "10.1109/tits.2018.2803628", "arxiv_id": "1808.00509", "pdf_urls": ["https://arxiv.org/pdf/1808.00509"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "H. Nourkhiz Mahjoub, A. Tahmasbi-Sarvestani, S. M. O. Gani and Y.\n  P. Fallah, \"Composite {\\alpha}-{\\mu} Based DSRC Channel Model Using Large\n  Data Set of RSSI Measurements,\" in IEEE Transactions on Intelligent\n  Transportation Systems. 2018", "categories": "eess.SP"}
{"title": "DCASE 2018 Challenge Surrey Cross-Task convolutional neural network\n  baseline", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qiuqiang Kong", "Turab Iqbal", "Yong Xu", "Wenwu Wang", "Mark D. Plumbley"], "abstract": "  The Detection and Classification of Acoustic Scenes and Events (DCASE)\nconsists of five audio classification and sound event detection tasks: 1)\nAcoustic scene classification, 2) General-purpose audio tagging of Freesound,\n3) Bird audio detection, 4) Weakly-labeled semi-supervised sound event\ndetection and 5) Multi-channel audio classification. In this paper, we create a\ncross-task baseline system for all five tasks based on a convlutional neural\nnetwork (CNN): a \"CNN Baseline\" system. We implemented CNNs with 4 layers and 8\nlayers originating from AlexNet and VGG from computer vision. We investigated\nhow the performance varies from task to task with the same configuration of\nneural networks. Experiments show that deeper CNN with 8 layers performs better\nthan CNN with 4 layers on all tasks except Task 1. Using CNN with 8 layers, we\nachieve an accuracy of 0.680 on Task 1, an accuracy of 0.895 and a mean average\nprecision (MAP) of 0.928 on Task 2, an accuracy of 0.751 and an area under the\ncurve (AUC) of 0.854 on Task 3, a sound event detection F1 score of 20.8% on\nTask 4, and an F1 score of 87.75% on Task 5. We released the Python source code\nof the baseline systems under the MIT license for further research.\n", "doi": null, "arxiv_id": "1808.00773", "pdf_urls": ["https://arxiv.org/pdf/1808.00773"], "github": ["https://github.com/qiuqiangkong/dcase2018_task1", "https://github.com/qiuqiangkong/dcase2018_task4", "https://github.com/qiuqiangkong/dcase2018_task2", "https://github.com/qiuqiangkong/dcase2018_task3", "https://github.com/qiuqiangkong/dcase2018_task5"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Workshop on Detection and Classification of Acoustic Scenes and\n  Events (DCASE), 2018, pp. 217-221", "categories": "cs.SD eess.AS"}
{"title": "Time-like detonation in presence of magnetic field", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ritam Mallick and Shailendra Singh"], "abstract": "  We study the effect of magnetic field in an implosion process achieved by\nradiation. A time-varying sinusoidal magnetic field is seen to affect the\ncontinuous transition of space-like detonation to time-like detonation at the\ncore of implosion region. The oscillating varying magnetic field has a\nsignificant effect in increasing the volume of the time-like detonation of the\ncore of implosion and also modify the time of the implosion process. This\ntransition can have significant outcome both theoretically and experimentally\nin the areas of high energy hadronization of quark-gluon plasma (QGP) matter\nand Inertial Confinement Fusion efforts of fuels.\n", "doi": "10.1017/s0263034619000041", "arxiv_id": "1808.01107", "pdf_urls": ["https://arxiv.org/pdf/1808.01107"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Part. Beams 37 (2019) 30-37", "categories": "nucl-th"}
{"title": "A Multi-task Framework for Skin Lesion Detection and Segmentation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sulaiman Vesal", "Shreyas Malakarjun Patil", "Nishant Ravikumar", "Andreas\n  Maier"], "abstract": "  Early detection and segmentation of skin lesions is crucial for timely\ndiagnosis and treatment, necessary to improve the survival rate of patients.\nHowever, manual delineation is time consuming and subject to intra- and\ninter-observer variations among dermatologists. This underlines the need for an\naccurate and automatic approach to skin lesion segmentation. To tackle this\nissue, we propose a multi-task convolutional neural network (CNN) based, joint\ndetection and segmentation framework, designed to initially localize the lesion\nand subsequently, segment it. A `Faster region-based convolutional neural\nnetwork' (Faster-RCNN) which comprises a region proposal network (RPN), is used\nto generate bounding boxes/region proposals, for lesion localization in each\nimage. The proposed regions are subsequently refined using a softmax classifier\nand a bounding-box regressor. The refined bounding boxes are finally cropped\nand segmented using `SkinNet', a modified version of U-Net. We trained and\nevaluated the performance of our network, using the ISBI 2017 challenge and the\nPH2 datasets, and compared it with the state-of-the-art, using the official\ntest data released as part of the challenge for the former. Our approach\noutperformed others in terms of Dice coefficients ($>0.93$), Jaccard index\n($>0.88$), accuracy ($>0.96$) and sensitivity ($>0.95$), across five-fold cross\nvalidation experiments.\n", "doi": null, "arxiv_id": "1808.01676", "pdf_urls": ["https://arxiv.org/pdf/1808.01676"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "OR 2.0 Context-Aware Operating Theaters, Computer Assisted Robotic\n  Endoscopy, Clinical Image-Based Procedures, and Skin Image Analysis 2018", "categories": "cs.CV"}
{"title": "Student Log-Data from a Randomized Evaluation of Educational Technology:\n  A Causal Case Study", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Adam C Sales and John F Pane"], "abstract": "  Randomized evaluations of educational technology produce log data as a\nbi-product: highly granular data student and teacher usage. These datasets\ncould shed light on causal mechanisms, effect heterogeneity, or optimal use.\nHowever, there are methodological challenges: implementation is not randomized\nand is only defined for the treatment group, and log datasets have a complex\nstructure. This paper discusses three approaches to help surmount these issues.\nOne approach uses data from the treatment group to estimate the effect of usage\non outcomes in an observational study. Another, causal mediation analysis,\nestimates the role of usage in driving the overall effect. Finally, principal\nstratification estimates overall effects for groups of students with the same\n\"potential\" usage. We analyze hint data from an evaluation of the Cognitive\nTutor Algebra I curriculum using these three approaches, with possibly\nconflicting results: the observational study and mediation analysis suggest\nthat hints reduce posttest scores, while principal stratification finds that\ntreatment effects may be correlated with higher rates of hint requests. We\ndiscuss these mixed conclusions and give broader methodological\nrecommendations.\n", "doi": "10.1080/19345747.2020.1823538", "arxiv_id": "1808.02528", "pdf_urls": ["https://arxiv.org/pdf/1808.02528"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Adam C. Sales & John F. Pane (2021) Student Log-Data from a\n  Randomized Evaluation of Educational Technology: A Causal Case Study, Journal\n  of Research on Educational Effectiveness, 14:1, 241-269, DOI:\n  10.1080/19345747.2020.1823538", "categories": "stat.AP"}
{"title": "Planar waveguide nanolaser configured by dye-doped hybrid nanofilm on\n  substrate", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["E.A. Tikhonov", "V.P. Yashchuk", "G.M. Telbiz"], "abstract": "  Dye-doped hybrid silicate/titanium nanofilms on the glass substrate in the\nstructure of asymmetrical waveguides were studied as the laser system. The\nspatial and spectral features of laser oscillation of genuine and hollow\nwaveguides were determined. Their lasing thresholds of a two-order difference\nof pumping power were identified. The calculated cutoff thickness for\nwaveguides of 100 nm did not exceed their actual thickness of 300nm. The\noverall pattern of stimulated emission included two concurrent processes:\none-mode waveguide lasing and the lateral beam emission of small divergence\nemanated through the waveguide wall as leaky modes. The comparison of the open\nangle of lateral beams and grazing angles of the waveguide lasing mode provided\ninsight into the effect as the leaky mode emission converted in the\nLummer-Gehrcke interference.\n", "doi": "10.1088/1555-6611/aaa2a5", "arxiv_id": "1808.02567", "pdf_urls": ["https://arxiv.org/pdf/1808.02567"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "has been published in Laser Physics, 28(4):045801, 2018", "categories": "physics.optics"}
{"title": "Generating pure single-photon states via spontaneous four-wave mixing in\n  a system of coupled microresonators", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["I.N. Chuprina", "N.S. Perminov", "D.Yu. Tarankova", "A.A. Kalachev"], "abstract": "  We present the optimal design for an on-chip single-photon source based on\nspontaneous four-wave mixing in a system of coupled ring microresonators, which\nprovides frequency uncorrelated joint spectral amplitude of the biphoton field\nand thereby generation of pure single-photon heralded states. A simple method\nis proposed for suppressing negative dispersion effects by optimizing the\ncontrolled spectroscopic parameters of the system. It shown that the optimal\ncoupling parameters, in combination with the optimal spectral width of the pump\npulse, give rise to the highest purity of the heralded photons for a given pump\nlinewidth.\n", "doi": "10.1088/1612-202x/aad990", "arxiv_id": "1808.04435", "pdf_urls": ["https://arxiv.org/pdf/1808.04435"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett., 15, 105104 (2018)", "categories": "quant-ph"}
{"title": "Vis4DD: A visualization system that supports Data Quality Visual\n  Assessment", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jo\\~ao Marcelo Borovina Josko", "Jo\\~ao Eduardo Ferreira"], "abstract": "  Data quality assessment process is essential to ensure reliable analytical\noutcomes. This process depends on human supervision-driven approaches since it\nis impossible to determine a defect based only on data. Visualization systems\nbelong to a class of supervised tools that can make data defect pattern\nvisible. However, their considerable design knowledge encodings and imple-\nmentations provide little support design to data quality visual assessment. To\ncover this gap, this work reports the design approach of V is4DD visualization\nsystem based on patterns of data defects structures and assessment tasks. An\nexploratory case study used this web-based system to explore which and how\nvisual-interactive properties facilitate visual detection of data defect.\n", "doi": null, "arxiv_id": "1808.05215", "pdf_urls": ["https://arxiv.org/pdf/1808.05215"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "32th Brazilian Symposium on Databases - Demo and Applications\n  (2017) pp. 46-51", "categories": "cs.DB"}
{"title": "Panoramic optical and near-infrared SETI instrument: overall\n  specifications and science program", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shelley A. Wright (a", "b)", "Paul Horowitz (c)", "J\\'er\\^ome Maire (a)", "Dan\n  Werthimer (d", "e)", "Franklin Antonio (f)", "Michael Aronson (g)", "Sam\n  Chaim-Weismann (d)", "Maren Cosens (a", "b)", "Frank D. Drake (h)", "Andrew W. Howard\n  (i)", "Geoffrey W. Marcy (d)", "Rick Raffanti (j)", "Andrew P. V. Siemion (d", "h", "k", "l)", "Remington P. S. Stone (m)", "Richard R. Treffers (n)", "Avinash Uttamchandani\n  (o) ((a) Center for Astrophysics & Space Sciences", "University of California\n  San Diego", "USA", "(b) Department of Physics", "University of California San\n  Diego", "USA", "(c) Department of Physics", "Harvard University", "USA"], "abstract": "  We present overall specifications and science goals for a new optical and\nnear-infrared (350 - 1650 nm) instrument designed to greatly enlarge the\ncurrent Search for Extraterrestrial Intelligence (SETI) phase space. The Pulsed\nAll-sky Near-infrared Optical SETI (PANOSETI) observatory will be a dedicated\nSETI facility that aims to increase sky area searched, wavelengths covered,\nnumber of stellar systems observed, and duration of time monitored. This\nobservatory will offer an \"all-observable-sky\" optical and wide-field\nnear-infrared pulsed technosignature and astrophysical transient search that is\ncapable of surveying the entire northern hemisphere. The final implemented\nexperiment will search for transient pulsed signals occurring between\nnanosecond to second time scales. The optical component will cover a solid\nangle 2.5 million times larger than current SETI targeted searches, while also\nincreasing dwell time per source by a factor of 10,000. The PANOSETI instrument\nwill be the first near-infrared wide-field SETI program ever conducted. The\nrapid technological advance of fast-response optical and near-infrared detector\narrays (i.e., Multi-Pixel Photon Counting; MPPC) make this program now\nfeasible. The PANOSETI instrument design uses innovative domes that house 100\nFresnel lenses, which will search concurrently over 8,000 square degrees for\ntransient signals (see Maire et al. and Cosens et al., this conference). In\nthis paper, we describe the overall instrumental specifications and science\nobjectives for PANOSETI.\n", "doi": "10.1117/12.2314268", "arxiv_id": "1808.05772", "pdf_urls": ["https://arxiv.org/pdf/1808.05772"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10702, Ground-based and Airborne Instrumentation for\n  Astronomy VII (2018)", "categories": "astro-ph.IM"}
{"title": "Panoramic optical and near-infrared SETI instrument: optical and\n  structural design concepts", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J\\'er\\^ome Maire (a)", "Shelley A. Wright (a", "b)", "Maren Cosens (a", "b)", "Franklin Antonio (c)", "Michael Aronson (d)", "Samuel A. Chaim-Weismann (e)", "Frank D. Drake (f)", "Paul Horowitz (g)", "Andrew W. Howard (h)", "Geoffrey W.\n  Marcy (e) Rick Raffanti (i)", "Andrew P.V. Siemion (e", "f", "j", "k)", "Remington P.S.\n  Stone (l)", "Richard R. Treffers (m)", "Avinash Uttamchandani (n)", "Dan Werthimer\n  (e", "o) ((a) Center for Astrophysics & Space Sciences", "University of\n  California San Diego", "USA", "(b) Department of Physics", "University of\n  California San Diego", "USA", "(c) Qualcomm Inc.", "San Diego", "USA", "(d) Electronics\n  Packaging Man"], "abstract": "  We propose a novel instrument design to greatly expand the current optical\nand near-infrared SETI search parameter space by monitoring the entire\nobservable sky during all observable time. This instrument is aimed to search\nfor technosignatures by means of detecting nano- to micro-second light pulses\nthat could have been emitted, for instance, for the purpose of interstellar\ncommunications or energy transfer. We present an instrument conceptual design\nbased upon an assembly of 198 refracting 0.5-m telescopes tessellating two\ngeodesic domes. This design produces a regular layout of hexagonal collecting\napertures that optimizes the instrument footprint, aperture diameter,\ninstrument sensitivity and total field-of-view coverage. We also present the\noptical performance of some Fresnel lenses envisaged to develop a dedicated\npanoramic SETI (PANOSETI) observatory that will dramatically increase sky-area\nsearched (pi steradians per dome), wavelength range covered, number of stellar\nsystems observed, interstellar space examined and duration of time monitored\nwith respect to previous optical and near-infrared technosignature finders.\n", "doi": "10.1117/12.2314444", "arxiv_id": "1808.05773", "pdf_urls": ["https://arxiv.org/pdf/1808.05773"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10702, Ground-based and Airborne Instrumentation for\n  Astronomy VII (2018)", "categories": "astro-ph.IM"}
{"title": "Panoramic optical and near-infrared SETI instrument: prototype design\n  and testing", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Maren Cosens (a", "b)", "J\\'er\\^ome Maire (a)", "Shelley A. Wright (a", "b)", "Franklin Antonio (c)", "Michael Aronson (d)", "Samuel A. Chaim-Weismann (e)", "Frank D. Drake (f)", "Paul Horowitz (g)", "Andrew W. Howard (h)", "Rick Raffanti\n  (i)", "Andrew P.V. Siemion (e", "f", "j", "k)", "Remington P.S. Stone (l)", "Richard R.\n  Treffers (m)", "Avinash Uttamchandani (n)", "Dan Werthimer (e", "o) ((a) Center for\n  Astrophysics & Space Sciences", "University of California San Diego", "USA", "(b)\n  Department of Physics", "University of California San Diego", "USA", "(c) Qualcomm\n  Inc.", "San Diego", "USA", "(d) Electronics Packaging Man"], "abstract": "  The Pulsed All-sky Near-infrared Optical Search for ExtraTerrestrial\nIntelligence (PANOSETI) is an instrument program that aims to search for fast\ntransient signals (nano-second to seconds) of artificial or astrophysical\norigin. The PANOSETI instrument objective is to sample the entire observable\nsky during all observable time at optical and near-infrared wavelengths over\n300 - 1650 nm$^1$. The PANOSETI instrument is designed with a number of modular\ntelescope units using Fresnel lenses ($\\sim$0.5m) arranged on two geodesic\ndomes in order to maximize sky coverage$^2$. We present the prototype design\nand tests of these modular Fresnel telescope units. This consists of the design\nof mechanical components such as the lens mounting and module frame. One of the\nmost important goals of the modules is to maintain the characteristics of the\nFresnel lens under a variety of operating conditions. We discuss how we account\nfor a range of operating temperatures, humidity, and module orientations in our\ndesign in order to minimize undesirable changes to our focal length or angular\nresolution.\n", "doi": "10.1117/12.2314252", "arxiv_id": "1808.05774", "pdf_urls": ["https://arxiv.org/pdf/1808.05774"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10702, Ground-based and Airborne Instrumentation for\n  Astronomy VII (2018)", "categories": "astro-ph.IM"}
{"title": "Excimer laser cleaning of black sulphur encrustation from silver surface", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Shahid Raza", "Sankha Shuvra Das", "Parimal Tudu", "Partha Saha"], "abstract": "  The process of localized cleaning of silver sulphide from the silver surface\nhas been investigated in this work. An artificial black encrustation was\ngenerated on the silver surface and its laser cleaning was performed using an\nexcimer laser (KrF based) working at a wavelength of 248 nm and pulse width 25\nns. Laser process parameters i.e. laser fluence and number of pulses were used\nto perform the experiment and after different optical, microstructural,\nelemental, microhardness and surface topography analysis of the laser ablated\nzone was performed. The parametric window selected for the excimer laser\ncleaning were laser fluence (200-400 mJ/cm2), repetition rate 4 Hz and number\nof pulses (60-300). It was observed that excimer laser is very effective in the\ncleaning of black encrustation having 6 wt. % of sulphur from the surface\nwithout any significant removal of the silver substrate. The fluence value of\n260.48 mJ/cm2 was observed as above threshold value for removal of sulphide\nfrom the encrusted surface while a fluence of 384.85 mJ/cm2 and 220 pulses\nshowed the maximum removal of sulphur encrustation (0.38 wt. % of sulphur\nremaining). Formation of the peripheral rim was observed to occur above 280.17\nmJ/cm2 of fluence value. The topography of the ablated surface showed a removal\nof 5-10 um of the sulphide layer from the surface whereas the thickness of the\nsulphide coating was around 8-10 um. Microhardness value showed a change of\nmicrohardness of the silver surface from 75.12 HV0.5 (uncoated parent silver)\nto 96.07 HV0.5 (centre of the ablated zone).Finally, it was concluded that\nexcimer laser cleaning is a novel method for localized removal of silver\nsulphide encrustation from silver surface.\n", "doi": "10.1016/j.optlastec.2018.12.012", "arxiv_id": "1808.06591", "pdf_urls": ["https://arxiv.org/pdf/1808.06591"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Opt. Laser Technol. 113 (2019) 95-103", "categories": "physics.chem-ph physics.app-ph"}
{"title": "The Slow Invariant Manifold of the Lorenz--Krishnamurthy Model", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jean-Marc Ginoux (PROTEE)"], "abstract": "  During this last decades, several attempts to construct slow invariant\nmanifold of the Lorenz-Krishnamurthy five-mode model of slow-fast interactions\nin the atmosphere have been made by various authors. Unfortunately, as in the\ncase of many two-time scales singularly perturbed dynamical systems the various\nasymptotic procedures involved for such a construction diverge. So, it seems\nthat till now only the first-order and third-order approximations of this slow\nmanifold have been analytically obtained. While using the Flow Curvature Method\nwe show in this work that one can provide the eighteenth-order approximation of\nthe slow manifold of the generalized Lorenz-Krishnamurthy model and the\nthirteenth-order approximation of the \"conservative\" Lorenz-Krishnamurthy\nmodel. The invariance of each slow manifold is then established according to\nDarboux invariance theorem.\n", "doi": "10.1007/s12346-013-0104-6", "arxiv_id": "1808.08058", "pdf_urls": ["https://arxiv.org/pdf/1808.08058"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Qualitative Theory of Dynamical Systems, SP Birkh{\\\"a}user Verlag\n  Basel, 2014, 13 (1), pp.19 - 37", "categories": "math.DS math.DG"}
{"title": "Design and Characterization of a Balloon-Borne Diffraction-Limited\n  Submillimeter Telescope Platform for BLAST-TNG", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nathan P. Lourie", "Francisco E. Angile", "Peter C. Ashton", "Brian\n  Catanzaro", "Mark J. Devlin", "Simon Dicker", "Joy Didier", "Bradley Dober", "Laura M.\n  Fissel", "Nicholas Galitzki", "Samuel Gordon", "Jeffrey Klein", "Ian Lowe", "Philip\n  Mauskopf", "Federico Nati", "Giles Novak", "L. Javier Romualdez", "Juan D. Soler", "Paul A. Williams"], "abstract": "  The Next Generation Balloon-borne Large Aperture Submillimeter Telescope\n(BLAST-TNG) is a submillimeter mapping experiment planned for a 28 day\nlong-duration balloon (LDB) flight from McMurdo Station, Antarctica during the\n2018-2019 season. BLAST-TNG will detect submillimeter polarized interstellar\ndust emission, tracing magnetic fields in galactic molecular clouds. BLAST-TNG\nwill be the first polarimeter with the sensitivity and resolution to probe the\n$\\sim$0.1 parsec-scale features that are critical to understanding the origin\nof structures in the interstellar medium. With three detector arrays operating\nat 250, 350, and 500 $\\mu$m (1200, 857, and 600 GHz), BLAST-TNG will obtain\ndiffraction-limited resolution at each waveband of 30, 41, and 59 arcseconds\nrespectively.\n  To achieve the submillimeter resolution necessary for its science goals, the\nBLAST-TNG telescope features a 2.5 m aperture carbon fiber composite primary\nmirror, one of the largest mirrors flown on a balloon platform. Successful\nperformance of such a large telescope on a balloon-borne platform requires\nstiff, lightweight optical components and mounting structures. Through a\ncombination of optical metrology and finite element modeling of thermal and\nmechanical stresses on both the telescope optics and mounting structures, we\nexpect diffraction-limited resolution at all our wavebands. We expect pointing\nerrors due to deformation of the telescope mount to be negligible. We have\ndeveloped a detailed thermal model of the sun shielding, gondola, and optical\ncomponents to optimize our observing strategy and increase the stability of the\ntelescope over the flight. We present preflight characterization of the\ntelescope and its platform.\n", "doi": "10.1117/12.2314380", "arxiv_id": "1808.08597", "pdf_urls": ["https://arxiv.org/pdf/1808.08597"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SPIE Proceedings Volume 10700, Ground-based and Airborne\n  Telescopes VII; 1070022 (2018)", "categories": "astro-ph.IM"}
{"title": "Canards Existence in Memristor's Circuits", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jean-Marc Ginoux (PROTEE)", "Jaume Llibre"], "abstract": "  The aim of this work is to propose an alternative method for determining the\ncondition of existence of \"canard solutions\" for three and four-dimensional\nsingularly perturbed systems with only one fast variable in the folded saddle\ncase. This method enables to state a unique generic condition for the existence\nof \"canard solutions\" for such three and four-dimensional singularly perturbed\nsystems which is based on the stability of folded singularities of the\nnormalized slow dynamics deduced from a well-known property of linear algebra.\nThis unique generic condition is perfectly identical to that provided in\nprevious works. Application of this method to the famous three and\nfour-dimensional memristor canonical Chua's circuits for which the classical\npiecewise-linear characteristic curve has been replaced by a smooth cubic\nnonlinear function according to the least squares method enables to show the\nexistence of \"canard solutions\" in such Memristor Based Chaotic Circuits.\n", "doi": "10.1007/s12346-015-0160-1", "arxiv_id": "1808.09022", "pdf_urls": ["https://arxiv.org/pdf/1808.09022"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Qualitative Theory of Dynamical Systems, SP Birkh{\\\"a}user Verlag\n  Basel, 2016, 15 (2), pp.383 - 431", "categories": "math.DS"}
{"title": "Monitoring of laser metal deposition height by means of coaxial laser\n  triangulation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Simone Donadello", "Maurizio Motta", "Ali G\\\"okhan Demir", "Barbara\n  Previtali"], "abstract": "  Laser metal deposition (LMD) is an additive manufacturing technique, whose\nperformances can be influenced by several factors and parameters. Monitoring\ntheir evolution allows for a better comprehension and control of the process,\nhence enhancing the deposition quality. In particular, the deposition height is\nan important variable that, if it does not match the process growth, can bring\nto defects and geometrical inaccuracies in the deposited structures. The\ncurrent work presents a system based on optical triangulation for the height\nmonitoring, implemented on a LMD setup composed of a fiber laser, a deposition\nhead, and an anthropomorphic robot. Its coaxial and non-intrusive configuration\nallows for flexibility in the deposition strategy and direction. A measurement\nlaser beam is launched through the powder nozzle and hits the melt pool. A\ncoaxial camera acquires the probe spot, whose position is converted to relative\nheight. The device has been demonstrated for monitoring the deposition of a\nstainless steel cylinder. The measurements allowed to reconstruct a spatial map\nof the height variation, highlighting a transient in the deposition growth\nwhich can be explained in terms of a self-regulating mechanism for the layer\nthickness.\n", "doi": "10.1016/j.optlaseng.2018.09.012", "arxiv_id": "1808.10205", "pdf_urls": ["https://arxiv.org/pdf/1808.10205"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering 112 (2019): 136-144", "categories": "physics.ins-det physics.app-ph"}
{"title": "A possible origin of quantum correlations", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alexander V. Belinsky and Michael H. Shulman"], "abstract": "  We intend to eliminate the known conflict between relativity and quantum\nmechanics. We believe the instant correlation between entangled distant quantum\nparticles can be explained by the fact that in a laboratory reference frame the\nphoton traveling duration is positive and finite while its proper (in vacuum)\ntraveling duration is equal to zero. In the latter case, any two events that\nare separated (in a laboratory reference frame) by an arbitrary finite distance\ncan be considered as simultaneous ones. So, the photon nonlocal correlation\nturns out to be a relative property and may be explained like known twins\nparadox in relativity. In such a situation, any standard causal interaction\nbetween the correlated particles is absent in a laboratory reference frame;\nhowever, some specific mutual couple appears between them; this couple is\nstrictly oscillating without some oriented energy or/and information\ntransferring. We also motivate the basic hypothesis extension on quantum\nparticles having nonzero masses.\n", "doi": "10.1007/s10946-017-9638-4", "arxiv_id": "1808.10271", "pdf_urls": ["https://arxiv.org/pdf/1808.10271"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, Volume 38, Number 3, May, 2017", "categories": "physics.gen-ph quant-ph"}
{"title": "Quantum state identification of qutrits via a nonlinear protocol", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["P. V. Pyshkin", "A. G\\'abris", "O. K\\'alm\\'an", "I. Jex and T. Kiss"], "abstract": "  We propose a probabilistic quantum protocol to realize a nonlinear\ntransformation of qutrit states, which by iterative applications on ensembles\ncan be used to distinguish two types of pure states. The protocol involves\nsingle-qutrit and two-qutrit unitary operations as well as post-selection\naccording to the results obtained in intermediate measurements. We utilize the\nnonlinear transformation in an algorithm to identify a quantum state provided\nit belongs to an arbitrary known finite set. The algorithm is based on dividing\nthe known set of states into two appropriately designed subsets which can be\ndistinguished by the nonlinear protocol. In most cases this is accompanied by\nthe application of some properly defined physical (unitary) operation on the\nunknown state. Then, by the application of the nonlinear protocol one can\ndecide which of the two subsets the unknown state belongs to thus reducing the\nnumber of possible candidates. By iteratively continuing this procedure until a\nsingle possible candidate remains, one can identify the unknown state.\n", "doi": "10.1007/s10946-018-9740-2", "arxiv_id": "1808.10360", "pdf_urls": ["https://arxiv.org/pdf/1808.10360"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser Res. 39, 456 (2018)", "categories": "quant-ph"}
{"title": "Symbolic regression based genetic approximations of the Colebrook\n  equation for flow friction", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pavel Praks and Dejan Brkic"], "abstract": "  Widely used in hydraulics, the Colebrook equation for flow friction relates\nimplicitly to the input parameters; the Reynolds number, and the relative\nroughness of inner pipe surface, with the output unknown parameter; the flow\nfriction factor. In this paper, a few explicit approximations to the Colebrook\nequation are generated using the ability of artificial intelligence to make\ninner patterns to connect input and output parameters in explicit way not\nknowing their nature or the physical law that connects them, but only knowing\nraw numbers. The fact that the used genetic programming tool does not know the\nstructure of the Colebrook equation which is based on computationally expensive\nlogarithmic law, is used to obtain better structure of the approximations which\nis less demanding for calculation but also enough accurate. All generated\napproximations are with low computational cost because they contain a limited\nnumber of logarithmic forms used although for normalization of input parameters\nor for acceleration, but they are also sufficiently accurate. The relative\nerror regarding the friction factor in best case is up to 0.13% with only two\nlogarithmic forms used. As the second logarithm can be accurately approximated\nby the Pade approximation, practically the same error is obtained also using\nonly one logarithm.\n", "doi": "10.3390/w10091175", "arxiv_id": "1808.10394", "pdf_urls": ["https://arxiv.org/pdf/1808.10394"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Praks, P.; Brki\\'c, D. Symbolic Regression-Based Genetic\n  Approximations of the Colebrook Equation for Flow Friction. Water 2018,\n  10(9), 1175", "categories": "cs.CE cs.NE"}
{"title": "Full Stokes polarimetry using Dual-Frequency Liquid Crystals", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["K. Nagaraju", "D. V. S. Phanindra", "S. Krishna Prasad", "D. S. Shankar Rao", "P. Sreekumar"], "abstract": "  In a dual-frequency liquid crystal (DFLC), when the frequency of the applied\nvoltage is more than a critical value ($f_c$), the dielectric anisotropy of the\nmaterial changes from positive to negative. This causes the director to switch\nits orientation from parallel to the field (for $f < f_c$), to perpendicular to\nit ($f > f_c$). Hence DFLC can be used in modulating the light by switching the\nfrequency of an externally applied voltage. We present in this work about\napplication of DFLCs in full Stokes polarimetery. A polarization modulator has\nbeen worked out based on two DFLCs and two static retarders. The combination of\nDFLCs' switching and static retarders are chosen such that more or less equal\nweightage is given to all the Stokes parameters. Initial results on the\noptimization of position angles of the modulators are presented towards the\ngoal of achieving polychromatic modulator in the wavelength range 600-900 nm.\n", "doi": "10.1117/12.2312503", "arxiv_id": "1808.10689", "pdf_urls": ["https://arxiv.org/pdf/1808.10689"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10702, Ground-based and Airborne Instrumentation for\n  Astronomy VII, 107024X (6 July 2018)", "categories": "astro-ph.IM"}
{"title": "ScrumLint: Identifying Violations of Agile Practices Using Development\n  Artifacts", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christoph Matthies", "Thomas Kowark", "Keven Richly", "Matthias Uflacker", "Hasso Plattner"], "abstract": "  Linting tools automatically identify source code fragments that do not follow\na set of predefined standards. Such feedback tools are equally desirable for\n\"linting\" agile development processes. However, providing concrete feedback on\nprocess conformance is a challenging task, due to the intentional lack of\nformal agile process models. In this paper, we present ScrumLint, a tool that\ntackles this issue by analyzing development artifacts. On the basis of\nexperiences with an undergraduate agile software engineering course, we defined\na collection of process metrics. These contain the core ideas of agile methods\nand report deviations. Using this approach, development teams receive immediate\nfeedback on their executed development practices. They can use this knowledge\nto improve their workflows, or can adapt the metrics to better reflect their\nproject reality.\n", "doi": "10.1145/2897586.2897602", "arxiv_id": "1809.00634", "pdf_urls": ["https://arxiv.org/pdf/1809.00634"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 9th International Workshop on Cooperative and\n  Human Aspects of Software Engineering (CHASE '16). 2016, ACM, New York, NY,\n  USA, 40-43", "categories": "cs.SE"}
{"title": "Laser excitation of gigahertz vibrations in Cauliflower mosaic viruses\n  suspension", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["N. V. Tcherniega", "S. M. Pershin", "A. F. Bunkin", "E. K. Donchenko", "O. V.\n  Karpova", "A. D. Kudryavtseva", "V. N. Lednev", "T. V. Mironova", "M. A. Shevchenko", "M. A. Strokov", "and K. I. Zemskov"], "abstract": "  The interaction of laser pulses with the Cauliflower mosaic virus (CaMV) in a\nTris-HCl pH7.5 buffer is investigated. 20 ns ruby laser pulses are used for\nexcitation. Spectra of the light passing through the sample and reflected from\nit are registered with the help of a Fabri-Perot interferometer. Stimulated\nlow-frequency Raman scattering (SLFRS) in a CaMV suspension is registered. The\nSLFRS frequency shift, conversion efficiency and threshold are measured for the\nfirst time, to the best of our knowledge.\n", "doi": "10.1088/1612-202x/aad28d", "arxiv_id": "1809.02377", "pdf_urls": ["https://arxiv.org/pdf/1809.02377"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "N V Tcherniega et al 2018 Laser Phys. Lett. 15 095603", "categories": "physics.optics"}
{"title": "Mobile mathematical environments: current state and development\n  prospects", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kateryna Slovak", "Serhiy Semerikov", "Yu. V. Tryus"], "abstract": "  The formation and development of the human person is most influenced by the\nenvironment in which it lives, studies, works. Therefore, the problem of the\ncreation of such a high-tech information and communication educational and\nscientific environment, in which the student is on a daily basis during the\nwhole period of study at univeristy, which should meet the needs of the\ninformation society, to the modern level, is an important and topical problem\nof both theoretical and practical nature, science, technology and world\neducational standards, and to promote the level of information and\ncommunication training and the formation of professional competencies. An\nexample of such an information and communication educational and scientific\nenvironment for the teaching of mathematical subjects of university students is\na web-oriented mathematical environment.\n", "doi": null, "arxiv_id": "1809.02521", "pdf_urls": ["https://arxiv.org/pdf/1809.02521"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Scientific journal of National Drahomanov Pedagogical University.\n  Series 2, Computer-based learning systems 12 (2012) 102-109", "categories": "math.HO cs.CY"}
{"title": "Forecasting Based on Surveillance Data", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Leonhard Held and Sebastian Meyer"], "abstract": "  Forecasting the future course of epidemics has always been one of the main\ngoals of epidemic modelling. This chapter reviews statistical methods to\nquantify the accuracy of epidemic forecasts. We distinguish point and\nprobabilistic forecasts and describe different methods to evaluate and compare\nthe predictive performance across models. Two case studies demonstrate how to\napply the different techniques to uni- and multivariate forecasts. We focus on\nforecasting count time series from routine public health surveillance: weekly\ncounts of influenza-like illness in Switzerland, and age-stratified counts of\nnorovirus gastroenteritis in Berlin, Germany. Data and code for all analyses\nare available in a supplementary R package.\n", "doi": "10.1201/9781315222912-25", "arxiv_id": "1809.03735", "pdf_urls": ["https://arxiv.org/pdf/1809.03735"], "github": ["https://github.com/HIDDA/HIDDA.github.io"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Handbook of Infectious Disease Data Analysis; Chapman & Hall/CRC,\n  2019; Chapter 25", "categories": "stat.ME stat.AP"}
{"title": "Galois connections and tense operators on q-effect algebras", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ivan Chajda and Jan Paseka"], "abstract": "  For effect algebras, the so-called tense operators were already introduced by\nChajda and Paseka. They presented also a canonical construction of them using\nthe notion of a time frame.\n  Tense operators express the quantifiers \"it is always going to be the case\nthat\" and \"it has always been the case that\" and hence enable us to express the\ndimension of time both in the logic of quantum mechanics and in the many-valued\nlogic.\n  A crucial problem concerning tense operators is their representation. Having\nan effect algebra with tense operators, we can ask if there exists a time frame\nsuch that each of these operators can be obtained by the canonical\nconstruction. To approximate physical real systems as best as possible, we\nintroduce the notion of a q-effect algebra and we solve this problem for\nq-tense operators on q-representable q-Jauch-Piron q-effect algebras.\n", "doi": "10.1016/j.fss.2015.05.010", "arxiv_id": "1809.03773", "pdf_urls": ["https://arxiv.org/pdf/1809.03773"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Authors: I. Chajda, J. Paseka, Title: Galois connections and tense\n  operators on q-effect algebras, Journal: Fuzzy Sets and Systems 298 (2016),\n  56-68", "categories": "math.LO"}
{"title": "Comment on \"Inherent security of phase coding quantum key distribution\n  systems against detector blinding attacks\" [Laser Phys. Lett. 15, 095203\n  (2018)]", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Aleksey Fedorov", "Ilja Gerhardt", "Anqi Huang", "Jonathan Jogenfors", "Yury\n  Kurochkin", "Ant\\'ia Lamas-Linares", "Jan-{\\AA}ke Larsson", "Gerd Leuchs", "Lars\n  Lydersen", "Vadim Makarov", "Johannes Skaar"], "abstract": "  This is a brief comment on the Letter by Balygin and his coworkers [Laser\nPhys. Lett. 15, 095203 (2018)]. We point out an error that invalidates the\nLetter's conclusions.\n", "doi": "10.1088/1612-202x/aaf22d", "arxiv_id": "1809.03911", "pdf_urls": ["https://arxiv.org/pdf/1809.03911"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 16, 019401 (2019)", "categories": "quant-ph"}
{"title": "Categorical foundations of variety-based bornology", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jan Paseka and Sergey A. Solovyov"], "abstract": "  Following the concept of topological theory of S.~E.~Rodabaugh, this paper\nintroduces a new approach to (lattice-valued) bornology, which is based in\nbornological theories, and which is called variety-based bornology. In\nparticular, motivated by the notion of topological system of S.~Vickers, we\nintroduce the concept of variety-based bornological system, and show that the\ncategory of variety-based bornological spaces is isomorphic to a full\nreflective subcategory of the category of variety-based bornological systems.\n", "doi": "10.1016/j.fss.2015.07.011", "arxiv_id": "1809.04124", "pdf_urls": ["https://arxiv.org/pdf/1809.04124"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Authors: J. Paseka, S.A. Solovyov, Title: Categorical foundations\n  of variety-based bornology, Journal: Fuzzy Sets and Systems 291 (2016),\n  132-143", "categories": "math.CT"}
{"title": "Stein and Weinstein structures on disk cotangent bundles of surfaces", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Burak Ozbagci"], "abstract": "  In 1998, Gompf described a Stein domain structure on the disk cotangent\nbundle of any closed surface S, by a Legendrian handlebody diagram. We prove\nthat Gompf's Stein domain is symplectomorphic to the disk cotangent bundle\nequipped with its canonical symplectic structure and the boundary of this\ndomain is contactomorphic to the unit cotangent bundle of S equipped with its\ncanonical contact structure. As a corollary, we obtain a surgery diagram for\nthe canonical contact structure on the unit cotangent bundle of S.\n", "doi": null, "arxiv_id": "1809.05279", "pdf_urls": ["https://arxiv.org/pdf/1809.05279"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 113 (2019), no. 6, 661-670 and 671-672", "categories": "math.GT math.SG"}
{"title": "New approach for solar tracking systems based on computer vision, low\n  cost hardware and deep learning", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jose A. Carballo", "Javier Bonilla", "Manuel Berenguel", "Jes\\'us\n  Fern\\'andez-Reche", "Gin\\'es Garc\\'ia"], "abstract": "  In this work, a new approach for Sun tracking systems is presented. Due to\nthe current system limitations regarding costs and operational problems, a new\napproach based on low cost, computer vision open hardware and deep learning has\nbeen developed. The preliminary tests carried out successfully in Plataforma\nsolar de Almeria (PSA), reveal the great potential and show the new approach as\na good alternative to traditional systems. The proposed approach can provide\nkey variables for the Sun tracking system control like cloud movements\nprediction, block and shadow detection, atmospheric attenuation or measures of\nconcentrated solar radiation, which can improve the control strategies of the\nsystem and therefore the system performance.\n", "doi": "10.1016/j.renene.2018.08.101", "arxiv_id": "1809.07048", "pdf_urls": ["https://arxiv.org/pdf/1809.07048"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Carballo, J. A., Bonilla, J., Berenguel, M., Fernandez-Reche, J.,\n  & Garcia, G. (2018). New approach for solar tracking systems based on\n  computer vision, low cost hardware and deep learning. Renewable Energy", "categories": "cs.LG cs.CV stat.ML"}
{"title": "Comparison of time profiles for the magnetic transport of cold atoms", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Badr (LPL)", "Dany Ben Ali (LPL)", "Joseph Seaward (LPL)", "Yangliang\n  Guo (LPL)", "Fabrice Wiotte (LPL)", "Romain Dubessy (LPL)", "H\\'el\\`ene Perrin\n  (LPL)", "Aur\\'elien Perrin (LPL)"], "abstract": "  We have compared different time profiles for the trajectory of the centre of\na quadrupole magnetic trap designed for the transport of cold sodium atoms. Our\nexperimental observations show that a smooth profile characterized by an\nanalytical expression involving the error function minimizes the transport\nduration while limiting atom losses and heating of the trapped gas. Using\nnumerical calculations of single atom classical trajectories within the trap,\nwe show that this observation can be qualitatively interpreted as a trade-off\nbetween two types of losses: finite depth of the confinement and Majorana spin\nflips.\n", "doi": "10.1007/s00340-019-7213-0", "arxiv_id": "1809.07096", "pdf_urls": ["https://arxiv.org/pdf/1809.07096"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Applied Physics B - Laser and Optics, 2019, 125 (6), pp.102", "categories": "cond-mat.quant-gas"}
{"title": "Controllable optical bistability in a cavity optomechanical system with\n  a Bose-Einstein condensate", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Seyedeh Hamideh Kazemi", "Saeed Ghanbari", "and Mohammad Mahmoudi"], "abstract": "  The optical bistability (OB) in a two-mode optomechanical system with a\nBose-Einstein condensate (BEC) is studied. By investigating the behavior of\nsteady state solutions, we show that how OB develops in the system for a\ncertain range of cavity-pump detunings and pump amplitudes. We then investigate\nthe effects of the decay rate of the cavity photons and coupling strength\nbetween the cavity and the BEC as well as the pump-atom detuning on the optical\nbehaviour of the system. We find that one can control the OB threshold and\nwidth of the bistability curve via adjusting properly the decay rate, coupling\nstrength and the detuning. By applying Routh-Hurwitz criterion, we then derive\nstability conditions for different branches of the OB curve. Moreover, by\nintroducing an effective potential for the system, a simple physical\ninterpretation is obtained.\n", "doi": "10.1088/1054-660x/26/5/055502", "arxiv_id": "1809.08547", "pdf_urls": ["https://arxiv.org/pdf/1809.08547"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics, 26(5), 055502 (2016)", "categories": "physics.optics quant-ph"}
{"title": "Superefficient cascade multiresonator quantum memory", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["N.S. Perminov", "D.Yu. Tarankova", "and S.A. Moiseev"], "abstract": "We propose a cascade scheme of a superefficient broadband quantum memory consisting of four high-Q ring resonators forming a controllable frequency comb and interacting with long-lived spin systems and with a common waveguide. Using the transfer function giving extended matching conditions, the optimization of all spectroscopic parameters of the system for quantum memory in the resonator is carried out. It was shown that our quantum memory scheme does not impose large restrictions on the parameters of losses in resonators and allows to achieve super high efficiency 99.99 % in a wide frequency range.", "doi": "10.1088/1612-202x/aae782", "arxiv_id": "1809.08759", "pdf_urls": ["https://arxiv.org/pdf/1809.08759"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 15 125203 (2018)", "categories": "quant-ph"}
{"title": "Dynamic stabilization of plasma instability", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. Kawata", "T. Karino and Y. J. Gu"], "abstract": "  The paper presents a review of dynamic stabilization mechanisms for plasma\ninstabilities. One of the dynamic stabilization mechanisms for plasma\ninstability was proposed in the papers [Phys. Plasmas 19, 024503(2012) and\nreferences therein], based on a perturbation phase control. In general,\ninstabilities emerge from the perturbations of the physical quantity. Normally\nthe perturbation phase is unknown so that the instability growth rate is\ndiscussed. However, if the perturbation phase is known, the instability growth\ncan be controlled by a superimposition of perturbations imposed actively: if\nthe perturbation is introduced by, for example, a driving beam axis oscillation\nor so, the perturbation phase can be controlled and the instability growth is\nmitigated by the superimposition of the growing perturbations. Based on this\nmechanism we present the application results of the dynamic stabilization\nmechanism to the Rayleigh-Taylor (R-T) instability and to the filamentation\ninstability as typical examples in this paper. On the other hand, in the paper\n[Comments Plasma Phys. Controlled Fusion 3, 1(1977)] another mechanism was\nproposed to stabilize the R-T instability based on the strong oscillation of\nacceleration, which was realized by the laser intensity modulation in laser\ninertial fusion [Phys. Rev. Lett. 71, 3131(1993)]. In the latter mechanism, the\ntotal acceleration strongly oscillates, so that the additional oscillating\nforce is added to create a new stable window in the system. Originally the\nlatter mechanism was proposed by P. L. Kapitza, and it was applied to the\nstabilization of an inverted pendulum. In this paper we review the two dynamic\nstabilization mechanisms, and present the application results of the former\ndynamic stabilization mechanism.\n", "doi": "10.1063/1.5017517", "arxiv_id": "1809.09984", "pdf_urls": ["https://arxiv.org/pdf/1809.09984"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "High Pow Laser Sci Eng 7 (2019) e3", "categories": "physics.plasm-ph physics.flu-dyn"}
{"title": "Introductory Lectures on Extended Supergravities and Gaugings", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Antonio Gallerati and Mario Trigiante"], "abstract": "  In an ungauged supergravity theory, the presence of a \\emph{scalar potential}\nis allowed only for the minimal $\\N=1$ case. In extended supergravities, a\nnon-trivial scalar potential can be introduced without explicitly breaking\nsupersymmetry only through the so-called \\emph{gauging procedure}. The latter\nconsists in promoting a suitable global symmetry group to local symmetry to be\ngauged by the vector fields of the theory. Gauged supergravities provide a\nvaluable approach to the study of superstring flux-compactifications and the\nconstruction of phenomenologically viable, string-inspired models. The aim of\nthese lectures is to give a pedagogical introduction to the subject of gauged\nsupergravities, covering just selected issues and discussing some of their\napplications.\n", "doi": "10.1007/978-3-319-31352-8_2", "arxiv_id": "1809.10647", "pdf_urls": ["https://arxiv.org/pdf/1809.10647"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Based on the contribution to \"Theoretical Frontiers in Black Holes\n  and Cosmology\", Springer Proceedings in Physics, vol. 176 (2006). Springer,\n  Cham", "categories": "hep-th"}
{"title": "Cell Grid Architecture for Maritime Route Prediction on AIS Data Streams", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ciprian Amariei", "Paul Diac", "Emanuel Onica", "Valentin Ro\\c{s}ca"], "abstract": "  The 2018 Grand Challenge targets the problem of accurate predictions on data\nstreams produced by automatic identification system (AIS) equipment, describing\nnaval traffic. This paper reports the technical details of a custom solution,\nwhich exposes multiple tuning parameters, making its configurability one of the\nmain strengths. Our solution employs a cell grid architecture essentially based\non a sequence of hash tables, specifically built for the targeted use case.\nThis makes it particularly effective in prediction on AIS data, obtaining a\nhigh accuracy and scalable performance results. Moreover, the architecture\nproposed accommodates also an optionally semi-supervised learning process\nbesides the basic supervised mode.\n", "doi": "10.1145/3210284.3220503", "arxiv_id": "1810.00090", "pdf_urls": ["https://arxiv.org/pdf/1810.00090"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "DEBS 2018, Proceedings of the 12th ACM International Conference on\n  Distributed and Event-based Systems, Pages 202-204", "categories": "cs.AI cs.LG stat.ML"}
{"title": "Predicting Destinations by Nearest Neighbor Search on Training Vessel\n  Routes", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Valentin Ro\\c{s}ca", "Emanuel Onica", "Paul Diac", "Ciprian Amariei"], "abstract": "  The DEBS Grand Challenge 2018 is set in the context of maritime route\nprediction. Vessel routes are modeled as streams of Automatic Identification\nSystem (AIS) data points selected from real-world tracking data. The challenge\nrequires to correctly estimate the destination ports and arrival times of\nvessel trips, as early as possible. Our proposed solution partitions the\ntraining vessel routes by reported destination port and uses a nearest neighbor\nsearch to find the training routes that are closer to the query AIS point.\nParticular improvements have been included as well, such as a way to avoid\nchanging the predicted ports frequently within one query route and automating\nthe parameters tuning by the use of a genetic algorithm. This leads to\nsignificant improvements on the final score.\n", "doi": "10.1145/3210284.3220509", "arxiv_id": "1810.00096", "pdf_urls": ["https://arxiv.org/pdf/1810.00096"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "DEBS 2018, Proceedings of the 12th ACM International Conference on\n  Distributed and Event-based Systems, Pages 224-225", "categories": "cs.LG stat.ML"}
{"title": "Phase transitions and thermodynamic properties of antiferromagnetic\n  Ising model with next-nearest-neighbor interactions on the Kagome lattice", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Magomed A. Magomedov", "Magomedsheikh K. Ramazanov", "Akay K. Murtazaev"], "abstract": "  We study phase transitions and thermodynamic properties in the\ntwo-dimensional antiferromagnetic Ising model with next-nearest-neighbor\ninteraction on a Kagome lattice by Monte Carlo simulations. A histogram data\nanalysis shows that a second order transition occurs in the model. From the\nanalysis of obtained data, we can assume that next-nearest-neighbor\nferromagnetic interactions in two-dimensional antiferromagnetic Ising model on\na Kagome lattice excite the occurrence of a second order transition and unusual\nbehavior of thermodynamic properties on the temperature dependence.\n", "doi": "10.1080/01411594.2018.1428975", "arxiv_id": "1810.00695", "pdf_urls": ["https://arxiv.org/pdf/1810.00695"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Phase Transitions, 2018, V.91, pp.610-618", "categories": "cond-mat.stat-mech"}
{"title": "Integrability of geodesics of totally geodesic metrics", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rados{\\l}aw A. Kycia", "Maria U{\\l}an"], "abstract": "  Analysis of the geodesics in the space of signature $(1,3)$ that splits in\ntwo-dimensional distributions resulting from the Weyl tensor eignespaces -\nhyperbolic and elliptic ones - described in [V. Lychagin, V. Yumaguzhin,\n\\emph{Differential invariants and exact solutions of the Einstein equations},\nAnal.Math.Phys. 1664-235X 1-9 (2016)] are presented. Cases when geodesic\nequations are integrable are identified. Similar analysis is performed for the\nsame model coupled to Electromagnetism described in [V. Lychagin, V. Yumaguzhi,\n\\emph{Differential invariants and exact solutions of the Einstein-Maxwell\nequation}, Anal.Math.Phys. 1, 19--29, (2017)].\n", "doi": "10.1007/978-3-030-17031-8", "arxiv_id": "1810.00962", "pdf_urls": ["https://arxiv.org/pdf/1810.00962"], "github": ["https://github.com/rkycia/GeodesicsIntegrability"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Chapter in the Book: Nonlinear PDEs, Their Geometry, and\n  Applications, Birkh\\\"auser Basel 2019", "categories": "math-ph gr-qc math.MP"}
{"title": "Multimode semiconductor laser: quantum versus classical behavior", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M. Lebedev", "A. Demenev", "A. Parakhonsky and O. Misochko"], "abstract": "  Temporal correlations of radiation intensities of a multimode Fabry-Perot\nsemiconductor laser are investigated. Strong intensity correlations with a\nfixed phase shift between different longitudinal modes of the laser are\nrevealed. The second g^(2) and third g^(3) order intensity correlation\nfunctions are studied to clear the character of the intermodal coupling.\n", "doi": "10.1007/s10946-019-09770-y", "arxiv_id": "1810.01129", "pdf_urls": ["https://arxiv.org/pdf/1810.01129"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J Russ Laser Res (2019), Volume 40, Number 1, pp 60-67", "categories": "quant-ph"}
{"title": "Damped Oscillator with delta-kicked frequency in probability\n  representation of quantum mechanic", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir N. Chernega", "Olga V. Man'ko"], "abstract": "  We obtain the tomogram of squeezed correlated states of a quantum parametric\ndamped oscillator in an explicit form. We study the damping within the\nframework of the Caldirola--Kanai model and chose the parametric excitation in\nthe form of a very short pulse simulated by a delta-kick of frequency; the\nsqueezing phenomenon is reviewed. The cases of strong and weak damping are\ninvestigated.\n", "doi": "10.1007/s10946-018-9735-z", "arxiv_id": "1810.01672", "pdf_urls": ["https://arxiv.org/pdf/1810.01672"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, v.39, N 4, pp.411-419 (2018)", "categories": "quant-ph"}
{"title": "Quantum Berezinskii-Kosterltz-Thouless Transition for Topological\n  Insulator", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ranjith Kumar R", "Rahul S", "Surya Narayan", "Sujit Sarkar"], "abstract": "  We consider the interacting helical liquid system at the one-dimensional edge\nof a two-dimensional topological insulator, coupled to an external magnetic\nfield and s-wave superconductor and map it to an XYZ spin chain system. This\nmodel undergoes quantum Berezinskii-Kosterlitz-Thouless (BKT) transition with\ntwo limiting conditions. We derive the renormalization group (RG) equations\nexplicitly and also present the flow lines behavior. We also present the\nbehavior of RG flow lines based on the exact solution. We observe that the\nphysics of Majorana fermion zero modes and the gaped Ising-ferromagnetic phase,\nwhich appears in a different context. We observe that the evidence of gapless\nhelical Luttinger liquid phase as a common non-topological quantum phase for\nboth quantum BKT transitions. We explain analytically and physically that there\nis no Majorana-Ising transition. In the presence of chemical potential, the\nsystem shows the commensurate to incommensurate transition.\n", "doi": "10.1080/01411594.2020.1765349", "arxiv_id": "1810.01741", "pdf_urls": ["https://arxiv.org/pdf/1810.01741"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Phase Transitions, 93:6, 606-629 (2020)", "categories": "cond-mat.stat-mech cond-mat.other"}
{"title": "Thermal effects of the quantum states generated from the isomorphs of\n  PPKTP crystal", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rui-Bo Jin", "Guo-Qun Chen", "Fabian Laudenbach", "Shengmei Zhao", "Pei-Xiang\n  Lu"], "abstract": "  We theoretically and numerically investigate the temperature-dependent\nproperties of the biphotons generated from four isomorphs of periodically poled\n$\\mathrm{KTiOPO_4}$ (PPKTP): i.e., PPRTP, PPKTA, PPRTA and PPCTA. It is\ndiscovered that the first type of group-velocity-matched (GVM) wavelength is\ndecreased by 6.4, 1.2, 8.9, 25.6 and 6.3 nm, while the phase-matched wavelength\nis decreased by 4.4, -0.4, -1.2, 29.1 and 59.5 nm for PPKTP, PPRTP, PPKTA,\nPPRTA and PPCTA, respectively, when the temperature is increased from\n20$\\,^{\\circ}\\mathrm{C}$ to 120$\\,^{\\circ}\\mathrm{C}$. Although the maximal\nspectral purity of the heralded single photons is not changed at different\ntemperature, the Hong-Ou-Mandel (HOM) interference shows different patterns due\nto a shift of the joint spectral amplitude. These thermal effects are very\nimportant for precise control of the quantum state for the future applications\nin quantum information processing, for example, in quantum interference or\nspectroscopy.\n", "doi": "10.1016/j.optlastec.2018.07.014", "arxiv_id": "1810.02025", "pdf_urls": ["https://arxiv.org/pdf/1810.02025"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Laser Technology 109, 222-226 (2019)", "categories": "quant-ph"}
{"title": "Polarized Proton Beams from Laser-induced Plasmas", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anna H\\\"utzen", "Johannes Thomas", "J\\\"urgen B\\\"oker", "Ralf Engels", "Ralf\n  Gebel", "Andreas Lehrach", "Alexander Pukhov", "T. Peter Rakitzis", "Dimitris\n  Sofikitis", "and Markus B\\\"uscher"], "abstract": "  We report on the concept of an innovative source to produce polarized\nproton/deuteron beams of a kinetic energy up to several GeV from a laser-driven\nplasma accelerator. Spin effects have been implemented into the PIC simulation\ncode VLPL to make theoretical predictions about the behavior of proton spins in\nlaser-induced plasmas. Simulations of spin-polarized targets show that the\npolarization is conserved during the acceleration process. For the experimental\nrealization, a polarized HCl gas-jet target is under construction using the\nfundamental wavelength of a Nd:YAG laser system to align the HCl bonds and\nsimultaneously circular polarized light of the fifth harmonic to\nphoto-dissociate, yielding nuclear polarized H atoms. Subsequently, their\ndegree of polarization is measured with a Lamb-shift polarimeter. The final\nexperiments, aiming at the first observation of a polarized particle beam from\nlaser-generated plasmas, will be carried out at the 10 PW laser system SULF at\nSIOM/Shanghai.\n", "doi": "10.1017/hpl.2018.73", "arxiv_id": "1810.02247", "pdf_urls": ["https://arxiv.org/pdf/1810.02247"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "High Pow Laser Sci Eng 7 (2019) e16", "categories": "physics.plasm-ph physics.acc-ph"}
{"title": "CDF Transform-and-Shift: An effective way to deal with datasets of\n  inhomogeneous cluster densities", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ye Zhu", "Kai Ming Ting", "Mark Carman", "Maia Angelova"], "abstract": "  The problem of inhomogeneous cluster densities has been a long-standing issue\nfor distance-based and density-based algorithms in clustering and anomaly\ndetection. These algorithms implicitly assume that all clusters have\napproximately the same density. As a result, they often exhibit a bias towards\ndense clusters in the presence of sparse clusters. Many remedies have been\nsuggested; yet, we show that they are partial solutions which do not address\nthe issue satisfactorily. To match the implicit assumption, we propose to\ntransform a given dataset such that the transformed clusters have approximately\nthe same density while all regions of locally low density become globally low\ndensity -- homogenising cluster density while preserving the cluster structure\nof the dataset. We show that this can be achieved by using a new\nmulti-dimensional Cumulative Distribution Function in a transform-and-shift\nmethod. The method can be applied to every dataset, before the dataset is used\nin many existing algorithms to match their implicit assumption without\nalgorithmic modification. We show that the proposed method performs better than\nexisting remedies.\n", "doi": "10.1016/j.patcog.2021.107977", "arxiv_id": "1810.02897", "pdf_urls": ["https://arxiv.org/pdf/1810.02897"], "github": ["https://github.com/zhuye88/CDF-TS"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Zhu Y, Ting K M, Carman M J, et al. CDF Transform-and-Shift: An\n  effective way to deal with datasets of inhomogeneous cluster densities.\n  Pattern Recognition, 2021, 117: 107977", "categories": "cs.LG cs.AI cs.CV stat.ML"}
{"title": "Transition from the wave equation to either the heat or the transport\n  equations through fractional differential expressions", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fernando Olivar-Romero and Oscar Rosas-Ortiz"], "abstract": "  We study a model that intermediates among the wave, heat, and transport\nequations. The approach considers the propagation of initial disturbances in a\none-dimensional medium that can vibrate. The medium is nonlinear in such a form\nthat nonlocal differential expressions are required to describe the\ntime-evolution of solutions. Non-locality is modeled with a space-time\nfractional differential equation of order $1 \\leq \\alpha \\leq 2$ in time, and\norder $1\\leq \\beta \\leq 2$ in space. We adopt the notion of Caputo for\ntime-derivative and the Riesz pseudo-differential operator for\nspace-derivative. The corresponding Cauchy problem is solved for zero initial\nvelocity and initial disturbance represented by either the Dirac delta or the\nGaussian distributions. Well known results for the partial differential\nequations of wave propagation, diffusion and (modified) transport processes are\nrecovered as particular cases. In addition, regular solutions are found for the\npartial differential equation that arises from $\\alpha=2$ and $\\beta=1$. Unlike\nthe above cases, the latter equation permits the presence of nodes in its\nsolutions.\n", "doi": "10.3390/sym10100524", "arxiv_id": "1810.02908", "pdf_urls": ["https://arxiv.org/pdf/1810.02908"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Symmetry-Basel 10 (2018) 524", "categories": "math-ph math.MP"}
{"title": "DOTIFS: a new multi-IFU optical spectrograph for the 3.6-m Devasthal\n  optical telescope", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haeun Chung", "A. N. Ramaprakash", "Amitesh Omar", "Swara Ravindranath", "Sabyasachi Chattopadhyay", "Chaitanya V. Rajarshi", "Pravin Khodade"], "abstract": "  Devasthal Optical Telescope Integral Field Spectrograph (DOTIFS) is a new\nmulti-object Integral Field Spectrograph (IFS) being designed and fabricated by\nthe Inter-University Center for Astronomy and Astrophysics (IUCAA), Pune,\nIndia, for the Cassegrain side port of the 3.6m Devasthal Optical Telescope,\n(DOT) being constructed by the Aryabhatta Research Institute of Observational\nSciences (ARIES), Nainital. It is mainly designed to study the physics and\nkinematics of the ionized gas, star formation and H II regions in the nearby\ngalaxies. It is a novel instrument in terms of multi-IFU, built in deployment\nsystem, and high throughput. It consists of one magnifier, 16 integral field\nunits (IFUs), and 8 spectrographs. Each IFU is comprised of a microlens array\nand optical fibers and has 7.4'' x 8.7'' field of view with 144 spaxel\nelements, each sampling 0.8'' hexagonal aperture. The IFUs can be distributed\non the telescope side port over an 8' diameter focal plane by the deployment\nsystem. Optical fibers deliver light from the IFUs to the spectrographs. Eight\nidentical, all refractive, dedicated spectrographs will produce 2,304 R~1800\nspectra over 370-740nm wavelength range with a single exposure. Volume Phase\nHolographic gratings are chosen to make smaller optics and get high throughput.\nThe total throughput of the instrument including the telescope is predicted as\n27.5% on average. Observing techniques, data simulator and reduction software\nare also under development. Currently, conceptual and baseline design review\nhas been done. Some of the components have already been procured. The\ninstrument is expected to see its first light in 2016.\n", "doi": "10.1117/12.2053051", "arxiv_id": "1810.03614", "pdf_urls": ["https://arxiv.org/pdf/1810.03614"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9147, Ground-based and Airborne Instrumentation for\n  Astronomy V, 91470V (18 July 2014)", "categories": "astro-ph.IM"}
{"title": "DOTIFS: spectrograph optical and opto-mechanical design", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haeun Chung", "A. N. Ramaprakash", "Pravin Khodade", "Deepa Modi", "Chaitanya\n  V. Rajarshi", "Sabyasachi Chattopadhyay", "Pravin A. Chordia", "Vishal Joshi", "Sungwook E. Hong", "Amitesh Omar", "Swara Ravindranath", "Yong-Sun Park", "Changbom\n  Park"], "abstract": "  Devasthal Optical Telescope Integral Field Spectrograph (DOTIFS) is a new\nmulti-Integral Field Unit (IFU) instrument, planned to be mounted on the 3.6m\nDevasthal optical telescope in Nainital, India. It has eight identical,\nfiber-fed spectrographs to disperse light coming from 16 IFUs. The\nspectrographs produce 2,304 spectra over a 370-740nm wavelength range\nsimultaneously with a spectral resolution of R=1200-2400. It is composed of\nall-refractive, all spherical optics designed to achieve on average 26.0%\nthroughput from the telescope to the CCD with the help of high transmission\nspectrograph optics, volume phase holographic grating, and graded coated e2v 2K\nby 4K CCD. We present the optical and opto-mechanical design of the\nspectrograph as well as current development status. Optics and optomechanical\ncomponents for the spectrographs are being fabricated.\n", "doi": "10.1117/12.2311594", "arxiv_id": "1810.03621", "pdf_urls": ["https://arxiv.org/pdf/1810.03621"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10702, Ground-based and Airborne Instrumentation for\n  Astronomy VII, 107027A (8 July 2018)", "categories": "astro-ph.IM"}
{"title": "DOTIFS: fore-optics and calibration unit design", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haeun Chung", "A. N. Ramaprakash", "Pravin Khodade", "Chaitanya V. Rajarshi", "Sabyasachi Chattopadhyay", "Pravin A. Chordia", "Amitesh Omar", "Changbom Park"], "abstract": "  We present fore-optics and calibration unit design of Devasthal Optical\nTelescope Integral Field Spectrograph (DOTIFS). DOTIFS fore-optics is designed\nto modify the focal ratio of the light and to match its plate scale to the\nphysical size of Integral Field Units (IFUs). The fore-optics also delivers a\ntelecentric beam to the IFUs on the telescope focal plane. There is a\ncalibration unit part of which is combined with the fore-optics to have a light\nand compact system. We use Xenon-arc lamp as a continuum source and\nKrypton/Mercury-Neon lamps as wavelength calibration sources. Fore-optics and\ncalibration unit shares two optical lenses to maintain compactness of the\noverall subsystem. Here we present optical and opto-mechanical design of the\ncalibration unit and fore-optics as well as calibration scheme of DOTIFS.\n", "doi": "10.1117/12.2312394", "arxiv_id": "1810.03627", "pdf_urls": ["https://arxiv.org/pdf/1810.03627"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10702, Ground-based and Airborne Instrumentation for\n  Astronomy VII, 107027U (9 July 2018)", "categories": "astro-ph.IM"}
{"title": "Convolutional Neural Networks and x-vector Embedding for DCASE2018\n  Acoustic Scene Classification Challenge", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hossein Zeinali", "Lukas Burget and Jan Cernocky"], "abstract": "  In this paper, the Brno University of Technology (BUT) team submissions for\nTask 1 (Acoustic Scene Classification, ASC) of the DCASE-2018 challenge are\ndescribed. Also, the analysis of different methods on the leaderboard set is\nprovided. The proposed approach is a fusion of two different Convolutional\nNeural Network (CNN) topologies. The first one is the common two-dimensional\nCNNs which is mainly used in image classification. The second one is a\none-dimensional CNN for extracting fixed-length audio segment embeddings, so\ncalled x-vectors, which has also been used in speech processing, especially for\nspeaker recognition. In addition to the different topologies, two types of\nfeatures were tested: log mel-spectrogram and CQT features. Finally, the\noutputs of different systems are fused using a simple output averaging in the\nbest performing system. Our submissions ranked third among 24 teams in the ASC\nsub-task A (task1a).\n", "doi": null, "arxiv_id": "1810.04273", "pdf_urls": ["https://arxiv.org/pdf/1810.04273"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Detection and Classification of Acoustic Scenes\n  and Events 2018 Workshop (DCASE2018)", "categories": "eess.AS cs.SD"}
{"title": "Set Representation of Dynamic De Morgan algebras", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ivan Chajda and Jan Paseka"], "abstract": "  By a De Morgan algebra is meant a bounded poset equipped with an antitone\ninvolution considered as negation. Such an algebra can be considered as an\nalgebraic axiomatization of a propositional logic satisfying the double\nnegation law. Our aim is to introduce the so-called tense operators in every De\nMorgan algebra for to get an algebraic counterpart of a tense logic with\nnegation satisfying the double negation law which need not be Boolean.\n  Following the standard construction of tense operators $G$ and $H$ by a frame\nwe solve the following question: if a dynamic De Morgan algebra is given, how\nto find a frame such that its tense operators $G$ and $H$ can be reached by\nthis construction.\n", "doi": "10.1109/ismvl.2013.56.", "arxiv_id": "1810.05086", "pdf_urls": ["https://arxiv.org/pdf/1810.05086"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "I. Chajda, J. Paseka, Set representation of partial dynamic De\n  Morgan algebras, In: Proceedings of the 46th IEEE International Symposium on\n  Multiple-Valued Logic, Springer, (2016), 119--124", "categories": "math.LO"}
{"title": "The groupoid-based logic for lattice effect algebras", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["I. Chajda", "H. L\\\"anger", "J. Paseka"], "abstract": "  The aim of the paper is to establish a certain logic corresponding to lattice\neffect algebras. First, we answer a natural question whether a lattice effect\nalgebra can be represented by means of a groupoid-like structure. We establish\na one-to-one correspondence between lattice effect algebras and certain\ngroupoids with an antitone involution. Using these groupoids, we are able to\nintroduce a suitable logic for lattice effect algebras.\n", "doi": "10.1109/ismvl.2017.15", "arxiv_id": "1810.05498", "pdf_urls": ["https://arxiv.org/pdf/1810.05498"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "I. Chajda, H. L\\\"anger, J. Paseka, The groupoid-based logic for\n  lattice effect algebras, in: Proceedings of the 47th IEEE International\n  Symposium on Multiple-Valued Logic, IEEE, (2017), 230-235", "categories": "math.LO"}
{"title": "Error estimation at the information reconciliation stage of quantum key\n  distribution", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["E.O. Kiktenko", "A.O. Malyshev", "A.A. Bozhedarov", "N.O. Pozhar", "M.N.\n  Anufriev", "and A.K. Fedorov"], "abstract": "  Quantum key distribution (QKD) offers a practical solution for secure\ncommunication between two distinct parties via a quantum channel and an\nauthentic public channel. In this work, we consider different approaches to the\nquantum bit error rate (QBER) estimation at the information reconciliation\nstage of the post-processing procedure. For reconciliation schemes employing\nlow-density parity-check (LDPC) codes, we develop a novel syndrome-based QBER\nestimation algorithm. The algorithm suggested is suitable for irregular LDPC\ncodes and takes into account punctured and shortened bits. Testing our approach\nin a real QKD setup, we show that an approach combining the proposed algorithm\nwith conventional QBER estimation techniques allows one to improve the accuracy\nof the QBER estimation.\n", "doi": "10.1007/s10946-018-9752-y", "arxiv_id": "1810.05841", "pdf_urls": ["https://arxiv.org/pdf/1810.05841"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser Res. 39, 558 (2018)", "categories": "quant-ph cs.IT math.IT"}
{"title": "Emergence of a new symmetry class for Bogoliubov-de Gennes (BdG)\n  Hamiltonians: Expanding ten-fold symmetry classes", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ranjith Kumar R and Sujit Sarkar"], "abstract": "  Symmetry plays an important role in the topological states of quantum matter.\nCartan found three symmetry classes, Altland and Zirnbauer extended it to the\nten-fold symmetry class for mesoscopic systems. We observe emergence of a new\nsymmetry class for BdG Hamiltonians. This new symmetry class appears for the\nBdG Hamiltonian in spinful background. We also observe the interesting feature\nthat there is no evidence of Kramers's degeneracy for this BdG model\nHamiltonian either in spinless or in spinful background. We call the extra\nsymmetry class X, i.e, expanding the ten-fold symmetry classes for topological\nstates of quantum matter. These BdG show many new, interesting and insightful\nresults.\n", "doi": "10.1080/01411594.2020.1723588", "arxiv_id": "1810.07618", "pdf_urls": ["https://arxiv.org/pdf/1810.07618"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Phase Transitions, 93:3, 287-300 (2020)", "categories": "cond-mat.str-el"}
{"title": "Shrinkage estimation of rate statistics", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Einar Holsb{\\o}", "Vittorio Perduca"], "abstract": "  This paper presents a simple shrinkage estimator of rates based on Bayesian\nmethods. Our focus is on crime rates as a motivating example. The estimator\nshrinks each town's observed crime rate toward the country-wide average crime\nrate according to town size. By realistic simulations we confirm that the\nproposed estimator outperforms the maximum likelihood estimator in terms of\nglobal risk. We also show that it has better coverage properties.\n", "doi": null, "arxiv_id": "1810.07654", "pdf_urls": ["https://arxiv.org/pdf/1810.07654"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Case Studies in Business, Industry and Government Statistics -\n  CSBIGS, Vol 7 No 1 (2018)", "categories": "stat.AP"}
{"title": "Profile-Based Ad Hoc Social Networking Using Wi-Fi Direct on the Top of\n  Android", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nagender Aneja and Sapna Gambhir"], "abstract": "  Ad-hoc Social Networks have become popular to support novel applications\nrelated to location-based mobile services that are of great importance to users\nand businesses. Unlike traditional social services using a centralized server\nto fetch location, ad-hoc social network services support infrastructure less\nreal-time social networking. It allows users to collaborate and share views\nanytime anywhere. However, current ad-hoc social network applications are\neither not available without rooting the mobile phones or don't filter the\nnearby users based on common interests without a centralized server. This paper\npresents an architecture and implementation of social networks on commercially\navailable mobile devices that allow broadcasting name and a limited number of\nkeywords representing users' interests without any connection in a nearby\nregion to facilitate matching of interests. The broadcasting region creates a\ndigital aura and is limited by WiFi region that is around 200 meters. The\napplication connects users to form a group based on their profile or interests\nusing peer-to-peer communication mode without using any centralized networking\nor profile matching infrastructure. The peer-to-peer group can be used for\nprivate communication when the network is not available.\n", "doi": "10.1155/2018/9469536", "arxiv_id": "1810.07886", "pdf_urls": ["https://arxiv.org/pdf/1810.07886"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Nagender Aneja and Sapna Gambhir, \"Profile-Based Ad Hoc Social\n  Networking Using Wi-Fi Direct on the Top of Android,\" Mobile Information\n  Systems, vol 2018, Article ID 9469536, 7 pages, 2018.\n  https://doi.org/10.1155/2018/9469536", "categories": "cs.SI cs.CR cs.NI"}
{"title": "Multi-scale approach for analyzing convective heat transfer flow in\n  background-oriented Schlieren technique", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rajshekhar Gannavarpu and Dario Ambrosini"], "abstract": "  The paper introduces a multi-scale processing method for quantitative study\nand visualization of convective heat transfer using diffractive optical element\nbased background-oriented schlieren technique. The method relies on robust\nestimation of phase encoded in the fringe pattern using windowed Fourier\ntransform and subsequent multi-scale characterization of the obtained phase\nusing continuous wavelet transform. As the phase is directly mapped to the\nrefractive index fluctuations caused by the temperature gradients, the\nmulti-scale inspection provides interesting insights about the underlying heat\nflow phenomenon. The performance of the proposed method is demonstrated for\nquantitative flow visualization.\n", "doi": "10.1016/j.optlaseng.2018.07.002", "arxiv_id": "1810.07928", "pdf_urls": ["https://arxiv.org/pdf/1810.07928"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Gannavarpu Rajshekhar and Dario Ambrosini, \"Multi-scale approach\n  for analyzing convective heat transfer flow in background-oriented Schlieren\n  technique\", Optics and Lasers in Engineering, 110, 415-419, 2018", "categories": "eess.SP"}
{"title": "A representation theorem for quantale valued sup-algebras", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jan Paseka", "Radek \\v{S}lesinger"], "abstract": "  With this paper we hope to contribute to the theory of quantales and\nquantale-like structures. It considers the notion of $Q$-sup-algebra and shows\na representation theorem for such structures generalizing the well-known\nrepresentation theorems for quantales and sup-algebras. In addition, we present\nsome important properties of the category of $Q$-sup-algebras.\n", "doi": "10.1109/ismvl.2018.00024", "arxiv_id": "1810.09561", "pdf_urls": ["https://arxiv.org/pdf/1810.09561"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Paseka, R. \\v{S}lesinger, A representation theorem for quantale\n  valued sup-algebras, In: Proceedings of the 48th IEEE International Symposium\n  on Multiple-Valued Logic, Springer, (2018), 91-96", "categories": "math.LO math.RA"}
{"title": "A Fully Attention-Based Information Retriever", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alvaro Henrique Chaim Correia", "Jorge Luiz Moreira Silva", "Thiago de\n  Castro Martins", "Fabio Gagliardi Cozman"], "abstract": "  Recurrent neural networks are now the state-of-the-art in natural language\nprocessing because they can build rich contextual representations and process\ntexts of arbitrary length. However, recent developments on attention mechanisms\nhave equipped feedforward networks with similar capabilities, hence enabling\nfaster computations due to the increase in the number of operations that can be\nparallelized. We explore this new type of architecture in the domain of\nquestion-answering and propose a novel approach that we call Fully Attention\nBased Information Retriever (FABIR). We show that FABIR achieves competitive\nresults in the Stanford Question Answering Dataset (SQuAD) while having fewer\nparameters and being faster at both learning and inference than rival methods.\n", "doi": "10.1109/ijcnn.2018.8489656", "arxiv_id": "1810.09580", "pdf_urls": ["https://arxiv.org/pdf/1810.09580"], "github": ["https://github.com/AlCorreia/FABIR"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "A. H. C. Correia, J. L. M. Silva, T. d. C. Martins and F. G.\n  Cozman, \"A Fully Attention-Based Information Retriever,\" 2018 International\n  Joint Conference on Neural Networks (IJCNN), Rio de Janeiro, Brazil, 2018,\n  pp. 2799-2806", "categories": "cs.CL cs.IR"}
{"title": "Expression Recognition Using the Periocular Region: A Feasibility Study", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fernando Alonso-Fernandez", "Josef Bigun", "Cristofer Englund"], "abstract": "  This paper investigates the feasibility of using the periocular region for\nexpression recognition. Most works have tried to solve this by analyzing the\nwhole face. Periocular is the facial region in the immediate vicinity of the\neye. It has the advantage of being available over a wide range of distances and\nunder partial face occlusion, thus making it suitable for unconstrained or\nuncooperative scenarios. We evaluate five different image descriptors on a\ndataset of 1,574 images from 118 subjects. The experimental results show an\naverage/overall accuracy of 67.0%/78.0% by fusion of several descriptors. While\nthis accuracy is still behind that attained with full-face methods, it is\nnoteworthy to mention that our initial approach employs only one frame to\npredict the expression, in contraposition to state of the art, exploiting\nseveral order more data comprising spatial-temporal data which is often not\navailable.\n", "doi": null, "arxiv_id": "1810.09798", "pdf_urls": ["https://arxiv.org/pdf/1810.09798"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. Intl Conf on Signal Image Technology & Internet Based\n  Systems, SITIS, Gran Canaria, Spain, 26-29 Nov 2018", "categories": "cs.CV"}
{"title": "Action and intention recognition of pedestrians in urban traffic", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dimitrios Varytimidis", "Fernando Alonso-Fernandez", "Boris Duran", "Cristofer Englund"], "abstract": "  Action and intention recognition of pedestrians in urban settings are\nchallenging problems for Advanced Driver Assistance Systems as well as future\nautonomous vehicles to maintain smooth and safe traffic. This work investigates\na number of feature extraction methods in combination with several machine\nlearning algorithms to build knowledge on how to automatically detect the\naction and intention of pedestrians in urban traffic. We focus on the motion\nand head orientation to predict whether the pedestrian is about to cross the\nstreet or not. The work is based on the Joint Attention for Autonomous Driving\n(JAAD) dataset, which contains 346 videoclips of various traffic scenarios\ncaptured with cameras mounted in the windshield of a car. An accuracy of 72%\nfor head orientation estimation and 85% for motion detection is obtained in our\nexperiments.\n", "doi": null, "arxiv_id": "1810.09805", "pdf_urls": ["https://arxiv.org/pdf/1810.09805"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. Intl Conf on Signal Image Technology & Internet Based\n  Systems, SITIS, Gran Canaria, Spain, 26-29 Nov 2018", "categories": "cs.CV"}
{"title": "Fruit and Vegetable Identification Using Machine Learning for Retail\n  Applications", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Frida Femling", "Adam Olsson", "Fernando Alonso-Fernandez"], "abstract": "  This paper describes an approach of creating a system identifying fruit and\nvegetables in the retail market using images captured with a video camera\nattached to the system. The system helps the customers to label desired fruits\nand vegetables with a price according to its weight. The purpose of the system\nis to minimize the number of human computer interactions, speed up the\nidentification process and improve the usability of the graphical user\ninterface compared to existing manual systems. The hardware of the system is\nconstituted by a Raspberry Pi, camera, display, load cell and a case. To\nclassify an object, different convolutional neural networks have been tested\nand retrained. To test the usability, a heuristic evaluation has been performed\nwith several users, concluding that the implemented system is more user\nfriendly compared to existing systems.\n", "doi": null, "arxiv_id": "1810.09811", "pdf_urls": ["https://arxiv.org/pdf/1810.09811"], "github": ["https://github.com/FynnQ/a-test"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. Intl Conf on Signal Image Technology & Internet Based\n  Systems, SITIS, Gran Canaria, Spain, 26-29 Nov 2018", "categories": "cs.CV"}
{"title": "Accurate and efficient explicit approximations of the Colebrook flow\n  friction equation based on the Wright-Omega function", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dejan Brki\\'c and Pavel Praks"], "abstract": "  The Colebrook equation is a popular model for estimating friction loss\ncoefficients in water and gas pipes. The model is implicit in the unknown flow\nfriction factor f. To date, the captured flow friction factor f can be\nextracted from the logarithmic form analytically only in the term of the\nLambert W-function. The purpose of this study is to find an accurate and\ncomputationally efficient solution based on the shifted Lambert W-function also\nknown as the Wright Omega-function. The Wright Omega-function is more suitable\nbecause it overcomes the problem with the overflow error by switching the fast\ngrowing term y=W(e^x) of the Lambert W-function to the series expansions that\nfurther can be easily evaluated in computers without causing overflow run-time\nerrors. Although the Colebrook equation transformed through the Lambert\nW-function is identical to the original expression in term of accuracy, a\nfurther evaluation of the Lambert W-function can be only approximate. Very\naccurate explicit approximations of the Colebrook equation that contains only\none or two logarithms are shown. The final result is an accurate explicit\napproximation of the Colebrook equation with the relative error of no more than\n0.0096%. The presented approximations are in the form suitable for everyday\nengineering use, they are both accurate and computationally efficient.\n", "doi": "10.3390/math7010034", "arxiv_id": "1810.10273", "pdf_urls": ["https://arxiv.org/pdf/1810.10273"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Brki\\'c, D.; Praks, P. Accurate and Efficient Explicit\n  Approximations of the Colebrook Flow Friction Equation Based on the Wright\n  {\\omega}-Function. Mathematics 2019, 7, 34.,\n  https://doi.org/10.3390/math7010034", "categories": "cs.NA"}
{"title": "Superensemble Classifier for Improving Predictions in Imbalanced\n  Datasets", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tanujit Chakraborty and Ashis Kumar Chakraborty"], "abstract": "  Learning from an imbalanced dataset is a tricky proposition. Because these\ndatasets are biased towards one class, most existing classifiers tend not to\nperform well on minority class examples. Conventional classifiers usually aim\nto optimize the overall accuracy without considering the relative distribution\nof each class. This article presents a superensemble classifier, to tackle and\nimprove predictions in imbalanced classification problems, that maps Hellinger\ndistance decision trees (HDDT) into radial basis function network (RBFN)\nframework. Regularity conditions for universal consistency and the idea of\nparameter optimization of the proposed model are provided. The proposed\ndistribution-free model can be applied for feature selection cum imbalanced\nclassification problems. We have also provided enough numerical evidence using\nvarious real-life data sets to assess the performance of the proposed model.\nIts effectiveness and competitiveness with respect to different\nstate-of-the-art models are shown.\n", "doi": "10.1080/23737484.2020.1740065", "arxiv_id": "1810.11317", "pdf_urls": ["https://arxiv.org/pdf/1810.11317"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Communications in Statistics: Case Studies, Data Analysis and\n  Applications Volume 6, 2020 - Issue 2", "categories": "cs.LG stat.ML"}
{"title": "Partial Shading Detection and Smooth Maximum Power Point Tracking of PV\n  Arrays under PSC", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohammad Amin Ghasemi", "Hossein Mohammadian Foroushani", "Mostafa\n  Parniani"], "abstract": "  One of the most important issues in the operation of a photovoltaic (PV)\nsystem is extracting maximum power from the PV array, especially in partial\nshading condition (PSC). Under PSC, P-V characteristic of PV arrays will have\nmultiple peak points, only one of which is global maximum. Conventional maximum\npower point tracking (MPPT) methods are not able to extract maximum power in\nthis condition. In this paper, a novel two-stage MPPT method is presented to\novercome this drawback. In the first stage, a method is proposed to determine\nthe occurrence of PSC, and in the second stage, using a new algorithm that is\nbased on ramp change of the duty cycle and continuous sampling from the P-V\ncharacteristic of the array, global maximum power point of array is reached.\nP&O algorithm is then re-activated to trace small changes of the new MPP. Open\nloop operation of the proposed method makes its implementation cheap and\nsimple. The method is robust in the face of changing environmental conditions\nand array characteristics, and has minimum negative impact on the connected\npower system. Simulations in Matlab/Simulink and experimental results validate\nthe performance of the proposed methods.\n", "doi": null, "arxiv_id": "1810.12431", "pdf_urls": ["https://arxiv.org/pdf/1810.12431"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "M. A. Ghasemi, H. M. Foroushani, M. Parniani, \"Partial shading\n  detection and smooth maximum power point tracking of PV arrays under PSC\",\n  IEEE Trans. Power Electron., vol. 31, no. 9, pp. 6281-6292, Sep. 2016", "categories": "eess.SP"}
{"title": "A brief review of Scott measure as a multipartite entanglement criterion", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saeed Haddadi"], "abstract": "  In recent decades, various multipartite entanglement measures have been\nproposed by many researchers, with different characteristics. Meanwhile, Scott\nstudied various interesting aspects of multipartite entanglement measures and\nhe has defined a class of related multipartite entanglement measures in an\nobvious manner. Recently, Jafarpour et al. (Int. J. Quantum Inform. 13, 1550047\n2015) have calculated the entanglement quantity of two-dimensional 5-site spin\nsystem by means of Scott measure. As it was presented in their calculation\nQ_{2}>Q_{3}. In this paper, we would like to point out that in the 5-qudit\nsystem, Q_{2} does not provide a stronger entanglement than Q_{3}, while there\nis a simple relation between them.\n", "doi": "10.1088/1612-202x/ab8fab", "arxiv_id": "1810.13152", "pdf_urls": ["https://arxiv.org/pdf/1810.13152"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 17 (2020) 075201", "categories": "quant-ph"}
{"title": "A methodology to compute the territorial productivity of scientists: The\n  case of Italy", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giovanni Abramo", "Ciriaco Andrea D'Angelo"], "abstract": "  Policy-makers working at the national and regional levels could find the\nterritorial mapping of research productivity by field to be useful in informing\nboth research and industrial policy. Research-based private companies could\nalso use such mapping for efficient selection in localizing R&D activities and\nuniversity research collaborations. In this work we apply a bibliometric\nmethodology for ranking by research productivity: i) the fields of research for\neach territory (region and province); and ii) the territories for each\nscientific field. The analysis is based on the 2008-2012 scientific output\nindexed in the Web of Science, by all professors on staff at Italian\nuniversities. The population is over 36,000 professors, active in 192 fields\nand 9 disciplines.\n", "doi": "10.1016/j.joi.2015.07.007", "arxiv_id": "1810.13341", "pdf_urls": ["https://arxiv.org/pdf/1810.13341"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Abramo, G., D'Angelo, C.A. (2015). A methodology to compute the\n  territorial productivity of scientists: The case of Italy. Journal of\n  Informetrics, 9(4), 675-685", "categories": "cs.DL"}
{"title": "DOLORES: Deep Contextualized Knowledge Graph Embeddings", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Haoyu Wang", "Vivek Kulkarni", "William Yang Wang"], "abstract": "  We introduce a new method DOLORES for learning knowledge graph embeddings\nthat effectively captures contextual cues and dependencies among entities and\nrelations. First, we note that short paths on knowledge graphs comprising of\nchains of entities and relations can encode valuable information regarding\ntheir contextual usage. We operationalize this notion by representing knowledge\ngraphs not as a collection of triples but as a collection of entity-relation\nchains, and learn embeddings for entities and relations using deep neural\nmodels that capture such contextual usage. In particular, our model is based on\nBi-Directional LSTMs and learn deep representations of entities and relations\nfrom constructed entity-relation chains. We show that these representations can\nvery easily be incorporated into existing models to significantly advance the\nstate of the art on several knowledge graph prediction tasks like link\nprediction, triple classification, and missing relation type prediction (in\nsome cases by at least 9.5%).\n", "doi": null, "arxiv_id": "1811.00147", "pdf_urls": ["https://arxiv.org/pdf/1811.00147"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Automated Knowledge Base Construction (AKBC), 2020", "categories": "cs.CL cs.AI cs.LG cs.NE"}
{"title": "IteRank: An iterative network-oriented approach to neighbor-based\n  collaborative ranking", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bita Shams and Saman Haratizadeh"], "abstract": "  Neighbor-based collaborative ranking (NCR) techniques follow three\nconsecutive steps to recommend items to each target user: first they calculate\nthe similarities among users, then they estimate concordance of pairwise\npreferences to the target user based on the calculated similarities. Finally,\nthey use estimated pairwise preferences to infer the total ranking of items for\nthe target user. This general approach faces some problems as the rank data is\nusually sparse as users usually have compared only a few pairs of items and\nconsequently, the similarities among users is calculated based on limited\ninformation and is not accurate enough for inferring true values of preference\nconcordance and can lead to an invalid ranking of items. This article presents\na novel framework, called IteRank, that models the data as a bipartite network\ncontaining users and pairwise preferences. It then simultaneously refines\nusers' similarities and preferences' concordances using a random walk method on\nthis graph structure. It uses the information in this first step in another\nnetwork structure for simultaneously adjusting the concordances of preferences\nand rankings of items. Using this approach, IteRank can overcome some existing\nproblems caused by the sparsity of the data. Experimental results show that\nIteRank improves the performance of recommendation compared to the state of the\nart NCR techniques that use the traditional NCR framework for recommendation.\n", "doi": null, "arxiv_id": "1811.01345", "pdf_urls": ["https://arxiv.org/pdf/1811.01345"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems 128 (2017): 102-114", "categories": "cs.IR cs.SI"}
{"title": "A possible time dependent generalization of the bipartite quantum\n  marginal problem", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giuseppe Baio", "Dariusz Chruscinski", "Antonino Messina"], "abstract": "  In this work we study an inverse dynamical problem for a bipartite quantum\nsystem governed by the time local master equation: to find the class of\ngenerators which give rise to a certain time evolution with the constraint of\nfixed reduced states (marginals). The compatibility of such choice with a\nglobal unitary evolution is considered. For the non unitary case we propose a\nsystematic method to reconstruct examples of master equations and address them\nto different physical scenarios.\n", "doi": "10.1007/s10946-018-9737-x", "arxiv_id": "1811.01633", "pdf_urls": ["https://arxiv.org/pdf/1811.01633"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, v. 39, no. 4 (2018)", "categories": "quant-ph"}
{"title": "Recent advances in methodology for clinical trials in small populations:\n  the InSPiRe project", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["T. Friede", "M. Posch", "S. Zohar", "C. Alberti", "N. Benda", "E. Comets", "S.\n  Day", "A. Dmitrenko", "A. Graf", "B. K. G\\\"unhan", "S. W. Hee", "F. Lentz", "J. Madan", "F.\n  Miller", "T. Ondra", "M. Pearce", "C. R\\\"over", "A. Tournazi", "S. Unkel", "M. Ursino", "G.\n  Wassmer", "N. Stallard"], "abstract": "  Where there are a limited number of patients, such as in a rare disease,\nclinical trials in these small populations present several challenges,\nincluding statistical issues. This led to an EU FP7 call for proposals in 2013.\nOne of the three projects funded was the Innovative Methodology for Small\nPopulations Research (InSPiRe) project. This paper summarizes the main results\nof the project, which was completed in 2017. The InSPiRe project has led to\ndevelopment of novel statistical methodology for clinical trials in small\npopulations in four areas. We have explored new decision-making methods for\nsmall population clinical trials using a Bayesian decision-theoretic framework\nto compare costs with potential benefits, developed approaches for targeted\ntreatment trials, enabling simultaneous identification of subgroups and\nconfirmation of treatment effect for these patients, worked on early phase\nclinical trial design and on extrapolation from adult to pediatric studies,\ndeveloping methods to enable use of pharmacokinetics and pharmacodynamics data,\nand also developed improved robust meta-analysis methods for a small number of\ntrials to support the planning, analysis and interpretation of a trial as well\nas enabling extrapolation between patient groups. In addition to scientific\npublications, we have contributed to regulatory guidance and produced free\nsoftware in order to facilitate implementation of the novel methods.\n", "doi": "10.1186/s13023-018-0919-y", "arxiv_id": "1811.02504", "pdf_urls": ["https://arxiv.org/pdf/1811.02504"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Orphanet Journal of Rare Diseases, 13:136, 2018", "categories": "stat.AP stat.ME"}
{"title": "Design and production of the DESI fibre cables", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["J\\\"urgen Schmoll", "Robert Besuner", "David Bramall", "David Brooks", "Jerry\n  Edelstein", "Patrick Jelinsky", "Michael Levi", "Graham Murray", "Claire Poppett", "Ray\n  Sharples", "Luke Tyas", "David Schlegel (for the DESI collaboration)"], "abstract": "  The Dark Energy Spectroscopic Instrument (DESI) is under construction to\nmeasure the expansion history of the Universe using the Baryonic Acoustic\nOscillation technique. The spectra of 35 million galaxies and quasars over\n14000 sq deg will be measured during the life of the experiment. A new prime\nfocus corrector for the KPNO Mayall telescope will deliver light to 5000 fibre\noptic positioners. The fibres in turn feed 10 broad-band spectrographs. We will\ndescribe the design and production progress on the fibre cables, strain relief\nsystem and preparation of the slit end. In contrast to former projects, the\nlarger scale of production required for DESI requires teaming up with industry\nto find a solution to reduce the time scale of production as well as to\nminimise the stress on the optical fibres.\n", "doi": "10.1117/12.2312140", "arxiv_id": "1811.03383", "pdf_urls": ["https://arxiv.org/pdf/1811.03383"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10702, Ground-based and Airborne Instrumentation for\n  Astronomy VII, 107027N (9 July 2018); doi: 10.1117/12.2312140;\n  https://doi.org/10.1117/12.2312140", "categories": "astro-ph.IM"}
{"title": "Tunable Terahertz Amplification Based on Photoexcited Active Graphene\n  Hyperbolic Metamaterials", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tianjing Guo", "Liang Zhu", "Pai-Yen Chen", "and Christos Argyropoulos"], "abstract": "  The efficient amplification and lasing of electromagnetic radiation at\nterahertz (THz) frequencies is a non-trivial task achieved mainly by quantum\ncascade laser configurations with limited tunability and narrowband\nfunctionality. There is a strong need of compact and efficient THz\nelectromagnetic sources with reconfigurable operation in a broad frequency\nrange. Photoexcited graphene can act as the gain medium to produce coherent\nradiation at low THz frequencies but its response is very weak due to its\nultrathin thickness. In this work, we demonstrate an alternative design to\nachieve efficient tunable and compact THz amplifiers and lasers with broadband\noperation based on active THz hyperbolic metamaterials (HMM) designed by\nmultiple stacked photoexcited graphene layers separated by thin dielectric\nsheets. The hyperbolic THz response of the proposed ultrathin active HMM is\nanalytically and numerically studied and characterized. When the graphene-based\nHMM structure is periodically patterned, a broadband slow-wave propagation\nregime is identified, thanks to the hyperbolic dispersion. In this scenario,\nreconfigurable amplification of THz waves in a broad frequency range is\nobtained, which can be made tunable by varying the quasi-Fermi level of\ngraphene. We demonstrate that the THz response of the presented tunable THz\namplifiers or lasers is controlled by the incident optical pumping\n(photodoping) and the loaded dielectric materials in the HMM waveguide array,\nan interesting property that can have great potential for THz amplification,\nemission, and sensing applications.\n", "doi": "10.1364/ome.8.003941", "arxiv_id": "1811.04143", "pdf_urls": ["https://arxiv.org/pdf/1811.04143"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "T. Guo, L. Zhu, P.-Y. Chen, C. Argyropoulos, Tunable Terahertz\n  Amplification Based on Photoexcited Active Graphene Hyperbolic Metamaterials\n  [Invited], Optics Materials Express, vol. 8, No. 12, pp. 3941-3952, 2018", "categories": "physics.optics"}
{"title": "Effect of saturated absorption on sub-Poissonian lasing", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yu. M. Golubev", "T. Yu. Golubeva", "E. A. Vashukevich", "S. V. Fedorov", "N.\n  N. Rosanov"], "abstract": "  This paper discusses the effect of saturated absorption on the quantum\nfeatures of a sub-Poissonian laser. It is shown that when both media (laser and\nabsorbing) are saturated, the appearance of an additional element in the cavity\ndoes not lead to the demolition of the quantum properties (regular statistics\nof photons and quadrature squeezing) of laser radiation.\n", "doi": "10.1088/1612-202x/aaf69e", "arxiv_id": "1811.04672", "pdf_urls": ["https://arxiv.org/pdf/1811.04672"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 16 025201 (2019)", "categories": "quant-ph"}
{"title": "Criteria of minimum squeezing for quantum cluster state generation", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. B. Korolev", "A. D. Manukhova", "K. S. Tikhonov", "T. Yu. Golubeva", "Yu.\n  M. Golubev"], "abstract": "  In this paper, we assess possibilities of generating cluster states with\ndifferent topologies being possessed of a finite squeezing resource of the\ninitial oscillators used to generate a cluster state. We obtained the condition\non minimum squeezing required for generating a cluster with a given topology as\na simple estimation in terms of the coefficients of the adjacency matrix\n", "doi": "10.1088/1612-202x/aac03e", "arxiv_id": "1811.05241", "pdf_urls": ["https://arxiv.org/pdf/1811.05241"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. V. 15, P. 075203 (2018)", "categories": "quant-ph"}
{"title": "Mammographic density: Comparison of visual assessment with fully\n  automatic calculation on a multivendor dataset", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniela Sacchetto", "Lia Morra", "Silvano Agliozzo", "Daniela Bernardi", "Tomas Bjorklund", "Beniamino Brancato", "Patrizia Bravetti", "Luca A. Carbonaro", "Loredana Correale", "Carmen Fant\\`o", "Elisabetta Favettini", "Laura Martincich", "Luisella Milanesio", "Sara Mombelloni", "Francesco Monetti", "Doralba Morrone", "Marco Pellegrini", "Barbara Pesce", "Antonella Petrillo", "Gianni Saguatti", "Carmen\n  Stevanin", "Rubina M. Trimboli", "Paola Tuttobene", "Marvi Valentini", "Vincenzo\n  Marra", "Alfonso Frigerio", "Alberto Bert", "Francesco Sardanelli"], "abstract": "  Objectives: To compare breast density (BD) assessment provided by an\nautomated BD evaluator (ABDE) with that provided by a panel of experienced\nbreast radiologists, on a multivendor dataset.\n  Methods: Twenty-one radiologists assessed 613 screening/diagnostic digital\nmammograms from 9 centers and 6 different vendors, using the BI-RADS a, b, c,\nand d density classification. The same mammograms were also evaluated by an\nABDE providing the ratio between fibroglandular and total breast area on a\ncontinuous scale and, automatically, the BI-RADS score. Panel majority report\n(PMR) was used as reference standard. Agreement (k) and accuracy (proportion of\ncases correctly classified) were calculated for binary (BI-RADS a-b versus c-d)\nand 4-class classification.\n  Results: While the agreement of individual radiologists with PMR ranged from\nk=0.483 to k=0.885, the ABDE correctly classified 563/613 mammograms (92%). A\nsubstantial agreement for binary classification was found for individual reader\npairs (k=0.620, standard deviation [SD]=0.140), individual versus PMR (k=0.736,\nSD=0.117), and individual versus ABDE (k=0.674, SD=0.095). Agreement between\nABDE and PMR was almost perfect (k=0.831).\n  Conclusions: The ABDE showed an almost perfect agreement with a\n21-radiologist panel in binary BD classification on a multivendor dataset,\nearning a chance as a reproducible alternative to visual evaluation.\n", "doi": "10.1007/s00330-015-3784-2", "arxiv_id": "1811.05324", "pdf_urls": ["https://arxiv.org/pdf/1811.05324"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Sacchetto, Daniela et al. \"Mammographic density: comparison of\n  visual assessment with fully automatic calculation on a multivendor dataset.\"\n  European radiology 26, no. 1 (2016): 175-183", "categories": "physics.med-ph cs.CV"}
{"title": "To bee or not to bee: Investigating machine learning approaches for\n  beehive sound recognition", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["In\\^es Nolasco and Emmanouil Benetos"], "abstract": "  In this work, we aim to explore the potential of machine learning methods to\nthe problem of beehive sound recognition. A major contribution of this work is\nthe creation and release of annotations for a selection of beehive recordings.\nBy experimenting with both support vector machines and convolutional neural\nnetworks, we explore important aspects to be considered in the development of\nbeehive sound recognition systems using machine learning approaches.\n", "doi": null, "arxiv_id": "1811.06016", "pdf_urls": ["https://arxiv.org/pdf/1811.06016"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Detection and Classification of Acoustic Scenes\n  and Events 2018 Workshop (DCASE2018)", "categories": "cs.SD eess.AS"}
{"title": "ReSIFT: Reliability-Weighted SIFT-based Image Quality Assessment", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dogancan Temel and Ghassan AlRegib"], "abstract": "  This paper presents a full-reference image quality estimator based on SIFT\ndescriptor matching over reliability-weighted feature maps. Reliability\nassignment includes a smoothing operation, a transformation to perceptual color\ndomain, a local normalization stage, and a spectral residual computation with\nglobal normalization. The proposed method ReSIFT is tested on the LIVE and the\nLIVE Multiply Distorted databases and compared with 11 state-of-the-art\nfull-reference quality estimators. In terms of the Pearson and the Spearman\ncorrelation, ReSIFT is the best performing quality estimator in the overall\ndatabases. Moreover, ReSIFT is the best performing quality estimator in at\nleast one distortion group in compression, noise, and blur category.\n", "doi": "10.1109/icip.2016.7532718", "arxiv_id": "1811.06090", "pdf_urls": ["https://arxiv.org/pdf/1811.06090"], "github": ["https://github.com/olivesgatech/ReSIFT"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "D. Temel and G. AlRegib, \"ReSIFT: Reliability-weighted sift-based\n  image quality assessment,\" 2016 IEEE International Conference on Image\n  Processing (ICIP), Phoenix, AZ, 2016, pp. 2047-2051", "categories": "eess.IV cs.CV"}
{"title": "A two-fluid model for numerical simulation of shear-dominated suspension\n  flows", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Federico Municchi and Pranay P. Nagrani and Ivan C. Christov"], "abstract": "  Suspension flows are ubiquitous in nature (hemodynamics, subsurface fluid\nmechanics, etc.) and industrial applications (hydraulic fracturing, CO$_2$\nstorage, etc.). However, such flows are notoriously difficult to model due to\nthe variety of fluid-particle and particle-particle interactions that can\noccur. In this work, we focus on non-Brownian shear-dominated suspensions,\nwhere kinetic collisions are negligible and frictional effects play a dominant\nrole. Under these circumstances, irreversible phenomena such as particle\ndiffusion and migration arise, requiring anisotropic stress models to describe\nthe suspension rheology. On a continuum level, reduced-order models such as the\nsuspension balance model (SBM) or the diffusive flux model are commonly used to\npredict particle migration phenomena. We propose a new method based on a\ntwo-fluid model (TFM), where both the phases are considered as interpenetrating\ncontinua with their own conservation of mass and momentum equations. Without\nemploying the nowadays customary simplifications in applying the SBM, we close\nthe ``full'' TFM instead. Specifically, we show that when an anisotropic stress\nanalogous to that used in the SBM is added to the equilibrium equations for the\nparticle phase, the TFM is able to accurately predict particle migration. Thus,\nthe TFM does not require the assumptions of a steady suspension velocity and a\nStokesian (inertialess) fluid, and the TFM can be easily extended to include\nbuoyancy and even kinetic collisional models. We present several benchmark\nsimulations of our TFM implementation in\nOpenFOAM{\\textsuperscript\\textregistered}, including in curvilinear coordinates\nand three-dimensional flow. Good agreement between the TFM solutions and\nprevious experimental and numerical results is found.\n", "doi": "10.1016/j.ijmultiphaseflow.2019.07.015", "arxiv_id": "1811.06972", "pdf_urls": ["https://arxiv.org/pdf/1811.06972"], "github": ["https://github.com/fmuni/twoFluidsNBSuspensionFoam"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 120 (2019) 103079", "categories": "physics.flu-dyn cond-mat.soft"}
{"title": "A simulink circuit model for measurement of consumption of electric\n  energy using frequency method", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Emmanouil Markoulakis", "Emmanuel Antonidakis", "George S. Stavrakakis"], "abstract": "  The following analysis and presentation summarizes the implementation in\nMatlab / Simulink environment of a prototype model digital energy circuit for\nmeasurement of the consumption of electric energy of an electrification network\nin the installations of customer of electric energy that can be applied as part\nof any consumption smart meter.\n", "doi": null, "arxiv_id": "1811.07144", "pdf_urls": ["https://arxiv.org/pdf/1811.07144"], "github": ["https://gitlab.com/markoulg/em9.mdl"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "A simulated frequency based electric single phase power\n  consumption digital metering method. WSEAS Transactions on Power Systems, 14\n  (2019), 209-215", "categories": "eess.SP"}
{"title": "The contribution of star scientists to overall sex differences in\n  research productivity", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giovanni Abramo", "Ciriaco Andrea D'Angelo", "Alessandro Caprasecca"], "abstract": "  The state of the art on the issue of sex differences in research efficiency\nagrees in recognizing higher performances for males, however there are\ndivergences in explaining the possible causes. One of the causes advanced is\nthat there are sex differences in the availability of aptitude at the \"high\nend\". By comparing sex differences in concentration and performance of Italian\nacademic star scientists to the case in the population complement, this work\naims to verify if star, or \"high-end\", scientists play a preponderant role in\ndetermining higher performance among males. The study reveals the existence of\na greater relative concentration of males among star scientists, as well as a\nperformance gap between male and female star scientists that is greater than\nfor the rest of the population. In the latter subpopulation the performance gap\nbetween the two sexs is seen as truly marginal.\n", "doi": "10.1007/s11192-008-2131-7", "arxiv_id": "1811.08696", "pdf_urls": ["https://arxiv.org/pdf/1811.08696"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Abramo, G., D'Angelo, C.A., Caprasecca, A. (2009). The\n  contribution of star scientists to overall sex differences in research\n  productivity. Scientometrics, 81(1), 137-156", "categories": "cs.DL"}
{"title": "Re-visiting the single-phase flow model for liquid steel ladle stirred\n  by gas", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Najib Alia", "Volker John", "Seppo Ollila"], "abstract": "  Ladle stirring is an important step of the steelmaking process to homogenize\nthe temperature and the chemical composition of the liquid steel and to remove\ninclusions before casting. Gas is injected from the bottom of the bath to\ninduce a turbulent flow of the liquid steel. Multiphase modeling of ladle\nstirring can become computationally expensive, especially when used within\noptimal flow control problems. This paper focuses therefore on single-phase\nflow models. It aims at improving the existing models from the literature.\nSimulations in a 2d axial-symmetrical configuration, as well as, in a real 3d\nlaboratory-scale ladle, are performed. The results obtained with the present\nmodel are in a relative good agreement with experimental data and suggest that\nit can be used as an efficient model in optimal flow control problems.\n", "doi": "10.1016/j.apm.2018.11.005", "arxiv_id": "1811.11535", "pdf_urls": ["https://arxiv.org/pdf/1811.11535"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "N. Alia, V. John and S. Ollila, Revisiting the single-phase flow\n  model for liquid steel ladle stirred by gas, Applied Mathematical Modelling,\n  67 (2019), 549--556, ISSN 0307-904X", "categories": "physics.flu-dyn cs.CE"}
{"title": "Characteristic methods and Roe's method for the incompressible two-fluid\n  model for stratified pipe flow", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andreas Holm Akselsen"], "abstract": "  This article examines the use of characteristic methods in stratified\ntwo-phase pipe flow simulations for obtaining non-dissipative flow predictions.\nA Roe scheme and several methods based on the principle of characteristics are\npresented for the two-fluid model. The main focus is finding numerically\nefficient ways of capturing wave dynamics and flow regime transitions through\ndirect simulation. Characteristic methods offer the possibility of simulating\nhyperbolic systems without numerical dissipation. These methods do however lack\ncertain fundamental conservation properties. Challenges related to information\nscattering and clustering in space and time, particularly around shocks, are\nalso an issue in some method variants. Hybridisations with the finite volume\nmethod are proposed which overcome these shortcomings. All methods are\ncompared, evaluating predictions on the onset of linear wave growth and\nsimulations of non-linear, discontinuous roll-waves. The following observations\nare made: 1. Characteristic methods are excellent at predicting the onset of\nlinear hydrodynamic instability, even with a small number of computational\nnodes. 2. Dissipative errors in finite volume methods and characteristic\nhybrids will be closely linked to the Courant number. The Roe scheme and the\ncharacteristic hybrids give very little dissipation error as the Courant number\napproaches unity. This then becomes a question of numerical stability. 3.\nAdapting dynamic grid cells, moving along with the characteristics information\ndrift, greatly improves simulation efficiency by allowing for longer time\nsteps. Dynamic grid cells are also useful for alleviating the need for\ninterpolation in characteristic methods. These methods easily out-perform the\nmore basic upwind and Lax-Friedrich schemes.\n", "doi": "10.1016/j.ijmultiphaseflow.2016.10.009", "arxiv_id": "1811.11840", "pdf_urls": ["https://arxiv.org/pdf/1811.11840"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, 89, 81-91", "categories": "physics.comp-ph physics.flu-dyn"}
{"title": "Nanonionics and interfaces for energy and information technologies", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Francesco Chiabrera", "Inigo Garbayo", "Albert Tarancon"], "abstract": "  There is a growing interest in the development of functional metal oxides\nwith mixed ionic electronic conduction for their application in different\nstrategic fields. In particular, ionic transport-related phenomena are of\nprimary importance in energy transformation and storage devices, such as solid\noxides fuel cells (SOFC) or batteries. Traditionally, the main issue that\nhindered a wide spread of solid state electrochemical devices is the slow ionic\nconduction and the reduced number of families of materials with pure ionic\nconductivity able to play the role of the electrolyte. This is due to the low\nmobility of the ionic charge carriers and their mechanical and coulombic\ninteractions with their host crystal structures. For relatively big and charged\nions, e.g. O2- or Na+, the low ionic conductivity imposes operating at high\ntemperatures, which is incompatible with some applications such as portable\nelectronics.\n", "doi": "10.1016/b978-0-12-811166-6.00017-0", "arxiv_id": "1811.12744", "pdf_urls": ["https://arxiv.org/pdf/1811.12744"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Chapter in \"Metal Oxide-Based Thin Film Structures\", 409, 2018", "categories": "cond-mat.mtrl-sci"}
{"title": "Mapping of the 2+1 Dirac-Moshinsky Oscillator Coupled to an External\n  Isospin Field onto Jaynes-Cummings Model", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A. S.-F. Obada", "M. M. A. Ahmed", "M. Abu-Shady", "and H. F. Habeba"], "abstract": "  In this paper, the 2+1 Dirac-Moshinsky oscillator (2+1 DMO) coupled to an\nexternal isospin field is mapped onto the Jaynes-Cummings model (JCM), which\ndescribes the interaction between two two-level systems and a quantum\nsingle-mode field. The time-dependent wave function and the density matrix are\nobtained in the two cases. In the first case, the quantum number state is\nconsidered, while in the second case, the coherent state is considered as an\ninitial state. The effect of both the detuning parameter and the coherence\nangle are studied on the entanglement and on the population inversion. It has\nbeen shown that the coherent state gives good description than the number state\nfor the entanglement and the population inversion.\n", "doi": "10.1007/s10946-019-09780-w", "arxiv_id": "1812.00261", "pdf_urls": ["https://arxiv.org/pdf/1812.00261"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, Volume 40, Number 2, March,\n  2019", "categories": "quant-ph"}
{"title": "Massive Modes for Quantum Graphs", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hans A. Weidenm\\\"uller"], "abstract": "  The spectral two-point function of chaotic quantum graphs is expected to be\nuniversal. Within the supersymmetry approach, a proof of that assertion amounts\nto showing that the contribution of non-universal (or massive) modes vanishes\nin the limit of infinite graph size. Here we pay particular attention to the\nfact that the massive modes are defined in a coset space. Using the assumption\nthat the spectral gap of the Perron-Frobenius operator remains finite in the\nlimit, we then argue that the massive modes are indeed negligible.\n", "doi": null, "arxiv_id": "1812.00655", "pdf_urls": ["https://arxiv.org/pdf/1812.00655"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In: Discrete and Continuous Models in the Theory of Networks,\n  Birkhaeuser Basel 2020", "categories": "quant-ph hep-th"}
{"title": "Care2Vec: A Deep learning approach for the classification of self-care\n  problems in physically disabled children", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sayan Putatunda"], "abstract": "  Accurate classification of self-care problems in children who suffer from\nphysical and motor affliction is an important problem in the healthcare\nindustry. This is a difficult and a time consumming process and it needs the\nexpertise of occupational therapists. In recent years, healthcare professionals\nhave opened up to the idea of using expert systems and artificial intelligence\nin the diagnosis and classification of self care problems. In this study, we\npropose a new deep learning based approach named Care2Vec for solving these\nkind of problems and use a real world self care activities dataset that is\nbased on a conceptual framework designed by the World Health Organization\n(WHO). Care2Vec is a mix of unsupervised and supervised learning where we use\nAutoencoders and Deep neural networks as a two step modeling process. We found\nthat Care2Vec has a better prediction accuracy than some of the traditional\nmethods reported in the literature for solving the self care classification\nproblem viz. Decision trees and Artificial neural networks.\n", "doi": "10.1007/s00521-020-04943-2", "arxiv_id": "1812.00715", "pdf_urls": ["https://arxiv.org/pdf/1812.00715"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Putatunda, S. Care2Vec: a hybrid autoencoder-based approach for\n  the classification of self-care problems in physically disabled children.\n  Neural Comput & Applic (2020). https://doi.org/10.1007/s00521-020-04943-2", "categories": "cs.LG stat.ML"}
{"title": "Nucleation Rates of Water Using Adjusted SAFT-0 EOS", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fawaz Hrahsheh"], "abstract": "  The SAFT-0 is an equation of state (EOS) that considers the effects of\nmolecular association based on the statistical association fluid theory (SAFT).\nThis EOS recently showed relatively successful calculations of the\nphase-equilibrium properties and the classical and nonclassical nucleation\nrates of methanol. Motivated by methanol results, we use the SAFT-0 EOS for\nwater, in particular within the temperature range of anomalous density behavior\nbelow T_{max}=277.15 K. To do so, we adjust the effective temperature-dependent\nsegment diameter in terms of the association energy in a way that the SAFT-0\nEOS reproduces the water vapor-liquid equilibria and the vapor pressures,\nparticularly in the temperature range where the data of nucleation rates of\nwater are available (220-260 K). The Gibbsian form of classical nucleation\ntheory (CNT) (known as the P-form) and nonclassical gradient theory (GT)\ncalculations were carried out using the SAFT-0 EOS with and without including\nthis adjusted diameter. Calculated rates were compared to the experimental\nvalues of W\\\"olk and Strey [J. Phys. Chem. B 2001, 105, 11683-11701]. In\naddition to the phase-equilibrium properties, this adjustment improved the\nnucleation rates from both GT and CNT by factors of 500 and 100, respectively.\nTo explore this further, the GT and experimental rates were analyzed using\nHale's scaled model [J. Chem. Phys., 2005, 122, 204509]. This analysis shows\nthat the predictions of GT scale relatively well with those of the experimental\ndata.\n", "doi": "10.1016/j.fluid.2019.112272", "arxiv_id": "1812.01744", "pdf_urls": ["https://arxiv.org/pdf/1812.01744"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Fluid Phase Equilibria 501 (2019) 112272", "categories": "physics.chem-ph"}
{"title": "Prior-Knowledge and Attention-based Meta-Learning for Few-Shot Learning", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yunxiao Qin", "Weiguo Zhang", "Chenxu Zhao", "Zezheng Wang", "Xiangyu Zhu", "Guojun Qi", "Jingping Shi", "Zhen Lei"], "abstract": "  Recently, meta-learning has been shown as a promising way to solve few-shot\nlearning. In this paper, inspired by the human cognition process which utilizes\nboth prior-knowledge and vision attention in learning new knowledge, we present\na novel paradigm of meta-learning approach with three developments to introduce\nattention mechanism and prior-knowledge for meta-learning. In our approach,\nprior-knowledge is responsible for helping meta-learner expressing the input\ndata into high-level representation space, and attention mechanism enables\nmeta-learner focusing on key features of the data in the representation space.\nCompared with existing meta-learning approaches that pay little attention to\nprior-knowledge and vision attention, our approach alleviates the\nmeta-learner's few-shot cognition burden. Furthermore, a Task-Over-Fitting\n(TOF) problem, which indicates that the meta-learner has poor generalization on\ndifferent K-shot learning tasks, is discovered and we propose a Cross-Entropy\nacross Tasks (CET) metric to model and solve the TOF problem. Extensive\nexperiments demonstrate that we improve the meta-learner with state-of-the-art\nperformance on several few-shot learning benchmarks, and at the same time the\nTOF problem can also be released greatly.\n", "doi": "10.1016/j.knosys.2020.106609", "arxiv_id": "1812.04955", "pdf_urls": ["https://arxiv.org/pdf/1812.04955"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "knowledge-based systems-2021", "categories": "cs.CV cs.LG"}
{"title": "Analyzing Popularity of Software Testing Careers in Canada", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pradeep Kashinath Waychal", "Luiz Fernando Capretz", "Sachin Narendra\n  Pardeshi"], "abstract": "  Software testing is critical to prevent software failures. Therefore,\nresearch has been carried out in testing but that is largely limited to the\nprocess and technology dimensions and has not sufficiently addressed the human\ndimension. Even though there are reports about inadequacies of testing\nprofessionals and their skills, only a few studies have tackled the problem.\nTherefore, we decided to explore the human dimension. We started with the basic\nproblem that plagues the testing profession, the shortage of talent, by asking\nwhy do students and professionals are reluctant to consider testing careers,\nwhat can be done about that, and is the problem specific to locales or spread\nacross the globe? This paper focusses on these questions. The study was carried\nout in one college in Canada and its findings are compared with a college in\nIndia. Studies in more colleges is required to develop acceptable national\nviews. It also may help to study this phenomenon in more countries and develop\nglobal perspectives on the issue. However, the study certainly offers useful\ninsights and helps educators and industry leaders to come up with an action\nplan to change the outlook towards testers in industry and in computer science\nand software engineering programs, and put the software testing profession\nunder a new light. That could increase the number of software engineers\ndeciding on testing as a career of their choice, could increase the quality of\nsoftware testing, and improve the overall productivity, and turnaround time of\nsoftware development activity.\n", "doi": null, "arxiv_id": "1812.05172", "pdf_urls": ["https://arxiv.org/pdf/1812.05172"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "125th Annual Conference of the American Society for Engineering\n  Education (ASEE), paper ID #21627, 13 pages, Salt Lake City, UT, USA, June\n  2018", "categories": "cs.CY"}
{"title": "Assessing technical and cost efficiency of research activities: A case\n  study of the Italian university system", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giovanni Abramo", "Ciriaco Andrea D'Angelo"], "abstract": "  This paper employs data envelopment analysis (DEA) to assess both technical\nand cost efficiency of research activities of the Italian university system.\nDifferently from both peer review and the top-down discipline-invariant\nbibliographic approaches used elsewhere, a bottom-up bibliometric methodology\nis applied. Publications are assigned first to authors and then to one of nine\nscientific and technical university disciplinary areas. Inputs are specified in\nterms of the numbers of full, associate and assistant professors and outputs as\nthe number of publications, contributions to publications and their scientific\nimpact as variously measured across the disciplines included. DEA is undertaken\ncross-sectionally using the averages of these inputs and outputs over the\nperiod 2001-2003. The results typically show much variation in the rankings of\nthe disciplinary areas within and across universities, depending on the\nefficiency indicator employed.\n", "doi": "10.3152/095820209x408869", "arxiv_id": "1812.07845", "pdf_urls": ["https://arxiv.org/pdf/1812.07845"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Abramo, G., D'Angelo, C.A. (2009). Assessing technical and cost\n  efficiency of research activities: a case study of the Italian university\n  system. Research Evaluation, 18(1), 61-70", "categories": "cs.DL"}
{"title": "Gender differences in research productivity: a bibliometric analysis of\n  the Italian academic system", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giovanni Abramo", "Ciriaco Andrea D'Angelo", "Alessandro Caprasecca"], "abstract": "  The literature dedicated to analysis of the difference in research\nproductivity between the sexes tends to agree in indicating better performance\nfor men. This study enters in the vein of work on the subject. Through\nbibliometric examination of the entire population of research personnel working\nin the scientific-technological disciplines of Italian university system, it\nconfirms the presence of significant differences in productivity between men\nand women. But such differences result as being smaller than reported in a\nlarge part of the literature, confirming an ongoing tendency towards decline,\nand are also seen as more noticeable for quantitative performance indicators\nthan other indicators. The gap between the sexes presents important sectorial\nspecificities. In spite of the generally better performance of men, it can not\nbe ignored that there are a significant number of scientific sectors in which\nthe performance of women does not result as inferior.\n", "doi": "10.1007/s11192-007-2046-8", "arxiv_id": "1812.07851", "pdf_urls": ["https://arxiv.org/pdf/1812.07851"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Abramo, G., D'Angelo, C.A., Caprasecca, A. (2009). Gender\n  differences in research productivity: a bibliometric analysis of the Italian\n  academic system. Scientometrics, 79(3), 517-539", "categories": "cs.DL"}
{"title": "A heuristic approach to author name disambiguation in bibliometrics\n  databases for large-scale research assessments", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ciriaco Andrea D'Angelo", "Cristiano Giuffrida", "Giovanni Abramo"], "abstract": "  National exercises for the evaluation of research activity by universities\nare becoming regular practice in ever more countries. These exercises have\nmainly been conducted through the application of peer-review methods.\nBibliometrics has not been able to offer a valid large-scale alternative\nbecause of almost overwhelming difficulties in identifying the true author of\neach publication. We will address this problem by presenting a heuristic\napproach to author name disambiguation in bibliometric datasets for large-scale\nresearch assessments. The application proposed concerns the Italian university\nsystem, consisting of 80 universities and a research staff of over 60,000\nscientists. The key advantage of the proposed approach is the ease of\nimplementation. The algorithms are of practical application and have\nconsiderably better scalability and expandability properties than\nstate-of-the-art unsupervised approaches. Moreover, the performance in terms of\nprecision and recall, which can be further improved, seems thoroughly adequate\nfor the typical needs of large-scale bibliometric research assessments.\n", "doi": "10.1002/asi.21460", "arxiv_id": "1812.08538", "pdf_urls": ["https://arxiv.org/pdf/1812.08538"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "D'Angelo, C.A., Giuffrida C., Abramo, G. (2011). A heuristic\n  approach to author name disambiguation in bibliometrics databases for\n  large-scale research assessments. JASIST, 62(2), 257-269", "categories": "cs.DL"}
{"title": "The future of statistical disclosure control", "year": 2018, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mark Elliot and Josep Domingo-Ferrer"], "abstract": "  Statistical disclosure control (SDC) was not created in a single seminal\npaper nor following the invention of a new mathematical technique, rather it\ndeveloped slowly in response to the practical challenges faced by data\npractitioners based at national statistical institutes (NSIs). SDC's subsequent\nemergence as a specialised academic field was an outcome of three interrelated\nsocio-technical changes: (i) the advent of accessible computing as a research\ntool in the 1980s meant that it became possible - and then increasingly easy -\nfor researchers to process larger quantities of data automatically; this\nnaturally increased demand for such data; (ii) it became possible for data\nholders to process and disseminate detailed data as digital files and (iii) the\nnumber of organisations holding data about individuals proliferated. This also\nmeant the number of potential adversaries with the resources to attack any\ngiven dataset increased exponentially. In this article, we describe the state\nof the art for SDC and then discuss the core issues and future challenges. In\nparticular, we touch on SDC and big data, on SDC and machine learning, and on\nSDC and anti-discrimination.\n", "doi": null, "arxiv_id": "1812.09204", "pdf_urls": ["https://arxiv.org/pdf/1812.09204"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Please cite as : Elliot, M. J. & Domingo Ferrer, J. (2018) 'The\n  future of statistical disclosure control'. Paper published as part of The\n  National Statistician's Quality Review. London, December 2018", "categories": "cs.CR"}
{"title": "Long-term optical monitoring of the solar atmosphere in Italy", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S.L. Guglielmino", "I. Ermolli", "P. Romano", "F. Zuccarello", "F. Giorgi", "M.\n  Falco", "R. Piazzesi", "M. Stangalini", "M. Murabito", "M. Ferrucci and A. Mangano"], "abstract": "  Probably, the long-term monitoring of the solar atmosphere started in Italy\nwith the first telescopic observations of the Sun made by Galileo Galilei in\nthe early $17^{\\mathrm{th}}$ century. His recorded observations and science\nresults, as well as the work carried out by other following outstanding Italian\nastronomers inspired the start of institutional programs of regular solar\nobservations at the Arcetri, Catania, and Rome Observatories. These programs\nhave accumulated daily images of the solar photosphere and chromosphere taken\nat various spectral bands over a time span greater than 80 years. In the last\ntwo decades, regular solar observations were continued with digital cameras\nonly at the Catania and Rome Observatories, which are now part of the INAF\nNational Institute for Astrophysics. At the two sites, daily solar images are\ntaken at the photospheric G-band, Blue ($\\lambda=409.4$ nm), and Red\n($\\lambda=606.9$ nm) continua spectral ranges and at the chromospheric Ca II K\nand H$\\alpha$ lines, with a $2^{\\prime\\prime}$ spatial resolution. Solar\nobservation in Italy, which benefits from over 2500 hours of yearly sunshine,\ncurrently aims at the operational monitoring of solar activity and long-term\nvariability and at the continuation of the historical series as well. Existing\ninstruments will be soon enriched by the SAMM double channel telescope equipped\nwith magneto-optical filters that will enable the tomography of the solar\natmosphere with simultaneous observations at the K I 769.9 nm and Na I D 589.0\nnm lines. In this contribution, we present the available observations and\noutline their scientific relevance.\n", "doi": "10.1017/s1743921318001138", "arxiv_id": "1901.01050", "pdf_urls": ["https://arxiv.org/pdf/1901.01050"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Volume 13, Symposium S340 (Long-term Datasets for the\n  Understanding of Solar and Stellar Magnetic Cycles), pp. 251-254, 2018", "categories": "astro-ph.SR"}
{"title": "A compact experimental machine for studying tunable Bose-Bose superfluid\n  mixtures", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["P. C. M. Castilho", "E. Pedrozo-Pe\\~nafiel", "E. M. Gutierrez", "P. L. Mazo", "G. Roati", "K. M. Farias", "V. S. Bagnato"], "abstract": "  We present a compact and versatile experimental system for producing\nBose-Bose superfluid mixtures composed of sodium and potassium atoms. The\ncompact design combines the necessary ultra-high vacuum enviroment for\nultracold atom experiments with efficient atomic fluxes by using\ntwo-dimensional magneto-optical traps as independent source of atoms. We\ndemonstrate the performance of this new machine by producing a Bose-Einstein\ncondensate of $^{23}$Na with $\\sim 1 \\times 10^{6}~$atoms. The tunability of\nNa-K bosonic mixtures is particularly interesting for studies regarding the\nnucleation of vortices and quantum turbulence. In this direction, the large\noptical access of the science chamber along the vertical direction provides the\nconditions to implement high resolution optical setups for imaging and rotating\nthe condensate with a stirring beam. We show the nucleation of a vortex lattice\nwith up to 14 vortices in the $^{23}$Na BEC, attesting the efficiency of the\nexperimental apparatus in studying the dynamics of vortices.\n", "doi": "10.1088/1612-202x/ab00fb", "arxiv_id": "1901.01089", "pdf_urls": ["https://arxiv.org/pdf/1901.01089"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 16, 035501 (2019)", "categories": "cond-mat.quant-gas physics.atom-ph"}
{"title": "Uso de gestos-como recurso-mediador-por un profesor de bachillerato para\n  enfrentar un desaf{\\'i}o did{\\'a}ctico no previsto por {\\'e}l", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ulises Salinas-Hern\\'andez", "Luc Trouche (EA S2HEP)"], "abstract": "  In this article, we report how a high school teacher (levels 10-12) used\ngestures when facing a classroom situation not foreseen by him. The use of\ngestures took place during the interaction with three students around the\nanalysis of the movement of an object in free fall. A qualitative analysis of\nthe data was carried out from a conceptual framework that coordinates elements\nof three theoretical approaches: documentational approach to didactics,\nactivity theory and historical epistemology. The data collection was carried\nout by videotaping the teacher-student interaction while the meaning production\nprocess about the movement of an object in free fall took place. We consider\nthat the analysis of results shows that the coordination of gestures is, on the\none hand, a semiotic resource that should be considered relevant in the\nteachers' resources system; and on the other hand, represents in itself, a way\nof visualizing the cognitive structure that guides the actions of the teacher.\n", "doi": null, "arxiv_id": "1901.02373", "pdf_urls": ["https://arxiv.org/pdf/1901.02373"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Union, Revista ibero-americana de educaci{\\'o}n matem{\\'a}tica,,\n  Pontif{\\'i}cia Universidade Cat{\\'o}lica de S{\\~a}o Paulo, Brasil, 2018, 54,\n  pp.6-24. http://asenmacformacion.com/ojs/index.php/union/article/view/369", "categories": "math.HO"}
{"title": "Influence of a dark-soliton on the reflection of a Bose-Einstein\n  condensate by a square barrier", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qiao-Ling Cheng", "Wen-Kai Bai", "Yao-Zhong Zhang", "Bo Xiong", "Tao Yang"], "abstract": "  We study the quantum reflection of a two-dimensional disk-shaped\nBose-Einstein condensate with a dark-soliton excitation by a square potential\nbarrier. For the giving geometry, the dark-soliton initially located at the\ncentre of the condensate cloud survive long enough for investigating the\nreflection process. We show the time evolution of the reflection probability\nwith respect to various width of the barrier. The asymptotic value of the\nreflection probability is decreased by the existence of a dark-soliton, and is\nhighly sensitive to the initial orientation of the dark-soliton which also\naffects the excitation properties during the process of condensate and barrier\ninteraction.\n", "doi": "10.1088/1555-6611/aaea78", "arxiv_id": "1901.04294", "pdf_urls": ["https://arxiv.org/pdf/1901.04294"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics, 29 (2019) 015501", "categories": "cond-mat.quant-gas quant-ph"}
{"title": "Optimality Criteria for Probabilistic Numerical Methods", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chris. J. Oates", "Jon Cockayne", "Dennis Prangle", "T.J. Sullivan", "Mark\n  Girolami"], "abstract": "  It is well understood that Bayesian decision theory and average case analysis\nare essentially identical. However, if one is interested in performing\nuncertainty quantification for a numerical task, it can be argued that standard\napproaches from the decision-theoretic framework are neither appropriate nor\nsufficient. Instead, we consider a particular optimality criterion from\nBayesian experimental design and study its implied optimal information in the\nnumerical context. This information is demonstrated to differ, in general, from\nthe information that would be used in an average-case-optimal numerical method.\nThe explicit connection to Bayesian experimental design suggests several\ndistinct regimes in which optimal probabilistic numerical methods can be\ndeveloped.\n", "doi": "10.1515/9783110635461-005", "arxiv_id": "1901.04326", "pdf_urls": ["https://arxiv.org/pdf/1901.04326"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Multivariate Algorithms and Information-Based Complexity, Radon\n  Series on Computational and Applied Mathematics 27:65--88, 2020", "categories": "stat.ME"}
{"title": "Signal reconstruction in diffusion-based molecular communication", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Baris Atakan and Fatih Gulec"], "abstract": "  Molecular Communication (MC) is an important nanoscale communication\nparadigm, which is employed for the interconnection of the nanomachines (NMs)\nto form nanonetworks. A transmitter NM (TN) sends the information symbols by\nemitting molecules into the transmission medium and a receiver NM (RN) receives\nthe information symbols by sensing the molecule concentration. In this paper, a\nmodel of how a RN measures and reconstructs the molecular signal is proposed.\nThe signal around the RN is assumed to be a Gaussian random process instead of\ndeterministic approach in a more realistic way. After the reconstructed signal\nis derived as a Doubly Stochastic Poisson Process (DSPP), the distortion\nbetween the signal around the RN and the reconstructed signal is derived as a\nnew performance parameter in MC systems. The derived distortion which is a\nfunction of system parameters such as RN radius, sampling period and the\ndiffusion coefficient of the channel, is shown to be valid by employing random\nwalk simulations. Then, it is shown that the original signal can be\nsatisfactorily reconstructed with a sufficiently low-level of distortion.\nFinally, optimum RN design parameters, namely RN radius, sampling period and\nsampling frequency, are derived by minimizing the signal distortion. The\nsimulation results reveal that there is a trade-off among the RN design\nparameters which can be jointly set for a desired signal distortion.\n", "doi": "10.1002/ett.3699", "arxiv_id": "1901.11240", "pdf_urls": ["https://arxiv.org/pdf/1901.11240"], "github": ["https://github.com/fatihguelec/Signal-Reconstruction-in-Diffusion-based-Molecular-Communication"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "B. Atakan and F. Gulec, Signal reconstruction in diffusion-based\n  molecular communication, Trans. on Emerg. Telecommun. Technol., vol. 30, no.\n  12, e3699, 2019", "categories": "eess.SP cs.ET"}
{"title": "Standard Magnetic Field Production at Huairou Solar Observing Station", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Suo Liu", "Ganghua Lin", "Xiao Yang", "Xiaofan Wang", "Jiangtao Su", "Yuanyong\n  Deng"], "abstract": "  The regular solar observations are operated at Huairou Solar Observing\nStation (HSOS) since 1987, which make the construction of long-term magnetic\nfield datasets available to understand solar magnetic field and cycles. There\nexist some inconveniences for solar physicist to use these data, because the\ndata storage medium and format at HSOS experienced some changes. Additionally,\nthe processes of magnetic field calibration are not easy to deal with for who\nare not familiar with these data. Here shows that the magnetic field of HSOS\nare further processed toward international standards, in order to explore HSOS\nobservations data for scientific research.\n", "doi": "10.1017/s1743921318001333", "arxiv_id": "1902.00344", "pdf_urls": ["https://arxiv.org/pdf/1902.00344"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Long-Term Datasets for the Understanding of Solar and Stellar\n  Magnetic Cycles Proceedings IAU Symposium No. 340, 2018", "categories": "astro-ph.SR"}
{"title": "Color imaging through the scattering media based on phase retrieval with\n  triple correlation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lei Zhu", "Yuxiang Wu", "Jietao Liu", "Tengfei Wu", "Lixian Liu and Xiaopeng\n  Shao"], "abstract": "  Light passing through scattering media will be strongly scattered and\ndiffused into complex speckle pattern, which however contains almost all the\nspatial information and color information of the objects. Although various\ntechnologies have been proposed to realize color imaging through the scattering\nmedia, current technologies are still complex with long sequence of measurement\nfor each imaging pixel or spectral point spread functions of optical system.\nHere we theoretically prove the spatial averaging of triple correlation\ntechnique can be used to retrieve the Fourier phase of object, and\nexperimentally demonstrate it can be applied in color imaging through\nscattering media. Compared to other phase retrieval techniques, the phase\nretrieval with triple correlation technique can retain the orientation\ninformation of objects, and can composite color image without rotation\noperation. Furthermore, our approach has the potential of realizing spectral\nimaging through scattering media.\n", "doi": "10.1016/j.optlaseng.2019.105796", "arxiv_id": "1902.00379", "pdf_urls": ["https://arxiv.org/pdf/1902.00379"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering 124 (2020) 105796", "categories": "eess.IV"}
{"title": "A Manually-Curated Dataset of Fixes to Vulnerabilities of Open-Source\n  Software", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Serena E. Ponta", "Henrik Plate", "Antonino Sabetta", "Michele Bezzi", "C\\'edric Dangremont"], "abstract": "  Advancing our understanding of software vulnerabilities, automating their\nidentification, the analysis of their impact, and ultimately their mitigation\nis necessary to enable the development of software that is more secure. While\noperating a vulnerability assessment tool that we developed and that is\ncurrently used by hundreds of development units at SAP, we manually collected\nand curated a dataset of vulnerabilities of open-source software and the\ncommits fixing them. The data was obtained both from the National Vulnerability\nDatabase (NVD) and from project-specific Web resources that we monitor on a\ncontinuous basis. From that data, we extracted a dataset that maps 624 publicly\ndisclosed vulnerabilities affecting 205 distinct open-source Java projects,\nused in SAP products or internal tools, onto the 1282 commits that fix them.\nOut of 624 vulnerabilities, 29 do not have a CVE identifier at all and 46,\nwhich do have a CVE identifier assigned by a numbering authority, are not\navailable in the NVD yet. The dataset is released under an open-source license,\ntogether with supporting scripts that allow researchers to automatically\nretrieve the actual content of the commits from the corresponding repositories\nand to augment the attributes available for each instance. Also, these scripts\nallow to complement the dataset with additional instances that are not security\nfixes (which is useful, for example, in machine learning applications). Our\ndataset has been successfully used to train classifiers that could\nautomatically identify security-relevant commits in code repositories. The\nrelease of this dataset and the supporting code as open-source will allow\nfuture research to be based on data of industrial relevance; also, it\nrepresents a concrete step towards making the maintenance of this dataset a\nshared effort involving open-source communities, academia, and the industry.\n", "doi": "10.1109/msr.2019.0006", "arxiv_id": "1902.02595", "pdf_urls": ["https://arxiv.org/pdf/1902.02595"], "github": ["https://github.com/copernico/msr2019", "https://github.com/SAP/vulnerability-assessment-kb"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of The 16th International Conference on Mining\n  Software Repositories (Data Showcase track), 2019", "categories": "cs.SE cs.CR cs.LG"}
{"title": "Approaching the ultimate capacity limit in deep-space optical\n  communication", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Konrad Banaszek and Ludwig Kunz and Marcin Jarzyna and Micha{\\l}\n  Jachura"], "abstract": "  The information capacity of an optical channel under power constraints is\nultimately limited by the quantum nature of transmitted signals. We discuss\ncurrently available and emerging photonic technologies whose combination can be\nshown theoretically to enable nearly quantum-limited operation of a noisy\noptical communication link in the photon-starved regime, with the information\nrate scaling linearly in the detected signal power. The key ingredients are\nquantum pulse gating to facilitate mode selectivity, photon-number-resolved\ndirect detection, and a photon-efficient high-order modulation format such as\npulse position modulation, frequency shift keying, or binary phase shift keyed\nHadamard words decoded optically using structured receivers.\n", "doi": "10.1117/12.2506963", "arxiv_id": "1902.03654", "pdf_urls": ["https://arxiv.org/pdf/1902.03654"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 10910, Free-Space Laser Communication and Atmospheric\n  Propagation XXXI, 109100A (4 March 2019)", "categories": "quant-ph physics.optics"}
{"title": "Giant Negative Thermal Expansion Induced by the Synergistic Effects of\n  Ferroelectrostriction and Spin-Crossover in PbTiO3-Based Perovskites", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhao Pan", "Jun Chen", "Runze Yu", "Lokanath Patra", "Ponniah Ravindran", "Andrea Sanson", "Ruggero Milazzo", "Alberto Carnera", "Lei Hu", "Hajime Yamamoto", "Yang Ren", "Qingzhen Huang", "Yuki Sakai", "Takumi Nishikubo", "Takahiro Ogata", "Xian\n  Fan", "Yawei Li", "Guangqiang Li", "Hajime Hojo", "Masaki Azuma", "and Xianran Xing"], "abstract": "  The discovery of unusual negative thermal expansion (NTE) provides the\nopportunity to control the common but much desired property of thermal\nexpansion, which is valuable not only in scientific interests but also in\npractical applications. However, most of the available NTE materials are\nlimited to a narrow temperature range, and the NTE effect is generally weakened\nby means of various modifications. Here, we report an enhanced NTE effect that\noccurs over a wide temperature range (\\alpha V = -5.24 * 10-5 {\\deg}C^-1,\n25-575 {\\deg} C), and this NTE effect is accompanied by an abnormal enhanced\ntetragonality, a large spontaneous polarization, and a G-type antiferromagnetic\nordering in the present perovskite-type ferroelectric of (1-x)PbTiO3-xBiCoO3.\nSpecifically, for the composition of 0.5PbTiO3-0.5BiCoO3, an extensive\nvolumetric contraction of ~4.8 % has been observed near the Curie temperature\nof 700 {\\deg}C, which represents the highest level in PbTiO3-based\nferroelectrics. According to our experimental and theoretical results, the\ngiant NTE originates from a synergistic effect of the ferroelectrostriction and\nspin-crossover of cobalt on the crystal lattice. The actual NTE mechanism is\ncontrasted with previous functional NTE materials, in which the NTE is simply\ncoupled with one ordering such as electronic, magnetic, or ferroelectric\nordering. The present study sheds light on the understanding of NTE mechanisms\nand it attests that NTE could be simultaneouslycoupled with different\norderings, which will pave a new way toward the design of large NTE materials.\n", "doi": "10.1021/acs.chemmater.8b04266", "arxiv_id": "1902.04757", "pdf_urls": ["https://arxiv.org/pdf/1902.04757"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Giant Negative Thermal Expansion Induced by the Synergistic\n  Effects of Ferroelectrostriction and Spin-Crossover in PbTiO3-Based\n  Perovskites. Chemistry of Materials. (2019)", "categories": "cond-mat.mtrl-sci"}
{"title": "Properties of Finite Amplitude Electromagnetic Waves propagating in the\n  Quantum Vacuum", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hedvika Kadlecov\\'a", "Sergei V. Bulanov", "Georg Korn"], "abstract": "  We study two counter-propagating electromagnetic waves in the vacuum within\nthe framework of the Heisenberg-Euler formalism in quantum electrodynamics. We\nshow that the non-linear field equations decouple for ordinary wave case and\ncan be solved exactly. We solve the non-linear field equations assuming the\nsolution in a form of a Riemann wave. We discuss the properties of the\nnonlinear electromagnetic wave propagating in the quantum vacuum, such as the\nwave steepening, subsequent generation of high order harmonics and\nelectromagnetic shock wave formation with electron-positron pair generation at\nthe shock wave front.\n", "doi": "10.1088/1361-6587/ab21fb", "arxiv_id": "1902.04928", "pdf_urls": ["https://arxiv.org/pdf/1902.04928"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Special issue on high field laser-plasma interactions, Plasma\n  Physics and Controlled Fusion, Volume 61, Number 8, 2019", "categories": "physics.plasm-ph hep-th"}
{"title": "The \"glass transition'' as a topological defect driven transition in a\n  distribution of crystals and a prediction of a universal viscosity collapse", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Z. Nussinov", "N. B. Weingartner", "F. S. Nogueira"], "abstract": "  Topological defects are typically quantified relative to ordered backgrounds.\nThe importance of these defects to the understanding of physical phenomena\nincluding diverse equilibrium melting transitions from low temperature ordered\nto higher temperatures disordered systems (and vice versa) can hardly be\noverstated. Amorphous materials such as glasses seem to constitute a\nfundamental challenge to this paradigm. A long held dogma is that transitions\ninto and out of an amorphous glassy state are distinctly different from typical\nequilibrium phase transitions and must call for radically different concepts.\nIn this work, we critique this belief. We examine systems that may be viewed as\nsimultaneous distribution of different ordinary equilibrium structures. In\nparticular, we focus on the analogs of melting (or freezing) transitions in\nsuch distributed systems. The theory that we arrive at yields dynamical,\nstructural, and thermodynamic behaviors of glasses and supercooled fluids that,\nfor the properties tested thus far, are in qualitative and quantitative\nagreement with experiment. We arrive at a prediction for the viscosity and\ndielectric relaxations that is universally satisfied for all experimentally\nmeasured supercooled liquids and glasses over 15 decades.\n", "doi": null, "arxiv_id": "1902.06593", "pdf_urls": ["https://arxiv.org/pdf/1902.06593"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Chapter 6 (pp. 61-79) in the book \"Topological Phase Transitions\n  and New Developments\", Eds. L. Brink, M. Gunn, J. V. Jose, J. M. Kosterlitz,\n  and K. K. Phua, World Scientific (2019), (electronic version- September 2018)", "categories": "cond-mat.stat-mech cond-mat.mtrl-sci"}
{"title": "Pulsing mechanism based on power adiabatic evolution of pump in Tm-doped\n  fiber laser", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fuyong Wang"], "abstract": "  We prove an alternative pulsing mechanism based on power adiabatic evolution\nof pump in Tm-doped fiber laser. A pulsed laser technique, unlike Q-switching\nand gain-switching, is explored under the equilibrium between the stimulated\nemission and absorption. After the laser reaching a CW steady state, the\ntemporal fluctuation of pump power is called power adiabatic evolution if it\ndoes not break the balance between the stimulated emission and the absorption.\nUnder the pump power adiabatic evolution the population densities in the upper\nand lower laser levels get clamped to their steady-state values, and the\ntemporal shape of output laser is identical with that of pump. Based on the\npower adiabatic evolution of pump a laser pulse can therefore be generated by a\npulsed pump which is added to a CW pump. Moreover, the temporal profile,\nduration and peak power of the laser pulse can all be precisely controlled.\nPower adiabatic evolution of pump can be achieved in the three pumping shemes\nof Tm-doped fiber laser, provided that the duration of pump pulse is broader\nthan a certain value. The study on the pulsing mechanism highlights an\nalternative pulsed technique possessing several advantages over Q-switching and\ngain-switching.\n", "doi": "10.1088/1555-6611/ab543c", "arxiv_id": "1902.06618", "pdf_urls": ["https://arxiv.org/pdf/1902.06618"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 30 (2020) 015102 (9pp)", "categories": "physics.optics"}
{"title": "Sequential Learning over Implicit Feedback for Robust Large-Scale\n  Recommender Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alexandra Burashnikova", "Yury Maximov and Massih-Reza Amini"], "abstract": "  In this paper, we propose a robust sequential learning strategy for training\nlarge-scale Recommender Systems (RS) over implicit feedback mainly in the form\nof clicks. Our approach relies on the minimization of a pairwise ranking loss\nover blocks of consecutive items constituted by a sequence of non-clicked items\nfollowed by a clicked one for each user. Parameter updates are discarded if for\na given user the number of sequential blocks is below or above some given\nthresholds estimated over the distribution of the number of blocks in the\ntraining set. This is to prevent from an abnormal number of clicks over some\ntargeted items, mainly due to bots; or very few user interactions. Both\nscenarios affect the decision of RS and imply a shift over the distribution of\nitems that are shown to the users. We provide a theoretical analysis showing\nthat in the case where the ranking loss is convex, the deviation between the\nloss with respect to the sequence of weights found by the proposed algorithm\nand its minimum is bounded. Furthermore, experimental results on five\nlarge-scale collections demonstrate the efficiency of the proposed algorithm\nwith respect to the state-of-the-art approaches, both regarding different\nranking measures and computation time.\n", "doi": "10.1007/978-3-030-46133-1_16", "arxiv_id": "1902.08495", "pdf_urls": ["https://arxiv.org/pdf/1902.08495"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ECML PKDD 2019: Machine Learning and Knowledge Discovery in\n  Databases pp 253-269", "categories": "cs.IR cs.LG stat.ML"}
{"title": "Stimulated low-frequency Raman scattering in albumin", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M.A. Shevchenko", "L.L. Chaikov", "M.N. Kirichenko", "A.D. Kudryavtseva", "T.V. Mironova", "V.I. Savichev", "V.V. Sokovishin", "N.V. Tcherniega", "K.I. Zemskov"], "abstract": "  Stimulated low-frequency Raman scattering can give essential information\nabout the elastic properties of different nanoparticles systems, in particular,\nbiological nanostructures. In the present study, low-frequency vibrational\nmodes in human and bovine serum albumin were for the first time investigated\nusing stimulated low-frequency Raman scattering. Stimulated low-frequency Raman\nscattering frequency shifts, corresponding to acoustic eigenfrequencies of the\nsample, were registered by Fabri-Perot interferometers. Conversion efficiency,\nthreshold and set of eigenfrequencies were also measured. Stimulated\nlow-frequency Raman scattering can be applied for biological objects\nidentification and impact on them.\n", "doi": "10.1007/s10946-019-09771-x", "arxiv_id": "1902.10456", "pdf_urls": ["https://arxiv.org/pdf/1902.10456"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, Volume 40, Number 1, January,\n  2019", "categories": "physics.bio-ph"}
{"title": "Phase-field modeling of fracture for quasi-brittle materials", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jacinto Ulloa", "Patricio Rodr\\'iguez", "Crist\\'obal Samaniego", "Esteban\n  Samaniego"], "abstract": "  This paper addresses the modeling of fracture in quasi-brittle materials\nusing a phase-field approach to the description of crack topology. Within the\ncomputational mechanics community, several studies have treated the issue of\nmodeling fracture using phase fields. Most of these studies have used an\napproach that implies the lack of a damage threshold. We herein explore an\nalternative model that includes a damage threshold and study how it compares\nwith the most popular approach. The formulation is systematically explained\nwithin a rigorous variational framework. Subsequently, we present the\ncorresponding three-dimensional finite element discretization that leads to a\nstraightforward numerical implementation. Benchmark simulations in two\ndimensions and three dimensions are then presented. The results show that while\nan elastic stage and a damage threshold are ensured by the present model, good\nagreement with the results reported in the literature can be obtained, where\nsuch features are generally absent.\n", "doi": "10.1016/j.undsp.2018.08.002", "arxiv_id": "1902.10759", "pdf_urls": ["https://arxiv.org/pdf/1902.10759"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Ulloa, J., Rodr\\'iguez, P., Samaniego, C., & Samaniego, E. (2018).\n  Phase-field modeling of fracture for quasi-brittle materials. Underground\n  Space", "categories": "cs.CE"}
{"title": "Ultrathin, polarization-independent, and focus-tunable liquid crystal\n  diffractive lens for augmented reality", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mareddi Bharath Kumar", "Daekyung Kang", "Jihoon Jung", "Hongsik Park", "Joonku Hahn", "Muhan Choi", "Jin-Hyuk Bae", "Hyunmin Kim", "Jonghoo Park"], "abstract": "  Despite the recent advances in augmented reality (AR), which has shown the\npotential to significantly impact on our daily lives by offering a new way to\nmanipulate and interact with virtual information, minimizing visual discomfort\ndue to the vergence-accommodation conflict remains a challenge. Emerging AR\ntechnologies often exploit focus-tunable optics to address this problem.\nAlthough they demonstrated improved depth perception by enabling proper focus\ncues, a bulky form factor of focus-tunable optics prevents their use in the\nform of a pair of eyeglasses. Herein, we describe an ultrathin, focus-tunable\nliquid crystal (LC) diffractive lens with a large aperture, a low weight, and a\nlow operating voltage. In addition, we show that the polarization dependence of\nthe lens, which is an inherent optical property of LC lenses, can be eliminated\nusing birefringent thin films as substrates and by aligning the optical axes of\nthe birefringent substrates and LC at a specific angle. The polarization\nindependence eliminates the need for a polarizer, thus further reducing the\nform factor of the optical system. Next, we demonstrate a prototype of AR\nglasses with addressable focal planes using the ultrathin lens. The prototype\nAR glasses can adjust the accommodation distance of the virtual image,\nmitigating the vergence-accommodation conflict without substantially\ncompromising the form factor or image quality. This research on ultrathin lens\ntechnology shows promising potential for developing compact optical displays in\nvarious applications.\n", "doi": "10.1016/j.optlaseng.2020.106006", "arxiv_id": "1902.10889", "pdf_urls": ["https://arxiv.org/pdf/1902.10889"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering, Volume 128, May 2020, 106006", "categories": "physics.optics physics.app-ph"}
{"title": "Efficient Dense Frontier Detection for 2D Graph SLAM Based on Occupancy\n  Grid Submaps", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Juraj Or\\v{s}uli\\'c", "Damjan Mikli\\'c", "Zdenko Kova\\v{c}i\\'c"], "abstract": "  In autonomous robot exploration, the frontier is the border in the world map\nbetween the explored space and unexplored space. The frontier plays an\nimportant role when deciding where in the environment the robots should go\nexplore next. We examine a modular control system pipeline for autonomous\nexploration where a 2D graph SLAM algorithm based on occupancy grid submaps\nperforms map building and localization. We provide an overview of the state of\nthe art in frontier detection and the relevant SLAM concepts and propose a\nspecialized frontier detection method which is efficiently constrained to\nactive submaps, yet robust to SLAM loop closures.\n", "doi": "10.1109/lra.2019.2928203", "arxiv_id": "1902.11061", "pdf_urls": ["https://arxiv.org/pdf/1902.11061"], "github": ["https://github.com/larics/cartographer_frontier_detection"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Orsulic, D. Miklic and Z. Kovacic, \"Efficient Dense Frontier\n  Detection for 2D Graph SLAM Based on Occupancy Grid Submaps,\" in IEEE\n  Robotics and Automation Letters, 2019", "categories": "cs.RO eess.IV"}
{"title": "MVC-3D: Adaptive Design Pattern for Virtual and Augmented Reality\n  Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Samir Benbelkacem (CDTA)", "Djamel Aouam", "Nadia Zenati-Henda", "Abdelkader\n  Bellarbi (CDTA)", "Ahmed Bouhena", "Samir Otmane"], "abstract": "  In this paper, we present MVC-3D design pattern to develop virtual and\naugmented (or mixed) reality interfaces that use new types of sensors,\nmodalities and implement specific algorithms and simulation models. The\nproposed pattern represents the extension of classic MVC pattern by enriching\nthe View component (interactive View) and adding a specific component\n(Library). The results obtained on the development of augmented reality\ninterfaces showed that the complexity of M, iV and C components is reduced. The\ncomplexity increases only on the Library component (L). This helps the\nprogrammers to well structure their models even if the interface complexity\nincreases. The proposed design pattern is also used in a design process called\nMVC-3D in the loop that enables a seamless evolution from initial prototype to\nthe final system.\n", "doi": null, "arxiv_id": "1903.00185", "pdf_urls": ["https://arxiv.org/pdf/1903.00185"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Conference on Advanced Aspects of Software\n  Engineering ICAASE'18, Dec 2018, Constantine, Algeria", "categories": "cs.HC cs.SE"}
{"title": "Two-phase protein folding optimization on a three-dimensional AB\n  off-lattice model", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Borko Bo\\v{s}kovi\\'c and Janez Brest"], "abstract": "  This paper presents a two-phase protein folding optimization on a\nthree-dimensional AB off-lattice model. The first phase is responsible for\nforming conformations with a good hydrophobic core or a set of compact\nhydrophobic amino acid positions. These conformations are forwarded to the\nsecond phase, where an accurate search is performed with the aim of locating\nconformations with the best energy value. The optimization process switches\nbetween these two phases until the stopping condition is satisfied. An\nauxiliary fitness function was designed for the first phase, while the original\nfitness function is used in the second phase. The auxiliary fitness function\nincludes an expression about the quality of the hydrophobic core. This\nexpression is crucial for leading the search process to the promising solutions\nthat have a good hydrophobic core and, consequently, improves the efficiency of\nthe whole optimization process. Our differential evolution algorithm was used\nfor demonstrating the efficiency of two-phase optimization. It was analyzed on\nwell-known amino acid sequences that are used frequently in the literature. The\nobtained experimental results show that the employed two-phase optimization\nimproves the efficiency of our algorithm significantly and that the proposed\nalgorithm is superior to other state-of-the-art algorithms.\n", "doi": "10.1016/j.swevo.2020.100708", "arxiv_id": "1903.01456", "pdf_urls": ["https://arxiv.org/pdf/1903.01456"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Borko Bo\\v{s}kovi\\'c, Janez Brest. Two-phase protein folding\n  optimization on a three-dimensional AB off-lattice model. Swarm and\n  Evolutionary Computation, 2020, vol. 57, pp. 100708", "categories": "cs.NE physics.comp-ph"}
{"title": "Photon number and optical tomograms for Gaussian states", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["O.V.Man'ko and V.I.Man'ko"], "abstract": "  A review of probability representation of quantum states in given for optical\nand photon number tomography approaches. Explicit connection of photon number\ntomogram with measurable by homodyne detector optical tomogram is obtained. New\nintegral relations connecting Hermite polynomials of two variables with\nLaguerre polynomials are found. Examples of generic Gaussian photon states\n(squeezed and correlated states) are studied in detail.\n", "doi": "10.1134/s1054660x09150286", "arxiv_id": "1903.02304", "pdf_urls": ["https://arxiv.org/pdf/1903.02304"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. (2009) 19: 1804", "categories": "quant-ph"}
{"title": "Photon-number tomography of multimode states and positivity of the\n  density matrix", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Olga Man'ko", "and V. I. Man'ko"], "abstract": "  For one-mode and multimode light, the photon-number tomograms of Gaussian\nquantum states are explicitly calculated in terms of multivariable Hermite\npolynomials. Positivity of the tomograms is shown to be necessary condition for\npositivity of the density matrix.\n", "doi": "10.1023/a:1025876210639", "arxiv_id": "1903.02310", "pdf_urls": ["https://arxiv.org/pdf/1903.02310"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research (2003) 24: 497", "categories": "quant-ph"}
{"title": "The filamented electron bunch of the bubble regime", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lars Reichwein", "Johannes Thomas", "Alexander Pukhov"], "abstract": "  We present a theory for describing the inner structure of the electron bunch\nin the bubble regime starting from a random distribution of electrons inside\nthe bubble and subsequently minimizing the system's energy. Consequently, we\nfind a filament-like structure in the direction of propagation that is\nsurrounded by various shells consisting of further electrons. If we specify a\n2D initial structure, we observe a hexagonal structure for a high number of\nparticles, corresponding to the close-packing of spheres in two dimensions. The\ntwo-dimensional structures are in agreement with the equilibrium slice model\n(ESM).\n", "doi": "10.1017/s0263034620000130", "arxiv_id": "1903.04858", "pdf_urls": ["https://arxiv.org/pdf/1903.04858"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Part. Beams 38 (2020) 121-127", "categories": "physics.plasm-ph"}
{"title": "Effect of Anisotropy on Defect Mode Peculiariries in Chiral Liquid\n  Crystals", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.H. Gevorgyan", "K. B. Oganesyan"], "abstract": "  The effect of anisotropy on defect mode peculiarities in cholesteric liquid\ncrystals is investigated. The problem is solved by Ambartsumians layer addition\nmodified method. Two cases are considered. In the first case, it is assumed\nthat the defect layer is not absorbing and the effect of refraction anisotropy\non the reflection, relative photonic density of states and the total field\nintensity aroused in the defect layer are studied . In the second case, defect\nlayer is assumed to be isotropic for refraction and anisotropic for absorption,\nand the influence of defect layer absorption anisotropy on reflection,\nabsorption, relative photonic density of states and the total field intensity\naroused in the defect layer are investigated.\n", "doi": "10.1088/1612-202x/aa930c", "arxiv_id": "1903.04924", "pdf_urls": ["https://arxiv.org/pdf/1903.04924"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters, 15, 016004 (2018)", "categories": "physics.optics"}
{"title": "Is the Stack Distance Between Test Case and Method Correlated With Test\n  Effectiveness?", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rainer Niedermayr and Stefan Wagner"], "abstract": "  Mutation testing is a means to assess the effectiveness of a test suite and\nits outcome is considered more meaningful than code coverage metrics. However,\ndespite several optimizations, mutation testing requires a significant\ncomputational effort and has not been widely adopted in industry. Therefore, we\nstudy in this paper whether test effectiveness can be approximated using a more\nlight-weight approach. We hypothesize that a test case is more likely to detect\nfaults in methods that are close to the test case on the call stack than in\nmethods that the test case accesses indirectly through many other methods.\nBased on this hypothesis, we propose the minimal stack distance between test\ncase and method as a new test measure, which expresses how close any test case\ncomes to a given method, and study its correlation with test effectiveness. We\nconducted an empirical study with 21 open-source projects, which comprise in\ntotal 1.8 million LOC, and show that a correlation exists between stack\ndistance and test effectiveness. The correlation reaches a strength up to 0.58.\nWe further show that a classifier using the minimal stack distance along with\nadditional easily computable measures can predict the mutation testing result\nof a method with 92.9% precision and 93.4% recall. Hence, such a classifier can\nbe taken into consideration as a light-weight alternative to mutation testing\nor as a preceding, less costly step to that.\n", "doi": "10.1145/3319008.3319021", "arxiv_id": "1903.05432", "pdf_urls": ["https://arxiv.org/pdf/1903.05432"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2019 ACM 23rd International Conference on Evaluation and\n  Assessment in Software Engineering (EASE)", "categories": "cs.SE"}
{"title": "Authentication by Witness Functions", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jaouhar Fattahi", "Mohamed Mejri", "Emil Pricop"], "abstract": "  Witness functions have recently been introduced in cryptographic protocols'\nliterature as a new powerful way to prove protocol correctness with respect to\nsecrecy. In this paper, we extend them to the property of authentication. We\nshow how to use them safely and we run an analysis on a modified version of the\nWoo-Lam protocol. We show that it is correct with respect to authentication.\n", "doi": "10.1109/trustcom.2016.0304", "arxiv_id": "1903.05791", "pdf_urls": ["https://arxiv.org/pdf/1903.05791"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Trustcom/BigDataSE/ISPA 2016: 1990-1997", "categories": "cs.CR"}
{"title": "Low-rank Kernel Learning for Graph-based Clustering", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhao Kang", "Liangjian Wen", "Wenyu Chen", "Zenglin Xu"], "abstract": "  Constructing the adjacency graph is fundamental to graph-based clustering.\nGraph learning in kernel space has shown impressive performance on a number of\nbenchmark data sets. However, its performance is largely determined by the\nchosen kernel matrix. To address this issue, the previous multiple kernel\nlearning algorithm has been applied to learn an optimal kernel from a group of\npredefined kernels. This approach might be sensitive to noise and limits the\nrepresentation ability of the consensus kernel. In contrast to existing\nmethods, we propose to learn a low-rank kernel matrix which exploits the\nsimilarity nature of the kernel matrix and seeks an optimal kernel from the\nneighborhood of candidate kernels. By formulating graph construction and kernel\nlearning in a unified framework, the graph and consensus kernel can be\niteratively enhanced by each other. Extensive experimental results validate the\nefficacy of the proposed method.\n", "doi": "10.1016/j.knosys.2018.09.009", "arxiv_id": "1903.05962", "pdf_urls": ["https://arxiv.org/pdf/1903.05962"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 2019", "categories": "cs.LG cs.CV stat.ML"}
{"title": "Mixture Modeling of Global Shape Priors and Autoencoding Local Intensity\n  Priors for Left Atrium Segmentation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tim Sodergren and Riddhish Bhalodia and Ross Whitaker and Joshua Cates\n  and Nassir Marrouche and Shireen Elhabian"], "abstract": "  Difficult image segmentation problems, for instance left atrium MRI, can be\naddressed by incorporating shape priors to find solutions that are consistent\nwith known objects. Nonetheless, a single multivariate Gaussian is not an\nadequate model in cases with significant nonlinear shape variation or where the\nprior distribution is multimodal. Nonparametric density estimation is more\ngeneral, but has a ravenous appetite for training samples and poses serious\nchallenges in optimization, especially in high dimensional spaces. Here, we\npropose a maximum-a-posteriori formulation that relies on a generative image\nmodel by incorporating both local intensity and global shape priors. We use\ndeep autoencoders to capture the complex intensity distribution while avoiding\nthe careful selection of hand-crafted features. We formulate the shape prior as\na mixture of Gaussians and learn the corresponding parameters in a\nhigh-dimensional shape space rather than pre-projecting onto a low-dimensional\nsubspace. In segmentation, we treat the identity of the mixture component as a\nlatent variable and marginalize it within a generalized\nexpectation-maximization framework. We present a conditional maximization-based\nscheme that alternates between a closed-form solution for component-specific\nshape parameters that provides a global update-based optimization strategy, and\nan intensity-based energy minimization that translates the global notion of a\nnonlinear shape prior into a set of local penalties. We demonstrate our\napproach on the left atrial segmentation from gadolinium-enhanced MRI, which is\nuseful in quantifying the atrial geometry in patients with atrial fibrillation.\n", "doi": null, "arxiv_id": "1903.06260", "pdf_urls": ["https://arxiv.org/pdf/1903.06260"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Statistical Atlases and Computational Models of the Heart. Atrial\n  Segmentation and LV Quantification Challenges, 2019, Springer International\n  Publishing, Cham 357--367,", "categories": "cs.CV cs.CG cs.LG stat.ML"}
{"title": "Nanobody interaction unveils structure, dynamics and proteotoxicity of\n  the Finnish-type amyloidogenic gelsolin variant", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Toni Giorgino", "Davide Mattioni", "Amal Hassan", "Mario Milani", "Eloise\n  Mastrangelo", "Alberto Barbiroli", "Adriaan Verhelle", "Jan Gettemans", "Maria Monica\n  Barzago", "Luisa Diomede", "Matteo de Rosa"], "abstract": "  AGel amyloidosis, formerly known as familial amyloidosis of the Finnish-type,\nis caused by pathological aggregation of proteolytic fragments of plasma\ngelsolin. So far, four mutations in the gelsolin gene have been reported as\nresponsible for the disease. Although D187N is the first identified variant and\nthe best characterized, its structure has been hitherto elusive. Exploiting a\nrecently-developed nanobody targeting gelsolin, we were able to stabilize the\nG2 domain of the D187N protein and obtained, for the first time, its\nhigh-resolution crystal structure. In the nanobody-stabilized conformation, the\nmain effect of the D187N substitution is the impairment of the calcium binding\ncapability, leading to a destabilization of the C-terminal tail of G2. However,\nmolecular dynamics simulations show that in the absence of the nanobody,\nD187N-mutated G2 further misfolds, ultimately exposing its hydrophobic core and\nthe furin cleavage site. The nanobody's protective effect is based on the\nenhancement of the thermodynamic stability of different G2 mutants (D187N,\nG167R and N184K). In particular, the nanobody reduces the flexibility of\ndynamic stretches, and most notably decreases the conformational entropy of the\nC-terminal tail, otherwise stabilized by the presence of the Ca2+ ion. A\nCaenorhabditis elegans-based assay was also applied to quantify the proteotoxic\npotential of the mutants and determine whether nanobody stabilization\ntranslates into a biologically relevant effect. Successful protection from G2\ntoxicity in vivo points to the use of C. elegans as a tool for investigating\nthe mechanisms underlying AGel amyloidosis and rapidly screen new therapeutics.\n", "doi": "10.1016/j.bbadis.2019.01.010", "arxiv_id": "1903.07308", "pdf_urls": ["https://arxiv.org/pdf/1903.07308"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Biochimica et Biophysica Acta (BBA) - Molecular Basis of Disease.\n  Volume 1865, Issue 3, 1 March 2019, Pages 648-660", "categories": "q-bio.BM"}
{"title": "SymInfer: Inferring Program Invariants using Symbolic States", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["ThanhVu Nguyen and Matthew B. Dwyer and Willem Visser"], "abstract": "  We introduce a new technique for inferring program invariants that uses\nsymbolic states generated by symbolic execution. Symbolic states, which consist\nof path conditions and constraints on local variables, are a compact\ndescription of sets of concrete program states and they can be used for both\ninvariant inference and invariant verification. Our technique uses a\ncounterexample-based algorithm that creates concrete states from symbolic\nstates, infers candidate invariants from concrete states, and then verifies or\nrefutes candidate invariants using symbolic states. The refutation case\nproduces concrete counterexamples that prevent spurious results and allow the\ntechnique to obtain more precise invariants. This process stops when the\nalgorithm reaches a stable set of invariants.\n  We present SymInfer, a tool that implements these ideas to automatically\ngenerate invariants at arbitrary locations in a Java program. The tool obtains\nsymbolic states from Symbolic PathFinder and uses existing algorithms to infer\ncomplex (potentially nonlinear) numerical invariants. Our preliminary results\nshow that SymInfer is effective in using symbolic states to generate precise\nand useful invariants for proving program safety and analyzing program runtime\ncomplexity. We also show that SymInfer outperforms existing invariant\ngeneration systems.\n", "doi": null, "arxiv_id": "1903.11768", "pdf_urls": ["https://arxiv.org/pdf/1903.11768"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "32nd IEEE/ACM International Conference on Automated Software\n  Engineering (ASE), pages 804--814. IEEE, 2017", "categories": "cs.SE"}
{"title": "Useful Statistical Methods for Human Factors Research in Software\n  Engineering: A Discussion on Validation with Quantitative Data", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lucas Gren and Alfredo Goldman"], "abstract": "  In this paper we describe the usefulness of statistical validation techniques\nfor human factors survey research. We need to investigate a diversity of\nvalidity aspects when creating metrics in human factors research, and we argue\nthat the statistical tests used in other fields to get support for reliability\nand construct validity in surveys, should also be applied to human factors\nresearch in software engineering more often. We also show briefly how such\nmethods can be applied (Test-Retest, Cronbach's {\\alpha}, and Exploratory\nFactor Analysis).\n", "doi": "10.1145/2897586.2897588", "arxiv_id": "1904.02457", "pdf_urls": ["https://arxiv.org/pdf/1904.02457"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "9th International Workshop on Cooperative and Human Aspects of\n  Software Engineering (CHASE), 2016", "categories": "cs.SE"}
{"title": "A fourth explanation to Brooks' Law - The aspect of group developmental\n  psychology", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lucas Gren"], "abstract": "  Brooks' Law is often referred to in practice and states that adding manpower\nto a late software project makes it even later. Brooks' himself gave three\nexplanation only related to concrete task-related issues, like introducing new\nmembers to the work being done, communication overheads, or difficulty dividing\nsome programming tasks. Through a description of group developmental psychology\nwe argue for a fourth explanation to the law by suggesting that the group will\nfall back in its group development when new members are added, resulting in\nrework setting group norms, group goals, defining roles etc. that will also\nchange over time. We show that this fourth explanation is important when trying\nto understanding Brooks' Law, and that adding the group developmental\nperspective might help software development organizations in managing projects.\n", "doi": "10.1109/chase.2017.16", "arxiv_id": "1904.02472", "pdf_urls": ["https://arxiv.org/pdf/1904.02472"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "10th International Workshop on Cooperative and Human Aspects of\n  Software Engineering (CHASE, 2017", "categories": "cs.SE"}
{"title": "Is it Possible to Disregard Obsolete Requirements? - An Initial\n  Experiment on a Potentially New Bias in Software Effort Estimation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lucas Gren", "Richard Berntsson Svensson and Michael Unterkalmsteiner"], "abstract": "  Effort estimation is a complex area in decision-making, and is influenced by\na diversity of factors that could increase the estimation error. The effects on\neffort estimation accuracy of having obsolete requirements in specifications\nhave not yet been studied. This study aims at filling that gap. A total of 150\nstudents were asked to provide effort estimates for different amounts of\nrequirements, and one group was explicitly told to disregard some of the given\nrequirements. The results show that even the extra text instructing\nparticipants to exclude requirements in the estimation task, had the subjects\ngive higher estimates. The effect of having obsolete requirements in\nrequirements specifications and backlogs in software effort estimation is not\ntaken into account enough today, and this study provides empirical evidence\nthat it possibly should. We also suggest different psychological explanations\nto the found effect.\n", "doi": "10.1109/chase.2017.10", "arxiv_id": "1904.02477", "pdf_urls": ["https://arxiv.org/pdf/1904.02477"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "10th International Workshop on Cooperative and Human Aspects of\n  Software Engineering (CHASE), 2017", "categories": "cs.SE"}
{"title": "Bayesian Heatmaps: Probabilistic Classification with Multiple Unreliable\n  Information Sources", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Edwin Simpson", "Steven Reece", "Stephen J. Roberts"], "abstract": "  Unstructured data from diverse sources, such as social media and aerial\nimagery, can provide valuable up-to-date information for intelligent situation\nassessment. Mining these different information sources could bring major\nbenefits to applications such as situation awareness in disaster zones and\nmapping the spread of diseases. Such applications depend on classifying the\nsituation across a region of interest, which can be depicted as a spatial\n\"heatmap\". Annotating unstructured data using crowdsourcing or automated\nclassifiers produces individual classifications at sparse locations that\ntypically contain many errors. We propose a novel Bayesian approach that models\nthe relevance, error rates and bias of each information source, enabling us to\nlearn a spatial Gaussian Process classifier by aggregating data from multiple\nsources with varying reliability and relevance. Our method does not require\ngold-labelled data and can make predictions at any location in an area of\ninterest given only sparse observations. We show empirically that our approach\ncan handle noisy and biased data sources, and that simultaneously inferring\nreliability and transferring information between neighbouring reports leads to\nmore accurate predictions. We demonstrate our method on two real-world problems\nfrom disaster response, showing how our approach reduces the amount of\ncrowdsourced data required and can be used to generate valuable heatmap\nvisualisations from SMS messages and satellite images.\n", "doi": null, "arxiv_id": "1904.03063", "pdf_urls": ["https://arxiv.org/pdf/1904.03063"], "github": ["https://github.com/OxfordML/heatmap_expts"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Joint European Conference on Machine Learning and Knowledge\n  Discovery in Databases (2017), pp. 109-125, Springer, Cham", "categories": "cs.LG stat.ML"}
{"title": "ReinBo: Machine Learning pipeline search and configuration with Bayesian\n  Optimization embedded Reinforcement Learning", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xudong Sun", "Jiali Lin", "Bernd Bischl"], "abstract": "  Machine learning pipeline potentially consists of several stages of\noperations like data preprocessing, feature engineering and machine learning\nmodel training. Each operation has a set of hyper-parameters, which can become\nirrelevant for the pipeline when the operation is not selected. This gives rise\nto a hierarchical conditional hyper-parameter space. To optimize this mixed\ncontinuous and discrete conditional hierarchical hyper-parameter space, we\npropose an efficient pipeline search and configuration algorithm which combines\nthe power of Reinforcement Learning and Bayesian Optimization. Empirical\nresults show that our method performs favorably compared to state of the art\nmethods like Auto-sklearn , TPOT, Tree Parzen Window, and Random Search.\n", "doi": null, "arxiv_id": "1904.05381", "pdf_urls": ["https://arxiv.org/pdf/1904.05381"], "github": ["https://github.com/smilesun/reinbo"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ECML PKDD 2019: Machine Learning and Knowledge Discovery in\n  Databases pp 68-84", "categories": "cs.LG cs.AI stat.ML"}
{"title": "The links between agile practices, interpersonal conflict, and perceived\n  productivity", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lucas Gren"], "abstract": "  Agile processes explicitly focus more on team-work than more traditional\nmanagement techniques when building software. With high velocity and\nresponsiveness on team-level come the risk of interpersonal conflict in the\nagile organizations. Through a survey with 68 software developers from three\nlarge Swedish companies, I found that the presence of interpersonal conflict\nwas negatively connected to the agile practices Iterative Development and\nCustomer Access. The agile practices Iteration Planning and Iterative\nDevelopment were positively linked to the measurement of the developers'\nperceived team productivity. However, Continuous Integration & Testing was\nnegatively connected to productivity. These results show which agile practices\nare directly linked to team productivity, but also, and more importantly,\nindicate which of the agile practices that might be more prone to not work as\nintended, when the team struggles with interpersonal conflict. Therefore, I\nargue that members of agile teams need training in conflict resolution\ntechniques in order to lower the risk of interpersonal conflict negatively\naffecting team productivity.\n", "doi": "10.1145/3084226.3084269", "arxiv_id": "1904.05843", "pdf_urls": ["https://arxiv.org/pdf/1904.05843"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "21st Conference on Evaluation and Assessment in Software\n  Engineering (EASE), 2017", "categories": "cs.SE"}
{"title": "Investigating the Effect of Attributes on User Trust in Social Media", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jamal Al Qundus and Adrian Paschke"], "abstract": "  One main challenge in social media is to identify trustworthy information. If\nwe cannot recognize information as trustworthy, that information may become\nuseless or be lost. Opposite, we could consume wrong or fake information with\nmajor consequences. How does a user handle the information provided before\nconsuming it? Are the comments on a post, the author or votes essential for\ntaking such a decision? Are these attributes considered together and which\nattribute is more important? To answer these questions, we developed a trust\nmodel to support knowledge sharing of user content in social media. This trust\nmodel is based on the dimensions of stability, quality, and credibility. Each\ndimension contains metrics (user role, user IQ, votes, etc.) that are important\nto the user based on data analysis. We present in this paper, an evaluation of\nthe proposed trust model using conjoint analysis (CA) as an evaluation method.\nThe results obtained from 348 responses, validate the trust model. A trust\ndegree translator interprets the content as very trusted, trusted, untrusted,\nand very untrusted based on the calculated value of trust. Furthermore, the\nresults show different importance for each dimension: stability 24%,\ncredibility 35% and quality 41%.\n", "doi": null, "arxiv_id": "1904.07569", "pdf_urls": ["https://arxiv.org/pdf/1904.07569"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Conference on Database and Expert Systems\n  Applications 2018", "categories": "cs.SI cs.IR"}
{"title": "Entanglement production by statistical operators", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov", "E.P. Yukalova", "and V.A. Yurovsky"], "abstract": "  In the problem of entanglement there exist two different notions. One is the\nentanglement of a quantum state, characterizing the state structure. The other\nis entanglement production by quantum operators, describing the action of\noperators in the given Hilbert space. Entanglement production by statistical\noperators, or density operators, is an important notion arising in quantum\nmeasurements and quantum information processing. The operational meaning of the\nentangling power of any operator, including statistical operators, is the\nproperty of the operators to entangle wave functions of the Hilbert space they\nare defined on. The measure of entanglement production by statistical operators\nis described and illustrated by entangled quantum states, equilibrium Gibbs\nstates, as well as by the state of a complex multiparticle spinor system. It is\nshown that this measure is in intimate relation to other notions of quantum\ninformation theory, such as the purity of quantum states, linear entropy, or\nimpurity, inverse participation ratio, quadratic R\\'{e}nyi entropy, the\ncorrelation function of composite measurements, and decoherence phenomenon.\nThis measure can be introduced for a set of statistical operators\ncharacterizing a system after quantum measurements. The explicit value of the\nmeasure depends on the type of the Hilbert space partitioning. For a general\nmultiparticle spinor system, it is possible to accomplish the particle-particle\npartitioning or spin-spatial partitioning. Conditions are defined showing when\nentanglement production is maximal and when it is zero. The study on\nentanglement production by statistical operators is important because,\ndepending on whether such an operator is entangling or not, it generates\nqualitatively different probability measures, which is principal for quantum\nmeasurements and quantum information processing.\n", "doi": "10.1088/1555-6611/ab0cf9", "arxiv_id": "1904.08294", "pdf_urls": ["https://arxiv.org/pdf/1904.08294"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 29 (2019) 065502", "categories": "quant-ph cond-mat.stat-mech"}
{"title": "MoralStrength: Exploiting a Moral Lexicon and Embedding Similarity for\n  Moral Foundations Prediction", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Oscar Araque", "Lorenzo Gatti and Kyriaki Kalimeri"], "abstract": "  Moral rhetoric plays a fundamental role in how we perceive and interpret the\ninformation we receive, greatly influencing our decision-making process.\nEspecially when it comes to controversial social and political issues, our\nopinions and attitudes are hardly ever based on evidence alone. The Moral\nFoundations Dictionary (MFD) was developed to operationalize moral values in\nthe text. In this study, we present MoralStrength, a lexicon of approximately\n1,000 lemmas, obtained as an extension of the Moral Foundations Dictionary,\nbased on WordNet synsets. Moreover, for each lemma it provides with a\ncrowdsourced numeric assessment of Moral Valence, indicating the strength with\nwhich a lemma is expressing the specific value. We evaluated the predictive\npotentials of this moral lexicon, defining three utilization approaches of\nincreased complexity, ranging from lemmas' statistical properties to a deep\nlearning approach of word embeddings based on semantic similarity. Logistic\nregression models trained on the features extracted from MoralStrength,\nsignificantly outperformed the current state-of-the-art, reaching an F1-score\nof 87.6% over the previous 62.4% (p-value<0.01), and an average F1-Score of\n86.25% over six different datasets. Such findings pave the way for further\nresearch, allowing for an in-depth understanding of moral narratives in text\nfor a wide range of social issues.\n", "doi": "10.1016/j.knosys.2019.105184", "arxiv_id": "1904.08314", "pdf_urls": ["https://arxiv.org/pdf/1904.08314"], "github": ["https://github.com/oaraque/moral-foundations"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems 2019", "categories": "cs.CL cs.CY"}
{"title": "Optimizing Quantum Programs against Decoherence: Delaying Qubits into\n  Quantum Superposition", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yu Zhang", "Haowei Deng", "Quanxi Li", "Haoze Song and Leihai Nie"], "abstract": "  Quantum computing technology has reached a second renaissance in the last\ndecade. However, in the NISQ era pointed out by John Preskill in 2018, quantum\nnoise and decoherence, which affect the accuracy and execution effect of\nquantum programs, cannot be ignored and corrected by the near future NISQ\ncomputers. In order to let users more easily write quantum programs, the\ncompiler and runtime system should consider underlying quantum hardware\nfeatures such as decoherence. To address the challenges posed by decoherence,\nin this paper, we propose and prototype QLifeReducer to minimize the qubit\nlifetime in the input OpenQASM program by delaying qubits into quantum\nsuperposition. QLifeReducer includes three core modules, i.e.,the parser,\nparallelism analyzer and transformer. It introduces the layered bundle format\nto express the quantum program, where a set of parallelizable quantum\noperations is packaged into a bundle. We evaluate quantum programs before and\nafter transformed by QLifeReducer on both real IBM Q 5 Tenerife and the\nself-developed simulator. The experimental results show that QLifeReducer\nreduces the error rate of a quantum program when executed on IBMQ 5 Tenerife by\n11%; and can reduce the longest qubit lifetime as well as average qubit\nlifetime by more than 20% on most quantum workloads.\n", "doi": "10.1109/tase.2019.000-2", "arxiv_id": "1904.09041", "pdf_urls": ["https://arxiv.org/pdf/1904.09041"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "13th International Symposium on Theoretical Aspects of Software\n  Engineering(TASE), July 29 - August 1, 2019", "categories": "quant-ph cs.PL"}
{"title": "Probability representation of quantum states as a renaissance of hidden\n  variables -- God plays coins", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir N. Chernega", "Olga V. Man'ko", "Vladimir I. Man'ko"], "abstract": "  We develop an approach where the quantum system states and quantum\nobservables are described as in classical statistical mechanics -- the states\nare identified with probability distributions and observables, with random\nvariables. An example of the spin-1/2 state is considered. We show that the\ntriada of Malevich's squares can be used to illustrate the qubit state. We\nformulate the superposition principle of quantum states in terms of\nprobabilities determining the quantum states. New formulas for nonlinear\naddition rules of probabilities providing the probabilities associated with the\ninterference of quantum states are obtained. The evolution equation for quantum\nstates is given in the form of a kinetic equation for the probability\ndistribution identified with the state.\n", "doi": "10.1007/s10946-019-09778-4", "arxiv_id": "1904.09788", "pdf_urls": ["https://arxiv.org/pdf/1904.09788"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Russ. Laser Res. v. 40, N 2, p. 1-14 (2019)", "categories": "quant-ph"}
{"title": "On Gender, Ethnicity, and Culture in Empirical Software Engineering\n  Research", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lucas Gren"], "abstract": "  This note highlights the importance of investigating diversity aspects in\ncombination in empirical research. It draws on the psychological discourse and\nsuggests why and how software engineering scholars can use the aspect of\ndiversity in all their research endeavors.\n", "doi": "10.1145/3195836.3195837", "arxiv_id": "1904.09820", "pdf_urls": ["https://arxiv.org/pdf/1904.09820"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "11th International Workshop on Cooperative and Human Aspects of\n  Software Engineering (CHASE), 2018", "categories": "cs.SE cs.CY"}
{"title": "Crowdsourced Truth Discovery in the Presence of Hierarchies for\n  Knowledge Fusion", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Woohwan Jung", "Younghoon Kim and Kyuseok Shim"], "abstract": "  Existing works for truth discovery in categorical data usually assume that\nclaimed values are mutually exclusive and only one among them is correct.\nHowever, many claimed values are not mutually exclusive even for functional\npredicates due to their hierarchical structures. Thus, we need to consider the\nhierarchical structure to effectively estimate the trustworthiness of the\nsources and infer the truths. We propose a probabilistic model to utilize the\nhierarchical structures and an inference algorithm to find the truths. In\naddition, in the knowledge fusion, the step of automatically extracting\ninformation from unstructured data (e.g., text) generates a lot of false\nclaims. To take advantages of the human cognitive abilities in understanding\nunstructured data, we utilize crowdsourcing to refine the result of the truth\ndiscovery. We propose a task assignment algorithm to maximize the accuracy of\nthe inferred truths. The performance study with real-life datasets confirms the\neffectiveness of our truth inference and task assignment algorithms.\n", "doi": "10.5441/002/edbt.2019.19", "arxiv_id": "1904.10217", "pdf_urls": ["https://arxiv.org/pdf/1904.10217"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 22nd International Conference on Extending\n  Database Technology, 2019. pp. 205-216", "categories": "cs.DB"}
{"title": "Deep Iterative Reconstruction for Phase Retrieval", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["\\c{C}a\\u{g}atay I\\c{s}{\\i}l", "Figen S. Oktem", "Aykut Ko\\c{c}"], "abstract": "  Classical phase retrieval problem is the recovery of a constrained image from\nthe magnitude of its Fourier transform. Although there are several well-known\nphase retrieval algorithms including the hybrid input-output (HIO) method, the\nreconstruction performance is generally sensitive to initialization and\nmeasurement noise. Recently, deep neural networks (DNNs) have been shown to\nprovide state-of-the-art performance in solving several inverse problems such\nas denoising, deconvolution, and superresolution. In this work, we develop a\nphase retrieval algorithm that utilizes two DNNs together with the model-based\nHIO method. First, a DNN is trained to remove the HIO artifacts and is used\niteratively with the HIO method to improve the reconstructions. After this\niterative phase, a second DNN is trained to remove the remaining artifacts.\nNumerical results demonstrate the effectiveness of ourapproach, which has\nlittle additional computational cost compared to the HIO method. Our approach\nnot only achieves state-of-the-art reconstruction performance but also is more\nrobust to different initialization and noise levels.\n", "doi": "10.1364/ao.58.005422", "arxiv_id": "1904.11301", "pdf_urls": ["https://arxiv.org/pdf/1904.11301"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "\\c{C}a\\u{g}atay I\\c{s}{\\i}l, Figen S. Oktem, and Aykut Ko\\c{c},\n  \"Deep iterative reconstruction for phase retrieval,\" Appl. Opt. 58, 5422-5431\n  (2019)", "categories": "eess.IV cs.LG"}
{"title": "Robust Metric Learning based on the Rescaled Hinge Loss", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sumia Abdulhussien Razooqi Al-Obaidi", "Davood Zabihzadeh", "and Hamideh\n  Hajiabadi"], "abstract": "  Distance/Similarity learning is a fundamental problem in machine learning.\nFor example, kNN classifier or clustering methods are based on a\ndistance/similarity measure. Metric learning algorithms enhance the efficiency\nof these methods by learning an optimal distance function from data. Most\nmetric learning methods need training information in the form of pair or\ntriplet sets. Nowadays, this training information often is obtained from the\nInternet via crowdsourcing methods. Therefore, this information may contain\nlabel noise or outliers leading to the poor performance of the learned metric.\nIt is even possible that the learned metric functions perform worse than the\ngeneral metrics such as Euclidean distance. To address this challenge, this\npaper presents a new robust metric learning method based on the Rescaled Hinge\nloss. This loss function is a general case of the popular Hinge loss and\ninitially introduced in (Xu et al. 2017) to develop a new robust SVM algorithm.\nIn this paper, we formulate the metric learning problem using the Rescaled\nHinge loss function and then develop an efficient algorithm based on HQ\n(Half-Quadratic) to solve the problem. Experimental results on a variety of\nboth real and synthetic datasets confirm that our new robust algorithm\nconsiderably outperforms state-of-the-art metric learning methods in the\npresence of label noise and outliers.\n", "doi": "10.1007/s13042-020-01137-z", "arxiv_id": "1904.11711", "pdf_urls": ["https://arxiv.org/pdf/1904.11711"], "github": ["https://github.com/GT-Davood/Robust-metric-learning-based-on-the-rescaled-hinge-loss"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Robust metric learning based on the rescaled hinge loss.\n  International Journal of Machine Learning and Cybernetics 11 (2020):\n  2515-2528", "categories": "cs.LG stat.ML"}
{"title": "X-ray photoelectron spectroscopy, Raman and photoluminescence studies on\n  formation of defects in Cu:ZnO thin films and its role in non-linear optical\n  features", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Albin Antony", "P. Poornesh", "I.V.Kityk", "K.Ozga", "J.Jedryk", "P.Rakus and\n  A.Wojciechowski"], "abstract": "  The structural, optical, morphological and nonlinear optical properties of\nCu:ZnO spray-coated films are studied. The surface morphology of Cu:ZnO thin\nfilms turned out to be homogenous, crack free and well covered with pea-shaped\ngrains. The peak shift observed in the x-ray photoelectron spectroscopy spectra\nof the Cu:ZnO thin films infers the defect states present in the films. The\nsatellite peak observed at 939.9 eV for Cu2P core-level spectra confirms the +2\noxidation state of Cu in the films. The formation of additional defect levels\nin the nanostruc-tures upon Cu doping was investigated using photoluminescence\n(PL) and Raman spectroscopy studies. The luminescent centers in the violet,\nblue and green spectral region were observed. The most prominent emission was\ncentered at the blue color center for 5% Cu:ZnO thin films. The en-hancement in\nthe PL emission intensity confirms the increase in the defect state density\nupon Cu doping. The shifting of the UV emission peak to the visible region\nvalidates the increase in the non-radiative recombination process in the films\nupon doping. The phonon modes observed in Raman analysis around 439, 333 and\n558 cm-1 confirm the improvement in the crystallinity and formation of defect\nstates in the films. X-ray diffraction reveals that the deposited films are of\nsingle-phase wurtzite ZnO structure with preferential growth orientation\nparallel (0 0 2) to the C-axis. The third-order optical susceptibility\n\\c{hi}(3) has been increased from 3.5 x 10-4 to 2.77 x 10-3 esu due to the\nenhancement of electronic transition to different defect levels formed in the\nfilms and through local heating effects arising due to continuous wave laser\nillumination. The enhanced third harmonic generation signal investigated using\na Nd:YAG laser at 1064 nm and 8 ns pulse width shows the credibility of Cu:ZnO\nfilms in frequency tripling applications.\n", "doi": "10.1088/1555-6611/aacd93", "arxiv_id": "1904.12127", "pdf_urls": ["https://arxiv.org/pdf/1904.12127"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2 pages, 14 figures, published Laser Physics 2018, Volume 28,\n  Number 9", "categories": "cond-mat.mtrl-sci"}
{"title": "OPIEC: An Open Information Extraction Corpus", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kiril Gashteovski", "Sebastian Wanner", "Sven Hertling", "Samuel Broscheit", "Rainer Gemulla"], "abstract": "  Open information extraction (OIE) systems extract relations and their\narguments from natural language text in an unsupervised manner. The resulting\nextractions are a valuable resource for downstream tasks such as knowledge base\nconstruction, open question answering, or event schema induction. In this\npaper, we release, describe, and analyze an OIE corpus called OPIEC, which was\nextracted from the text of English Wikipedia. OPIEC complements the available\nOIE resources: It is the largest OIE corpus publicly available to date (over\n340M triples) and contains valuable metadata such as provenance information,\nconfidence scores, linguistic annotations, and semantic annotations including\nspatial and temporal information. We analyze the OPIEC corpus by comparing its\ncontent with knowledge bases such as DBpedia or YAGO, which are also based on\nWikipedia. We found that most of the facts between entities present in OPIEC\ncannot be found in DBpedia and/or YAGO, that OIE facts often differ in the\nlevel of specificity compared to knowledge base facts, and that OIE open\nrelations are generally highly polysemous. We believe that the OPIEC corpus is\na valuable resource for future research on automated knowledge base\nconstruction.\n", "doi": null, "arxiv_id": "1904.12324", "pdf_urls": ["https://arxiv.org/pdf/1904.12324"], "github": ["https://github.com/uma-pi1/OPIEC", "https://github.com/uma-pi1/OPIEC-pipeline", "https://github.com/uma-pi1/minie"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In Proceedings of the Conference of Automatic Knowledge Base\n  Construction (AKBC) 2019", "categories": "cs.CL"}
{"title": "Experimental evidence of laser power oscillations induced by the\n  relative Fresnel (Goos-Haenchen) phase", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. A. Carvalho", "S. De Leo", "J. A. O. Huguenin", "M. Martino", "L. da Silva"], "abstract": "  The amplification of the relative Fresnel (Goos-Haenchen) phase by an\nappropriate number of total internal reflections and the choice of favorable\nincidence angles allow to observe full oscillations in the power of a DPSS\nlaser transmitted through sequential BK7 blocks. The experimental results\nconfirm the theoretical predictions. The optical apparatus used in this letter\ncan be seen as a new type of two-phase ellipsometric system where the phase of\nthe complex refractive index is replaced by the relative Fresnel\n(Goos-Haenchen) phase.\n", "doi": "10.1088/1612-202x/ab1098", "arxiv_id": "1905.00862", "pdf_urls": ["https://arxiv.org/pdf/1905.00862"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letter 16, 065001-5 (2019)", "categories": "physics.optics"}
{"title": "Mid-range order in trapped quasi-condensates of bosonic atoms", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov and E.P. Yukalova"], "abstract": "  Finite Bose systems cannot display a genuine Bose-Einstein condensate with\ninfinite long-range order. But, if the number of trapped atoms is sufficiently\nlarge, a kind of Bose-Einstein condensation does occur, with the properties of\nthe arising quasi-condensate being very close to the genuine condensate.\nAlthough the quasi-condensate does not enjoy long-range order, it has mid-range\norder. This paper shows that the level of mid-range order in finite Bose\nsystems can be characterized by order indices of density matrices.\n", "doi": "10.1088/1612-202x/ab1337", "arxiv_id": "1905.01528", "pdf_urls": ["https://arxiv.org/pdf/1905.01528"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 16 (2019) 065501", "categories": "cond-mat.quant-gas"}
{"title": "A Review of Object Detection Models based on Convolutional Neural\n  Network", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["F. Sultana", "A. Sufian", "P. Dutta"], "abstract": "  Convolutional Neural Network (CNN) has become the state-of-the-art for object\ndetection in image task. In this chapter, we have explained different\nstate-of-the-art CNN based object detection models. We have made this review\nwith categorization those detection models according to two different\napproaches: two-stage approach and one-stage approach. Through this chapter, it\nhas shown advancements in object detection models from R-CNN to latest\nRefineDet. It has also discussed the model description and training details of\neach model. Here, we have also drawn a comparison among those models.\n", "doi": "10.1007/978-981-15-4288-6_1", "arxiv_id": "1905.01614", "pdf_urls": ["https://arxiv.org/pdf/1905.01614"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Intelligent Computing: Image Processing Based Applications.\n  Advances in Intelligent Systems and Computing, vol 1157, pages 1-16, 2020", "categories": "cs.CV"}
{"title": "Realization of the Werner-Holevo and Landau-Streater quantum channels\n  for qutrits on quantum computers", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A. I. Pakhomchik", "I. Feshchenko", "A. Glatz", "V. M. Vinokur", "A. V.\n  Lebedev", "K. V. Kuzhamuratova", "S. N. Filippov", "and G. B. Lesovik"], "abstract": "  We realize Landau-Streater (LS) and Werner-Holevo (WH) quantum channels for\nqutrits on the IBM quantum computers. These channels correspond to interaction\nbetween the qutrit and its environment that result in the globally unitarily\ncovariant qutrit transformation violating multiplicativity of the maximal\n$p$-norm. Our realization of LS and WH channels is based on embedding qutrit\nstates into states of two qubits and using single-qubit and two-qubit CNOT\ngates to implement the specific interaction. We employ the standard quantum\ngates hence the developed algorithm suits any quantum computer. We run our\nalgorithm on a 5-qubit and a 20-qubit computer as well as on a simulator. We\nquantify the quality of the implemented channels comparing their action on\ndifferent input states with theoretical predictions. The overall efficiency is\nquantified by fidelity between the theoretical and experimental Choi states\nimplemented on the 20-qubit computer.\n", "doi": "10.1007/s10946-020-09846-0", "arxiv_id": "1905.05277", "pdf_urls": ["https://arxiv.org/pdf/1905.05277"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research 41, 40-53 (2020)", "categories": "quant-ph"}
{"title": "How Case Based Reasoning Explained Neural Networks: An XAI Survey of\n  Post-Hoc Explanation-by-Example in ANN-CBR Twins", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mark T Keane and Eoin M Kenny"], "abstract": "  This paper surveys an approach to the XAI problem, using post-hoc explanation\nby example, that hinges on twinning Artificial Neural Networks (ANNs) with\nCase-Based Reasoning (CBR) systems, so-called ANN-CBR twins. A systematic\nsurvey of 1100+ papers was carried out to identify the fragmented literature on\nthis topic and to trace it influence through to more recent work involving Deep\nNeural Networks (DNNs). The paper argues that this twin-system approach,\nespecially using ANN-CBR twins, presents one possible coherent, generic\nsolution to the XAI problem (and, indeed, XCBR problem). The paper concludes by\nroad-mapping some future directions for this XAI solution involving (i) further\ntests of feature-weighting techniques, (iii) explorations of how explanatory\ncases might best be deployed (e.g., in counterfactuals, near-miss cases, a\nfortori cases), and (iii) the raising of the unwelcome and, much ignored, issue\nof human user evaluation.\n", "doi": "10.1007/978-3-030-29249-2_11", "arxiv_id": "1905.07186", "pdf_urls": ["https://arxiv.org/pdf/1905.07186"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 27th International Conference on Case Based\n  Reasoning (ICCBR-19), 2019", "categories": "cs.AI"}
{"title": "Numerical simulation of Ni-like Xe plasma dynamics and laser gain in a\n  low inductivity capillary discharge", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["N.V. Kalinin", "R.M. Feshchenko", "I.A. Artyukov and V.A. Burtsev"], "abstract": "  X-ray lasers based on transitions in highly charged \\textit{Ni}-like ions\ngenerating in the \"water window\" wavelength range can be pumped by compact\nlaboratory discharge sources. This makes them promising candidates for use as\ncompact coherent X-ray sources in laboratory applications including biological\nimaging and investigations of carbon containing materials. In this paper, the\nresults of numerical simulations of the plasma dynamics and kinetics in an\nX-ray laser based on transitions in \\textit{Ni}-like xenon ions are reported.\nThe laser active medium is created by an extended low-inductive high current\nZ-discharge capable of producing two successive electrical pulses. The\nnon-equilibrium multi-charged ion plasma dynamics is studied numerically using\na non-stationary 1D two-temperature radiation-MHD model, which describes plasma\nhydrodynamics, non-stationary ionization, transfer of the continuum and line\nradiation as well as processes in the pumping electrical circuit. The ionic\nenergy level populations are calculated in the quasi-stationary approximation.\nThe simulation results allowed determination of the electrical and energy\npumping parameters necessary to obtain a weak signal gain for the working\ntransitions of the order of $g^+\\sim1$ $\\mbox{cm}^{-1}$. It was demonstrated\nthat plasma with the electronic temperature of more than 400 eV and the density\nof more than $10^{19}$ $\\mbox{cm}^{-3}$ can be created by a low inductive two\nstep discharge with peak current exceeding 200 kA.\n", "doi": "10.1007/s10946-020-09895-5", "arxiv_id": "1905.08844", "pdf_urls": ["https://arxiv.org/pdf/1905.08844"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, 41(4), 424-433 (2020)", "categories": "physics.plasm-ph physics.comp-ph"}
{"title": "Seeker: Real-Time Interactive Search", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ari Biswas", "Thai T Pham", "Michael Vogelsong", "Benjamin Snyder", "Houssam\n  Nassif"], "abstract": "  This paper introduces Seeker, a system that allows users to interactively\nrefine search rankings in real time, through feedback in the form of likes and\ndislikes. When searching online, users may not know how to accurately describe\ntheir product of choice in words. An alternative approach is to search an\nembedding space, allowing the user to query using a representation of the item\n(like a tune for a song, or a picture for an object). However, this approach\nrequires the user to possess an example representation of their desired item.\nAdditionally, most current search systems do not allow the user to dynamically\nadapt the results with further feedback. On the other hand, users often have a\nmental picture of the desired item and are able to answer ordinal questions of\nthe form: \"Is this item similar to what you have in mind?\" With this\nassumption, our algorithm allows for users to provide sequential feedback on\nsearch results to adapt the search feed. We show that our proposed approach\nworks well both qualitatively and quantitatively. Unlike most previous\nrepresentation-based search systems, we can quantify the quality of our\nalgorithm by evaluating humans-in-the-loop experiments.\n", "doi": null, "arxiv_id": "1905.13125", "pdf_urls": ["https://arxiv.org/pdf/1905.13125"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge Discovery in Databases Conference (KDD'19), Anchorage,\n  Alaska, pp. 2867-2875, 2019", "categories": "cs.IR cs.LG stat.ML"}
{"title": "Reconciling Hierarchical Forecasts via Bayes' Rule", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giorgio Corani", "Dario Azzimonti", "Jo\\~ao P. S. C. Augusto and Marco\n  Zaffalon"], "abstract": "  We present a novel approach for reconciling hierarchical forecasts, based on\nBayes rule. We define a prior distribution for the bottom time series of the\nhierarchy, based on the bottom base forecasts. Then we update their\ndistribution via Bayes rule, based on the base forecasts for the upper time\nseries. Under the Gaussian assumption, we derive the updating in closed-form.\nWe derive two algorithms, which differ as for the assumed independencies. We\ndiscuss their relation with the MinT reconciliation algorithm and with the\nKalman filter, and we compare them experimentally.\n", "doi": "10.1007/978-3-030-67664-3_13", "arxiv_id": "1906.03105", "pdf_urls": ["https://arxiv.org/pdf/1906.03105"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ECML PKDD 2020: Proc. Machine Learning and Knowledge Discovery in\n  Databases, 211 - 226", "categories": "stat.AP"}
{"title": "Addictive Auctions: using lucky-draw and gambling addiction to increase\n  participation during auctioning", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ravin Kumar"], "abstract": "  Auction theories are believed to provide a better selling opportunity for the\nresources to be allocated. Various organizations have taken measures to\nincrease trust among participants towards their auction system, but trust alone\ncannot ensure a high level of participation. We propose a new type of auction\nsystem which takes advantage of lucky draw and gambling addictions to increase\nthe engagement level of candidates in an auction. Our system makes use of\nsecurity features present in existing auction systems for ensuring fairness and\nmaintaining trust among participants.\n", "doi": "10.51483/ijmre.1.1.2021.68-74", "arxiv_id": "1906.03237", "pdf_urls": ["https://arxiv.org/pdf/1906.03237"], "github": ["https://github.com/mr-ravin/collaborative-auction"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Ravin Kumar (2021). Addictive auctions: Using lucky-draw and\n  gambling addiction to increase participation during auctioning. International\n  Journal of Management Research and Economics. 1(1),68-74", "categories": "econ.TH"}
{"title": "Does Diversity Improve the Test Suite Generation for Mobile\n  Applications?", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas Vogel", "Chinh Tran", "and Lars Grunske"], "abstract": "  In search-based software engineering we often use popular heuristics with\ndefault configurations, which typically lead to suboptimal results, or we\nperform experiments to identify configurations on a trial-and-error basis,\nwhich may lead to better results for a specific problem. To obtain better\nresults while avoiding trial-and-error experiments, a fitness landscape\nanalysis is helpful in understanding the search problem, and making an informed\ndecision about the heuristics. In this paper, we investigate the search problem\nof test suite generation for mobile applications (apps) using SAPIENZ whose\nheuristic is a default NSGA-II. We analyze the fitness landscape of SAPIENZ\nwith respect to genotypic diversity and use the gained insights to adapt the\nheuristic of SAPIENZ. These adaptations result in SAPIENZ^div that aims for\npreserving the diversity of test suites during the search. To evaluate\nSAPIENZ^div, we perform a head-to-head comparison with SAPIENZ on 76\nopen-source apps.\n", "doi": "10.1007/978-3-030-27455-9_5", "arxiv_id": "1906.08142", "pdf_urls": ["https://arxiv.org/pdf/1906.08142"], "github": ["https://github.com/thomas-vogel/sapienzdiv-ssbse19"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "11th International Symposium on Search-Based Software Engineering\n  (SSBSE 2019)", "categories": "cs.SE"}
{"title": "3DBGrowth: volumetric vertebrae segmentation and reconstruction in\n  magnetic resonance imaging", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jonathan S. Ramos", "Mirela T. Cazzolato", "Bruno S. Fai\\c{c}al", "Marcello\n  H. Nogueira-Barbosa", "Caetano Traina Jr. and Agma J. M. Traina"], "abstract": "  Segmentation of medical images is critical for making several processes of\nanalysis and classification more reliable. With the growing number of people\npresenting back pain and related problems, the semi-automatic segmentation and\n3D reconstruction of vertebral bodies became even more important to support\ndecision making. A 3D reconstruction allows a fast and objective analysis of\neach vertebrae condition, which may play a major role in surgical planning and\nevaluation of suitable treatments. In this paper, we propose 3DBGrowth, which\ndevelops a 3D reconstruction over the efficient Balanced Growth method for 2D\nimages. We also take advantage of the slope coefficient from the annotation\ntime to reduce the total number of annotated slices, reducing the time spent on\nmanual annotation. We show experimental results on a representative dataset\nwith 17 MRI exams demonstrating that our approach significantly outperforms the\ncompetitors and, on average, only 37% of the total slices with vertebral body\ncontent must be annotated without losing performance/accuracy. Compared to the\nstate-of-the-art methods, we have achieved a Dice Score gain of over 5% with\ncomparable processing time. Moreover, 3DBGrowth works well with imprecise seed\npoints, which reduces the time spent on manual annotation by the specialist.\n", "doi": "10.1109/cbms.2019.00091", "arxiv_id": "1906.10288", "pdf_urls": ["https://arxiv.org/pdf/1906.10288"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Computer-Based Medical Systems, 2019", "categories": "eess.IV cs.CV"}
{"title": "An Acoustic Emission Activity Detection Method based on Short-Term\n  Waveform Features: Application to Metallic Components under Uniaxial Tensile\n  Test", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fernando Pinal-Moctezuma", "Miguel Delgado-Prieto and Luis\n  Romeral-Martinez"], "abstract": "  The Acoustic Emission (AE) phenomenon has been used as a powerful tool with\nthe purpose to either detect, locate or assess damage for a wide range of\napplications. Derived from its monitoring, one major current challenge on the\nanalysis of the acquired signal is the proper identification and separation of\neach AE event. Current advanced methods for detecting events are primarily\nfocused on identifying with high accuracy the beginning of the AE wave;\nhowever, the detection of the conclusion has been disregarded in the\nliterature. For an automatic continuous detection of events within a data\nstream, this lack of accuracy for the conclusion of the events generates errors\nin two critical aspects. In one hand, it deteriorates the accuracy of the\nmeasurement of the events duration, truncating the span of the event\n(undesirable in evaluation applications), and in the other hand, it causes\nfalse detections. In this work, an accurate and computationally efficient AE\nactivity detector is presented, using a framework inspired by the area of\nspeech processing, and which provides the required indicators to accurately\ndetect the onset and the end of an AE event. This is achieved by means of a\nthreshold approach that instead of directly operates with the transduced\nvoltage signal it does so over the Short-Term Energy and the Short-Term\nZero-Crossing Rate measures of the signal. The STE-ZCR method is developed for\nan application related to the continuous monitoring of a single AE channel\nderived from the characterization of metallic components by means of a uniaxial\ntensile test. Additionally, two experimental test-benches are implemented with\nthe aim to quantify the accuracy and the quality of event detection of the\npresented method. Finally, the obtained results are compared with four\ndifferent techniques, representing the current state of the art related to AE\nactivity detection.\n", "doi": "10.1016/j.ymssp.2020.106753", "arxiv_id": "1906.10956", "pdf_urls": ["https://arxiv.org/pdf/1906.10956"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "An acoustic emission activity detection method based on short-term\n  waveform features: Application to metallic components under uniaxial tensile\n  test, Mechanical Systems and Signal Processing, Volume 142, 2020, 106753,\n  ISSN 0888-3270,", "categories": "eess.SP"}
{"title": "Generalized Median Graph via Iterative Alternate Minimizations", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nicolas Boria", "S'ebastien Bougleux", "Benoit Ga\\\"uz\\`ere (LITIS)", "Luc\n  Brun"], "abstract": "  Computing a graph prototype may constitute a core element for clustering or\nclassification tasks. However, its computation is an NP-Hard problem, even for\nsimple classes of graphs. In this paper, we propose an efficient approach based\non block coordinate descent to compute a generalized median graph from a set of\ngraphs. This approach relies on a clear definition of the optimization process\nand handles labeling on both edges and nodes. This iterative process optimizes\nthe edit operations to perform on a graph alternatively on nodes and edges.\nSeveral experiments on different datasets show the efficiency of our approach.\n", "doi": null, "arxiv_id": "1906.11009", "pdf_urls": ["https://arxiv.org/pdf/1906.11009"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "IAPR International workshop on Graph-Based Representation in\n  Pattern Recognition, Donatello Conte, Jean-Yves Ramel,, Jun 2019, Tours,\n  France. pp.99-109", "categories": "cs.CV q-bio.QM"}
{"title": "Stable controllable giant vortex in a trapped Bose-Einstein condensate", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. K. Adhikari"], "abstract": "  In a harmonically-trapped rotating Bose-Einstein condensate (BEC), a vortex\nof large angular momentum decays to multiple vortices of unit angular momentum\nfrom an energetic consideration. We demonstrate the formation of a robust and\ndynamically stable giant vortex of large angular momentum in a harmonically\ntrapped rotating BEC with a potential hill at the center, thus forming a\nMexican hat like trapping potential. For a small inter-atomic interaction\nstrength, a highly controllable stable giant vortex appears, whose angular\nmomentum slowly increases as the angular frequency of rotation is increased. As\nthe inter-atomic interaction strength is increased beyond a critical value,\nonly vortices of unit angular momentum are formed, unless the strength of the\npotential hill at the center is also increased: for a stronger potential hill\nat the center a giant vortex is again formed. The dynamical stability of the\ngiant vortex is demonstrated by real-time propagation numerically. These giant\nvortices of large angular momentum can be observed and studied experimentally\nin a highly controlled fashion.\n", "doi": "10.1088/1612-202x/ab2d2c", "arxiv_id": "1906.11108", "pdf_urls": ["https://arxiv.org/pdf/1906.11108"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 16 (2019) 085501", "categories": "cond-mat.quant-gas nlin.PS"}
{"title": "Blowing Up Solutions to the Zakharov System for Langmuir Waves", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuri Cher", "Magdalena Czubak", "Catherine Sulem"], "abstract": "  Langmuir waves take place in a quasi-neutral plasma and are modeled by the\nZakharov system. The phenomenon of collapse, described by blowing up solutions\nplays a central role in their dynamics. We present in this article a review of\nthe main mathematical properties of blowing up solutions. They include\nconditions for blowup in finite or infinite time, description of self-similar\nsingular solutions and lower bounds for the rate of blowup of certain norms\nassociated to the solutions.\n", "doi": null, "arxiv_id": "1907.00926", "pdf_urls": ["https://arxiv.org/pdf/1907.00926"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Filamentation, 77-95, CRM Ser. Math. Phys., 2016; Springer;", "categories": "math.AP"}
{"title": "Conformally related Douglas metrics are Randers", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir S. Matveev and Samaneh Saberali"], "abstract": "  We show that two-dimensional conformally related Douglas metrics are Randers\n", "doi": "10.1007/s00013-020-01533-5", "arxiv_id": "1907.05134", "pdf_urls": ["https://arxiv.org/pdf/1907.05134"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 116 (2021), no. 2, 221--231", "categories": "math.DG"}
{"title": "Compensation in the spin-1/2 site diluted Ising ferrimagnet: A Monte\n  Carlo study", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sk Sajid and Muktish Acharyya"], "abstract": "  A two-dimensional spin-1/2 trilayer magnetic system with quenched\nnon-magnetic impurity is studied. The lattice is formed by alternate layers of\ntwo different theoretical atoms A and B arranged in a particular fashion A-B-A.\nThe compensation point appears below the critical temperature, for which total\nmagnetization of the system becomes zero even though the sublattice\nmagnetization has a nonzero value. For a range of values of the relative\ninteraction strength in the Hamiltonian, a compensation point is observed. We\nconsidered the Ising mechanics and employed the Monte Carlo method to determine\nthe compensation point and critical temperature of the system. However, the\neffects of impurity in such systems are still not well studied. With that in\nmind, we address the effects of random non-magnetic impurity in the trilayer\nsystem. We also investigate the lattice morphologies in the presence of\ncompensation and dilution and finally obtain the three-dimensional phase\ndiagram for selected Hamiltonian parameters and impurity concentration.\n", "doi": "10.1080/01411594.2019.1692016", "arxiv_id": "1907.07879", "pdf_urls": ["https://arxiv.org/pdf/1907.07879"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Phase Transition Vol-93 (2020) 62-73", "categories": "cond-mat.stat-mech"}
{"title": "Leveraging the Mob Mentality: An Experience Report on Mob Programming", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jim Buchan and Mark Pearl"], "abstract": "  Mob Programming, or \"mobbing\", is a relatively new collaborative programming\npractice being experimented with in different organizational contexts. There\nare a number of claimed benefits to this way of working, but it is not clear if\nthese are realized in practice and under what circumstances. This paper\ndescribes the experience of one team's experiences experimenting with Mob\nProgramming over an 18-month period. The context is programming in a software\nproduct organization in the Financial Services sector. The paper details the\nbenefits and challenges observed as well as lessons learned from these\nexperiences. It also reports some early work on understanding others'\nexperiences and perceptions of mobbing through a preliminary international\nsurvey of 82 practitioners of Mob Programming. The findings from the case and\nthe survey generally align well, as well as suggesting several fruitful areas\nfor further research into Mob Programming. Practitioners should find this\nuseful to extract learnings to inform their own mobbing experiments and its\npotential impact on collaborative software development.\n", "doi": "10.1145/3210459.3210482", "arxiv_id": "1907.11352", "pdf_urls": ["https://arxiv.org/pdf/1907.11352"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In EASE'18 Proceedings of the 22nd International Conference on\n  Evaluation and Assessment in Software Engineering 2018 Vol. Part F137700 (pp.\n  199-204)", "categories": "cs.SE"}
{"title": "Market and Long Term Accounting Operational Performance", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M. S. S. Rosa", "P. R. B. Lustosa"], "abstract": "  Following the value relevance literature, this study verifies whether the\nmarketplace differentiates companies of high, medium, and low long-term\noperational performance, measured by accounting information on profitability,\nsales variation and indebtedness. The data comprises the Corporate Financial\nStatements disclosed during the period from 1996 to 2009 and stock prices of\ncompanies listed on the Sao Paulo Stock Exchange and Commodities and Futures\nExchange - BM&FBOVESPA. The final sample is composed of 142 non-financial\ncompanies. Five year mobile windows were used, which resulted in ten five-year\nperiods. After checking each company indices, the accounting variables were\nunified in an Index Performance Summary to synthesize the final performance for\neach five-year period, which allowed segregation in operational performance\nlevels. Multiple regressions were performed using panel data techniques, fixed\neffects model and dummies variables, and then hypothesis tests were made.\nRegarding the explanatory power of each individual variable, the results show\nthat not all behaviors are according to the research hypothesis and that the\nBrazilian stock market differentiates companies of high and low long-term\noperational performance. This distinction is not fully perceived between\ncompanies of high and medium operational performance.\n", "doi": "10.4013/base.2014.111.03", "arxiv_id": "1907.11719", "pdf_urls": ["https://arxiv.org/pdf/1907.11719"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "BASE, 11(1), Jan-Mar 2014, p. 34-46", "categories": "econ.GN q-fin.EC"}
{"title": "Covering graphs, magnetic spectral gaps and applications to polymers and\n  nanoribbons", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["John Stewart Fabila-Carrasco and Fernando Lled\\'o"], "abstract": "  In this article, we analyze the spectrum of discrete magnetic Laplacians\n(DML) on an infinite covering graph $\\widetilde{G} \\rightarrow G=\\widetilde{G}\n/\\Gamma$ with (Abelian) lattice group $\\Gamma$ and periodic magnetic potential\n$\\widetilde{\\beta}$. We give sufficient conditions for the existence of\nspectral gaps in the spectrum of the DML and study how these depend on\n$\\widetilde{\\beta}$. The magnetic potential may be interpreted as a control\nparameter for the spectral bands and gaps. We apply these results to describe\nthe spectral band/gap structure of polymers (polyacetylene) and of nanoribbons\nin the presence of a constant magnetic field.\n", "doi": "10.3390/sym11091163", "arxiv_id": "1908.00292", "pdf_urls": ["https://arxiv.org/pdf/1908.00292"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Symmetry-Basel 11 (2019) 1163", "categories": "math-ph math.CO math.MP math.SP"}
{"title": "Estimating the standard error of cross-Validation-Based estimators of\n  classifier performance", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Waleed A. Yousef"], "abstract": "  First, we analyze the variance of the Cross Validation (CV)-based estimators\nused for estimating the performance of classification rules. Second, we propose\na novel estimator to estimate this variance using the Influence Function (IF)\napproach that had been used previously very successfully to estimate the\nvariance of the bootstrap-based estimators. The motivation for this research is\nthat, as the best of our knowledge, the literature lacks a rigorous method for\nestimating the variance of the CV-based estimators. What is available is a set\nof ad-hoc procedures that have no mathematical foundation since they ignore the\ncovariance structure among dependent random variables. The conducted\nexperiments show that the IF proposed method has small RMS error with some\nbias. However, surprisingly, the ad-hoc methods still work better than the\nIF-based method. Unfortunately, this is due to the lack of enough smoothness if\ncompared to the bootstrap estimator. This opens the research for three points:\n(1) more comprehensive simulation study to clarify when the IF method win or\nloose; (2) more mathematical analysis to figure out why the ad-hoc methods work\nwell; and (3) more mathematical treatment to figure out the connection between\nthe appropriate amount of \"smoothness\" and decreasing the bias of the IF\nmethod.\n", "doi": "10.1016/j.patrec.2021.02.022", "arxiv_id": "1908.00325", "pdf_urls": ["https://arxiv.org/pdf/1908.00325"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Waleed A. Yousef, Estimating the standard error of\n  cross-Validation-Based estimators of classifier performance, Pattern\n  Recognition Letters, Volume 146, 2021, Pages 115-125", "categories": "stat.ML cs.LG"}
{"title": "AutoML: A Survey of the State-of-the-Art", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xin He", "Kaiyong Zhao", "Xiaowen Chu"], "abstract": "  Deep learning (DL) techniques have penetrated all aspects of our lives and\nbrought us great convenience. However, building a high-quality DL system for a\nspecific task highly relies on human expertise, hindering the applications of\nDL to more areas. Automated machine learning (AutoML) becomes a promising\nsolution to build a DL system without human assistance, and a growing number of\nresearchers focus on AutoML. In this paper, we provide a comprehensive and\nup-to-date review of the state-of-the-art (SOTA) in AutoML. First, we introduce\nAutoML methods according to the pipeline, covering data preparation, feature\nengineering, hyperparameter optimization, and neural architecture search (NAS).\nWe focus more on NAS, as it is currently very hot sub-topic of AutoML. We\nsummarize the performance of the representative NAS algorithms on the CIFAR-10\nand ImageNet datasets and further discuss several worthy studying directions of\nNAS methods: one/two-stage NAS, one-shot NAS, and joint hyperparameter and\narchitecture optimization. Finally, we discuss some open problems of the\nexisting AutoML methods for future research.\n", "doi": "10.1016/j.knosys.2020.106622", "arxiv_id": "1908.00709", "pdf_urls": ["https://arxiv.org/pdf/1908.00709"], "github": ["https://github.com/daya6489/DriveML", "https://github.com/marsggbo/automl_a_survey_of_state_of_the_art"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 212, 5 January 2021, 106622", "categories": "cs.LG cs.CV stat.ML"}
{"title": "Sound source detection, localization and classification using\n  consecutive ensemble of CRNN models", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S{\\l}awomir Kapka", "Mateusz Lewandowski"], "abstract": "  In this paper, we describe our method for DCASE2019 task3: Sound Event\nLocalization and Detection (SELD). We use four CRNN SELDnet-like single output\nmodels which run in a consecutive manner to recover all possible information of\noccurring events. We decompose the SELD task into estimating number of active\nsources, estimating direction of arrival of a single source, estimating\ndirection of arrival of the second source where the direction of the first one\nis known and a multi-label classification task. We use custom consecutive\nensemble to predict events' onset, offset, direction of arrival and class. The\nproposed approach is evaluated on the TAU Spatial Sound Events 2019 - Ambisonic\nand it is compared with other participants' submissions.\n", "doi": "10.33682/1syg-dy60", "arxiv_id": "1908.00766", "pdf_urls": ["https://arxiv.org/pdf/1908.00766"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Detection and Classification of Acoustic Scenes\n  and Events 2019 Workshop (DCASE2019), New York University, NY, USA, October\n  2019", "categories": "eess.AS cs.LG cs.SD stat.ML"}
{"title": "Semi-supervised representation learning via dual autoencoders for domain\n  adaptation", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shuai Yang", "Hao Wang", "Yuhong Zhang", "Pei-Pei Li", "Yi Zhu and Xuegang Hu"], "abstract": "  Domain adaptation aims to exploit the knowledge in source domain to promote\nthe learning tasks in target domain, which plays a critical role in real-world\napplications. Recently, lots of deep learning approaches based on autoencoders\nhave achieved a significance performance in domain adaptation. However, most\nexisting methods focus on minimizing the distribution divergence by putting the\nsource and target data together to learn global feature representations, while\nthey do not consider the local relationship between instances in the same\ncategory from different domains. To address this problem, we propose a novel\nSemi-Supervised Representation Learning framework via Dual Autoencoders for\ndomain adaptation, named SSRLDA. More specifically, we extract richer feature\nrepresentations by learning the global and local feature representations\nsimultaneously using two novel autoencoders, which are referred to as\nmarginalized denoising autoencoder with adaptation distribution (MDAad) and\nmulti-class marginalized denoising autoencoder (MMDA) respectively. Meanwhile,\nwe make full use of label information to optimize feature representations.\nExperimental results show that our proposed approach outperforms several\nstate-of-the-art baseline methods.\n", "doi": "10.1016/j.knosys.2019.105161", "arxiv_id": "1908.01342", "pdf_urls": ["https://arxiv.org/pdf/1908.01342"], "github": ["https://github.com/Minminhfut/SSRLDACode"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems(2019)", "categories": "cs.LG stat.ML"}
{"title": "Chip-Firing Games and Critical Groups", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Darren Glass and Nathan Kaplan"], "abstract": "  In this expository article intended to be accessible to undergraduate\nstudents we introduce a finite abelian group that can be associated to any\nfinite connected graph. This group can be defined in an elementary\ncombinatorial way in terms of chip-firing operations, and has been an object of\ninterest in combinatorics, algebraic geometry, statistical physics, and several\nother areas of mathematics. We will begin with basic definitions and examples\nand develop a number of properties that can be derived by looking at this group\nfrom different angles. Throughout, we will give exercises, some of which are\nstraightforward and some of which are open questions. We will also attempt to\nhighlight some of the many contributions to this area made by undergraduate\nstudents\n", "doi": "10.1007/978-3-030-37853-0_4", "arxiv_id": "1908.04395", "pdf_urls": ["https://arxiv.org/pdf/1908.04395"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "A Project-Based Guide to Undergraduate Research in Mathematics,\n  107-152, Found. Undergrad. Res. Math., Birkh\\\"auser, Cham, 2020", "categories": "math.CO"}
{"title": "Beam quality measurement through off-axis optical vortex", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mateusz Szatkowski", "Agnieszka Popio{\\l}ek-Masajada", "Jan Masajada"], "abstract": "  One of the challenges for every optical system is preserving the quality of\nthe used beam, which may be significantly reduced, due to the low condition of\nused optical elements or their misalignment. There are plenty of methods\nfocused on the correction of the final beam, depending on the used entire\noptical system. The problem of efficient beam evaluation is just as important.\nSo far, most of the measurements, are based on visual inspection, which is not\nalways enough, especially when the high quality of the beam is required. Novel\napproaches use structured light to increase beam sensitivity for any\nimperfections. In this paper, we present an approach, which uses optical vortex\nshifted off-axis for a beam quality measurement. It uses SLM as a vortex\ngenerating element, which is shifted off-axis by proper hologram\ntransformation. Tracking of the vortex trajectory may provide information about\nbeam quality and aberration of an optical system. The new vortex localization\nalgorithm will be presented.\n", "doi": "10.1117/12.2529779", "arxiv_id": "1908.08879", "pdf_urls": ["https://arxiv.org/pdf/1908.08879"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11107, Laser Beam Shaping XIX, 1110703 (2019)", "categories": "physics.optics"}
{"title": "When did Life Likely Emerge on Earth in an RNA-First Process?", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Steven A. Benner", "Elizabeth A. Bell", "Elisa Biondi", "Ramon Brasser", "Thomas Carell", "Hyo-Joong Kim", "Stephen J. Mojzsis", "Arthur Omran", "Matthew A.\n  Pasek and Dustin Trail"], "abstract": "  The widespread presence of ribonucleic acid (RNA) catalysts and cofactors in\nEarth's biosphere today suggests that RNA was the first biopolymer to support\nDarwinian evolution. However, most \"path-hypotheses\" to generate building\nblocks for RNA require reduced nitrogen-containing compounds not made in useful\namounts in the CO2-N2-H2O atmospheres of the Hadean. We review models for\nEarth's impact history that invoke a single ~10^23 kg impactor (Moneta) to\naccount for measured amounts of platinum, gold, and other siderophilic\n(\"iron-loving\") elements on the Earth and Moon. If it were the last sterilizing\nimpactor, Moneta would have reduced the atmosphere but not its mantle, opening\na \"window of opportunity\" for RNA synthesis, a period when RNA precursors\nrained from the atmosphere to land holding oxidized minerals that stabilize\nadvanced RNA precursors and RNA. Surprisingly, this combination of physics,\ngeology, and chemistry suggests a time when RNA formation was most probable,\n~120 +/- 100 million years after Moneta's impact, or ~4.36 +/- 0.1 billion\nyears ago. Uncertainties in this time are driven by uncertainties in rates of\nproductive atmosphere loss and amounts of sub-aerial land.\n", "doi": "10.1002/syst.201900035", "arxiv_id": "1908.11327", "pdf_urls": ["https://arxiv.org/pdf/1908.11327"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "19. Benner, S.A., Bell, E.A., Biondi, E., Brasser, R., Carell, T.,\n  Kim, H-J., Mojzsis, S.J., Omran, A., Pasek, M.A., and Trail, D. (2020) When\n  did Life Likely Emerge on Earth in an RNA-First Process? ChemSystemsChem 2,\n  e1900035", "categories": "astro-ph.EP physics.bio-ph physics.chem-ph physics.geo-ph"}
{"title": "Normality and Montel's Theorem", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gopal Datt and Sanjay Kumar"], "abstract": "  In this article, we prove a normality criterion for a family of meromorphic\nfunctions having zeros with some multiplicity which involves sharing of a\nholomorphic function by the members of the family. Our result generalizes\nMontel's normality test in a certain sense.\n", "doi": "10.1007/s00013-016-0954-7", "arxiv_id": "1909.00151", "pdf_urls": ["https://arxiv.org/pdf/1909.00151"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch Math Basel (2016)", "categories": "math.CV"}
{"title": "Dynamic characterization of beating sinusoidal wave oscillations in a\n  thin-slice solid-state laser with coupled orthogonally polarized transverse\n  modes", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kenju Otsuka"], "abstract": "  Dynamic characterization of self-induced beating sinusoidal wave (BSW)\noscillations and related phenomena, which were previously explored in a\nthin-slice dual-polarization solid-state laser operating in the regime of\nincomplete mode-locking of orthogonally polarized transverse eigenmodes,\nnamely, a quasi-locked state [Laser Physics Letters, 15 (2018) 075001], is\nperformed in terms of the amplitude correlation coefficient and intensity\ncirculation among various orthogonally polarized mode pairs.\nPolarization-dependent symmetry-breaking featuring a nonreciprocal intensity\nflow for different orthogonally polarized mode pairs operating in the BSW state\nare found. The singular state is hidden in a nonlinear system where a perfect\nmode-locked BSW state with a large amplitude correlation coefficient featuring\nreciprocal intensity flow is established for a transverse mode pair possessing\nparticular polarization directions that are related to the intensity ratio of\northogonally polarized transverse eigenmodes. Self-organized chaos\nsynchronization is shown to take place for such a singular transverse mode pair\nsubjected to self-mixing modulations.\n", "doi": "10.1088/1612-202x/ab5573-1", "arxiv_id": "1909.00152", "pdf_urls": ["https://arxiv.org/pdf/1909.00152"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 2019", "categories": "physics.optics"}
{"title": "Manifolds of mappings for continuum mechanics", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Peter W. Michor"], "abstract": "  This is an overview article. After an introduction to convenient calculus in\ninfinite dimensions, the foundational material for manifolds of mappings is\npresented. The central character is the smooth convenient manifold\n$C^{\\infty}(M,N)$ of all smooth mappings from a finite dimensional Whitney\nmanifold germ $M$ into a smooth manifold $N$. A Whitney manifold germ is a\nsmooth (in the interior) manifold with a very general boundary, but still\nadmitting a continuous Whitney extension operator. This notion is developed\nhere for the needs of geometric continuum mechanics.\n", "doi": "10.1007/978-3-030-42683-5_1", "arxiv_id": "1909.00445", "pdf_urls": ["https://arxiv.org/pdf/1909.00445"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In the book: Geometric Continuum Mechanics. Editors: Reuven Segev,\n  Marcelo Epstein. Series: Advances in Continuum Mechanics, Vol. 42. pp. 3-75.\n  Birkh\\\"auser Basel 2020", "categories": "math.DG math.AP"}
{"title": "Know2Look: Commonsense Knowledge for Visual Search", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sreyasi Nag Chowdhury", "Niket Tandon", "Gerhard Weikum"], "abstract": "  With the rise in popularity of social media, images accompanied by contextual\ntext form a huge section of the web. However, search and retrieval of documents\nare still largely dependent on solely textual cues. Although visual cues have\nstarted to gain focus, the imperfection in object/scene detection do not lead\nto significantly improved results. We hypothesize that the use of background\ncommonsense knowledge on query terms can significantly aid in retrieval of\ndocuments with associated images. To this end we deploy three different\nmodalities - text, visual cues, and commonsense knowledge pertaining to the\nquery - as a recipe for efficient search and retrieval.\n", "doi": null, "arxiv_id": "1909.00749", "pdf_urls": ["https://arxiv.org/pdf/1909.00749"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "5th Workshop on Automated Knowledge Base Construction (AKBC) 2016", "categories": "cs.IR"}
{"title": "Generating Black-Box Adversarial Examples for Text Classifiers Using a\n  Deep Reinforced Model", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Prashanth Vijayaraghavan", "Deb Roy"], "abstract": "  Recently, generating adversarial examples has become an important means of\nmeasuring robustness of a deep learning model. Adversarial examples help us\nidentify the susceptibilities of the model and further counter those\nvulnerabilities by applying adversarial training techniques. In natural\nlanguage domain, small perturbations in the form of misspellings or paraphrases\ncan drastically change the semantics of the text. We propose a reinforcement\nlearning based approach towards generating adversarial examples in black-box\nsettings. We demonstrate that our method is able to fool well-trained models\nfor (a) IMDB sentiment classification task and (b) AG's news corpus news\ncategorization task with significantly high success rates. We find that the\nadversarial examples generated are semantics-preserving perturbations to the\noriginal text.\n", "doi": "10.1007/978-3-030-46147-8_43", "arxiv_id": "1909.07873", "pdf_urls": ["https://arxiv.org/pdf/1909.07873"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Joint European Conference on Machine Learning and Knowledge\n  Discovery in Databases. Springer, Cham, 2019", "categories": "cs.LG cs.CL cs.IR stat.ML"}
{"title": "Agility is responsiveness to change: An essential definition", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lucas Gren and Per Lenberg"], "abstract": "  There is some ambiguity of what agile means in both research and practice.\nAuthors have suggested a diversity of different definitions, through which it\nis difficult to interpret what agile really is. The concept, however, exists in\nits implementation through agile practices. In this vision paper, we argue that\nadopting an agile approach boils down to being more responsive to change. To\nsupport this claim, we relate agile principles, practices, the agile manifesto,\nand our own experiences to this core definition. We envision that agile\ntransformations would be, and are, much easier using this definition and\ncontextualizing its implications.\n", "doi": "10.1145/3383219.3383265", "arxiv_id": "1909.10082", "pdf_urls": ["https://arxiv.org/pdf/1909.10082"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Evaluation and Assessment in Software Engineering (EASE 2020),\n  April 15-17, 2020, Trondheim, Norway", "categories": "cs.SE"}
{"title": "A Survey on the Role of Wireless Sensor Networks and IoT in Disaster\n  Management", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ahsan Adeel", "Mandar Gogate", "Saadullah Farooq", "Cosimo Ieracitano", "Kia\n  Dashtipour", "Hadi Larijani", "Amir Hussain"], "abstract": "  Extreme events and disasters resulting from climate change or other\necological factors are difficult to predict and manage. Current limitations of\nstate-of-the-art approaches to disaster prediction and management could be\naddressed by adopting new unorthodox risk assessment and management strategies.\nThe next generation Internet of Things (IoT), Wireless Sensor Networks (WSNs),\n5G wireless communication, and big data analytics technologies are the key\nenablers for future effective disaster management infrastructures. In this\nchapter, we commissioned a survey on emerging wireless communication\ntechnologies with potential for enhancing disaster prediction, monitoring, and\nmanagement systems. Challenges, opportunities, and future research trends are\nhighlighted to provide some insight on the potential future work for\nresearchers in this field.\n", "doi": "10.1007/978-981-13-0992-2_5", "arxiv_id": "1909.10353", "pdf_urls": ["https://arxiv.org/pdf/1909.10353"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2019 Geological Disaster Monitoring Based on Sensor Networks", "categories": "cs.NI"}
{"title": "Patch-Based Image Similarity for Intraoperative 2D/3D Pelvis\n  Registration During Periacetabular Osteotomy", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Robert Grupp", "Mehran Armand", "Russell Taylor"], "abstract": "  Periacetabular osteotomy is a challenging surgical procedure for treating\ndevelopmental hip dysplasia, providing greater coverage of the femoral head via\nrelocation of a patient's acetabulum. Since fluoroscopic imaging is frequently\nused in the surgical workflow, computer-assisted X-Ray navigation of osteotomes\nand the relocated acetabular fragment should be feasible. We use\nintensity-based 2D/3D registration to estimate the pelvis pose with respect to\nfluoroscopic images, recover relative poses of multiple views, and triangulate\nlandmarks which may be used for navigation. Existing similarity metrics are\nunable to consistently account for the inherent mismatch between the\npreoperative intact pelvis, and the intraoperative reality of a fractured\npelvis. To mitigate the effect of this mismatch, we continuously estimate the\nrelevance of each pixel to solving the registration and use these values as\nweightings in a patch-based similarity metric. Limiting computation to randomly\nselected subsets of patches results in faster runtimes than existing\npatch-based methods. A simulation study was conducted with random fragment\nshapes, relocations, and fluoroscopic views, and the proposed method achieved a\n1.7 mm mean triangulation error over all landmarks, compared to mean errors of\n3 mm and 2.8 mm for the non-patched and image-intensity-variance-weighted patch\nsimilarity metrics, respectively.\n", "doi": "10.1007/978-3-030-01201-4_17", "arxiv_id": "1909.10443", "pdf_urls": ["https://arxiv.org/pdf/1909.10443"], "github": ["https://github.com/rg2/xreg"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In OR 2.0 Context-Aware Operating Theaters, Computer Assisted\n  Robotic Endoscopy, Clinical Image-Based Procedures, and Skin Image Analysis\n  2018 Sep 16 (pp. 153-163). Springer, Cham", "categories": "cs.CV eess.IV"}
{"title": "Radiation trapping effect versus superradiance in quantum simulation of\n  light-matter interaction", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. V. Remizov", "A. A. Zhukov", "W. V. Pogosov", "Yu. E. Lozovik"], "abstract": "  We propose a realization of two remarkable effects of Dicke physics in\nquantum simulation of light-matter many-body interactions with artificial\nquantum systems. These effects are a superradiant decay of an ensemble of\nqubits and the opposite radiation trapping effect. We show that both phenomena\ncoexist in the crossover regime of a \"moderately bad\" single-mode cavity\ncoupled to the qubit subsystem. Depending on the type of the initial state and\non the presence of multipartite entanglement in it, the dynamical features can\nbe opposite resulting either in the superradiance or in the radiation trapping\ndespite of the fact that the initial state contains the same number of excited\nqubits. The difference originates from the symmetrical or nonsymmetrical\ncharacter of the initial wave function of the ensemble, which corresponds to\nindistinguishable or distinguishable emitters. We argue that a coexistence of\nboth effects can be used in dynamical quantum simulators to demonstrate\nrealization of Dicke physics, effects of multipartite quantum entanglement, as\nwell as quantum interference and thus to deeply probe quantum nature of these\nartificial quantum systems.\n", "doi": "10.1088/1612-202x/ab1e9e", "arxiv_id": "1909.11900", "pdf_urls": ["https://arxiv.org/pdf/1909.11900"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 16, 065205 (2019)", "categories": "quant-ph physics.app-ph physics.optics"}
{"title": "Breakup Dynamics of Capillary Bridges on Hydrophobic Stripes", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Maximilian Hartmann and Mathis Fricke and Lukas Weimar and Dirk\n  Gr\\\"unding and Tomislav Mari\\'c and Dieter Bothe and Steffen Hardt"], "abstract": "  The breakup dynamics of a capillary bridge on a hydrophobic stripe between\ntwo hydrophilic stripes is studied experimentally and numerically using direct\nnumerical simulations. The capillary bridge is formed from an evaporating water\ndroplet wetting three neighboring stripes of a chemically patterned surface. By\nconsidering the breakup process in a phase space representation, the breakup\ndynamics can be evaluated without the uncertainty in determining the precise\nbreakup time. The simulations are based on the Volume-of-Fluid (VOF) method\nimplemented in Free Surface 3D (FS3D). In order to construct physically\nrealistic initial data for the VOF simulation, Surface Evolver is employed to\ncalculate an initial configuration consistent with experiments. Numerical\ninstabilities at the contact line are reduced by a novel discretization of the\nNavier-slip boundary condition on staggered grids. The breakup of the capillary\nbridge cannot be characterized by a unique scaling relationship. Instead, at\ndifferent stages of the breakup process different scaling exponents apply, and\nthe structure of the bridge undergoes a qualitative change. In the final stage\nof breakup, the capillary bridge forms a liquid thread that breaks up\nconsistently with the Rayleigh-Plateau instability.\n", "doi": "10.1016/j.ijmultiphaseflow.2021.103582", "arxiv_id": "1910.01887", "pdf_urls": ["https://arxiv.org/pdf/1910.01887"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 140 (2021) 103582", "categories": "physics.flu-dyn"}
{"title": "The influence of the Earth's curved spacetime on Gaussian quantum\n  coherence", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tonghua Liu", "Shumin Wu", "Shuo Cao"], "abstract": "  Light wave-packets propagating from the Earth to satellites will be deformed\nby the curved background spacetime of the Earth, thus influencing the quantum\nstate of light. We show that Gaussian coherence of photon pairs, which are\ninitially prepared in a two-mode squeezed state, is affected by the curved\nspacetime background of the Earth. We demonstrate that quantum coherence of the\nstate increases for a specific range of height h and then gradually approaches\na finite value with further increasing height of the satellite's orbit in Kerr\nspacetime, because special relativistic effect are involved. Meanwhile, we find\nthat Gaussian coherence increases with the increase of Gaussian bandwidth\nparameter, but the Gaussian coherence decreases with the growth of the peak\nfrequency. In addition, we also find that total gravitational frequency shift\ncauses changes of Gaussian coherence less than $%1$ and different initial peak\nfrequencies also can effect rate of change with the satellite height in\ngeostationary Earth orbits.\n", "doi": "10.1088/1612-202x/ab2be4", "arxiv_id": "1910.02595", "pdf_urls": ["https://arxiv.org/pdf/1910.02595"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters (2019)", "categories": "quant-ph"}
{"title": "Fast and robust method for flow analysis using GPU assisted diffractive\n  optical element based background oriented schlieren (BOS)", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jagadesh Ramaiah", "Sreeprasad Ajithaprasad", "Gannavarpu Rajshekhar and\n  Dario Ambrosini"], "abstract": "  The paper introduces a method for studying flow dynamics using diffractive\noptical element based background-oriented schlieren (BOS). Our method relies on\nfringe demodulation using root multiple signal classification technique which\nprovides high robustness against noise. Further, a graphics processing unit\n(GPU) based implementation is proposed which offers significant improvement in\ncomputational efficiency, and thus enables high speed analysis of flows. The\nperformance of the method is demonstrated via numerical simulations and the\npractical applicability is also shown by analyzing a diffusion phenomenon in\nliquids by BOS.\n", "doi": "10.1016/j.optlaseng.2019.105908", "arxiv_id": "1910.11872", "pdf_urls": ["https://arxiv.org/pdf/1910.11872"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering, 126, 105908, 2020", "categories": "eess.IV eess.SP"}
{"title": "A Framework for Building Closed-Domain Chat Dialogue Systems", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mikio Nakano and Kazunori Komatani"], "abstract": "  This paper presents HRIChat, a framework for developing closed-domain chat\ndialogue systems. Being able to engage in chat dialogues has been found\neffective for improving communication between humans and dialogue systems. This\npaper focuses on closed-domain systems because they would be useful when\ncombined with task-oriented dialogue systems in the same domain. HRIChat\nenables domain-dependent language understanding so that it can deal well with\ndomain-specific utterances. In addition, HRIChat makes it possible to integrate\nstate transition network-based dialogue management and reaction-based dialogue\nmanagement. FoodChatbot, which is an application in the food and restaurant\ndomain, has been developed and evaluated through a user study. Its results\nsuggest that reasonably good systems can be developed with HRIChat. This paper\nalso reports lessons learned from the development and evaluation of\nFoodChatbot.\n", "doi": "10.1016/j.knosys.2020.106212", "arxiv_id": "1910.13826", "pdf_urls": ["https://arxiv.org/pdf/1910.13826"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 204, 2020", "categories": "cs.CL"}
{"title": "Weak inverse problem of calculus of variations for geodesic mappings and\n  relation to harmonic maps", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stanislav Hronek"], "abstract": "  In this paper, we study the relation between geodesic and harmonic mappings.\nHarmonic mappings are defined between Riemannian manifolds as critical points\nof the energy functional, on the other hand, geodesic mappings are defined in a\nmore general setting (manifolds with affine connections). Using the\nwell-established formalism of calculus of variations on fibred manifolds we\nsolve the weak inverse problem for the equation of geodesic mappings and get a\nvariational equation which is a consequence of the geodesic mappings equation.\nFor the connection on the target manifold we get the expected result, that it\nis a metric connection. However, we find that the connection on the source\nmanifold need not be metric. The interesting result is that the metric which\ninduces the connection on the target manifold can change between fibres and\nthese changes are related to the connection on the source manifold. These\nresults hint onto a possibility for a more general structure on the fibred\nmanifold, than usually assumed.\n", "doi": "10.1007/978-3-030-17031-8_9", "arxiv_id": "1910.14089", "pdf_urls": ["https://arxiv.org/pdf/1910.14089"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Chapter in the Book: Nonlinear PDEs, Their Geometry, and\n  Applications, Birkh\\\"auser Basel 2019", "categories": "math.DG math-ph math.MP"}
{"title": "Efficiency Improvement of Commercially Available MPPT Controllers Using\n  Boost Converter", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lean Karlo S. Tolentino", "Dan Frederico P. Abacco", "Mar Jun M. Siquihod"], "abstract": "  The use of charge controllers in photovoltaic generation systems increases\nthe energy harvested significantly. The most efficient type of charge\ncontroller is the Maximum Power Point Tracking (MPPT) controller. The\ncommercially available MPPT controller is limited to the input voltage of the\nsolar panel and to the charging voltage of the battery making it inefficient to\nvery low irradiance weather condition. In this paper, it is proposed to\nincrease the efficiency of commercially available MPPT controllers by adding\nPower Management System that has boost converter and switching circuit that\nwill operate at low irradiance weather conditions like cloudy, sunrise, and\nsunset. The boost converter is controlled by the PWM function of Arduino Uno to\nregulate the voltage required of the MPPT controller. The switching circuit\nwill automatically change the direction of current depending on the output of\nthe voltage sensors attached to the PV panel and input of MPPT controller. The\nresults showed that there is 8.77% increase in average power to the system with\nPower Management System compared to the MPPT controller alone.\n", "doi": null, "arxiv_id": "1911.01524", "pdf_urls": ["https://arxiv.org/pdf/1911.01524"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "29th ASEMEP National Technical Symposium (2018), 1-5", "categories": "eess.SY cs.SY eess.SP"}
{"title": "Distributed Model Predictive Safety Certification for Learning-based\n  Control", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Simon Muntwiler", "Kim P. Wabersich", "Andrea Carron", "Melanie N. Zeilinger"], "abstract": "  While distributed algorithms provide advantages for the control of complex\nlarge-scale systems by requiring a lower local computational load and less\nlocal memory, it is a challenging task to design high-performance distributed\ncontrol policies. Learning-based control algorithms offer promising\nopportunities to address this challenge, but generally cannot guarantee safety\nin terms of state and input constraint satisfaction. A recently proposed safety\nframework for centralized linear systems ensures safety by matching the\nlearning-based input online with the initial input of a model predictive\ncontrol law capable of driving the system to a terminal set known to be safe.\nWe extend this idea to derive a distributed model predictive safety\ncertification (DMPSC) scheme, which is able to ensure state and input\nconstraint satisfaction when applying any learning-based control algorithm to\nan uncertain distributed linear system with dynamic couplings. The scheme is\nbased on a distributed tube-based model predictive control (MPC) concept, where\nsubsystems negotiate local tube sizes among neighbors in order to mitigate\nrestrictiveness of the safety approach. In addition, we present a technique for\ngenerating a structured ellipsoidal robust positive invariant tube. In\nnumerical simulations, we show that the safety framework ensures constraint\nsatisfaction for an initially unsafe control policy and allows to improve\noverall control performance compared to robust distributed MPC.\n", "doi": "10.1016/j.ifacol.2020.12.1205", "arxiv_id": "1911.01832", "pdf_urls": ["https://arxiv.org/pdf/1911.01832"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Muntwiler, S., Wabersich, K.P., Carron, A., and Zeilinger, M.N.\n  (2020). Distributed Model Predictive Safety Certification for Learning-based\n  Control. IFAC-PapersOnLine, 53(2), 5258-5265. 21th IFAC World Congress", "categories": "eess.SY cs.SY"}
{"title": "Out of distribution detection for intra-operative functional imaging", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tim J. Adler", "Leonardo Ayala", "Lynton Ardizzone", "Hannes G. Kenngott", "Anant Vemuri", "Beat P. M\\\"uller-Stich", "Carsten Rother", "Ullrich K\\\"othe", "and\n  Lena Maier-Hein"], "abstract": "  Multispectral optical imaging is becoming a key tool in the operating room.\nRecent research has shown that machine learning algorithms can be used to\nconvert pixel-wise reflectance measurements to tissue parameters, such as\noxygenation. However, the accuracy of these algorithms can only be guaranteed\nif the spectra acquired during surgery match the ones seen during training. It\nis therefore of great interest to detect so-called out of distribution (OoD)\nspectra to prevent the algorithm from presenting spurious results. In this\npaper we present an information theory based approach to OoD detection based on\nthe widely applicable information criterion (WAIC). Our work builds upon recent\nmethodology related to invertible neural networks (INN). Specifically, we make\nuse of an ensemble of INNs as we need their tractable Jacobians in order to\ncompute the WAIC. Comprehensive experiments with in silico, and in vivo\nmultispectral imaging data indicate that our approach is well-suited for OoD\ndetection. Our method could thus be an important step towards reliable\nfunctional imaging in the operating room.\n", "doi": "10.1007/978-3-030-32689-0_8", "arxiv_id": "1911.01877", "pdf_urls": ["https://arxiv.org/pdf/1911.01877"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the First International Workshop on Uncertainty for\n  Safe Utilization of Machine Learning in Medical Imaging, UNSURE 2019, and the\n  8th International Workshop on Clinical Image-Based Procedures, CLIP 2019", "categories": "eess.IV cs.LG physics.med-ph stat.ML"}
{"title": "Stimulated Raman scattering in the degenerate regime", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yao Zhao", "Suming Weng", "Zhengming Sheng", "Jianqiang Zhu"], "abstract": "  Stimulated Raman scattering (SRS) in plasma in the degenerate regime is\nstudied theoretically and numerically. Different from normal SRS with the\nnon-degenerate eigen electrostatic mode excited, the degenerate SRS is\ndeveloped at plasma density $n_e>0.25n_c$ when the laser amplitude is larger\nthan a certain threshold. To satisfy the phase-matching conditions of frequency\nand wavenumber, the excited electrostatic mode has a constant frequency around\nhalf of the incident light frequency $\\omega_0/2$, which is no longer the\nnon-degenerate eigenmode of electron plasma wave $\\omega_{pe}$. Both the\nscattered light and the electrostatic wave are trapped in plasma with their\ngroup velocities being zero. Super hot electrons are produced by the degenerate\nelectrostatic wave. Our theoretical model is validated by particle-in-cell\nsimulations. The SRS driven in this degenerate regime is an important laser\nenergy loss mechanism in the laser plasma interactions as long as the laser\nintensity is higher than $10^{15}$W/cm$^2$.\n", "doi": "10.1017/hpl.2020.22", "arxiv_id": "1911.04671", "pdf_urls": ["https://arxiv.org/pdf/1911.04671"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "High Pow Laser Sci Eng 8 (2020) e21", "categories": "physics.plasm-ph nlin.PS physics.optics"}
{"title": "Basic Ideas and Tools for Projection-Based Model Reduction of Parametric\n  Partial Differential Equations", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gianluigi Rozza", "Martin Hess", "Giovanni Stabile", "Marco Tezzele", "Francesco Ballarin"], "abstract": "  We provide first the functional analysis background required for reduced\norder modeling and present the underlying concepts of reduced basis model\nreduction. The projection-based model reduction framework under affinity\nassumptions, offline-online decomposition and error estimation is introduced.\nSeveral tools for geometry parametrizations, such as free form deformation,\nradial basis function interpolation and inverse distance weighting\ninterpolation are explained. The empirical interpolation method is introduced\nas a general tool to deal with non-affine parameter dependency and non-linear\nproblems. The discrete and matrix versions of the empirical interpolation are\nconsidered as well. Active subspaces properties are discussed to reduce\nhigh-dimensional parameter spaces as a pre-processing step. Several examples\nillustrate the methodologies.\n", "doi": "10.1515/9783110671490-001", "arxiv_id": "1911.08954", "pdf_urls": ["https://arxiv.org/pdf/1911.08954"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Model Order Reduction, Volume 2: Snapshot-Based Methods and\n  Algorithms, De Gruyter, 2020", "categories": "math.NA cs.NA"}
{"title": "An Empirical Study of Sections in Classifying Disease Outbreak Reports", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Son Doan", "Mike Conway", "Nigel Collier"], "abstract": "  Identifying articles that relate to infectious diseases is a necessary step\nfor any automatic bio-surveillance system that monitors news articles from the\nInternet. Unlike scientific articles which are available in a strongly\nstructured form, news articles are usually loosely structured. In this chapter,\nwe investigate the importance of each section and the effect of section\nweighting on performance of text classification. The experimental results show\nthat (1) classification models using the headline and leading sentence achieve\na high performance in terms of F-score compared to other parts of the article;\n(2) all section with bag-of-word representation (full text) achieves the\nhighest recall; and (3) section weighting information can help to improve\naccuracy.\n", "doi": "10.1007/978-1-4419-1274-9_4", "arxiv_id": "1911.09319", "pdf_urls": ["https://arxiv.org/pdf/1911.09319"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Web-Based Applications in Healthcare and Biomedicine, pp 47-58,\n  2010", "categories": "cs.CL"}
{"title": "Communication-Efficient Distributed Online Learning with Kernels", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michael Kamp", "Sebastian Bothe", "Mario Boley", "Michael Mock"], "abstract": "  We propose an efficient distributed online learning protocol for low-latency\nreal-time services. It extends a previously presented protocol to kernelized\nonline learners that represent their models by a support vector expansion.\nWhile such learners often achieve higher predictive performance than their\nlinear counterparts, communicating the support vector expansions becomes\ninefficient for large numbers of support vectors. The proposed extension allows\nfor a larger class of online learning algorithms---including those alleviating\nthe problem above through model compression. In addition, we characterize the\nquality of the proposed protocol by introducing a novel criterion that requires\nthe communication to be bounded by the loss suffered.\n", "doi": null, "arxiv_id": "1911.12899", "pdf_urls": ["https://arxiv.org/pdf/1911.12899"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Machine Learning and Knowledge Discovery in Databases. ECML PKDD\n  2016", "categories": "cs.LG cs.DC stat.ML"}
{"title": "Weakly multiplicative arithmetic functions and the normal growth of\n  groups", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jan-Christoph Schlage-Puchta"], "abstract": "  We show that an arithmetic function which satisfies some weak\nmultiplicativity properties and in addition has a non-decreasing or\n$\\log$-uniformly continuous normal order is close to a function of the form\n$n\\mapsto n^c$. As an application we show that a finitely generated, residually\nfinite, infinite group, whose normal growth has a non-decreasing or a\n$\\log$-uniformly continuous normal order is isomorphic to $(\\mathbb{Z}, +)$.\n", "doi": "10.1007/s00013-018-1267-9", "arxiv_id": "1912.00851", "pdf_urls": ["https://arxiv.org/pdf/1912.00851"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 112 (2019), 233-240", "categories": "math.NT math.GR"}
{"title": "Multimessenger search for evaporating primordial black holes", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.B. Petkov", "E.V. Bugaev", "P. A. Klimai"], "abstract": "  Primordial black holes (PBHs) are black holes which may form in the early\nUniverse through the gravitational collapse of primordial cosmological density\nfluctuations. Due to Hawking radiation these PBHs are supposed to evaporate by\nemitting particles. Recent developments in the experimental searching for\nevaporating PBHs in the local Universe are reviewed. The multimessenger\ntechniques of searching for signals from evaporating PBHs are discussed.\n", "doi": null, "arxiv_id": "1912.01317", "pdf_urls": ["https://arxiv.org/pdf/1912.01317"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the International Conference \"SN 1987A, Quark Phase\n  Transition in Compact Objects and Multimessenger Astronomy\", Russia, Terskol\n  (BNO INR RAS), Nizhnij Arkhyz (SAO RAS), 2-8 July 2017, INR RAS, Moscow,\n  2018, p. 158", "categories": "astro-ph.HE"}
{"title": "A Gaussian moment method and its augmentation via LSTM recurrent neural\n  networks for the statistics of cavitating bubble populations", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Spencer H. Bryngelson", "Alexis Charalampopoulos", "Themistoklis P.\n  Sapsis", "Tim Colonius"], "abstract": "  Phase-averaged dilute bubbly flow models require high-order statistical\nmoments of the bubble population. The method of classes, which directly evolve\nbins of bubbles in the probability space, are accurate but computationally\nexpensive. Moment-based methods based upon a Gaussian closure present an\nopportunity to accelerate this approach, particularly when the bubble size\ndistributions are broad (polydisperse). For linear bubble dynamics a Gaussian\nclosure is exact, but for bubbles undergoing large and nonlinear oscillations,\nit results in a large error from misrepresented higher-order moments. Long\nshort-term memory recurrent neural networks, trained on Monte Carlo truth data,\nare proposed to improve these model predictions. The networks are used to\ncorrect the low-order moment evolution equations and improve prediction of\nhigher-order moments based upon the low-order ones. Results show that the\nnetworks can reduce model errors to less than $1\\%$ of their unaugmented\nvalues.\n", "doi": "10.1016/j.ijmultiphaseflow.2020.103262", "arxiv_id": "1912.04450", "pdf_urls": ["https://arxiv.org/pdf/1912.04450"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 127, 103262 (2020)", "categories": "physics.flu-dyn physics.comp-ph"}
{"title": "Automatic Analysis of Sewer Pipes Based on Unrolled Monocular Fisheye\n  Images", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Johannes K\\\"unzel", "Thomas Werner", "Ronja M\\\"oller", "Peter Eisert", "Jan\n  Waschnewski", "Ralf Hilpert"], "abstract": "  The task of detecting and classifying damages in sewer pipes offers an\nimportant application area for computer vision algorithms. This paper describes\na system, which is capable of accomplishing this task solely based on low\nquality and severely compressed fisheye images from a pipe inspection robot.\nRelying on robust image features, we estimate camera poses, model the image\nlighting, and exploit this information to generate high quality cylindrical\nunwraps of the pipes' surfaces.Based on the generated images, we apply semantic\nlabeling based on deep convolutional neural networks to detect and classify\ndefects as well as structural elements.\n", "doi": "10.1109/wacv.2018.00223", "arxiv_id": "1912.05222", "pdf_urls": ["https://arxiv.org/pdf/1912.05222"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Kunzel, T. Werner, P. Eisert and J. Waschnewski, \"Automatic\n  Analysis of Sewer Pipes Based on Unrolled Monocular Fisheye Images,\" 2018\n  IEEE Winter Conference on Applications of Computer Vision (WACV), Lake Tahoe,\n  NV, 2018, pp. 2019-2027", "categories": "cs.CV"}
{"title": "Quantum Fisher information and coherence of an atom in a dissipative\n  cavity", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jianhe Yang", "Danping Lin", "Rongfang Liu", "Hong-Mei Zou"], "abstract": "  In this work, we investigate quantum Fisher information(QFI) and quantum\ncoherence(QC) of an atom in dissipative cavity. In zero temperature reservior\nand with one excitation number, we obtain the analytical solutions of QFI and\nQC as well as their relationship for Ohmic and Lorentzian reservoir,\nrespectively. The results show that both of the atom-cavity coupling and the\ncavity-reservoir coupling can effectively protect QFI and QC. Especially, QFI\nand QC will tend to their stable values when the atom-cavity coupling or the\ncavity-reservoir coupling is larger than a certain value. QC can augment QFI\nand can effectively improve the quantum metrology. In addition, we give a\nphysical explanation of the dynamic behavior of QFI and QC by using the\ndecoherence rate.\n", "doi": "10.1088/1555-6611/ab7382", "arxiv_id": "1912.05760", "pdf_urls": ["https://arxiv.org/pdf/1912.05760"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 30 (2020) 045202 (8pp)", "categories": "quant-ph"}
{"title": "The multiple holomorph of a semidirect product of groups having coprime\n  exponents", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Cindy Tsang"], "abstract": "  Given any group $G$, the multiple holomorph $\\mathrm{NHol}(G)$ is the\nnormalizer of the holomorph $\\mathrm{Hol}(G) = \\rho(G)\\rtimes \\mathrm{Aut}(G)$\nin the group of all permutations of $G$, where $\\rho$ denotes the right regular\nrepresentation. The quotient $T(G) = \\mathrm{NHol}(G)/\\mathrm{Hol}G)$ has order\na power of $2$ in many of the known cases, but there are exceptions. We shall\ngive a new method of constructing elements (of odd order) in $T(G)$ when\n$G=A\\rtimes C_d$, where $A$ is a group of finite exponent coprime to $d$ and\n$C_d$ is the cyclic group of order $d$.\n", "doi": "10.1007/s00013-020-01439-2", "arxiv_id": "1912.06781", "pdf_urls": ["https://arxiv.org/pdf/1912.06781"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 115 (2020), no. 1, 13-21", "categories": "math.GR"}
{"title": "Explainability and Adversarial Robustness for RNNs", "year": 2019, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alexander Hartl", "Maximilian Bachl", "Joachim Fabini", "Tanja Zseby"], "abstract": "  Recurrent Neural Networks (RNNs) yield attractive properties for constructing\nIntrusion Detection Systems (IDSs) for network data. With the rise of\nubiquitous Machine Learning (ML) systems, malicious actors have been catching\nup quickly to find new ways to exploit ML vulnerabilities for profit. Recently\ndeveloped adversarial ML techniques focus on computer vision and their\napplicability to network traffic is not straightforward: Network packets expose\nfewer features than an image, are sequential and impose several constraints on\ntheir features.\n  We show that despite these completely different characteristics, adversarial\nsamples can be generated reliably for RNNs. To understand a classifier's\npotential for misclassification, we extend existing explainability techniques\nand propose new ones, suitable particularly for sequential data. Applying them\nshows that already the first packets of a communication flow are of crucial\nimportance and are likely to be targeted by attackers. Feature importance\nmethods show that even relatively unimportant features can be effectively\nabused to generate adversarial samples. Since traditional evaluation metrics\nsuch as accuracy are not sufficient for quantifying the adversarial threat, we\npropose the Adversarial Robustness Score (ARS) for comparing IDSs, capturing a\ncommon notion of adversarial robustness, and show that an adversarial training\nprocedure can significantly and successfully reduce the attack surface.\n", "doi": "10.1109/bigdataservice49289.2020.00030", "arxiv_id": "1912.09855", "pdf_urls": ["https://arxiv.org/pdf/1912.09855"], "github": ["https://github.com/CN-TU/adversarial-recurrent-ids"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2020 IEEE Sixth International Conference on Big Data Computing\n  Service and Applications (BigDataService)", "categories": "cs.LG cs.CR cs.NI stat.ML"}
{"title": "Quantifying quantum non-Markovianity based on quantum coherence via skew\n  information", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lian-He Shao", "Yu-Ran Zhang", "Yu Luo", "Zhengjun Xi", "and Shao-Ming Fei"], "abstract": "  Based on the nonincreasing property of quantum coherence via skew information\nunder incoherent completely positive and trace-preserving maps, we propose a\nnon-Markovianity measure for open quantum processes. As applications, by\napplying the proposed measure to some typical noisy channels, we find that it\nis equivalent to the three previous measures of non-Markovianity for phase\ndamping and amplitude damping channels, i.e., the measures based on the quantum\ntrace distance, dynamical divisibility, and quantum mutual information. For the\nrandom unitary channel, it is equivalent to the non-Markovianity measure based\non $l_1$ norm of coherence for a class of output states and it is incompletely\nequivalent to the measure based on dynamical divisibility. We also use the\nmodified Tsallis relative $\\alpha$ entropy of coherence to detect the\nnon-Markovianity of dynamics of quantum open systems, the results show that the\nmodified Tsallis relative $\\alpha$ entropy of coherence are more comfortable\nthan the original Tsallis relative $\\alpha$ entropy of coherence for small\n$\\alpha$.\n", "doi": "10.1088/1612-202x/ab5fe3", "arxiv_id": "2001.01261", "pdf_urls": ["https://arxiv.org/pdf/2001.01261"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 17 015202 (2020)", "categories": "quant-ph"}
{"title": "Deep Transfer Convolutional Neural Network and Extreme Learning Machine\n  for Lung Nodule Diagnosis on CT images", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xufeng Huang", "Qiang Lei", "Tingli Xie", "Yahui Zhang", "Zhen Hu", "Qi Zhou"], "abstract": "  Some content of the article needs to be kept secret\n", "doi": "10.1016/j.knosys.2020.106230.", "arxiv_id": "2001.01279", "pdf_urls": ["https://arxiv.org/pdf/2001.01279"], "github": ["https://github.com/hxf1228/dtcnn_elm_lnd"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2020) 106230", "categories": "eess.IV cs.CV cs.LG"}
{"title": "Leveraging Prior Knowledge for Protein-Protein Interaction Extraction\n  with Memory Network", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Huiwei Zhou", "Zhuang Liu", "Shixian Ning", "Yunlong Yang", "Chengkun Lang", "Yingyu Lin", "Kun Ma"], "abstract": "  Automatically extracting Protein-Protein Interactions (PPI) from biomedical\nliterature provides additional support for precision medicine efforts. This\npaper proposes a novel memory network-based model (MNM) for PPI extraction,\nwhich leverages prior knowledge about protein-protein pairs with memory\nnetworks. The proposed MNM captures important context clues related to\nknowledge representations learned from knowledge bases. Both entity embeddings\nand relation embeddings of prior knowledge are effective in improving the PPI\nextraction model, leading to a new state-of-the-art performance on the\nBioCreative VI PPI dataset. The paper also shows that multiple computational\nlayers over an external memory are superior to long short-term memory networks\nwith the local memories.\n", "doi": "10.1093/database/bay071", "arxiv_id": "2001.02107", "pdf_urls": ["https://arxiv.org/pdf/2001.02107"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Database-The Journal of Biological Databases and Curation, 2018,\n  2018: bay071", "categories": "cs.CL"}
{"title": "Characterization of photoelastic materials by combined Mach-Zehnder and\n  conoscopic interferometry: Application to tetragonal lithium tetraborate\n  crystals", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["B.G.Mytsyk", "A.S.Andrushchak", "D.M.Vynnyk", "N.M.Demyanyshyn", "Ya.P.Kost\n  and A.V.Kityk"], "abstract": "  Mach-Zehnder and conoscopic interferometry are used to explore photoelastic\nproperties of anisotropic crystal materials. In a number of cases an\napplication of both techniques significantly improves an accuracy of piezooptic\nand photoelastic measurements. The performance of such combined approach is\ndemonstrated on tetragonal lithium tetraborate (LTB) single crystals, as an\nexample. Special attention is paid to methodological and metrological aspects,\nsuch as measurement accuracy and the quantitative error analysis of the\nresulting measurements. Performing the interferometric measurements for\ndifferent geometries of piezooptic coupling the full sets of piezooptic and\nphotoelastic tensor constants of LTB crystals have been determined. The\nacoustooptic efficiency, on the other hand, has been evaluated using the\nmagnitudes of photoelastic constants derived from the piezooptical\nmeasurements. For the geometries with strong photoelastic coupling LTB\ndemonstrates quite large acoustooptic performance with figure of merit value ,\n$M_2$ achieving 2.12 $\\times$ 10$^{-15}$ s$^3$/kg. It is several times larger\nthan that of strontium borate crystals, nowadays the best acoustooptic material\nin deep ultraviolet spectral region.\n", "doi": "10.1016/j.optlaseng.2019.105991", "arxiv_id": "2001.02475", "pdf_urls": ["https://arxiv.org/pdf/2001.02475"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering, 127 (2020) 105991", "categories": "physics.optics physics.app-ph"}
{"title": "Evolution of Image Segmentation using Deep Convolutional Neural Network:\n  A Survey", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Farhana Sultana (1)", "Abu Sufian (1) and Paramartha Dutta (2)", "((1)\n  Dept. of Computer Science", "University of Gour Banga", "(2) Dept. of Computer &\n  System Sciences", "Visva-Bharati University)"], "abstract": "  From the autonomous car driving to medical diagnosis, the requirement of the\ntask of image segmentation is everywhere. Segmentation of an image is one of\nthe indispensable tasks in computer vision. This task is comparatively\ncomplicated than other vision tasks as it needs low-level spatial information.\nBasically, image segmentation can be of two types: semantic segmentation and\ninstance segmentation. The combined version of these two basic tasks is known\nas panoptic segmentation. In the recent era, the success of deep convolutional\nneural networks (CNN) has influenced the field of segmentation greatly and gave\nus various successful models to date. In this survey, we are going to take a\nglance at the evolution of both semantic and instance segmentation work based\non CNN. We have also specified comparative architectural details of some\nstate-of-the-art models and discuss their training details to present a lucid\nunderstanding of hyper-parameter tuning of those models. We have also drawn a\ncomparison among the performance of those models on different datasets. Lastly,\nwe have given a glimpse of some state-of-the-art panoptic segmentation models.\n", "doi": "10.1016/j.knosys.2020.106062", "arxiv_id": "2001.04074", "pdf_urls": ["https://arxiv.org/pdf/2001.04074"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "journal = \"Knowledge-Based Systems\", volume = \"201-202\", pages =\n  \"106062\", year = \"2020\"", "categories": "cs.CV"}
{"title": "The Synthinel-1 dataset: a collection of high resolution synthetic\n  overhead imagery for building segmentation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fanjie Kong", "Bohao Huang", "Kyle Bradbury", "Jordan M. Malof"], "abstract": "  Recently deep learning - namely convolutional neural networks (CNNs) - have\nyielded impressive performance for the task of building segmentation on large\noverhead (e.g., satellite) imagery benchmarks. However, these benchmark\ndatasets only capture a small fraction of the variability present in real-world\noverhead imagery, limiting the ability to properly train, or evaluate, models\nfor real-world application. Unfortunately, developing a dataset that captures\neven a small fraction of real-world variability is typically infeasible due to\nthe cost of imagery, and manual pixel-wise labeling of the imagery. In this\nwork we develop an approach to rapidly and cheaply generate large and diverse\nvirtual environments from which we can capture synthetic overhead imagery for\ntraining segmentation CNNs. Using this approach, generate and publicly-release\na collection of synthetic overhead imagery - termed Synthinel-1 with full\npixel-wise building labels. We use several benchmark dataset to demonstrate\nthat Synthinel-1 is consistently beneficial when used to augment real-world\ntraining imagery, especially when CNNs are tested on novel geographic locations\nor conditions.\n", "doi": "10.1109/wacv45572.2020.9093339", "arxiv_id": "2001.05130", "pdf_urls": ["https://arxiv.org/pdf/2001.05130"], "github": ["https://github.com/timqqt/Synthinel"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "F. Kong, The Synthinel-1 dataset: a collection of high resolution\n  synthetic overhead imagery for building segmentation, 2020, IEEE Winter\n  Conference on Applications of Computer Vision (WACV)", "categories": "cs.CV cs.LG"}
{"title": "Guided-mode resonance filter extended-cavity diode laser", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["L Guillemot", "T Oksenhendler", "S Pelloquin", "O Gauthier-Lafaye", "A\n  Monmayrant and T Chaneli\\`ere"], "abstract": "  We characterize a semiconductor external cavity diode laser whose optical\nfeedback is provided by a guided mode resonance filter (GMRF). We focus on the\nspectral properties. The wavelength of operation falls in the telecom range\n(1506 nm). The GMRF acting both as a wavelength intracavity filter and feedback\nmirror allows for a compact laser design. The single-mode operation is verified\nin a wide range of driving currents. We finely tune the cavity length to adjust\nthe frequency by 14 GHz without mode-hops in agreement with the expected\nfree-spectral range of the resonator $\\sim$20 GHz. The compactness of the\ncavity allows fast frequency sweeps when modulating the current (90 MHz/mA at\n100 kHz, the modulation bandwidth). The frequency noise (366 kHz white-noise\ncontribution) is also analysed to evaluate the potential of our design for\nhigh-resolution applications.\n", "doi": "10.1088/1555-6611/ab7012", "arxiv_id": "2001.06104", "pdf_urls": ["https://arxiv.org/pdf/2001.06104"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2020 Laser Phys. 30 035802", "categories": "physics.optics"}
{"title": "Deep Collaborative Embedding for information cascade prediction", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuhui Zhao", "Ning Yang", "Tao Lin", "Philip S. Yu"], "abstract": "  Recently, information cascade prediction has attracted increasing interest\nfrom researchers, but it is far from being well solved partly due to the three\ndefects of the existing works. First, the existing works often assume an\nunderlying information diffusion model, which is impractical in real world due\nto the complexity of information diffusion. Second, the existing works often\nignore the prediction of the infection order, which also plays an important\nrole in social network analysis. At last, the existing works often depend on\nthe requirement of underlying diffusion networks which are likely unobservable\nin practice. In this paper, we aim at the prediction of both node infection and\ninfection order without requirement of the knowledge about the underlying\ndiffusion mechanism and the diffusion network, where the challenges are\ntwo-fold. The first is what cascading characteristics of nodes should be\ncaptured and how to capture them, and the second is that how to model the\nnon-linear features of nodes in information cascades. To address these\nchallenges, we propose a novel model called Deep Collaborative Embedding (DCE)\nfor information cascade prediction, which can capture not only the node\nstructural property but also two kinds of node cascading characteristics. We\npropose an auto-encoder based collaborative embedding framework to learn the\nnode embeddings with cascade collaboration and node collaboration, in which way\nthe non-linearity of information cascades can be effectively captured. The\nresults of extensive experiments conducted on real-world datasets verify the\neffectiveness of our approach.\n", "doi": "10.1016/j.knosys.2020.105502", "arxiv_id": "2001.06665", "pdf_urls": ["https://arxiv.org/pdf/2001.06665"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 2020, 105502", "categories": "cs.SI cs.LG"}
{"title": "Precise tomography of optical polarization qubits under conditions of\n  chromatic aberration of quantum transformations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["B. I. Bantysh", "Yu. I. Bogdanov", "N. A. Bogdanova", "Yu. A. Kuznetsov"], "abstract": "  In this work we present an algorithm of building an adequate model of\npolarizing quantum state measurement. This model takes into account chromatic\naberration of the basis change transformation caused by the parasitic\ndispersion of the wave plates crystal and finite radiation spectral bandwidth.\nWe show that the chromatic aberration reduces the amount of information in the\nmeasurements results. Using the information matrix approach we estimate the\nimpact of this effect on the qubit state reconstruction fidelity for different\nvalues of sample size and spectral bandwidth. We also demonstrate that our\nmodel outperforms the standard model of projective measurements as it could\nsuppress systematic errors of quantum tomography even when one performs the\nmeasurements using wave plates of high order.\n", "doi": "10.1088/1612-202x/ab6e72", "arxiv_id": "2001.07255", "pdf_urls": ["https://arxiv.org/pdf/2001.07255"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 17 035205 (2020)", "categories": "quant-ph"}
{"title": "From abstract items to latent spaces to observed data and back:\n  Compositional Variational Auto-Encoder", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Victor Berger (TAU)", "Mich\\`ele Sebag (LRI)"], "abstract": "  Conditional Generative Models are now acknowledged an essential tool in\nMachine Learning. This paper focuses on their control. While many approaches\naim at disentangling the data through the coordinate-wise control of their\nlatent representations, another direction is explored in this paper. The\nproposed CompVAE handles data with a natural multi-ensemblist structure (i.e.\nthat can naturally be decomposed into elements). Derived from Bayesian\nvariational principles, CompVAE learns a latent representation leveraging both\nobservational and symbolic information. A first contribution of the approach is\nthat this latent representation supports a compositional generative model,\namenable to multi-ensemblist operations (addition or subtraction of elements in\nthe composition). This compositional ability is enabled by the invariance and\ngenerality of the whole framework w.r.t. respectively, the order and number of\nthe elements. The second contribution of the paper is a proof of concept on\nsynthetic 1D and 2D problems, demonstrating the efficiency of the proposed\napproach.\n", "doi": null, "arxiv_id": "2001.07910", "pdf_urls": ["https://arxiv.org/pdf/2001.07910"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ECMLPKDD 2019 : European Conference on Machine learning and\n  knowledge discovery in databases, Sep 2019, W{\\\"u}rzburg, Germany", "categories": "cs.LG stat.ML"}
{"title": "Mathematical Modeling of Flash Boiling Phenomena in Superheated Sprays\n  at low Degree of Superheat using Dirichlet Hyperboloids", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["B. Bhatia", "A. De", "and E. Gutheil"], "abstract": "  The depressurization of the surrounding chamber or superheating of the\ninjected liquid is responsible for the flashing of the sprays, which promotes\nmicro-explosion of many bubbles near free-surface and thereby leading to\nprimary atomization of sprays. In this work, we propose a mathematical model,\nand the Dirichlet hyperboloids are used to explain the micro-explosion process\nwhile the external flashing phenomenon is observed in superheated liquid jets.\nThe developed mathematical model is implemented in the Lagrangian framework to\nstudy the spray structure, and the results of numerical simulations are found\nto be in good agreement with the experimental results from the literature. In\nthe onset region of a fully flashing regime, the bell-shaped spray structure\nbecomes eminent due to increased drag on the high radial-velocity ejected\ndroplets. However, at a lower degree of superheat, the droplet size is found to\nincrease with a decrease in ambient pressure. Whereas the opposite trend is\nobserved at a higher degree of superheat.\n", "doi": "10.1016/j.ijmultiphaseflow.2020.103366", "arxiv_id": "2001.10339", "pdf_urls": ["https://arxiv.org/pdf/2001.10339"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, 2020", "categories": "physics.flu-dyn"}
{"title": "Probability representation of photon states and tomography", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir N. Chernega", "Olga V. Man'ko", "Vladimir I. Man'ko"], "abstract": "  We give a review of the tomographic probability representation of quantum\nmechanics. We present the formalism of quantum states and quantum observables\nusing the formalism of standard probability distributions and classical-like\nrandom variables. We study the coherent and number states of photons in the\nprobability representation and obtain the evolution equation and energy spectra\nin the form of equations for probability distributions.\n", "doi": "10.1007/s10946-019-09831-2 10.1007/s10946-019-09831-2\n  10.1007/s10946-019-09831-2", "arxiv_id": "2001.10361", "pdf_urls": ["https://arxiv.org/pdf/2001.10361"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. of Russian Laser Research, v. 40, N 6 pp.503-514 (2019)", "categories": "quant-ph"}
{"title": "Preliminary prediction of the basic reproduction number of the Wuhan\n  novel coronavirus 2019-nCoV", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tao Zhou", "Quanhui Liu", "Zimo Yang", "Jingyi Liao", "Kexin Yang", "Wei Bai", "Xin L\\\"u", "Wei Zhang"], "abstract": "  Objectives.--To estimate the basic reproduction number of the Wuhan novel\ncoronavirus (2019-nCoV). Methods.--Based on the\nsusceptible-exposed-infected-removed (SEIR) compartment model and the\nassumption that the infectious cases with symptoms occurred before January 25,\n2020 are resulted from free propagation without intervention, we estimate the\nbasic reproduction number of 2019-nCoV according to the reported confirmed\ncases and suspected cases, as well as the theoretical estimated number of\ninfected cases by other research teams, together with some epidemiological\ndeterminants learned from the severe acute respiratory syndrome. Results The\nbasic reproduction number falls between 2.8 to 3.3 by using the real-time\nreports on the number of 2019-nCoV infected cases from People's Daily in China,\nand falls between 3.2 and 3.9 on the basis of the predicted number of infected\ncases from colleagues. Conclusions.--The early transmission ability of\n2019-nCoV is closed to or slightly higher than SARS. It is a controllable\ndisease with moderate-high transmissibility. Timely and effective control\nmeasures are needed to suppress the further transmissions. Notes Added.--Using\na newly reported epidemiological determinants for early 2019-nCoV, the\nestimated basic reproduction number is in the range [2.2,3.0].\n", "doi": "10.1111/jebm.12376", "arxiv_id": "2001.10530", "pdf_urls": ["https://arxiv.org/pdf/2001.10530"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Evidence Based Medicine (2020) 1", "categories": "q-bio.PE physics.soc-ph"}
{"title": "Atom interferometry and its applications", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sven Abend", "Matthias Gersemann", "Christian Schubert", "Dennis Schlippert", "Ernst M. Rasel", "Matthias Zimmermann", "Maxim A. Efremov", "Albert Roura", "Frank A.\n  Narducci", "and Wolfgang P. Schleich"], "abstract": "  We provide an introduction into the field of atom optics and review our work\non interferometry with cold atoms, and in particular with Bose-Einstein\ncondensates. Here we emphasize applications of atom interferometry with sources\nof this kind. We discuss tests of the equivalence principle, a quantum\ntiltmeter, and a gravimeter.\n", "doi": null, "arxiv_id": "2001.10976", "pdf_urls": ["https://arxiv.org/pdf/2001.10976"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the International School of Physics \"Enrico Fermi\"\n  Course 197 \"Foundations of Quantum Theory\", edited by Ernst M. Rasel,\n  Wolfgang P. Schleich, and Sabine W\\\"olk (IOS, Amsterdam; SIF, Bologna; 2019),\n  pp. 345-392", "categories": "physics.atom-ph quant-ph"}
{"title": "Modelling large scale airgun-bubble dynamics with highly non-spherical\n  features", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shuai Li", "Devaraj van der Meer", "A-Man Zhang", "Andrea Prosperetti", "Detlef Lohse"], "abstract": "  A thorough understanding of the dynamics of meter-sized airgun-bubbles is\nvery crucial to seabed geophysical exploration. In this study, we use the\nboundary integral method to investigate the highly non-spherical airgun-bubble\ndynamics and its corresponding pressure wave emission. Moreover, a model is\nproposed to also consider the process of air release from the airgun port,\nwhich is found to be the most crucial factor to estimate the initial peak of\nthe pressure wave. The numerical simulations show good agreement with\nexperiments, in terms of non-spherical bubble shapes and pressure waves.\nThereafter, the effects of the port opening time $T\\rm_{open}$, airgun firing\ndepth, heat transfer, and gravity are numerically investigated. We find that a\nsmaller $T\\rm_{open}$ leads to a more violent air release that consequently\ncauses stronger high-frequency pressure wave emissions; however, the\nlow-frequency pressure waves are little affected. Additionally, the\nnon-spherical bubble dynamics is highly dependent on the Froude number $Fr$.\nStarting from $Fr=2$, as $Fr$ increases, the jet contains lower kinetic energy,\nresulting in a stronger energy focusing of the bubble collapse itself and thus\na larger pressure peak during the bubble collapse phase. For $Fr \\ge 7$, the\nspherical bubble theory becomes an appropriate description of the\nairgun-bubble. The new findings of this study may provide a reference for\npractical operations and designing environmentally friendly airguns in the near\nfuture.\n", "doi": "10.1016/j.ijmultiphaseflow.2019.103143", "arxiv_id": "2002.02261", "pdf_urls": ["https://arxiv.org/pdf/2002.02261"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow (2020)", "categories": "physics.flu-dyn"}
{"title": "Piecewise quadratic growth during the 2019 novel coronavirus epidemic", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Axel Brandenburg"], "abstract": "  The temporal growth in the number of deaths in the COVID-19 epidemic is\nsubexponential. Here we show that a piecewise quadratic law provides an\nexcellent fit during the thirty days after the first three fatalities on\nJanuary 20 and later since the end of March 2020. There is also a brief\nintermediate period of exponential growth. During the second quadratic growth\nphase, the characteristic time of the growth is about eight times shorter than\nin the beginning, which can be understood as the occurrence of separate\nhotspots. Quadratic behavior can be motivated by peripheral growth when further\nspreading occurs only on the outskirts of an infected region. We also study\nnumerical solutions of a simple epidemic model, where the spatial extend of the\nsystem is taken into account. To model the delayed onset outside China together\nwith the early one in China within a single model with minimal assumptions, we\nadopt an initial condition of several hotspots, of which one reaches saturation\nmuch earlier than the others. At each site, quadratic growth commences when the\nlocal number of infections has reached a certain saturation level. The total\nnumber of deaths does then indeed follow a piecewise quadratic behavior.\n", "doi": "10.1016/j.idm.2020.08.014", "arxiv_id": "2002.03638", "pdf_urls": ["https://arxiv.org/pdf/2002.03638"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Infectious Disease Modelling 5, 681-690 (2020)", "categories": "q-bio.PE"}
{"title": "Chaotic Phase Synchronization and Desynchronization in an Oscillator\n  Network for Object Selection", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fabricio A Breve", "Marcos G Quiles", "Liang Zhao", "and Elbert E. N. Macau"], "abstract": "  Object selection refers to the mechanism of extracting objects of interest\nwhile ignoring other objects and background in a given visual scene. It is a\nfundamental issue for many computer vision and image analysis techniques and it\nis still a challenging task to artificial visual systems. Chaotic phase\nsynchronization takes place in cases involving almost identical dynamical\nsystems and it means that the phase difference between the systems is kept\nbounded over the time, while their amplitudes remain chaotic and may be\nuncorrelated. Instead of complete synchronization, phase synchronization is\nbelieved to be a mechanism for neural integration in brain. In this paper, an\nobject selection model is proposed. Oscillators in the network representing the\nsalient object in a given scene are phase synchronized, while no phase\nsynchronization occurs for background objects. In this way, the salient object\ncan be extracted. In this model, a shift mechanism is also introduced to change\nattention from one object to another. Computer simulations show that the model\nproduces some results similar to those observed in natural vision systems.\n", "doi": "10.1016/j.neunet.2009.06.027", "arxiv_id": "2002.05493", "pdf_urls": ["https://arxiv.org/pdf/2002.05493"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "BREVE, FA; ZHAO, L; QUILES, MG; MACAU, EEN. Chaotic Phase\n  Synchronization and Desynchronization in an Oscillator Network for Object\n  Selection. Neural Networks, v. 22, p. 728-737, 2009", "categories": "cs.CV cs.LG"}
{"title": "What Would You Ask the Machine Learning Model? Identification of User\n  Needs for Model Explanations Based on Human-Model Conversations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Micha{\\l} Ku\\'zba", "Przemys{\\l}aw Biecek"], "abstract": "  Recently we see a rising number of methods in the field of eXplainable\nArtificial Intelligence. To our surprise, their development is driven by model\ndevelopers rather than a study of needs for human end users. The analysis of\nneeds, if done, takes the form of an A/B test rather than a study of open\nquestions. To answer the question \"What would a human operator like to ask the\nML model?\" we propose a conversational system explaining decisions of the\npredictive model. In this experiment, we developed a chatbot called dr_ant to\ntalk about machine learning model trained to predict survival odds on Titanic.\nPeople can talk with dr_ant about different aspects of the model to understand\nthe rationale behind its predictions. Having collected a corpus of 1000+\ndialogues, we analyse the most common types of questions that users would like\nto ask. To our knowledge, it is the first study which uses a conversational\nsystem to collect the needs of human operators from the interactive and\niterative dialogue explorations of a predictive model.\n", "doi": "10.1007/978-3-030-65965-3_30", "arxiv_id": "2002.05674", "pdf_urls": ["https://arxiv.org/pdf/2002.05674"], "github": ["https://github.com/ModelOriented/xaibot"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Joint European Conference on Machine Learning and Knowledge\n  Discovery in Databases 2020", "categories": "cs.CY cs.CL cs.HC cs.LG stat.ML"}
{"title": "Finite-emittance Wigner crystals in the bubble regime", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lars Reichwein", "Johannes Thomas and Alexander Pukhov"], "abstract": "  We study the influence of finite emittance electron bunches in the bubble\nregime of laser-driven wakefield acceleration onto the microscopic structure of\nthe bunch itself. Using resilient backpropagation (Rprop) to find the\nequilibrium structure, we observe that for realistic and already observed\nemittances the previously found crystalline structures remain intact and are\nonly widened marginally. Higher emittances lead to larger electron\ndisplacements within the crystal and finally its breaking.\n", "doi": "10.1017/s0263034620000221", "arxiv_id": "2002.06962", "pdf_urls": ["https://arxiv.org/pdf/2002.06962"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Part. Beams 38 (2020) 176-180", "categories": "physics.plasm-ph"}
{"title": "Bloch-Siegert oscillations in the Rabi model with an amplitude-modulated\n  driving field", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.P. Saiko and S.A. Markevich and R. Fedaruk"], "abstract": "  We study the coherent dynamics of a qubit excited by an amplitude-modulated\nelectromagnetic field under the Rabi resonance when the frequency of the\nlow-frequency modulation field matches the Rabi frequency in the high-frequency\nfield. Due to destructive interference of multiple photon processes at the\nultrastrong coupling between the qubit and the low-frequency driving field,\nRabi oscillations result exclusively from the Bloch-Siegert effect. It is\ndirectly observed in the time-resolved coherent dynamics as the Bloch-Siegert\noscillation. In this case, triplets in Fourier spectra of the coherent response\nare transformed into doublets with the splitting between the lines equal to\ntwice the Bloch-Siegert shift. These unusual properties are demonstrated in\nconditions of experiments with a nitrogen vacancy center in diamond.\n", "doi": "10.1088/1555-6611/ab4bc6", "arxiv_id": "2002.07165", "pdf_urls": ["https://arxiv.org/pdf/2002.07165"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 29 124004 (2019)", "categories": "cond-mat.mes-hall quant-ph"}
{"title": "Fragment-synthesis-based multiparty cryptographic key distribution over\n  a public network", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wen-Kai Yu", "Ya-Xin Li", "Jian Leng", "and Shuo-Fei Wang"], "abstract": "  A secure optical communication requires both high transmission efficiency and\nhigh authentication performance, while existing cryptographic key distribution\nprotocols based on ghost imaging have many shortcomings. Here, based on\ncomputational ghost imaging, we propose an interactive protocol that enables\nmulti-party cryptographic key distribution over a public network and\nself-authentication by setting an intermediary that shares partial roles of the\nserver. This fragment-synthesis-based authentication method may facilitate the\nremote distribution of cryptographic keys.\n", "doi": "10.1016/j.optlaseng.2022.107067", "arxiv_id": "2002.08362", "pdf_urls": ["https://arxiv.org/pdf/2002.08362"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering, 155, 107067 (2022)", "categories": "eess.IV cs.CR eess.SP"}
{"title": "Optical Spectroscopy of nearby type1-LINERs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. Cazzoli", "I. M\\'arquez", "J. Masegosa", "A. del Olmo", "M. Povic", "O.\n  Gonz\\'alez-Mart\\'in", "B. Balmaverde", "L. Hern\\'andez-Garc\\'ia and S.\n  Garc\\'ia-Burillo"], "abstract": "  We present the highlights from our recent study of 22 local (z$<$0.025)\ntype-1 LINERs from the Palomar Survey, on the basis of optical long-slit\nspectroscopic observations taken with TWIN/CAHA, ALFOSC/NOT and HST/STIS\n(Cazzoli et al. 2018). Our goals were threefold: (a) explore the AGN- nature of\nthese LINERs by studying the broad (BLR-originated) H$\\alpha$ component; (b)\nderive a reliable interpretation for the multiple narrow components of emission\nlines by studying their kinematics and ionisation mechanism (via standard\nBPTs); (c) probe the neutral gas in the nuclei of these LINERs for the first\ntime. Hence, kinematics and fluxes of a set of emission lines, from H$\\beta$ to\n[SII], and the NaD doublet in absorption have been modelled and measured, after\nthe subtraction of the underlying light from the stellar component.\n", "doi": "10.1017/s174392132000263x", "arxiv_id": "2002.11139", "pdf_urls": ["https://arxiv.org/pdf/2002.11139"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the International Astronomical Union (356), 2019.\n  Eds. M. Povic, J. Masegosa, H. Netzer, P. Marziani, P. Shastri, S. B. Tessema\n  & S. H. Negu", "categories": "astro-ph.GA"}
{"title": "High-Dimensional Feature Selection for Genomic Datasets", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Majid Afshar", "Hamid Usefi"], "abstract": "  A central problem in machine learning and pattern recognition is the process\nof recognizing the most important features. In this paper, we provide a new\nfeature selection method (DRPT) that consists of first removing the irrelevant\nfeatures and then detecting correlations between the remaining features. Let\n$D=[A\\mid \\mathbf{b}]$ be a dataset, where $\\mathbf{b}$ is the class label and\n$A$ is a matrix whose columns are the features. We solve $A\\mathbf{x} =\n\\mathbf{b}$ using the least squares method and the pseudo-inverse of $A$. Each\ncomponent of $\\mathbf{x}$ can be viewed as an assigned weight to the\ncorresponding column (feature). We define a threshold based on the local maxima\nof $\\mathbf{x}$ and remove those features whose weights are smaller than the\nthreshold.\n  To detect the correlations in the reduced matrix, which we still call $A$, we\nconsider a perturbation $\\tilde A$ of $A$. We prove that correlations are\nencoded in $\\Delta\\mathbf{x}=\\mid \\mathbf{x} -\\tilde{\\mathbf{x}}\\mid $, where\n$\\tilde{\\mathbf{x}}$ is the least quares solution of\n  $\\tilde A\\tilde{\\mathbf{x}}=\\mathbf{b}$. We cluster features first based on\n$\\Delta\\mathbf{x}$ and then using the entropy of features. Finally, a feature\nis selected from each sub-cluster based on its weight and entropy. The\neffectiveness of DRPT has been verified by performing a series of comparisons\nwith seven state-of-the-art feature selection methods over ten genetic datasets\nranging up from 9,117 to 267,604 features. The results show that, over all, the\nperformance of DRPT is favorable in several aspects compared to each feature\nselection algorithm.\n  \\e\n", "doi": "10.1016/j.knosys.2020.106370", "arxiv_id": "2002.12104", "pdf_urls": ["https://arxiv.org/pdf/2002.12104"], "github": ["https://github.com/majid1292/DRPT"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "August 2020, Knowledge-Based Systems 206(4):106370", "categories": "cs.LG q-bio.QM stat.ML"}
{"title": "Spin kinetic equations in the probability representation of quantum\n  mechanics", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir N. Chernega", "Vladimir I. Man'ko"], "abstract": "  We discuss the possibility to formulate the dynamics of spin states described\nby the Schrodinger equation for pure states and the von Neumann equation (as\nwell as the GKSL equation) for mixed states in the form of quantum kinetic\nequations for probability distributions. We review an approach to the\nspin-state description by means of the probability distributions of dichotomic\nrandom variables.\n", "doi": "10.1007/s10946-019-09830-3", "arxiv_id": "2003.00485", "pdf_urls": ["https://arxiv.org/pdf/2003.00485"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. of Russian Laser Research, v.40, N 5, p.496-502 (2019)", "categories": "quant-ph"}
{"title": "Coherent states of parametric oscillators in the probability\n  representation of quantum mechanics", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir N. Chernega", "Olga V. Man'ko"], "abstract": "  Glauber coherent states of quantum systems are reviewed. We construct the\ntomographic probability distributions of the oscillator states. The possibility\nto describe quantum states by tomographic probability distributions (tomograms)\nis presented on an example of coherent states of parametric oscillator. The\nintegrals of motion linear in the position and momentum are used to explicitly\nobtain the tomogram evolution expressed in terms of trajectories of classical\nparametric oscillator\n", "doi": "10.1007/s10946-020-09844-2", "arxiv_id": "2003.01556", "pdf_urls": ["https://arxiv.org/pdf/2003.01556"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. of Russian Laser Research, v.41, N1, p.11-22 (2020)", "categories": "quant-ph"}
{"title": "KatzDriver: A network Based method to predict cancer causal genes in GR\n  Network", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mostafa Akhavansafar", "Babak Teimourpour"], "abstract": "  One of the important issues in oncology is finding the genes that\nperturbation the cell functionality, and result in cancer propagation. The\ngenes, namely driver genes, when they mutate in expression, result in cancer\nthrough activation of the mutated proteins. So, many methods have been\nintroduced to predict this group of genes. These are mostly computational\nmethods based on the number of mutations of each gene. Recently, some\nnetwork-based methods have been proposed to predict Cancer Driver Genes (CDGs).\nIn this study, we use a network-based approach and relative importance of each\ngene in the propagation and absorption of genes anomalies in the network to\nrecognize CDGs. The experimental results are compared with 19 previous methods\nthat show our proposed algorithm is better than the others in terms of\naccuracy, precision, and the number of recognized CDGs.\n", "doi": "10.1016/j.biosystems.2020.104326", "arxiv_id": "2003.06266", "pdf_urls": ["https://arxiv.org/pdf/2003.06266"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Safar, M.A. and Teimourpour, B., 2020. KatzDriver: A network based\n  method to cancer causal genes discovery in gene regulatory network.\n  Biosystems, p.104326", "categories": "q-bio.MN q-bio.BM"}
{"title": "Joint Event Extraction along Shortest Dependency Paths using Graph\n  Convolutional Networks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Balali", "Masoud Asadpour", "Ricardo Campos", "Adam Jatowt"], "abstract": "  Event extraction (EE) is one of the core information extraction tasks, whose\npurpose is to automatically identify and extract information about incidents\nand their actors from texts. This may be beneficial to several domains such as\nknowledge bases, question answering, information retrieval and summarization\ntasks, to name a few. The problem of extracting event information from texts is\nlongstanding and usually relies on elaborately designed lexical and syntactic\nfeatures, which, however, take a large amount of human effort and lack\ngeneralization. More recently, deep neural network approaches have been adopted\nas a means to learn underlying features automatically. However, existing\nnetworks do not make full use of syntactic features, which play a fundamental\nrole in capturing very long-range dependencies. Also, most approaches extract\neach argument of an event separately without considering associations between\narguments which ultimately leads to low efficiency, especially in sentences\nwith multiple events. To address the two above-referred problems, we propose a\nnovel joint event extraction framework that aims to extract multiple event\ntriggers and arguments simultaneously by introducing shortest dependency path\n(SDP) in the dependency graph. We do this by eliminating irrelevant words in\nthe sentence, thus capturing long-range dependencies. Also, an attention-based\ngraph convolutional network is proposed, to carry syntactically related\ninformation along the shortest paths between argument candidates that captures\nand aggregates the latent associations between arguments; a problem that has\nbeen overlooked by most of the literature. Our results show a substantial\nimprovement over state-of-the-art methods.\n", "doi": "10.1016/j.knosys.2020.106492", "arxiv_id": "2003.08615", "pdf_urls": ["https://arxiv.org/pdf/2003.08615"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 210, Year 2020, Page 106492", "categories": "cs.LG cs.AI stat.ML"}
{"title": "Accuracy of MRI Classification Algorithms in a Tertiary Memory Center\n  Clinical Routine Cohort", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alexandre Morin (ARAMIS)", "Jorge Samper-Gonz\\'alez (ARAMIS)", "Anne\n  Bertrand (ARAMIS)", "Sebastian Stroer", "Didier Dormont (ICM", "ARAMIS)", "Aline\n  Mendes", "Pierrick Coup\\'e", "Jamila Ahdidan", "Marcel L\\'evy (IM2A)", "Dalila Samri", "Harald Hampel", "Bruno Dubois (APM)", "Marc Teichmann (FRONTlab)", "St\\'ephane\n  Epelbaum (ARAMIS)", "Olivier Colliot (ARAMIS)"], "abstract": "  BACKGROUND:Automated volumetry software (AVS) has recently become widely\navailable to neuroradiologists. MRI volumetry with AVS may support the\ndiagnosis of dementias by identifying regional atrophy. Moreover, automatic\nclassifiers using machine learning techniques have recently emerged as\npromising approaches to assist diagnosis. However, the performance of both AVS\nand automatic classifiers has been evaluated mostly in the artificial setting\nof research datasets.OBJECTIVE:Our aim was to evaluate the performance of two\nAVS and an automatic classifier in the clinical routine condition of a memory\nclinic.METHODS:We studied 239 patients with cognitive troubles from a single\nmemory center cohort. Using clinical routine T1-weighted MRI, we evaluated the\nclassification performance of: 1) univariate volumetry using two AVS (volBrain\nand Neuroreader$^{TM}$); 2) Support Vector Machine (SVM) automatic classifier,\nusing either the AVS volumes (SVM-AVS), or whole gray matter (SVM-WGM); 3)\nreading by two neuroradiologists. The performance measure was the balanced\ndiagnostic accuracy. The reference standard was consensus diagnosis by three\nneurologists using clinical, biological (cerebrospinal fluid) and imaging data\nand following international criteria.RESULTS:Univariate AVS volumetry provided\nonly moderate accuracies (46% to 71% with hippocampal volume). The accuracy\nimproved when using SVM-AVS classifier (52% to 85%), becoming close to that of\nSVM-WGM (52 to 90%). Visual classification by neuroradiologists ranged between\nSVM-AVS and SVM-WGM.CONCLUSION:In the routine practice of a memory clinic, the\nuse of volumetric measures provided by AVS yields only moderate accuracy.\nAutomatic classifiers can improve accuracy and could be a useful tool to assist\ndiagnosis.\n", "doi": "10.3233/jad-190594", "arxiv_id": "2003.09260", "pdf_urls": ["https://arxiv.org/pdf/2003.09260"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Alzheimer's Disease, IOS Press, 2020, pp.1-10", "categories": "q-bio.QM cs.CV eess.IV eess.SP"}
{"title": "Incorporating Expert Prior in Bayesian Optimisation via Space Warping", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anil Ramachandran", "Sunil Gupta", "Santu Rana", "Cheng Li", "Svetha Venkatesh"], "abstract": "  Bayesian optimisation is a well-known sample-efficient method for the\noptimisation of expensive black-box functions. However when dealing with big\nsearch spaces the algorithm goes through several low function value regions\nbefore reaching the optimum of the function. Since the function evaluations are\nexpensive in terms of both money and time, it may be desirable to alleviate\nthis problem. One approach to subside this cold start phase is to use prior\nknowledge that can accelerate the optimisation. In its standard form, Bayesian\noptimisation assumes the likelihood of any point in the search space being the\noptimum is equal. Therefore any prior knowledge that can provide information\nabout the optimum of the function would elevate the optimisation performance.\nIn this paper, we represent the prior knowledge about the function optimum\nthrough a prior distribution. The prior distribution is then used to warp the\nsearch space in such a way that space gets expanded around the high probability\nregion of function optimum and shrinks around low probability region of\noptimum. We incorporate this prior directly in function model (Gaussian\nprocess), by redefining the kernel matrix, which allows this method to work\nwith any acquisition function, i.e. acquisition agnostic approach. We show the\nsuperiority of our method over standard Bayesian optimisation method through\noptimisation of several benchmark functions and hyperparameter tuning of two\nalgorithms: Support Vector Machine (SVM) and Random forest.\n", "doi": "10.1016/j.knosys.2020.105663", "arxiv_id": "2003.12250", "pdf_urls": ["https://arxiv.org/pdf/2003.12250"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2020) 105663", "categories": "cs.LG stat.ML"}
{"title": "Reconstructing Stokes parameters from non-uniform\n  division-of-focal-plane modulation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhaoxiang Jiang", "Qingchuan Zhang", "Shangquan Wu", "Tan Xu", "Yong Su", "and\n  Chuanbiao Bai"], "abstract": "  Division-of-focal-plane modulation is a powerful technique for real-time\npolarization imaging. This technique, however, suffers from the non-uniformity\nof the performance of linear polarization filters and photodetectors. We study\nthe Stokes parameters reconstruction from the division-of-focal-plane\nmodulation in the presence of the non-uniformity. Two reconstruction methods,\nnamed as least-squares and smoothing regularization methods, are proposed. The\nperformance of the proposed methods are evaluated through Fourier analysis,\nnumerical simulations, and experiments. The results indicate that the proposed\nmethods can effectively mitigate the reconstruction errors and artifacts caused\nby the non-uniformity, and therefore may further facilitate the practical\napplication of the division-of-focal-plane technique.\n", "doi": "10.1016/j.optlaseng.2020.106199", "arxiv_id": "2003.12275", "pdf_urls": ["https://arxiv.org/pdf/2003.12275"], "github": ["https://github.com/zxcn/SRM"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering, Volume 134, November 2020,\n  106199", "categories": "physics.optics eess.SP"}
{"title": "Dynamics of the COVID-1 -- Comparison between the Theoretical\n  Predictions and the Real Data, and Predictions about Returning to Normal Life", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giorgio Sonnino and Pasquale Nardone"], "abstract": "  A new coronavirus disease, called COVID-19, appeared in the Chinese region of\nWuhan at the end of last year; since then the virus spread to other countries,\nincluding most of Europe. We propose a differential equation governing the\nevolution of the COVID-19. This dynamic equation also describes the evolution\nof the number of infected people for 13 common respiratory viruses (including\nthe SARS-CoV-2). We validate our theoretical predictions with experimental data\nfor Italy, Belgium and Luxembourg, and compare them with the predictions of the\nlogistic model. We find that our predictions are in good agreement with the\nreal world since the beginning of the appearance of the COVID-19; this is not\nthe case for the logistic model that only applies to the first days. The second\npart of the work is devoted to modelling the descending phase, i.e. the\ndecrease of the number of people tested positive for COVID-19. Also in this\ncase, we propose a new set of dynamic differential equations that we solved\nnumerically. We use our differential equations parametrised with experimental\ndata to make several predictions, such as the date when Italy, Belgium, and\nLuxembourg will reach a peak number of SARS-CoV-2 infected people. The\ndescending curves provide valuable information such as the duration of the\nCOVID-19 epidemic in a given Country and therefore when it will be possible to\nreturn to normal life. The study of the the dynamics of COVID-19 when the\npopulation have been subject to less restrictive measures is beyond the scope\nof this work and it will be matter of future works.\n", "doi": null, "arxiv_id": "2003.13540", "pdf_urls": ["https://arxiv.org/pdf/2003.13540"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Annals of Clinical and Medical Case Reports. 2020; 4(9): 1-21 -\n  ISSN 2639-8109", "categories": "q-bio.PE"}
{"title": "Spatially multiplexed picosecond pulse-train generations through\n  simultaneous intra-modal four wave mixing and inter-modal cross-phase\n  modulation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["H. Zhang (CPPM)", "M. Bigot-Astruc", "P. Sillard", "Julien Fatome (LICB)"], "abstract": "  We report on the experimental generation of spatially multiplexed picosecond\n40-GHz pulse trains at telecommunication wavelengths by simultaneous\nintra-modal multiple four wave mixing and intermodal cross-phase modulation in\nkm-long bi-modal and 6-LP-mode graded-index few-mode fibers. More precisely, an\ninitial beat-signal injected into the fundamental mode is first nonlinearly\ncompressed into well-separated pulses by means of an intra-modal multiple\nfour-wave mixing process, while several group-velocity matched continuous-wave\nprobe signals are injected into higher-order modes in such a way to develop\nsimilar pulsed profile thanks to an intermodal cross-phase modulation\ninteraction. Specifically, by simultaneously exciting three higher-order modes\n(LP11, LP02 and LP31) of a 6-LP-mode fiber along group-velocity matched\nwavelengths with the fundamental mode, four spatially multiplexed 40-GHz\npicosecond pulse-trains are generated at selective wavelengths with negligible\ncross-talks between all the modes.\n", "doi": "10.1088/1612-202x/ab7d3a", "arxiv_id": "2004.01485", "pdf_urls": ["https://arxiv.org/pdf/2004.01485"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters, IOP Publishing, 2020, 17 (4), pp.045101", "categories": "physics.optics"}
{"title": "To mask or not to mask: Modeling the potential for face mask use by the\n  general public to curtail the COVID-19 pandemic", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Steffen E. Eikenberry", "Marina Mancuso", "Enahoro Iboi", "Tin Phan", "Keenan\n  Eikenberry", "Yang Kuang", "Eric Kostelich", "Abba B. Gumel"], "abstract": "  Face mask use by the general public for limiting the spread of the COVID-19\npandemic is controversial, though increasingly recommended, and the potential\nof this intervention is not well understood. We develop a compartmental model\nfor assessing the community-wide impact of mask use by the general,\nasymptomatic public, a portion of which may be asymptomatically infectious.\nModel simulations, using data relevant to COVID-19 dynamics in the US states of\nNew York and Washington, suggest that broad adoption of even relatively\nineffective face masks may meaningfully reduce community transmission of\nCOVID-19 and decrease peak hospitalizations and deaths. Moreover, mask use\ndecreases the effective transmission rate in nearly linear proportion to the\nproduct of mask effectiveness (as a fraction of potentially infectious contacts\nblocked) and coverage rate (as a fraction of the general population), while the\nimpact on epidemiologic outcomes (death, hospitalizations) is highly nonlinear,\nindicating masks could synergize with other non-pharmaceutical measures. Masks\nare found to be useful with respect to both preventing illness in healthy\npersons and preventing asymptomatic transmission. Hypothetical mask adoption\nscenarios suggest that immediate near universal (80%) adoption of moderately\n(50%) effective masks could prevent on the order of 17--45% of projected deaths\nover two months in New York, while decreasing the peak daily death rate by\n34--58%, absent other changes in epidemic dynamics. Our results suggest use of\nface masks by the general public is potentially of high value in curtailing\ncommunity transmission and the burden of the pandemic. The community-wide\nbenefits are likely to be greatest when face masks are used in conjunction with\nother non-pharmaceutical practices (such as social-distancing), and when\nadoption is nearly universal (nation-wide) and compliance is high.\n", "doi": "10.1016/j.idm.2020.04.001", "arxiv_id": "2004.03251", "pdf_urls": ["https://arxiv.org/pdf/2004.03251"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Infectious Disease Modelling. 5 (2020) 248-255", "categories": "q-bio.PE q-bio.QM"}
{"title": "Phase analysis and full phase control of chip-scale infrared frequency\n  combs", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Luigi Consolino", "Francesco Cappelli", "Pablo Cancio", "Iacopo Galli", "Davide Mazzotti", "Saverio Bartalini", "Paolo De Natale"], "abstract": "  The road towards the realization of quantum cascade laser (QCL) frequency\ncombs (QCL-combs) has undoubtedly attracted ubiquitous attention from the\nscientific community, as these devices promise to deliver all-in-one (i.e. a\nsingle, miniature, active devices) frequency comb (FC) synthesizers in a range\nas wide as QCL spectral coverage itself (from about 4 microns to the THz\nrange), with the unique possibility to tailor their spectral emission by band\nstructure engineering. For these reasons, vigorous efforts have been spent to\ncharacterize the emission of four-wave-mixing multi-frequency devices, aiming\nto seize their functioning mechanisms. However, up to now, all the reported\nstudies focused on free-running QCL-combs, eluding the fundamental ingredient\nthat turns a FC into a useful metrological tool. For the first time we have\ncombined mode-locked multi-frequency QCL emitters with full phase stabilization\nand independent control of the two FC degrees of freedom. At the same time, we\nhave introduced the Fourier transform analysis of comb emission (FACE)\ntechnique, used for measuring and simultaneously monitoring the Fourier phases\nof the QCL-comb modes. The demonstration of tailored-emission, miniaturized,\nelectrically-driven, mid-infrared/THz coverage, fully-stabilized and\nfully-controlled QCL-combs finally enables this technology for\nmetrological-grade applications triggering a new scientific leap affecting\nseveral fields ranging from everyday life to frontier-research.\n", "doi": "10.1117/12.2545641", "arxiv_id": "2004.03460", "pdf_urls": ["https://arxiv.org/pdf/2004.03460"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Novel In-Plane Semiconductor Lasers XIX, Proceedings Volume 11301\n  (2020), 1130119", "categories": "physics.ins-det physics.optics"}
{"title": "Confidence interval for the AUC of SROC curve and some related methods\n  using bootstrap for meta-analysis of diagnostic accuracy studies", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hisashi Noma", "Yuki Matsushima and Ryota Ishii"], "abstract": "  The area under the curve (AUC) of summary receiver operating characteristic\n(SROC) curve is a primary statistical outcome for meta-analysis of diagnostic\ntest accuracy studies (DTA). However, its confidence interval has not been\nreported in most of DTA meta-analyses, because no certain methods and\nstatistical packages have been provided. In this article, we provide a\nbootstrap algorithm for computing the confidence interval of the AUC. Also,\nusing the bootstrap framework, we can conduct a bootstrap test for assessing\nsignificance of the difference of AUCs for multiple diagnostic tests. In\naddition, we provide an influence diagnostic method based on the AUC by\nleave-one-study-out analyses. We present illustrative examples using two DTA\nmet-analyses for diagnostic tests of cervical cancer and asthma. We also\ndeveloped an easy-to-handle R package dmetatools for these computations. The\nvarious quantitative evidence provided by these methods certainly supports the\ninterpretations and precise evaluations of statistical evidence of DTA\nmeta-analyses.\n", "doi": "10.1080/23737484.2021.1894408", "arxiv_id": "2004.04339", "pdf_urls": ["https://arxiv.org/pdf/2004.04339"], "github": ["https://github.com/nomahi/dmetatools"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Communications in Statistics: Case Studies, Data Analysis and\n  Applications, 2021; 7(3):344-358", "categories": "stat.AP"}
{"title": "openACC. An open database of car-following experiments to study the\n  properties of commercial ACC systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michail Makridis", "Konstantinos Mattas", "Aikaterini Anesiadou and Biagio\n  Ciuffo"], "abstract": "  Commercial Adaptive Cruise Control (ACC) systems are increasingly available\nas standard options in modern vehicles. At the same time, still little\ninformation is openly available on how these systems actually operate and how\ndifferent is their behavior, depending on the vehicle manufacturer or model.T o\nreduce this gap, the present paper summarizes the main features of the openACC,\nan open-access database of different car-following experiments involving a\ntotal of 16 vehicles, 11 of which equipped with state-of-the-art commercial ACC\nsystems. As more test campaigns will be carried out by the authors, OpenACC\nwill evolve accordingly. The activity is performed within the framework of the\nopenData policy of the European Commission Joint Research Centre with the\nobjective to engage the whole scientific community towards a better\nunderstanding of the properties of ACC vehicles in view of anticipating their\npossible impacts on traffic flow and prevent possible problems connected to\ntheir widespread. A first preliminary analysis on the properties of the 11 ACC\nsystems is conducted in order to showcase the different research topics that\ncan be studied within this open science initiative.\n", "doi": "10.1016/j.trc.2021.103047", "arxiv_id": "2004.06342", "pdf_urls": ["https://arxiv.org/pdf/2004.06342"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Makridis, M., Mattas, K., Anesiadou, A., Ciuffo, B., 2021.\n  OpenACC. An open database of car-following experiments to study the\n  properties of commercial ACC systems. Transportation Research Part C:\n  Emerging Technologies 125, 103047", "categories": "eess.SY cs.SY"}
{"title": "Knowledge Elicitation using Deep Metric Learning and Psychometric\n  Testing", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lu Yin", "Vlado Menkovski", "Mykola Pechenizkiy"], "abstract": "  Knowledge present in a domain is well expressed as relationships between\ncorresponding concepts. For example, in zoology, animal species form complex\nhierarchies; in genomics, the different (parts of) molecules are organized in\ngroups and subgroups based on their functions; plants, molecules, and\nastronomical objects all form complex taxonomies. Nevertheless, when applying\nsupervised machine learning (ML) in such domains, we commonly reduce the\ncomplex and rich knowledge to a fixed set of labels, and induce a model shows\ngood generalization performance with respect to these labels. The main reason\nfor such a reductionist approach is the difficulty in eliciting the domain\nknowledge from the experts. Developing a label structure with sufficient\nfidelity and providing comprehensive multi-label annotation can be exceedingly\nlabor-intensive in many real-world applications. In this paper, we provide a\nmethod for efficient hierarchical knowledge elicitation (HKE) from experts\nworking with high-dimensional data such as images or videos. Our method is\nbased on psychometric testing and active deep metric learning. The developed\nmodels embed the high-dimensional data in a metric space where distances are\nsemantically meaningful, and the data can be organized in a hierarchical\nstructure. We provide empirical evidence with a series of experiments on a\nsynthetically generated dataset of simple shapes, and Cifar 10 and\nFashion-MNIST benchmarks that our method is indeed successful in uncovering\nhierarchical structures.\n", "doi": "10.1007/978-3-030-67661-2_10", "arxiv_id": "2004.06353", "pdf_urls": ["https://arxiv.org/pdf/2004.06353"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Machine Learning and Knowledge Discovery in Databases: European\n  Conference, ECML PKDD 2020", "categories": "cs.LG cs.AI"}
{"title": "The Optimal Geometry of the Acousto-Optic Interaction in Selected\n  Crystalline Materials Determined by Extreme Surfaces Method", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anatoliy Andrushchak", "Oleh Buryy"], "abstract": "  The optimal geometries of the acousto-optic interaction are determined by\nextreme surfaces method for a number of acousto-optic crystals.\n", "doi": "10.1109/caol46282.2019.9019517", "arxiv_id": "2004.06761", "pdf_urls": ["https://arxiv.org/pdf/2004.06761"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2019 IEEE 8th International Conference on Advanced Optoelectronics\n  and Lasers (2019) 1-5", "categories": "physics.optics physics.comp-ph"}
{"title": "Bus Frequency Optimization: When Waiting Time Matters in User\n  Satisfaction", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Songsong Mo", "Zhifeng Bao", "Baihua Zheng", "and Zhiyong Peng"], "abstract": "  Reorganizing bus frequency to cater for the actual travel demand can save the\ncost of the public transport system significantly. Many, if not all, existing\nstudies formulate this as a bus frequency optimization problem which tries to\nminimize passengers' average waiting time. However, many investigations have\nconfirmed that the user satisfaction drops faster as the waiting time\nincreases. Consequently, this paper studies the bus frequency optimization\nproblem considering the user satisfaction. Specifically, for the first time to\nour best knowledge, we study how to schedule the buses such that the total\nnumber of passengers who could receive their bus services within the waiting\ntime threshold is maximized. We prove that this problem is NP-hard, and present\nan index-based algorithm with $(1-1/e)$ approximation ratio. By exploiting the\nlocality property of routes in a bus network, we propose a partition-based\ngreedy method which achieves a $(1-\\rho)(1-1/e)$ approximation ratio. Then we\npropose a progressive partition-based greedy method to further improve the\nefficiency while achieving a $(1-\\rho)(1-1/e-\\varepsilon)$ approximation ratio.\nExperiments on a real city-wide bus dataset in Singapore verify the efficiency,\neffectiveness, and scalability of our methods.\n", "doi": "10.1007/978-3-030-59416-9_12", "arxiv_id": "2004.07812", "pdf_urls": ["https://arxiv.org/pdf/2004.07812"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Conference on Database Systems for Advanced\n  Applications 2020", "categories": "cs.SI cs.DB eess.SP"}
{"title": "Coronavirus (COVID-19): ARIMA based time-series analysis to forecast\n  near future", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hiteshi Tandon", "Prabhat Ranjan", "Tanmoy Chakraborty and Vandana Suhag"], "abstract": "  COVID-19, a novel coronavirus, is currently a major worldwide threat. It has\ninfected more than a million people globally leading to hundred-thousands of\ndeaths. In such grave circumstances, it is very important to predict the future\ninfected cases to support prevention of the disease and aid in the healthcare\nservice preparation. Following that notion, we have developed a model and then\nemployed it for forecasting future COVID-19 cases in India. The study indicates\nan ascending trend for the cases in the coming days. A time series analysis\nalso presents an exponential increase in the number of cases. It is supposed\nthat the present prediction models will assist the government and medical\npersonnel to be prepared for the upcoming conditions and have more readiness in\nhealthcare systems.\n", "doi": "10.1177/09720634221109087", "arxiv_id": "2004.07859", "pdf_urls": ["https://arxiv.org/pdf/2004.07859"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Coronavirus (COVID-19): ARIMA-based Time-series Analysis to\n  Forecast near Future and the Effect of School Reopening in India, Journal of\n  Health Management, 2022, 24 (3), 373-388", "categories": "q-bio.PE q-bio.QM stat.CO stat.OT"}
{"title": "Intuitive Contrasting Map for Antonym Embeddings", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Igor Samenko", "Alexey Tikhonov", "Ivan P. Yamshchikov"], "abstract": "  This paper shows that, modern word embeddings contain information that\ndistinguishes synonyms and antonyms despite small cosine similarities between\ncorresponding vectors. This information is encoded in the geometry of the\nembeddings and could be extracted with a straight-forward and intuitive\nmanifold learning procedure or a contrasting map. Such a map is trained on a\nsmall labeled subset of the data and can produce new embeddings that explicitly\nhighlight specific semantic attributes of the word. The new embeddings produced\nby the map are shown to improve the performance on downstream tasks.\n", "doi": "10.3233/faia210282", "arxiv_id": "2004.12835", "pdf_urls": ["https://arxiv.org/pdf/2004.12835"], "github": ["https://github.com/i-samenko/Triplet-net"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In Modern Management based on Big Data II and Machine Learning and\n  Intelligent Systems III 2021 (pp. 502-510). IOS Press", "categories": "cs.CL cs.IR cs.LG"}
{"title": "Zero-Shot Learning and its Applications from Autonomous Vehicles to\n  COVID-19 Diagnosis: A Review", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mahdi Rezaei and Mahsa Shahidi"], "abstract": "  The challenge of learning a new concept, object, or a new medical disease\nrecognition without receiving any examples beforehand is called Zero-Shot\nLearning (ZSL). One of the major issues in deep learning based methodologies\nsuch as in Medical Imaging and other real-world applications is the requirement\nof large annotated datasets prepared by clinicians or experts to train the\nmodel. ZSL is known for having minimal human intervention by relying only on\npreviously known or trained concepts plus currently existing auxiliary\ninformation. This makes the ZSL applicable in many real-world scenarios, from\nunknown object detection in autonomous vehicles to medical imaging and\nunforeseen diseases such as COVID-19 Chest X-Ray (CXR) based diagnosis. We\nintroduce a novel and broaden solution called Few/one-shot learning, and\npresent the definition of the ZSL problem as an extreme case of the few-shot\nlearning. We review over fundamentals and the challenging steps of Zero-Shot\nLearning, including state-of-the-art categories of solutions, as well as our\nrecommended solution, motivations behind each approach, their advantages over\neach category to guide both clinicians and AI researchers to proceed with the\nbest techniques and practices based on their applications. We then review\nthrough different datasets inducing medical and non-medical images, the variety\nof splits, and the evaluation protocols proposed so far. Finally, we discuss\nthe recent applications and future directions of ZSL. We aim to convey a useful\nintuition through this paper towards the goal of handling complex learning\ntasks more similar to the way humans learn. We mainly focus on two applications\nin the current modern yet challenging era: coping with an early and fast\ndiagnosis of COVID-19 cases, and also encouraging the readers to develop other\nsimilar AI-based automated detection/recognition systems using ZSL.\n", "doi": "10.1016/j.ibmed.2020.100005", "arxiv_id": "2004.14143", "pdf_urls": ["https://arxiv.org/pdf/2004.14143"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Intelligence-Based Medicine, Volumes 4, 2020", "categories": "cs.CV cs.LG stat.ML"}
{"title": "Using statistics and mathematical modelling to understand infectious\n  disease outbreaks: COVID-19 as an example", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christopher E. Overton", "Helena B. Stage", "Shazaad Ahmad", "Jacob\n  Curran-Sebastian", "Paul Dark", "Rajenki Das", "Elizabeth Fearon", "Timothy Felton", "Martyn Fyles", "Nick Gent", "Ian Hall", "Thomas House", "Hugo Lewkowicz", "Xiaoxi Pang", "Lorenzo Pellis", "Robert Sawko", "Andrew Ustianowski", "Bindu Vekaria", "Luke Webb"], "abstract": "  During an infectious disease outbreak, biases in the data and complexities of\nthe underlying dynamics pose significant challenges in mathematically modelling\nthe outbreak and designing policy. Motivated by the ongoing response to\nCOVID-19, we provide a toolkit of statistical and mathematical models beyond\nthe simple SIR-type differential equation models for analysing the early stages\nof an outbreak and assessing interventions. In particular, we focus on\nparameter estimation in the presence of known biases in the data, and the\neffect of non-pharmaceutical interventions in enclosed subpopulations, such as\nhouseholds and care homes. We illustrate these methods by applying them to the\nCOVID-19 pandemic.\n", "doi": "10.1016/j.idm.2020.06.008", "arxiv_id": "2005.04937", "pdf_urls": ["https://arxiv.org/pdf/2005.04937"], "github": ["https://github.com/thomasallanhouse/covid19-stochastics"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Infectious Disease Modelling, Volume 5 (2020), 409-441", "categories": "q-bio.PE physics.soc-ph"}
{"title": "A sufficient Entanglement Criterion Based On Quantum Fisher Information\n  and Variance", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qing-Hua Zhang", "Shao-Ming Fei"], "abstract": "  We derive criterion in the form of inequality based on quantum Fisher\ninformation and quantum variance to detect multipartite entanglement. It can be\nregarded as complementary of the well-established PPT criterion in the sense\nthat it can also detect bound entangled states. The inequality is motivated by\nY.Akbari-Kourbolagh $et\\ al.$[Phys. Rev A. 99, 012304 (2019)] which introduced\na multipartite entanglement criterion based on quantum Fisher information. Our\ncriterion is experimentally measurable for detecting any $N$-qudit pure state\nmixed with white noisy. We take several examples to illustrate that our\ncriterion has good performance for detecting certain entangled states.\n", "doi": "10.1088/1612-202x/ab8793", "arxiv_id": "2005.05533", "pdf_urls": ["https://arxiv.org/pdf/2005.05533"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 17 (2020) 065202", "categories": "quant-ph"}
{"title": "Blockchain Superoptimizer", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julian Nagele and Maria A Schett"], "abstract": "  In the blockchain-based, distributed computing platform Ethereum, programs\ncalled smart contracts are compiled to bytecode and executed on the Ethereum\nVirtual Machine (EVM). Executing EVM bytecode is subject to monetary fees---a\nclear optimization target. Our aim is to superoptimize EVM bytecode by encoding\nthe operational semantics of EVM instructions as SMT formulas and leveraging a\nconstraint solver to automatically find cheaper bytecode. We implement this\napproach in our EVM Bytecode SuperOptimizer ebso and perform two large scale\nevaluations on real-world data sets.\n", "doi": null, "arxiv_id": "2005.05912", "pdf_urls": ["https://arxiv.org/pdf/2005.05912"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Preproceedings of the 29th International Symposium on Logic-based\n  Program Synthesis and Transformation (LOPSTR 2019), pp. 166-180, 2019", "categories": "cs.LO"}
{"title": "Referencing Sources of Molecular Spectroscopic Data in the Era of Data\n  Science: Application to the HITRAN and AMBDAS Databases", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Frances M. Skinner", "Iouli E. Gordon", "Christian Hill", "Robert J.\n  Hargreaves", "Kelly E. Lockhart and Laurence S. Rothman"], "abstract": "  The application described has been designed to create bibliographic entries\nin large databases with diverse sources automatically, which reduces both the\nfrequency of mistakes and the workload for the administrators. This new system\nuniquely identifies each reference from its digital object identifier (DOI) and\nretrieves the corresponding bibliographic information from any of several\nonline services, including the SAO/NASA Astrophysics Data Systems (ADS) and\nCrossRef APIs. Once parsed into a relational database, the software is able to\nproduce bibliographies in any of several formats, including HTML and BibTeX,\nfor use on websites or printed articles. The application is provided\nfree-of-charge for general use by any scientific database. The power of this\napplication is demonstrated when used to populate reference data for the HITRAN\nand AMBDAS databases as test cases. HITRAN contains data that is provided by\nresearchers and collaborators throughout the spectroscopic community. These\ncontributors are accredited for their contributions through the bibliography\nproduced alongside the data returned by an online search in HITRAN. Prior to\nthe work presented here, HITRAN and AMBDAS created these bibliographies\nmanually, which is a tedious, time-consuming and error-prone process. The\ncomplete code for the new referencing system can be found at\n\\url{https://github.com/hitranonline/refs}.\n", "doi": "10.3390/atoms8020016", "arxiv_id": "2005.07544", "pdf_urls": ["https://arxiv.org/pdf/2005.07544"], "github": ["https://github.com/hitranonline/refs"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal: Atoms Special Issue Development and Perspectives of\n  Atomic and Molecular Databases, Volume 8, Issue 2, 30 April 2020", "categories": "cs.DL cs.DB"}
{"title": "Hermes: Enabling Energy-efficient IoT Networks with Generalized\n  Deduplication", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christian G\\\"ottel", "Lars Nielsen", "Niloofar Yazdani", "Pascal Felber", "Daniel E. Lucani and Valerio Schiavoni"], "abstract": "  With the advent of the Internet of Things (IoT), the ever growing number of\nconnected devices observed in recent years and foreseen for the next decade\nsuggests that more and more data will have to be transmitted over a network,\nbefore being processed and stored in data centers. Generalized deduplication\n(GD) is a novel technique to effectively reduce the data storage cost by\nidentifying similar data chunks, and able to gradually reduce the pressure from\nthe network infrastructure by limiting the data that needs to be transmitted.\n  This paper presents Hermes, an application-level protocol for the data-plane\nthat can operate over generalized deduplication, as well as over classic\ndeduplication. Hermes significantly reduces the data transmission traffic while\neffectively decreasing the energy footprint, a relevant matter to consider in\nthe context of IoT deployments. We fully implemented Hermes and evaluated its\nperformance using consumer-grade IoT devices (e.g., Raspberry Pi 4B models).\nOur results highlight several trade-offs that must be taken into account when\nconsidering real-world workloads.\n", "doi": "10.1145/3401025.3404098", "arxiv_id": "2005.11158", "pdf_urls": ["https://arxiv.org/pdf/2005.11158"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "DEBS'20: Proceedings of the 14th ACM International Conference on\n  Distributed and Event-Based Systems (2020) 133-136", "categories": "cs.DC"}
{"title": "Wavelet based multivariate signal denoising using Mahalanobis distance\n  and EDF statistics", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Khuram Naveed and Naveed ur Rehman"], "abstract": "  A multivariate signal denoising method is proposed which employs a novel\nmultivariate goodness of fit (GoF) test that is applied at multiple data scales\nobtained from discrete wavelet transform (DWT). In the proposed multivariate\nGoF test, we first utilize squared Mahalanobis distance (MD) measure to\ntransform input multivariate data residing in M-dimensional space\n$\\mathcal{R}^M$ to a single-dimensional space of positive real numbers\n$\\mathcal{R}_+$, i.e., $\\mathcal{R}^M \\rightarrow \\mathcal{R}_+$, where $M >\n1$. Owing to the properties of the MD measure, the transformed data in\n$\\mathcal{R}_+$ follows a distinct distribution. That enables us to apply the\nGoF test using statistic based on empirical distribution function (EDF) on the\nresulting data in order to define a test for multivariate normality. We further\npropose to apply the above test locally on multiple input data scales obtained\nfrom discrete wavelet transform, resulting in a multivariate signal denoising\nframework. Within the proposed method, the reference cumulative distribution\nfunction (CDF) is defined as a quadratic transformation of multivariate\nGaussian random process. Consequently, the proposed method checks whether a set\nof DWT coefficients belong to multivariate reference distribution or not; the\ncoefficients belonging to the reference distribution are discarded. The\neffectiveness of our proposed method is demonstrated by performing extensive\nsimulations on both synthetic and real world datasets.\n", "doi": "10.1109/tsp.2020.3029659", "arxiv_id": "2005.11616", "pdf_urls": ["https://arxiv.org/pdf/2005.11616"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "K. Naveed and N. u. Rehman, \"Wavelet Based Multivariate Signal\n  Denoising Using Mahalanobis Distance and EDF Statistics,\" in IEEE\n  Transactions on Signal Processing, vol. 68, pp. 5997-6010, 2020", "categories": "eess.SP"}
{"title": "Evolution of Credit Risk Using a Personalized Pagerank Algorithm for\n  Multilayer Networks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Cristi\\'an Bravo and Mar\\'ia \\'Oskarsd\\'ottir"], "abstract": "  In this paper we present a novel algorithm to study the evolution of credit\nrisk across complex multilayer networks. Pagerank-like algorithms allow for the\npropagation of an influence variable across single networks, and allow\nquantifying the risk single entities (nodes) are subject to given the\nconnection they have to other nodes in the network. Multilayer networks, on the\nother hand, are networks where subset of nodes can be associated to a unique\nset (layer), and where edges connect elements either intra or inter networks.\nOur personalized PageRank algorithm for multilayer networks allows for\nquantifying how credit risk evolves across time and propagates through these\nnetworks. By using bipartite networks in each layer, we can quantify the risk\nof various components, not only the loans. We test our method in an\nagricultural lending dataset, and our results show how default risk is a\nchallenging phenomenon that propagates and evolves through the network across\ntime.\n", "doi": null, "arxiv_id": "2005.12418", "pdf_urls": ["https://arxiv.org/pdf/2005.12418"], "github": ["https://github.com/Banking-Analytics-Lab/MuLP"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Third KDD Workshop on Machine Learning in\n  Finance, joint with 26th ACM SIGKDD Conference on Knowledge Discovery in\n  Databases (KDD MLF 2020). ACM, New York, NY, USA, 8 pages", "categories": "cs.SI cs.LG physics.soc-ph stat.ML"}
{"title": "Good Counterfactuals and Where to Find Them: A Case-Based Technique for\n  Generating Counterfactuals for Explainable AI (XAI)", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mark T. Keane", "Barry Smyth"], "abstract": "  Recently, a groundswell of research has identified the use of counterfactual\nexplanations as a potentially significant solution to the Explainable AI (XAI)\nproblem. It is argued that (a) technically, these counterfactual cases can be\ngenerated by permuting problem-features until a class change is found, (b)\npsychologically, they are much more causally informative than factual\nexplanations, (c) legally, they are GDPR-compliant. However, there are issues\naround the finding of good counterfactuals using current techniques (e.g.\nsparsity and plausibility). We show that many commonly-used datasets appear to\nhave few good counterfactuals for explanation purposes. So, we propose a new\ncase based approach for generating counterfactuals using novel ideas about the\ncounterfactual potential and explanatory coverage of a case-base. The new\ntechnique reuses patterns of good counterfactuals, present in a case-base, to\ngenerate analogous counterfactuals that can explain new problems and their\nsolutions. Several experiments show how this technique can improve the\ncounterfactual potential and explanatory coverage of case-bases that were\npreviously found wanting.\n", "doi": null, "arxiv_id": "2005.13997", "pdf_urls": ["https://arxiv.org/pdf/2005.13997"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "28th International Conference on Case Based Reasoning (ICCBR2020),\n  2020", "categories": "cs.AI"}
{"title": "Content and Context Features for Scene Image Representation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chiranjibi Sitaula and Sunil Aryal and Yong Xiang and Anish Basnet and\n  Xuequan Lu"], "abstract": "  Existing research in scene image classification has focused on either content\nfeatures (e.g., visual information) or context features (e.g., annotations). As\nthey capture different information about images which can be complementary and\nuseful to discriminate images of different classes, we suppose the fusion of\nthem will improve classification results. In this paper, we propose new\ntechniques to compute content features and context features, and then fuse them\ntogether. For content features, we design multi-scale deep features based on\nbackground and foreground information in images. For context features, we use\nannotations of similar images available in the web to design a filter words\n(codebook). Our experiments in three widely used benchmark scene datasets using\nsupport vector machine classifier reveal that our proposed context and content\nfeatures produce better results than existing context and content features,\nrespectively. The fusion of the proposed two types of features significantly\noutperform numerous state-of-the-art features.\n", "doi": "10.1016/j.knosys.2021.107470", "arxiv_id": "2006.03217", "pdf_urls": ["https://arxiv.org/pdf/2006.03217"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-based Systems (Elsevier), 2021", "categories": "cs.CV cs.LG"}
{"title": "Dynamics of a toroidal bubble on a cylinder surface with an application\n  to geophysical exploration", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shuai Li", "Andrea Prosperetti", "Devaraj van der Meer"], "abstract": "  During the operation of a seismic airgun source, a certain amount of\ncompressed high-pressure air is released from the airgun chamber into the\nsurrounding water, generating an expanding toroidal bubble attached to the\nairgun-body. The subsequent oscillations of the bubble generate low-frequency\npressure waves, which are used to map the ocean subbottom, e.g., to locate oil\nand gas reserves. The bubble dynamic behavior and the emitted pressure waves\nare inevitably influenced by the airgun-body. However, the bubble-airgun-body\ninteraction is far from well understood. This paper investigates the strong\ninteraction between a long cylinder and an attached toroidal bubble via\nhundreds of boundary integral simulations, aiming to provide new physical\ninsights for airgun-bubble dynamics. Firstly, the overall physical phenomena\nare discussed and three types of bubble collapse patterns are identified,\nnamely (i) upward jetting due to gravity, (ii) annular jet toward the cylinder\nbody and (iii) weak/no jet. Thereafter, we investigate the effects of the\ncylinder radius, initial bubble pressure and Froude number on the bubble\noscillation period and the pressure wave induced by the bubble. At last, the\nimpact of a cylinder on a Sercel type airgun-bubble is discussed with a\nparticular focus on the spectrum of the pressure waves.\n", "doi": "10.1016/j.ijmultiphaseflow.2020.103335", "arxiv_id": "2006.04395", "pdf_urls": ["https://arxiv.org/pdf/2006.04395"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow,2020", "categories": "physics.flu-dyn physics.geo-ph"}
{"title": "Generation of polarized particle beams at relativistic laser intensities", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Markus B\\\"uscher", "Anna H\\\"utzen", "Liangliang Ji", "Andreas Lehrach"], "abstract": "  The acceleration of polarized electrons, positrons, protons and ions in\nstrong laser and plasma fields is a very attractive option to obtain polarized\nbeams in the multi-MeV range. Recently, there has been substantial progress in\nthe understanding of the dominant mechanisms leading to high degrees of\npolarization, in the numerical modelling of these processes and in their\nexperimental implementation. This review article presents an overview on the\ncurrent status of the field, on the concepts of polarized laser-plasma\naccelerators and of the beam polarimetry.\n", "doi": "10.1017/hpl.2020.35", "arxiv_id": "2006.06974", "pdf_urls": ["https://arxiv.org/pdf/2006.06974"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "High Pow Laser Sci Eng 8 (2020) e36", "categories": "physics.acc-ph"}
{"title": "A family of $(p,n)$-gonal Riemann surfaces with several $(p,n)$-gonal\n  groups", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sebasti\\'an Reyes-Carocca"], "abstract": "  Let $p \\geqslant 3$ be a prime number and let $n \\geqslant 0$ be an integer\nsuch that $p-1$ divides $n.$ In this short note we construct a family of\n$(p,n)$-gonal Riemann surfaces of maximal genus $2np+(p-1)^2$ with more than\none $(p,n)$-gonal group.\n", "doi": "10.1007/s00013-020-01548-y", "arxiv_id": "2006.07531", "pdf_urls": ["https://arxiv.org/pdf/2006.07531"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 116 (2021), no. 3, 302-305", "categories": "math.AG"}
{"title": "Modeling bike counts in a bike-sharing system considering the effect of\n  weather conditions", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Huthaifa I. Ashqar", "Mohammed Elhenawy", "and Hesham A.Rakha"], "abstract": "  The paper develops a method that quantifies the effect of weather conditions\non the prediction of bike station counts in the San Francisco Bay Area Bike\nShare System. The Random Forest technique was used to rank the predictors that\nwere then used to develop a regression model using a guided forward step-wise\nregression approach. The Bayesian Information Criterion was used in the\ndevelopment and comparison of the various prediction models. We demonstrated\nthat the proposed approach is promising to quantify the effect of various\nfeatures on a large BSS and on each station in cases of large networks with big\ndata. The results show that the time-of-the-day, temperature, and humidity\nlevel (which has not been studied before) are significant count predictors. It\nalso shows that as weather variables are geographic location dependent and thus\nshould be quantified before using them in modeling. Further, findings show that\nthe number of available bikes at station i at time t-1 and time-of-the-day were\nthe most significant variables in estimating the bike counts at station i.\n", "doi": "10.1016/j.cstp.2019.02.011", "arxiv_id": "2006.07563", "pdf_urls": ["https://arxiv.org/pdf/2006.07563"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Case studies on transport policy 7, no. 2 (2019): 261-268", "categories": "cs.CY cs.LG physics.soc-ph"}
{"title": "Learning Tversky Similarity", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Javad Rahnama and Eyke H\\\"ullermeier"], "abstract": "  In this paper, we advocate Tversky's ratio model as an appropriate basis for\ncomputational approaches to semantic similarity, that is, the comparison of\nobjects such as images in a semantically meaningful way. We consider the\nproblem of learning Tversky similarity measures from suitable training data\nindicating whether two objects tend to be similar or dissimilar.\nExperimentally, we evaluate our approach to similarity learning on two image\ndatasets, showing that is performs very well compared to existing methods.\n", "doi": "10.1007/978-3-030-50143-3_21", "arxiv_id": "2006.11372", "pdf_urls": ["https://arxiv.org/pdf/2006.11372"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. IPMU, International Conference on Information Processing and\n  Management of Uncertainty in Knowledge-Based Systems, Springer, CCIS 1238,\n  2020", "categories": "cs.CV cs.LG stat.ML"}
{"title": "Loss compensation symmetry of unequally sized dielectric cylinders with\n  gain and loss", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anton V. Hlushchenko and Vitalii I. Shcherbinin and Denis V. Novitsky\n  and Vladimir R. Tuz"], "abstract": "  A rigorous analytical approach is applied to solve the eigenvalue problem for\na pair of circular dielectric cylinders with complex permittivity. This\napproach relies on field expansion in terms of two sets of orthogonal azimuthal\nmodes, which are coupled due to finite distance between the cylinders. We\ninvestigate the ability of a gain-dielectric cylinder operated in the\nfundamental TM mode to compensate material losses of a larger cylinder operated\nin the higher-order radial TM mode. To achieve such a loss compensation\nphenomenon, a simple design strategy is developed. It is shown that this\nphenomenon can be achieved for a certain distance between the cylinders, which\nis associated with the exceptional point of the system. For smaller distances,\nthe adverse impact of high-order azimuthal (hybrid) modes are found to be\nessential. The results obtained are validated against full-wave simulations.\n", "doi": "10.1088/1612-202x/abbef9", "arxiv_id": "2006.16788", "pdf_urls": ["https://arxiv.org/pdf/2006.16788"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters, Vol. 17, No.11, 116202 (2020)", "categories": "physics.optics"}
{"title": "Hospitalization dynamics during the first COVID-19 pandemic wave: SIR\n  modelling compared to Belgium, France, Italy, Switzerland and New York City\n  data", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gregory Kozyreff"], "abstract": "  Using the classical Susceptible-Infected-Recovered epidemiological model, an\nanalytical formula is derived for the number of beds occupied by Covid-19\npatients. The analytical curve is fitted to data in Belgium, France, New York\nCity and Switzerland, with a correlation coefficient exceeding 98.8%,\nsuggesting that finer models are unnecessary with such macroscopic data. The\nfitting is used to extract estimates of the doubling time in the ascending\nphase of the epidemic, the mean recovery time and, for those who require\nmedical intervention, the mean hospitalization time. Large variations can be\nobserved among different outbreaks.\n", "doi": "10.1016/j.idm.2021.01.006", "arxiv_id": "2007.01411", "pdf_urls": ["https://arxiv.org/pdf/2007.01411"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Infectious Disease Modelling, Vol. 6, 2021, Pages 398-404", "categories": "q-bio.PE physics.soc-ph"}
{"title": "Everyone's Universe: Teaching Astronomy in Community Colleges", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rica Sirbaugh French"], "abstract": "  Despite the negative stereotypes still overshadowing community colleges,\nscores of freshmen nationwide are deliberately beginning their college careers\nat these institutions, and the numbers are increasing more than twice as fast\nas those of four-year schools. Approximately 300,000 of these students take\nintroductory astronomy each year as the last formal exposure to science most of\nthem will ever have, and at least one-third of these students do so at a\ncommunity or two-year college. The importance of investing in and devoting\nresources and training to serve this population - everyone, demographically\nspeaking - cannot be overstated. Yet the overwhelming majority of those who do\nserve this population are lacking in both areas. The community colleges' heavy\nemphasis on teaching and student success creates both challenges and\nopportunities that educators must meet head-on using a variety of methods and\ninnovative strategies, teamwork and faculty support systems, and clever\nworkarounds. Here, we introduce both the student and faculty populations,\nexamine some characteristics of both populations, and offer some advice for\nthose looking to teach introductory astronomy at a community college.\n", "doi": "10.1088/2514-3433/ab2b42ch11", "arxiv_id": "2007.02456", "pdf_urls": ["https://arxiv.org/pdf/2007.02456"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Astronomy Education Volume 1: Evidence-based instruction for\n  introductory courses (pp. 11-1 to 11-29) (2020)", "categories": "physics.ed-ph"}
{"title": "Superradiance by ferroelectrics in cavity resonators", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov"], "abstract": "  A theory is presented showing that, under appropriate conditions, a\nferroelectric in a cavity resonator can emit superradiant pulses. Initially,\nthe ferroelectric has to be prepared in a nonequilibrium state from which it\nrelaxes emitting a coherent pulse in the infrared region. Polarization dipolar\nwaves play the role of the triggering mechanism initiating the beginning of the\nprocess.\n", "doi": "10.1088/1555-6611/ab4bc4", "arxiv_id": "2007.03300", "pdf_urls": ["https://arxiv.org/pdf/2007.03300"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 29 (2019) 124007", "categories": "cond-mat.mes-hall"}
{"title": "ID-Conditioned Auto-Encoder for Unsupervised Anomaly Detection", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S{\\l}awomir Kapka"], "abstract": "  In this paper, we introduce ID-Conditioned Auto-Encoder for unsupervised\nanomaly detection. Our method is an adaptation of the Class-Conditioned\nAuto-Encoder (C2AE) designed for the open-set recognition. Assuming that\nnon-anomalous samples constitute of distinct IDs, we apply Conditioned\nAuto-Encoder with labels provided by these IDs. Opposed to C2AE, our approach\nomits the classification subtask and reduces the learning process to the single\nrun. We simplify the learning process further by fixing a constant vector as\nthe target for non-matching labels. We apply our method in the context of\nsounds for machine condition monitoring. We evaluate our method on the ToyADMOS\nand MIMII datasets from the DCASE 2020 Challenge Task 2. We conduct an ablation\nstudy to indicate which steps of our method influences results the most.\n", "doi": "10.5281/zenodo.4061782", "arxiv_id": "2007.05314", "pdf_urls": ["https://arxiv.org/pdf/2007.05314"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Fifth Workshop on Detection and Classification\n  of Acoustic Scenes and Events (DCASE 2020)", "categories": "eess.AS cs.LG"}
{"title": "AutoEmbedder: A semi-supervised DNN embedding system for clustering", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Abu Quwsar Ohi", "M. F. Mridha", "Farisa Benta Safir", "Md. Abdul Hamid", "Muhammad Mostafa Monowar"], "abstract": "  Clustering is widely used in unsupervised learning method that deals with\nunlabeled data. Deep clustering has become a popular study area that relates\nclustering with Deep Neural Network (DNN) architecture. Deep clustering method\ndownsamples high dimensional data, which may also relate clustering loss. Deep\nclustering is also introduced in semi-supervised learning (SSL). Most SSL\nmethods depend on pairwise constraint information, which is a matrix containing\nknowledge if data pairs can be in the same cluster or not. This paper\nintroduces a novel embedding system named AutoEmbedder, that downsamples higher\ndimensional data to clusterable embedding points. To the best of our knowledge,\nthis is the first research endeavor that relates to traditional classifier DNN\narchitecture with a pairwise loss reduction technique. The training process is\nsemi-supervised and uses Siamese network architecture to compute pairwise\nconstraint loss in the feature learning phase. The AutoEmbedder outperforms\nmost of the existing DNN based semi-supervised methods tested on famous\ndatasets.\n", "doi": "10.1016/j.knosys.2020.106190", "arxiv_id": "2007.05830", "pdf_urls": ["https://arxiv.org/pdf/2007.05830"], "github": ["https://github.com/QuwsarOhi/AutoEmbedder"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, p.106190 (2020)", "categories": "cs.LG cs.CV stat.ML"}
{"title": "Destiny of optical lattices with strong intersite interactions", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov"], "abstract": "  Optical lattices are considered loaded by atoms or molecules that can exhibit\nstrong interactions between different lattice sites. The strength of these\ninteractions can be sufficient for generating collective phonon excitations\nabove the ground-state energy level. Varying the interaction strength makes it\npossible to create several equilibrium three-dimensional phases, including\nconducting optical lattices, insulating optical lattices, delocalized quantum\ncrystals, and localized quantum crystals. Also, there can exist finite one- and\ntwo-dimensional lattices of chains and planes.\n", "doi": "10.1088/1555-6611/ab5807", "arxiv_id": "2007.06358", "pdf_urls": ["https://arxiv.org/pdf/2007.06358"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. 30 (2020) 015501", "categories": "cond-mat.quant-gas cond-mat.stat-mech"}
{"title": "Intermittency acceleration of water droplet population dynamics inside\n  the interfacial layer between cloudy and clear air environments", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mina Golshan", "Shahbozbek Abdunabiev", "Mattia Tomatis", "Federico\n  Fraternale", "Marco Vanni", "Daniela Tordella"], "abstract": "  We use direct numerical simulation to study the temporal evolution of a\nperturbation localized on the turbulent layer that typically separates a cloud\nfrom the surrounding clear air. Across this shearless layer, a turbulent\nkinetic energy gradient naturally forms. Here, a finite perturbation in the\nform of a local initial temperature fluctuation is applied to simulate a\nhydrodynamic instability inside the background turbulent air flow. A numerical\ninitial value problem for two diametrically opposite types of drop population\ndistributions is then solved. Specifically, we consider a mono-disperse\npopulation of droplets of 15 $\\mu$m of radius and a poly-disperse distribution\nwith radii in the range 0.6 - 30 $\\mu$m. For both distributions, it is observed\nthat the evaporation and condensation have a dramatically different weight\ninside the homogeneous cloudy region and the interfacial anisotropic mixing\nregion. It is observed that the dynamics of drop collisions is highly effected\nby the turbulence structure of the host region. The two populations show a\ncommon aspect during their energy decay transient. That is the increased\nprobability of collisions in the interfacial layer hat houses intense\nanisotropic velocity fluctuations. This layer, in fact, induces an enhanced\ndifferentiation on droplets kinetic energy and sizes. Both polydisperse and\nmonodisperse initial particle distributions contain $10^7$ droplets, matching\nan initial liquid water content of $0.8 g/m^3$. An estimate of the turbulent\ncollision kernel for geometric collisions used in the population balance\nequations is given. A preliminary discussion is presented on the structure of\nthe two unsteady non ergodic collision kernels obtained inside the cloud\ninterface region.\n", "doi": "10.1016/j.ijmultiphaseflow.2021.103669", "arxiv_id": "2007.06497", "pdf_urls": ["https://arxiv.org/pdf/2007.06497"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, Volume 140, July 2021,\n  103669", "categories": "physics.flu-dyn"}
{"title": "Strong superadditivity relations for multiqubit systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xianfei Qi", "Ting Gao", "Fengli Yan"], "abstract": "  We investigate the distributions of quantum coherence characterized by\nsuperadditivity relations in multipartite quantum systems. General\nsuperadditivity inequalities based on the $\\alpha$th ($\\alpha\\geqslant 1$)\npower of $l_1$ norm of coherence are presented for multiqubit states, which\ninclude the existing ones as special cases. Our result is shown to be tighter\nthan the existing one by a specific example.\n", "doi": "10.1088/1612-202x/abae02", "arxiv_id": "2007.09544", "pdf_urls": ["https://arxiv.org/pdf/2007.09544"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 17 (2020) 105207", "categories": "quant-ph"}
{"title": "DeepCorn: A Semi-Supervised Deep Learning Method for High-Throughput\n  Image-Based Corn Kernel Counting and Yield Estimation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saeed Khaki", "Hieu Pham", "Ye Han", "Andy Kuhl", "Wade Kent", "and Lizhi Wang"], "abstract": "  The success of modern farming and plant breeding relies on accurate and\nefficient collection of data. For a commercial organization that manages large\namounts of crops, collecting accurate and consistent data is a bottleneck. Due\nto limited time and labor, accurately phenotyping crops to record color, head\ncount, height, weight, etc. is severely limited. However, this information,\ncombined with other genetic and environmental factors, is vital for developing\nnew superior crop species that help feed the world's growing population. Recent\nadvances in machine learning, in particular deep learning, have shown promise\nin mitigating this bottleneck. In this paper, we propose a novel deep learning\nmethod for counting on-ear corn kernels in-field to aid in the gathering of\nreal-time data and, ultimately, to improve decision making to maximize yield.\nWe name this approach DeepCorn, and show that this framework is robust under\nvarious conditions. DeepCorn estimates the density of corn kernels in an image\nof corn ears and predicts the number of kernels based on the estimated density\nmap. DeepCorn uses a truncated VGG-16 as a backbone for feature extraction and\nmerges feature maps from multiple scales of the network to make it robust\nagainst image scale variations. We also adopt a semi-supervised learning\napproach to further improve the performance of our proposed method. Our\nproposed method achieves the MAE and RMSE of 41.36 and 60.27 in the corn kernel\ncounting task, respectively. Our experimental results demonstrate the\nsuperiority and effectiveness of our proposed method compared to other\nstate-of-the-art methods.\n", "doi": "10.1016/j.knosys.2021.106874", "arxiv_id": "2007.10521", "pdf_urls": ["https://arxiv.org/pdf/2007.10521"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2021): 106874", "categories": "cs.CV cs.LG eess.IV"}
{"title": "Shapovalov wave-like spacetimes", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Konstantin Osetrin and Evgeny Osetrin"], "abstract": "  A complete classification of space-time models is presented, which admit the\nprivileged coordinate systems, where the Hamilton-Jacobi equation for a test\nparticle is integrated by the method of complete separation of variables with\nseparation of the isotropic (wave) variable, on which the metric of space\ndepends (wave-like Shapovalov spaces). For all types of Shapovalov spaces,\nexact solutions of the Einstein equations with a cosmological constant in\nvacuum are found. Complete integrals are presented for the eikonal equation and\nthe Hamilton-Jacobi equation of motion of test particles.\n", "doi": "10.3390/sym12081372", "arxiv_id": "2007.11359", "pdf_urls": ["https://arxiv.org/pdf/2007.11359"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SYMMETRY-BASEL, 12 (2020), 8, 1372", "categories": "gr-qc math-ph math.MP"}
{"title": "The ITensor Software Library for Tensor Network Calculations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Matthew Fishman", "Steven R. White", "E. Miles Stoudenmire"], "abstract": "  ITensor is a system for programming tensor network calculations with an\ninterface modeled on tensor diagram notation, which allows users to focus on\nthe connectivity of a tensor network without manually bookkeeping tensor\nindices. The ITensor interface rules out common programming errors and enables\nrapid prototyping of tensor network algorithms. After discussing the philosophy\nbehind the ITensor approach, we show examples of each part of the interface\nincluding Index objects, the ITensor product operator, tensor factorizations,\ntensor storage types, algorithms for matrix product state (MPS) and matrix\nproduct operator (MPO) tensor networks, quantum number conserving block-sparse\ntensors, and the NDTensors library. We also review publications that have used\nITensor for quantum many-body physics and for other areas where tensor networks\nare increasingly applied. To conclude we discuss promising features and\noptimizations to be added in the future.\n", "doi": "10.21468/scipostphyscodeb.4", "arxiv_id": "2007.14822", "pdf_urls": ["https://arxiv.org/pdf/2007.14822"], "github": ["https://github.com/ITensor/ITensors.jl", "https://github.com/ITensor/ITensor", "https://github.com/haggaila/lindbladmpo", "https://github.com/zhang-wenjun/Rydberg-Quantum-Simulator"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SciPost Phys. Codebases 4 (2022)", "categories": "cs.MS cond-mat.str-el physics.comp-ph"}
{"title": "Quantum Zeno dynamics induced atomic entanglement in a hybrid\n  atom-cavity-fiber system", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiaojiao Chen", "Baolong Fang", "and Wei Xiong"], "abstract": "  Quantum entanglement is important quanum resources in quantum information\nsicence. Here we propose an approach to {preparing} atomic quantum entanglement\nin a hybrid atom-cavity-fiber system. Using quantum Zeno dynamics method, the\nsystem evolution states are always split into a series of Zeno invariant\n{subspaces} consisting of dark and bright states. By choosing the initial state\nof the system, the bright states are all neglected and only dark states are\nkept to build the effective Hamiltonian. By tuning the system parameters,\ntwo-atom multiple-dimensional entanglement, two-atom Bell state, and three-atom\nGHZ state can be realized by one step. Our proposal provides a way to perform\nquantum information processing with dark states.\n", "doi": "10.1088/1612-202x/abac14", "arxiv_id": "2008.00982", "pdf_urls": ["https://arxiv.org/pdf/2008.00982"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 17 (2020) 105202 (7pp)", "categories": "quant-ph"}
{"title": "OCoR: An Overlapping-Aware Code Retriever", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qihao Zhu", "Zeyu Sun", "Xiran Liang", "Yingfei Xiong", "Lu Zhang"], "abstract": "  Code retrieval helps developers reuse the code snippet in the open-source\nprojects. Given a natural language description, code retrieval aims to search\nfor the most relevant code among a set of code. Existing state-of-the-art\napproaches apply neural networks to code retrieval. However, these approaches\nstill fail to capture an important feature: overlaps. The overlaps between\ndifferent names used by different people indicate that two different names may\nbe potentially related (e.g., \"message\" and \"msg\"), and the overlaps between\nidentifiers in code and words in natural language descriptions indicate that\nthe code snippet and the description may potentially be related. To address\nthese problems, we propose a novel neural architecture named OCoR, where we\nintroduce two specifically-designed components to capture overlaps: the first\nembeds identifiers by character to capture the overlaps between identifiers,\nand the second introduces a novel overlap matrix to represent the degrees of\noverlaps between each natural language word and each identifier.\n  The evaluation was conducted on two established datasets. The experimental\nresults show that OCoR significantly outperforms the existing state-of-the-art\napproaches and achieves 13.1% to 22.3% improvements. Moreover, we also\nconducted several in-depth experiments to help understand the performance of\ndifferent components in OCoR.\n", "doi": null, "arxiv_id": "2008.05201", "pdf_urls": ["https://arxiv.org/pdf/2008.05201"], "github": ["https://github.com/anyone546/OCoR", "https://github.com/zysszy/TreeGen"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ASE 2020: 35th IEEE/ACM International Conference on Automated\n  Software Engineering Proceedings", "categories": "cs.CL cs.LG cs.SE"}
{"title": "Improving adversarial robustness of deep neural networks by using\n  semantic information", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lina Wang", "Rui Tang", "Yawei Yue", "Xingshu Chen", "Wei Wang", "Yi Zhu", "and\n  Xuemei Zeng"], "abstract": "  The vulnerability of deep neural networks (DNNs) to adversarial attack, which\nis an attack that can mislead state-of-the-art classifiers into making an\nincorrect classification with high confidence by deliberately perturbing the\noriginal inputs, raises concerns about the robustness of DNNs to such attacks.\nAdversarial training, which is the main heuristic method for improving\nadversarial robustness and the first line of defense against adversarial\nattacks, requires many sample-by-sample calculations to increase training size\nand is usually insufficiently strong for an entire network. This paper provides\na new perspective on the issue of adversarial robustness, one that shifts the\nfocus from the network as a whole to the critical part of the region close to\nthe decision boundary corresponding to a given class. From this perspective, we\npropose a method to generate a single but image-agnostic adversarial\nperturbation that carries the semantic information implying the directions to\nthe fragile parts on the decision boundary and causes inputs to be\nmisclassified as a specified target. We call the adversarial training based on\nsuch perturbations \"region adversarial training\" (RAT), which resembles\nclassical adversarial training but is distinguished in that it reinforces the\nsemantic information missing in the relevant regions. Experimental results on\nthe MNIST and CIFAR-10 datasets show that this approach greatly improves\nadversarial robustness even using a very small dataset from the training data;\nmoreover, it can defend against FGSM adversarial attacks that have a completely\ndifferent pattern from the model seen during retraining.\n", "doi": "10.1016/j.knosys.2021.107141", "arxiv_id": "2008.07838", "pdf_urls": ["https://arxiv.org/pdf/2008.07838"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "[J]. Knowledge-Based Systems, 2021: 107141", "categories": "cs.LG stat.ML"}
{"title": "Rigorous Analysis of Non-Ideal Solubility of Sodium and Copper Chlorides\n  in Water Vapor Using Pitzer-Pabalan Model", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kirill A. Velizhanin", "Christopher D. Alcorn", "Artas A. Migdisov", "Robert\n  P. Currier"], "abstract": "  Gaseous mixtures of water vapor and neutral molecules of salt (e.g., NaCl,\nCuCl etc.) can be highly non-ideal due to the strong attractive interaction\nbetween salt and water molecules. In particular, this can result in high\nsolubility of salts in water vapor and a strong dependence of solubility on\nvapor pressure. The analysis of salt solubility in water vapor can be done\nusing the Pitzer-Pabalan model, which is based on the thermodynamic theory of\nimperfect gases. The original Pitzer-Pabalan work demonstrated that one can\nreproduce experimental data for NaCl solubility in vapor. No analysis was\nperformed on the reliability of their original fits, which we believe has\ncontributed to the lack of applications of the Pitzer-Pabalan model despite the\napparent success of the original paper. In this work, we report recent progress\nin developing a rigorous fitting procedure to parameterize the Pitzer-Pabalan\nmodel using experimental data. Specifically, we performed fitting of the\nexperimental results obtained elsewhere for NaCl and CuCl. We investigate the\ndegree of underfitting/overfitting and the sensitivity of the fitting quality\nto variations in the resulting fitting parameters. The results, as represented\nby the thermodynamic parameters describing the energetics of formation of\nsalt-bearing water clusters, were successfully benchmarked against Gaussian 16\nab initio quantum chemistry calculations. The resulting rigorous fitting\nprocedure presented here can now be applied to other systems.\n", "doi": "10.1016/j.fluid.2020.112731", "arxiv_id": "2008.08640", "pdf_urls": ["https://arxiv.org/pdf/2008.08640"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Fluid Phase Equilibria, 522, 112731 (2020)", "categories": "physics.chem-ph physics.atm-clus"}
{"title": "Efficient trainability of linear optical modules in quantum optical\n  neural networks", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["T.J. Volkoff"], "abstract": "  The existence of \"barren plateau landscapes\" for generic discrete variable\nquantum neural networks, which obstructs efficient gradient-based optimization\nof cost functions defined by global measurements, would be surprising in the\ncase of generic linear optical modules in quantum optical neural networks due\nto the tunability of the intensity of continuous variable states and the\nrelevant unitary group having exponentially smaller dimension. We demonstrate\nthat coherent light in $m$ modes can be generically compiled efficiently if the\ntotal intensity scales sublinearly with $m$, and extend this result to cost\nfunctions based on homodyne, heterodyne, or photon detection measurement\nstatistics, and to noisy cost functions in the presence of attenuation. We\nfurther demonstrate efficient trainability of $m$ mode linear optical quantum\ncircuits for variational mean field energy estimation of positive quadratic\nHamiltonians for input states that do not have energy exponentially vanishing\nwith $m$.\n", "doi": null, "arxiv_id": "2008.09173", "pdf_urls": ["https://arxiv.org/pdf/2008.09173"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, 42, 250 (2021)", "categories": "quant-ph"}
{"title": "Nanoplasmonic Laser Fusion. Response to F\\\"oldes and Pokol -- Letter to\n  the Editor", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["L\\'aszl\\'o P. Csernai", "Norbert Kro\\'o", "Istv\\'an Papp and Daniel D.\n  Strottman"], "abstract": "  F\\\"oldes and Pokol in their letter \"Inertial fusion without compression does\nnot work either with or without nanoplasmonics\" criticized our works\n\\cite{CS2015,CKP2018}. Here we refute their argumentation. Our proposed\nimprovement is the combination of two basic research discoveries: (i) The\npossibility of detonations on space-time hyper-surfaces with time-like normal\n(i.e. simultaneous detonation in a whole volume) and (ii) to increase the\nignition volume to the whole target, by regulating the laser light absorption\nusing nanoantennas. These principles can be realized in an in-line, one\ndimensional configuration, in the simplest way with two opposing laser beams as\nin particle colliders \\cite{CsEA2020,Bonasera2019}.\n", "doi": "10.1017/s0263034620000348", "arxiv_id": "2008.09847", "pdf_urls": ["https://arxiv.org/pdf/2008.09847"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser and Particle Beams, 38(4), 285-286 (2020),", "categories": "physics.plasm-ph nucl-th"}
{"title": "Particle-resolved simulation of freely evolving particle suspensions:\n  Flow physics and modeling", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vahid Tavanashad", "Alberto Passalacqua", "and Shankar Subramaniam"], "abstract": "  The objective of this study is to understand the dynamics of freely evolving\nparticle suspensions over a wide range of particle-to-fluid density ratios. The\ndynamics of particle suspensions are characterized by the average momentum\nequation, where the dominant contribution to the average momentum transfer\nbetween particles and fluid is the average drag force. In this study, the\naverage drag force is quantified using particle-resolved direct numerical\nsimulation in a canonical problem: a statistically homogeneous suspension where\nan imposed mean pressure gradient establishes a steady mean slip velocity\nbetween the phases. The effects of particle velocity fluctuations, particle\nclustering, and mobility of particles are studied separately. It is shown that\nthe competing effects of these factors could decrease, increase, or keep\nconstant the drag of freely evolving suspensions in comparison to fixed beds at\ndifferent flow conditions. It is also shown that the effects of particle\nclustering and particle velocity fluctuations are not independent. Finally, a\ncorrelation for interphase drag force in terms of volume fraction, Reynolds\nnumber, and density ratio is proposed. Two different approaches (symbolic\nregression and predefined functional forms) are used to develop the drag\ncorrelation. Since this drag correlation has been inferred from simulations of\nparticle suspensions, it includes the effect of the motion of the particles.\nThis drag correlation can be used in computational fluid dynamics simulations\nof particle-laden flows that solve the average two-fluid equations where the\naccuracy of the drag law affects the prediction of overall flow behavior.\n", "doi": "10.1016/j.ijmultiphaseflow.2020.103533", "arxiv_id": "2008.12862", "pdf_urls": ["https://arxiv.org/pdf/2008.12862"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, Volume 135, February\n  2021, 103533", "categories": "physics.flu-dyn"}
{"title": "ASTRAL: Adversarial Trained LSTM-CNN for Named Entity Recognition", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiuniu Wang", "Wenjia Xu", "Xingyu Fu", "Guangluan Xu", "Yirong Wu"], "abstract": "  Named Entity Recognition (NER) is a challenging task that extracts named\nentities from unstructured text data, including news, articles, social\ncomments, etc. The NER system has been studied for decades. Recently, the\ndevelopment of Deep Neural Networks and the progress of pre-trained word\nembedding have become a driving force for NER. Under such circumstances, how to\nmake full use of the information extracted by word embedding requires more\nin-depth research. In this paper, we propose an Adversarial Trained LSTM-CNN\n(ASTRAL) system to improve the current NER method from both the model structure\nand the training process. In order to make use of the spatial information\nbetween adjacent words, Gated-CNN is introduced to fuse the information of\nadjacent words. Besides, a specific Adversarial training method is proposed to\ndeal with the overfitting problem in NER. We add perturbation to variables in\nthe network during the training process, making the variables more diverse,\nimproving the generalization and robustness of the model. Our model is\nevaluated on three benchmarks, CoNLL-03, OntoNotes 5.0, and WNUT-17, achieving\nstate-of-the-art results. Ablation study and case study also show that our\nsystem can converge faster and is less prone to overfitting.\n", "doi": "10.1016/j.knosys.2020.105842", "arxiv_id": "2009.01041", "pdf_urls": ["https://arxiv.org/pdf/2009.01041"], "github": ["https://github.com/WangJiuniu/ASTRAL"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 197, 7 June 2020, 105842", "categories": "cs.CL cs.LG"}
{"title": "Sediment transport under oscillatory flows", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giovanna Vittori", "Paolo Blondeaux", "Marco Mazzuoli", "Julian Simeonov and\n  Joseph Calantoni"], "abstract": "  The results of Direct Numerical Simulations of the oscillatory flow over a\ncohesionless bed of spherical particles, mimicking sediment grains, are\ndescribed. The flow around the sediment particles is explicitly computed by\nusing the immersed boundary method, which allows the force and torque acting on\nthe particles to be evaluated along with their dynamics. Different values of\nthe Reynolds number and different values of the ratio between the grain size\nand the thickness of the boundary layer are considered such that the results\nare useful to quantify the sand transport generated by sea waves in the region\noffshore of the breaker line. Therefore, the results are used to test the\ncapability of empirical sediment transport formulae to predict the sediment\ntransport rate during the oscillatory cycle.\n", "doi": "10.1016/j.ijmultiphaseflow.2020.103454", "arxiv_id": "2009.01541", "pdf_urls": ["https://arxiv.org/pdf/2009.01541"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, vol. 133, pp. 103454,\n  2020", "categories": "physics.flu-dyn physics.app-ph physics.geo-ph"}
{"title": "SRQA: Synthetic Reader for Factoid Question Answering", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiuniu Wang", "Wenjia Xu", "Xingyu Fu", "Yang Wei", "Li Jin", "Ziyan Chen", "Guangluan Xu", "Yirong Wu"], "abstract": "  The question answering system can answer questions from various fields and\nforms with deep neural networks, but it still lacks effective ways when facing\nmultiple evidences. We introduce a new model called SRQA, which means Synthetic\nReader for Factoid Question Answering. This model enhances the question\nanswering system in the multi-document scenario from three aspects: model\nstructure, optimization goal, and training method, corresponding to Multilayer\nAttention (MA), Cross Evidence (CE), and Adversarial Training (AT)\nrespectively. First, we propose a multilayer attention network to obtain a\nbetter representation of the evidences. The multilayer attention mechanism\nconducts interaction between the question and the passage within each layer,\nmaking the token representation of evidences in each layer takes the\nrequirement of the question into account. Second, we design a cross evidence\nstrategy to choose the answer span within more evidences. We improve the\noptimization goal, considering all the answers' locations in multiple evidences\nas training targets, which leads the model to reason among multiple evidences.\nThird, adversarial training is employed to high-level variables besides the\nword embedding in our model. A new normalization method is also proposed for\nadversarial perturbations so that we can jointly add perturbations to several\ntarget variables. As an effective regularization method, adversarial training\nenhances the model's ability to process noisy data. Combining these three\nstrategies, we enhance the contextual representation and locating ability of\nour model, which could synthetically extract the answer span from several\nevidences. We perform SRQA on the WebQA dataset, and experiments show that our\nmodel outperforms the state-of-the-art models (the best fuzzy score of our\nmodel is up to 78.56%, with an improvement of about 2%).\n", "doi": "10.1016/j.knosys.2019.105415", "arxiv_id": "2009.01630", "pdf_urls": ["https://arxiv.org/pdf/2009.01630"], "github": ["https://github.com/WangJiuniu/SRQA"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 193, 6 April 2020, 105415", "categories": "cs.CL cs.LG"}
{"title": "An application of tomographic PIV to investigate the spray-induced\n  turbulence in a direct-injection engine", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Harry Hill", "Carl-Philipp Ding", "Elias Baum", "Benjamin B\\\"ohm", "Andreas\n  Dreizler", "Brian Peterson"], "abstract": "  Fuel sprays produce high-velocity, jet-like flows that impart turbulence onto\nthe ambient flow field. The spray-induced turbulence augments fuel-air mixing,\nwhich has a primary role in controlling pollutant formation and cyclic\nvariability in engines. This paper presents tomographic particle image\nvelocimetry (TPIV) measurements to analyse the 3D spray-induced turbulence\nduring the intake stroke of a direct-injection engine. The spray produces a\nstrong spray-induced jet in the far field, which travels through the cylinder\nand imparts turbulence onto the surrounding flow. Planar high-speed PIV\nmeasurements at 4.8 kHz are combined with TPIV at 3.3 Hz to evaluate spray\nparticle distributions and validate TPIV measurements in the particle-laden\nflow. An uncertainty analysis is performed to assess the uncertainty associated\nwith vorticity and strain rate components. TPIV analyses quantify the spatial\ndomain of the turbulence in relation to the SIJ and describe how turbulent flow\nfeatures such as turbulent kinetic energy, strain rate and vorticity evolve\ninto the surrounding flow field. Access to the full tensors facilitate the\nevaluation of turbulence for individual spray events. TPIV images reveal the\npresence of strong shear layers (visualized by high S magnitudes) and pockets\nof elevated vorticity along the immediate boundary of the SIJ. Values are\nextracted from spatial domains extending in 1mm increments from the SIJ.\nTurbulence levels are greatest within the 0-1mm region from the SIJ boarder and\ndissipate with radial distance. Individual strain rate and vorticity components\nare analyzed in detail to describe the relationship between local strain rates\nand 3D vortical structures produced within strong shear layers of the SIJ.\nAnalyses are intended to understand the flow features responsible for rapid\nfuel-air mixing and provide valuable data for the development of numerical\nmodels.\n", "doi": "10.1016/j.ijmultiphaseflow.2019.103116", "arxiv_id": "2009.01725", "pdf_urls": ["https://arxiv.org/pdf/2009.01725"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 121, 103116, 2019", "categories": "physics.flu-dyn"}
{"title": "Intelligent Luminaire based Real-time Indoor Positioning for Assisted\n  Living", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Iuliana Marin and Maria Iuliana Bocicor and Arthur-Jozsef Molnar"], "abstract": "  This paper presents an experimental evaluation on the accuracy of indoor\nlocalisation. The research was carried out as part of a European Union project\ntargeting the creation of ICT solutions for older adult care. Current\nexpectation is that advances in technology will supplement the human workforce\nrequired for older adult care, improve their quality of life and decrease\nhealthcare expenditure. The proposed approach is implemented in the form of a\nconfigurable cyber-physical system that enables indoor localization and\nmonitoring of older adults living at home or in residential buildings. Hardware\nconsists of custom developed luminaires with sensing, communication and\nprocessing capabilities. They replace the existing lighting infrastructure, do\nnot look out of place and are cost effective. The luminaires record the\nstrength of a Bluetooth signal emitted by a wearable device equipped by the\nmonitored user. The system's software server uses trilateration to calculate\nthe person's location based on known luminaire placement and recorded signal\nstrengths. However, multipath fading caused by the presence of walls, furniture\nand other objects introduces localisation errors. Our previous experiments\nshowed that room-level accuracy can be achieved using software-based filtering\nfor a stationary subject. Our current objective is to assess system accuracy in\nthe context of a moving subject, and ascertain whether room-level localization\nis feasible in real time.\n", "doi": "10.5220/0009578705480555", "arxiv_id": "2009.02483", "pdf_urls": ["https://arxiv.org/pdf/2009.02483"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In Proceedings of the 15th International Conference on Evaluation\n  of Novel Approaches to Software Engineering - Volume 1: ENASE 2020, ISBN\n  978-989-758-421-3, pages 548-555", "categories": "cs.CY"}
{"title": "The intersection graph of a finite simple group has diameter at most 5", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Saul D. Freedman"], "abstract": "  Let $G$ be a non-abelian finite simple group. In addition, let $\\Delta_G$ be\nthe intersection graph of $G$, whose vertices are the proper nontrivial\nsubgroups of $G$, with distinct subgroups joined by an edge if and only if they\nintersect nontrivially. We prove that the diameter of $\\Delta_G$ has a tight\nupper bound of 5, thereby resolving a question posed by Shen (2010).\nFurthermore, a diameter of 5 is achieved only by the baby monster group and\ncertain unitary groups of odd prime dimension.\n", "doi": "10.1007/s00013-021-01583-3", "arxiv_id": "2009.02884", "pdf_urls": ["https://arxiv.org/pdf/2009.02884"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 117(1) (2021), 1-7", "categories": "math.GR"}
{"title": "Edge effect removal in Fourier ptychographic microscopy via periodic\n  plus smooth image decomposition", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["An Pan", "Aiye Wang", "Junfu Zheng", "Yuting Gao", "Caiwen Ma", "Baoli Yao"], "abstract": "  Fourier ptychographic microscopy (FPM) is a promising computational imaging\ntechnique with high resolution, wide field-of-view (FOV) and quantitative phase\nrecovery. So far, a series of system errors that may corrupt the image quality\nof FPM has been reported. However, an imperceptible artifact caused by edge\neffect caught our attention and may also degrade the precision of phase imaging\nin FPM with a cross-shape artifact in the Fourier space. We found that the\nprecision of reconstructed phase at the same subregion depends on the different\nsizes of block processing as a result of different edge conditions, which\nlimits the quantitative phase measurements via FPM. And this artifact is caused\nby the aperiodic image extension of fast Fourier transform (FFT). Herein, to\nremove the edge effect and improve the accuracy, two classes of opposite\nalgorithms termed discrete cosine transform (DCT) and perfect Fourier transform\n(PFT) were reported respectively and discussed systematically. Although both\napproaches can remove the artifacts in FPM and may be extended to other Fourier\nanalysis techniques, PFT has a comparable efficiency to conventional FFT. The\nPFT algorithm improves the standard deviation of phase accuracy as a factor of\n4 from 0.08 radians to 0.02 radians. Finally, we summarized and discussed all\nthe reported system errors of FPM within a generalized model.\n", "doi": "10.1016/j.optlaseng.2022.107408", "arxiv_id": "2009.03138", "pdf_urls": ["https://arxiv.org/pdf/2009.03138"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering 162, 107408 (2023)", "categories": "eess.IV"}
{"title": "Designing a Serious Game: Teaching Developers to Embed Privacy into\n  Software Systems", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nalin Asanka Gamagedara Arachchilage and Mumtaz Abdul Hameed"], "abstract": "  Software applications continue to challenge user privacy when users interact\nwith them. Privacy practices (e.g. Data Minimisation (DM), Privacy by Design\n(PbD) or General Data Protection Regulation (GDPR)) and related \"privacy\nengineering\" methodologies exist and provide clear instructions for developers\nto implement privacy into software systems they develop that preserve user\nprivacy. However, those practices and methodologies are not yet a common\npractice in the software development community. There has been no previous\nresearch focused on developing \"educational\" interventions such as serious\ngames to enhance software developers' coding behaviour. Therefore, this\nresearch proposes a game design framework as an educational tool for software\ndevelopers to improve (secure) coding behaviour, so they can develop\nprivacy-preserving software applications that people can use. The elements of\nthe proposed framework were incorporated into a gaming application scenario\nthat enhances the software developers' coding behaviour through their\nmotivation. The proposed work not only enables the development of\nprivacy-preserving software systems but also helping the software development\ncommunity to put privacy guidelines and engineering methodologies into\npractice.\n", "doi": "10.1145/3417113.3422149", "arxiv_id": "2009.05714", "pdf_urls": ["https://arxiv.org/pdf/2009.05714"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "35th IEEE/ACM International Conference on Automated Software\n  Engineering Workshops (ASEW '20), September 25, 2020, Virtual Event,\n  Australia. ACM, New York, NY, USA", "categories": "cs.CR cs.HC"}
{"title": "Learning Daily Calorie Intake Standard using a Mobile Game", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anik Das", "Sumaiya Amin", "Muhammad Ashad Kabir", "Md. Sabir Hossain", "Mohammad Mainul Islam"], "abstract": "  Mobile games can contribute to learning at greater success. In this paper, we\nhave developed and evaluated a novel educational game, named FoodCalorie, to\nlearn the food calorie intake standards. Our game is aimed to learn the calorie\nvalues of various traditional Bangladeshi foods and the calorie intake standard\nthat varies with age and gender. Our study confirms the finding of existing\nstudies that game-based learning can enhance the learning experience.\n", "doi": "10.4018/ijgbl.2021040104", "arxiv_id": "2009.05802", "pdf_urls": ["https://arxiv.org/pdf/2009.05802"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Game-Based Learning, 2021", "categories": "cs.HC"}
{"title": "A System-Level Engineering Approach for Preliminary Performance Analysis\n  and Design of Global Navigation Satellite System Constellations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marco Nugnes", "Camilla Colombo and Massimo Tipaldi"], "abstract": "  This paper presents a system-level engineering approach for the preliminary\ncoverage performance analysis and the design of a generic Global Navigation\nSatellite System (GNSS) constellation. This analysis accounts for both the\ncoverage requirements and the robustness to transient or catastrophic failures\nof the constellation. The European GNSS, Galileo, is used as reference case to\nprove the effectiveness of the proposed tool. This software suite, named GNSS\nCoverage Analysis Tool (G-CAT), requires as input the state vector of each\nsatellite of the constellation and provides the performance of the GNSS\nconstellation in terms of coverage. The tool offers an orbit propagator, an\nattitude propagator, an algorithm to identify the visibility region on the\nEarth's surface from each satellite, and a counter function to compute how many\nsatellites are in view from given locations on the Earth's surface. Thanks to\nits low computational burden, the tool can be adopted to compute the optimal\nnumber of satellites per each orbital plane by verifying if the coverage and\naccuracy requirements are fulfilled under the assumption of uniform in-plane\nangular spacing between coplanar satellites.\n", "doi": "10.15866/irease.v13i3.18424", "arxiv_id": "2009.09387", "pdf_urls": ["https://arxiv.org/pdf/2009.09387"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "This is a preprint of an article published in International Review\n  of Aerospace Engineering (IREASE), Vol. 13, No. 3, June 2020, pp. 80-98 (OPEN\n  ACCESS)", "categories": "astro-ph.IM astro-ph.EP"}
{"title": "Use of Bayesian Network characteristics to link project management\n  maturity and risk of project overcost", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Felipe Sanchez (ERPI)", "Davy Monticolo (ERPI)", "Eric Bonjour (ERPI)", "Jean-Pierre Mica\\\"elli"], "abstract": "  The project management field has the imperative to increase the project\nprobability of success. Experts have developed several project management\nmaturity models to assets and improve the project outcome. However, the current\nliterature lacks of models allowing correlating the measured maturity and the\nexpected probability of success. This paper uses the characteristics of\nBayesian networks to formalize experts' knowledge and to extract knowledge from\na project overcost database. It develops a method to estimate the impact of\nproject management maturity on the risk of project overcost. A general\nframework is presented. An industrial case is used to illustrate the\napplication of the method.\n", "doi": "10.1109/sitis.2018.00071", "arxiv_id": "2009.09828", "pdf_urls": ["https://arxiv.org/pdf/2009.09828"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2018 14th International Conference on Signal-Image Technology &\n  Internet-Based Systems (SITIS), Nov 2018, Las Palmas de Gran Canaria, Spain.\n  pp.420-426", "categories": "cs.SE cs.AI"}
{"title": "Gamma distribution-based sampling for imbalanced data", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Firuz Kamalov and Dmitry Denisov"], "abstract": "  Imbalanced class distribution is a common problem in a number of fields\nincluding medical diagnostics, fraud detection, and others. It causes bias in\nclassification algorithms leading to poor performance on the minority class\ndata. In this paper, we propose a novel method for balancing the class\ndistribution in data through intelligent resampling of the minority class\ninstances. The proposed method is based on generating new minority instances in\nthe neighborhood of the existing minority points via a gamma distribution. Our\nmethod offers a natural and coherent approach to balancing the data. We conduct\na comprehensive numerical analysis of the new sampling technique. The\nexperimental results show that the proposed method outperforms the existing\nstate-of-the-art methods for imbalanced data. Concretely, the new sampling\ntechnique produces the best results on 12 out of 24 real life as well as\nsynthetic datasets. For comparison, the SMOTE method achieves the top score on\nonly 1 dataset. We conclude that the new technique offers a simple yet\neffective sampling approach to balance data.\n", "doi": "10.1016/j.knosys.2020.106368", "arxiv_id": "2009.10343", "pdf_urls": ["https://arxiv.org/pdf/2009.10343"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2020)", "categories": "cs.LG stat.ML"}
{"title": "Deep Learning-Based Reconstruction of Interventional Tools from Four\n  X-Ray Projections for Tomographic Interventional Guidance", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Elias Eulig", "Joscha Maier", "Michael Knaup", "N. Robert Bennett", "Klaus\n  H\\\"orndler", "Adam S. Wang", "Marc Kachelrie{\\ss}"], "abstract": "  Image guidance for minimally invasive interventions is usually performed by\nacquiring fluoroscopic images using a C-arm system. However, the projective\ndata provide only limited information about the spatial structure and position\nof interventional tools such as stents, guide wires or coils. In this work we\npropose a deep learning-based pipeline for real-time tomographic\n(four-dimensional) interventional guidance at acceptable dose levels. In the\nfirst step, interventional tools are extracted from four cone-beam CT\nprojections using a deep convolutional neural network (CNN). These projections\nare then reconstructed and fed into a second CNN, which maps this highly\nundersampled reconstruction to a segmentation of the interventional tools. Our\npipeline is capable of reconstructing interventional tools from only four x-ray\nprojections without the need for a patient prior with very high accuracy.\nTherefore, the proposed approach is capable of overcoming the drawbacks of\ntoday's interventional guidance and could enable the development of new\nminimally invasive radiological interventions by providing full spatiotemporal\ninformation about the interventional tools.\n", "doi": "10.1002/mp.15160", "arxiv_id": "2009.10993", "pdf_urls": ["https://arxiv.org/pdf/2009.10993"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Eulig, E., et al. Deep learning-based reconstruction of\n  interventional tools and devices from four X-ray projections for tomographic\n  interventional guidance. Medical Physics. 2021; 48: 5837-5850", "categories": "physics.med-ph eess.IV"}
{"title": "Machine Knowledge: Creation and Curation of Comprehensive Knowledge\n  Bases", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gerhard Weikum", "Luna Dong", "Simon Razniewski", "Fabian Suchanek"], "abstract": "  Equipping machines with comprehensive knowledge of the world's entities and\ntheir relationships has been a long-standing goal of AI. Over the last decade,\nlarge-scale knowledge bases, also known as knowledge graphs, have been\nautomatically constructed from web contents and text sources, and have become a\nkey asset for search engines. This machine knowledge can be harnessed to\nsemantically interpret textual phrases in news, social media and web tables,\nand contributes to question answering, natural language processing and data\nanalytics. This article surveys fundamental concepts and practical methods for\ncreating and curating large knowledge bases. It covers models and methods for\ndiscovering and canonicalizing entities and their semantic types and organizing\nthem into clean taxonomies. On top of this, the article discusses the automatic\nextraction of entity-centric properties. To support the long-term life-cycle\nand the quality assurance of machine knowledge, the article presents methods\nfor constructing open schemas and for knowledge curation. Case studies on\nacademic projects and industrial knowledge graphs complement the survey of\nconcepts and methods.\n", "doi": null, "arxiv_id": "2009.11564", "pdf_urls": ["https://arxiv.org/pdf/2009.11564"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Foundations and Trends in Databases, 2021", "categories": "cs.AI cs.DB"}
{"title": "Motivation and Autonomy in Global Software Development: An Empirical\n  Study", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["John Noll and Mohammad Abdur Razzak and Sarah Beecham"], "abstract": "  Distributed development involving globally distributed teams in different\ncountries and timezones adds additional complexity into an already complex\nundertaking. This paper focuses on the effect of global software development on\nmotivation. Specifically, we ask, what impact does misalignment between needed\nand actual autonomy have on global team motivation? We studied members of two\ndistributed software development teams with different degrees of distribution,\nboth following the Scrum approach to software development. One team's members\nare distributed across Ireland, England and Wales; the other has members in\nlocations across Europe and North America. We observed the teams during their\nScrum \"ceremonies,\" and interviewed each team member, during which asked we\nasked team members to rate their motivation on a 5 point ordinal scale.\nConsidering both the reported motivation levels, and qualitative analysis of\nour observations and interviews, our results suggest that autonomy appears to\nbe just one of three job aspects that affect motivation, the others being\ncompetence and relatedness. We hypothesize that (1) autonomy is a necessary but\nnot sufficient condition for motivation among experienced team members, and (2)\nautonomy is not a motivator unless accompanied by sufficient competence.\n", "doi": "10.1145/3084226.3084277", "arxiv_id": "2009.11603", "pdf_urls": ["https://arxiv.org/pdf/2009.11603"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "21st International Conference on Evaluation and Assessment in\n  Software Engineering (EASE 2017)", "categories": "cs.SE"}
{"title": "Inertial fusion without compression does not work either with or without\n  nanoplasmonics", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Istvan B Foldes and Gergo I Pokol"], "abstract": "  A recently published scheme for inertial fusion based on instantaneous\nheating of an uncompressed fuel is criticized. It is shown that efficient\nfusion and time-like fusion burn propagation cannot be realized due to the low\nnuclear reaction cross-sections. The suggested use of nanospheres inside the\nvolume of the target to support the fast heating of the fuel is also\nquestioned.\n", "doi": "10.1017/s0263034620000269", "arxiv_id": "2009.14063", "pdf_urls": ["https://arxiv.org/pdf/2009.14063"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser and Particle Beams, 38, 211-213. (2020)", "categories": "physics.plasm-ph"}
{"title": "Efficient texture-aware multi-GAN for image inpainting", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mohamed Abbas Hedjazi", "Yakup Genc"], "abstract": "  Recent GAN-based (Generative adversarial networks) inpainting methods show\nremarkable improvements and generate plausible images using multi-stage\nnetworks or Contextual Attention Modules (CAM). However, these techniques\nincrease the model complexity limiting their application in low-resource\nenvironments. Furthermore, they fail in generating high-resolution images with\nrealistic texture details due to the GAN stability problem. Motivated by these\nobservations, we propose a multi-GAN architecture improving both the\nperformance and rendering efficiency. Our training schema optimizes the\nparameters of four progressive efficient generators and discriminators in an\nend-to-end manner. Filling in low-resolution images is less challenging for\nGANs due to the small dimensional space. Meanwhile, it guides higher resolution\ngenerators to learn the global structure consistency of the image. To constrain\nthe inpainting task and ensure fine-grained textures, we adopt an LBP-based\nloss function to minimize the difference between the generated and the ground\ntruth textures. We conduct our experiments on Places2 and CelebHQ datasets.\nQualitative and quantitative results show that the proposed method not only\nperforms favorably against state-of-the-art algorithms but also speeds up the\ninference time.\n", "doi": "10.1016/j.knosys.2021.106789", "arxiv_id": "2009.14721", "pdf_urls": ["https://arxiv.org/pdf/2009.14721"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 217, 6 April 2021, 106789", "categories": "cs.CV"}
{"title": "Laser planar trapping", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Stefano De Leo"], "abstract": "  We investigate the phenomenon of the transverse breaking of symmetry of\nGaussian lasers transmitted through dielectrics, showing for which incidence\nconditions and beam parameters it can be observed in optical experiments. The\nnumerical analysis, done by using the integral form of the transmitted beam at\nthe lower interface of a dielectric prism, shows, for incidence approaching the\ncritical region, a laser planar trapping. By using an analytic approximation\nfor the intensity of lower transmitted beam, we model the wave front curvature\nby a closed expression which depends on the refractive index, on the\ngeometrical properties of the dielectric block, and, finally, on the incidence\nangle of the incoming beam. The analytic formula shows an excellent agreement\nwith the numerical analysis and it could be useful in future experimental\nimplementations.\n", "doi": "10.1088/1612-202x/abb473", "arxiv_id": "2010.00471", "pdf_urls": ["https://arxiv.org/pdf/2010.00471"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 17, 116001-10 (2020)", "categories": "physics.optics"}
{"title": "Laser-processing of grinded and mechanically abraded Nb-surfaces", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V. Porshyn", "P. Rothweiler", "D. L\\\"utzenkirchen-Hecht"], "abstract": "  The effect of pulsed laser polishing on rough niobium surfaces was\ninvestigated. We created different well-defined roughness profiles with\nstandard emery papers and subsequently remelted random surface areas with a\nsize of about 2x2 mm^2 with nanosecond laser pulses (wavelength of 1064 nm,\npulse length of 10 ns). Pristine as well as laser-treated surfaces were\ninvestigated using optical profilometry and atomic force microscopy, and the\nsurface topography was described by means of correlation functions. Uniformly\nrough and highly smooth surface geometries were achieved for fractals above and\nbelow 7 {\\mu}m, respectively. Moreover, the behavior of foreign particles\nduring the laser processing was investigated in detail. The polishing procedure\nwas also monitored point by point by detecting electrical signals, i.e., sample\ncharging, which resulted from the intense laser illumination. The measured\nelectrical charges were found to be correlated with the local surface texture.\nThus, regions with initially high roughness profiles and regions with extensive\nlaser-induced defects could be directly identified from the detected electrical\nsignals.\n", "doi": "10.2351/7.0000160", "arxiv_id": "2010.01336", "pdf_urls": ["https://arxiv.org/pdf/2010.01336"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Laser Appl. 32, 042009 (2020)", "categories": "physics.app-ph"}
{"title": "On the complete metrisability of spaces of contractive semigroups", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Raj Dahya"], "abstract": "  The space of unitary $C_{0}$-semigroups on separable infinite dimensional\nHilbert space, when viewed under the topology of uniform weak convergence on\ncompact subsets of $\\mathbb{R}_{+}$, is known to admit various interesting\nresidual subspaces. Before treating the contractive case, the problem of the\ncomplete metrisability of this space was raised in [Eisner, 2010]. Utilising\nBorel complexity computations and automatic continuity results for semigroups,\nwe obtain a general result, which in particular implies that the\none-/multiparameter contractive $C_{0}$-semigroups constitute Polish spaces and\nthus positively addresses the open problem.\n", "doi": "10.1007/s00013-022-01717-1", "arxiv_id": "2010.01573", "pdf_urls": ["https://arxiv.org/pdf/2010.01573"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel), Volume 118, Issue 5, pp. 509--528, 28 March\n  2022", "categories": "math.FA"}
{"title": "A consistent and conservative volume distribution algorithm and its\n  applications to multiphase flows using Phase-Field models", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ziyang Huang", "Guang Lin", "Arezoo M. Ardekani"], "abstract": "  In the present study, the multiphase volume distribution problem, where there\ncan be an arbitrary number of phases, is addressed using a consistent and\nconservative volume distribution algorithm. The proposed algorithm satisfies\nthe summation constraint, the conservation constraint, and the\n\\textit{consistency of reduction}. The first application of the volume\ndistribution algorithm is to determine the Lagrange multipliers in multiphase\nPhase-Field models that enforce the mass conservation, and a multiphase\nconservative Allen-Cahn model that satisfies the \\textit{consistency of\nreduction} is developed. A corresponding consistent and conservative numerical\nscheme is developed for the model. The multiphase conservative Allen-Cahn model\nhas a better ability than the multiphase Cahn-Hilliard model to preserve\nunder-resolved structures. The second application is to develop a numerical\nprocedure, called the boundedness mapping, to map the order parameters,\nobtained numerically from a multiphase model, into their physical interval, and\nat the same time to preserve the physical properties of the order parameters.\nAlong with the consistent and conservative schemes for the multiphase\nPhase-Field models, the numerical solutions of the order parameters are\nreduction consistent, conservative, and bounded, which are theoretically\nanalyzed and numerically validated. Then, the multiphase Phase-Field models are\ncoupled with the momentum equation by satisfying the \\textit{consistency of\nmass conservation} and the \\textit{consistency of mass and momentum transport},\nthanks to the consistent formulation. It is demonstrated that the proposed\nmodel and scheme converge to the sharp-interface solution and are capable of\ncapturing the complicated multiphase dynamics even when there is a large\ndensity and/or viscosity ratio.\n", "doi": "10.1016/j.ijmultiphaseflow.2021.103727", "arxiv_id": "2010.01738", "pdf_urls": ["https://arxiv.org/pdf/2010.01738"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 142 (2021) 103727", "categories": "physics.comp-ph physics.flu-dyn"}
{"title": "Documentation of quality requirements in agile software development", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Woubshet Behutiye", "Pertti Seppanen", "Pilar Rodriguez and Markku Oivo"], "abstract": "  Context: Quality requirements (QRs) have a significant role in the success of\nsoftware projects. In agile software development (ASD), where working software\nis valued over comprehensive documentation, QRs are often under-specified or\nnot documented. Consequently, they may be handled improperly and result in\ndegraded software quality and increased maintenance costs. Investigating the\ndocumentation of QRs in ASD, would provide evidence on existing practices,\ntools and aspects considered in ASD that other practitioners might utilize to\nimprove documentation and management of QRs in ASD. Although there are some\nstudies examining documentation in ASD, those that specifically investigate the\ndocumentation of QRs in depth are lacking. Method: we conducted a multiple case\nstudy by interviewing 15 practitioners of four ASD cases, to provide empirical\nevidence on documentation of QRs in ASD. We also run workshops with two of the\ncases, to identify important aspects that ASD practitioners consider when\ndocumenting QRs in requirements management repositories. Result and\nconclusions: ASD companies approach documentation of QRs to fit the needs of\ntheir context. They used tools, backlogs,iterative prototypes,... Please refer\nto the PDF document for the remaining part of the abstract and the rest of the\npaper\n", "doi": "10.1145/3383219.3383245", "arxiv_id": "2010.02971", "pdf_urls": ["https://arxiv.org/pdf/2010.02971"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "EASE 2020 In Evaluation and Assessment in Software Engineering", "categories": "cs.SE"}
{"title": "Sound event localization and detection based on crnn using rectangular\n  filters and channel rotation data augmentation", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Francesca Ronchini", "Daniel Arteaga", "Andr\\'es P\\'erez-L\\'opez"], "abstract": "  Sound Event Localization and Detection refers to the problem of identifying\nthe presence of independent or temporally-overlapped sound sources, correctly\nidentifying to which sound class it belongs, estimating their spatial\ndirections while they are active. In the last years, neural networks have\nbecome the prevailing method for sound Event Localization and Detection task,\nwith convolutional recurrent neural networks being among the most used systems.\nThis paper presents a system submitted to the Detection and Classification of\nAcoustic Scenes and Events 2020 Challenge Task 3. The algorithm consists of a\nconvolutional recurrent neural network using rectangular filters, specialized\nin recognizing significant spectral features related to the task. In order to\nfurther improve the score and to generalize the system performance to unseen\ndata, the training dataset size has been increased using data augmentation. The\ntechnique used for that is based on channel rotations and reflection on the xy\nplane in the First Order Ambisonic domain, which allows improving Direction of\nArrival labels keeping the physical relationships between channels. Evaluation\nresults on the development dataset show that the proposed system outperforms\nthe baseline results, considerably improving Error Rate and F-score for\nlocation-aware detection.\n", "doi": null, "arxiv_id": "2010.06422", "pdf_urls": ["https://arxiv.org/pdf/2010.06422"], "github": ["https://github.com/RonFrancesca/dcase2020-fp"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Detection and Classification of Acoustic Scenes\n  and Events 2020 Workshop (DCASE2020)", "categories": "eess.AS cs.SD"}
{"title": "Analytical parameter estimation of the SIR epidemic model. Applications\n  to the COVID-19 pandemic", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dimiter Prodanov"], "abstract": "  The dramatic outbreak of the coronavirus disease 2019 (COVID-19) pandemics\nand its ongoing progression boosted the scientific community's interest in\nepidemic modeling and forecasting. The SIR (Susceptible-Infected-Removed) model\nis a simple mathematical model of epidemic outbreaks, yet for decades it evaded\nthe efforts of the community to derive an explicit solution. The present work\ndemonstrates that this is a non-trivial task. Notably, it is proven that the\nexplicit solution of the model requires the introduction of a new\ntranscendental special function, related to the Wright's Omega function. The\npresent manuscript reports new analytical results and numerical routines\nsuitable for parametric estimation of the SIR model. The manuscript introduces\niterative algorithms approximating the incidence variable, which allows for\nestimation of the model parameters from the numbers of observed cases. The\nnumerical approach is exemplified with data from the European Centre for\nDisease Prevention and Control (ECDC) for several European countries in the\nperiod Jan 2020 -- Jun 2020.\n", "doi": "10.3390/e23010059", "arxiv_id": "2010.07000", "pdf_urls": ["https://arxiv.org/pdf/2010.07000"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Entropy (Basel). 2020 Dec 31;23(1):E59. PMID: 33396355", "categories": "q-bio.PE cs.NA math.NA physics.soc-ph"}
{"title": "A Light Heterogeneous Graph Collaborative Filtering Model using Textual\n  Information", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Chaoyang Wang", "Zhiqiang Guo", "Guohui Li", "Jianjun Li", "Peng Pan", "Ke Liu"], "abstract": "  Due to the development of graph neural networks, graph-based representation\nlearning methods have made great progress in recommender systems. However, data\nsparsity is still a challenging problem that most graph-based recommendation\nmethods are confronted with. Recent works try to address this problem by\nutilizing side information. In this paper, we exploit the relevant and easily\naccessible textual information by advanced natural language processing (NLP)\nmodels and propose a light RGCN-based (RGCN, relational graph convolutional\nnetwork) collaborative filtering method on heterogeneous graphs. Specifically,\nto incorporate rich textual knowledge, we utilize a pre-trained NLP model to\ninitialize the embeddings of text nodes. Afterward, by performing a simplified\nRGCN-based node information propagation on the constructed heterogeneous graph,\nthe embeddings of users and items can be adjusted with textual knowledge, which\neffectively alleviates the negative effects of data sparsity. Moreover, the\nmatching function used by most graph-based representation learning methods is\nthe inner product, which is not appropriate for the obtained embeddings that\ncontain complex semantics. We design a predictive network that combines\ngraph-based representation learning with neural matching function learning, and\ndemonstrate that this architecture can bring a significant performance\nimprovement. Extensive experiments are conducted on three publicly available\ndatasets, and the results verify the superior performance of our method over\nseveral baselines.\n", "doi": "10.1016/j.knosys.2021.107602", "arxiv_id": "2010.07027", "pdf_urls": ["https://arxiv.org/pdf/2010.07027"], "github": ["https://github.com/sunwardtree/lt-hgcf"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2021)", "categories": "cs.IR cs.LG"}
{"title": "Deep Conditional Transformation Models", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Philipp F.M. Baumann", "Torsten Hothorn and David R\\\"ugamer"], "abstract": "  Learning the cumulative distribution function (CDF) of an outcome variable\nconditional on a set of features remains challenging, especially in\nhigh-dimensional settings. Conditional transformation models provide a\nsemi-parametric approach that allows to model a large class of conditional CDFs\nwithout an explicit parametric distribution assumption and with only a few\nparameters. Existing estimation approaches within this class are, however,\neither limited in their complexity and applicability to unstructured data\nsources such as images or text, lack interpretability, or are restricted to\ncertain types of outcomes. We close this gap by introducing the class of deep\nconditional transformation models which unifies existing approaches and allows\nto learn both interpretable (non-)linear model terms and more complex neural\nnetwork predictors in one holistic framework. To this end we propose a novel\nnetwork architecture, provide details on different model definitions and derive\nsuitable constraints as well as network regularization terms. We demonstrate\nthe efficacy of our approach through numerical experiments and applications.\n", "doi": "10.1007/978-3-030-86523-8_1", "arxiv_id": "2010.07860", "pdf_urls": ["https://arxiv.org/pdf/2010.07860"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Machine Learning and Knowledge Discovery in Databases. Research\n  Track. ECML PKDD 2021", "categories": "cs.LG stat.ML"}
{"title": "Interface combinatorial pulsed laser deposition to enhance\n  heterostructures functional properties", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jerome Wolfman", "Beatrice Negulescu", "Antoine Ruyter", "Ndioba Niang and\n  Nazir Jaber"], "abstract": "  In this chapter we will describe a new development of combinatorial pulsed\nlaser deposition (CPLD) which targets the exploration of interface libraries.\nThe idea is to modulate continuously the composition of interfaces on a few\natomic layers in order to alter their functional properties. This unique\ncombinatorial synthesis of interfaces is possible due to very specific PLD\ncharacteristics. The first one is its well-known ability for complex oxide\nstoichiometry transfer from the target to the film. The second one is the layer\nby layer control of thin film growth at the atomic level using in-situ RHEED\ncharacterization. The third one relates to the directionality of the ablated\nplume which allows for selective area deposition on the substrate using a\nmobile shadow-mask. However PLD also has some limitations and important PLD\naspects to be considered for reliable CPLD are reviewed. Multiple examples\nregarding the control of interface magnetism in magnetic tunnel junctions and\nenergy band and Schottky barrier height tuning in ferroelectric tunable\ncapacitors are presented.\n", "doi": "10.5772/intechopen.94415", "arxiv_id": "2010.10773", "pdf_urls": ["https://arxiv.org/pdf/2010.10773"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Ablation, Book edited by Dr. Dongfang Yang, IntechOpen Ltd,\n  London, 2020", "categories": "cond-mat.mtrl-sci"}
{"title": "An explainable deep vision system for animal classification and\n  detection in trail-camera images with automatic post-deployment retraining", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Golnaz Moallem (1)", "Don D. Pathirage (1)", "Joel Reznick (1)", "James\n  Gallagher (2)", "Hamed Sari-Sarraf (1) ((1) Applied Vision Lab Texas Tech\n  University (2) Texas Parks and Wildlife Department)"], "abstract": "  This paper introduces an automated vision system for animal detection in\ntrail-camera images taken from a field under the administration of the Texas\nParks and Wildlife Department. As traditional wildlife counting techniques are\nintrusive and labor intensive to conduct, trail-camera imaging is a\ncomparatively non-intrusive method for capturing wildlife activity. However,\ngiven the large volume of images produced from trail-cameras, manual analysis\nof the images remains time-consuming and inefficient. We implemented a\ntwo-stage deep convolutional neural network pipeline to find animal-containing\nimages in the first stage and then process these images to detect birds in the\nsecond stage. The animal classification system classifies animal images with\noverall 93% sensitivity and 96% specificity. The bird detection system achieves\nbetter than 93% sensitivity, 92% specificity, and 68% average\nIntersection-over-Union rate. The entire pipeline processes an image in less\nthan 0.5 seconds as opposed to an average 30 seconds for a human labeler. We\nalso addressed post-deployment issues related to data drift for the animal\nclassification system as image features vary with seasonal changes. This system\nutilizes an automatic retraining algorithm to detect data drift and update the\nsystem. We introduce a novel technique for detecting drifted images and\ntriggering the retraining procedure. Two statistical experiments are also\npresented to explain the prediction behavior of the animal classification\nsystem. These experiments investigate the cues that steers the system towards a\nparticular decision. Statistical hypothesis testing demonstrates that the\npresence of an animal in the input image significantly contributes to the\nsystem's decisions.\n", "doi": "10.1016/j.knosys.2021.106815", "arxiv_id": "2010.11472", "pdf_urls": ["https://arxiv.org/pdf/2010.11472"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 216, 15 March 2021, 106815", "categories": "cs.CV"}
{"title": "Does anatomical contextual information improve 3D U-Net based brain\n  tumor segmentation?", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Iulian Emil Tampu and Neda Haj-Hosseini and Anders Eklund"], "abstract": "  Effective, robust, and automatic tools for brain tumor segmentation are\nneeded for the extraction of information useful in treatment planning from\nmagnetic resonance (MR) images. Context-aware artificial intelligence is an\nemerging concept for the development of deep learning applications for\ncomputer-aided medical image analysis. In this work, it is investigated whether\nthe addition of contextual information from the brain anatomy in the form of\nwhite matter, gray matter, and cerebrospinal fluid masks and probability maps\nimproves U-Net-based brain tumor segmentation. The BraTS2020 dataset was used\nto train and test two standard 3D U-Net models that, in addition to the\nconventional MR image modalities, used the anatomical contextual information as\nextra channels in the form of binary masks (CIM) or probability maps (CIP). A\nbaseline model (BLM) that only used the conventional MR image modalities was\nalso trained. The impact of adding contextual information was investigated in\nterms of overall segmentation accuracy, model training time, domain\ngeneralization, and compensation for fewer MR modalities available for each\nsubject. Results show that there is no statistically significant difference\nwhen comparing Dice scores between the baseline model and the contextual\ninformation models, even when comparing performances for high- and low-grade\ntumors independently. Only in the case of compensation for fewer MR modalities\navailable for each subject did the addition of anatomical contextual\ninformation significantly improve the segmentation of the whole tumor. Overall,\nthere is no overall significant improvement in segmentation performance when\nusing anatomical contextual information in the form of either binary masks or\nprobability maps as extra channels.\n", "doi": "10.3390/diagnostics11071159", "arxiv_id": "2010.13460", "pdf_urls": ["https://arxiv.org/pdf/2010.13460"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Diagnostics (Basel). 2021 Jun 25;11(7):1159", "categories": "eess.IV cs.CV cs.LG"}
{"title": "Laser effect on the final products of $Z$-boson decay", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M. Jakha", "S. Mouslih", "S. Taj", "and B. Manaut"], "abstract": "  Experimentalists have long sought a method that allows them to control as\nthey like the branching ratios of an unstable particle decay and direct some\ndecay to follow one specific desired channel without another. The powerful\nlaser could make this dream come true. In this Letter and within the framework\nof the standard electroweak model, we investigate theoretically the laser\neffect on the branching ratios of different $Z$-boson decay modes by\ncalculating analytically the $Z$-boson decay into a pair of fermion-antifermion\n$(Z\\rightarrow f\\bar{f})$ in the presence of a circularly polarized\nelectromagnetic field. It is found that, at high intensities, the $Z$-boson\ncould only decay invisibly into neutrinos, and its decay into any other pair of\ncharged fermions becomes impossible due to the increase in the effective mass\nthat fermions acquire inside the electromagnetic field. The influence of the\nlaser frequency and intensity on the lifetime is also included in order to\nconfirm the surprising result obtained for the pion lifetime in a previous\npaper [ Mouslih S \\textit{et al} 2020 \\textit{Phys. Rev. D} \\textbf{102} 073006\n].\n", "doi": "10.1088/1612-202x/abd17d", "arxiv_id": "2010.14401", "pdf_urls": ["https://arxiv.org/pdf/2010.14401"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 18 (2021) 016002", "categories": "hep-ph"}
{"title": "Which Minimizer Does My Neural Network Converge To?", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Manuel Nonnenmacher", "David Reeb", "Ingo Steinwart"], "abstract": "  The loss surface of an overparameterized neural network (NN) possesses many\nglobal minima of zero training error. We explain how common variants of the\nstandard NN training procedure change the minimizer obtained. First, we make\nexplicit how the size of the initialization of a strongly overparameterized NN\naffects the minimizer and can deteriorate its final test performance. We\npropose a strategy to limit this effect. Then, we demonstrate that for adaptive\noptimization such as AdaGrad, the obtained minimizer generally differs from the\ngradient descent (GD) minimizer. This adaptive minimizer is changed further by\nstochastic mini-batch training, even though in the non-adaptive case, GD and\nstochastic GD result in essentially the same minimizer. Lastly, we explain that\nthese effects remain relevant for less overparameterized NNs. While\noverparameterization has its benefits, our work highlights that it induces\nsources of error absent from underparameterized models.\n", "doi": "10.1007/978-3-030-86523-8_6", "arxiv_id": "2011.02408", "pdf_urls": ["https://arxiv.org/pdf/2011.02408"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ECML PKDD 2021. Machine Learning and Knowledge Discovery in\n  Databases. Research Track", "categories": "stat.ML cs.LG"}
{"title": "A fast learning algorithm for One-Class Slab Support Vector Machines", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bagesh Kumar", "Ayush Sinha", "Sourin Chakrabarti", "O.P.Vyas"], "abstract": "  One Class Slab Support Vector Machines (OCSSVM) have turned out to be better\nin terms of accuracy in certain classes of classification problems than the\ntraditional SVMs and One Class SVMs or even other One class classifiers. This\npaper proposes fast training method for One Class Slab SVMs using an updated\nSequential Minimal Optimization (SMO) which divides the multi variable\noptimization problem to smaller sub problems of size two that can then be\nsolved analytically. The results indicate that this training method scales\nbetter to large sets of training data than other Quadratic Programming (QP)\nsolvers.\n", "doi": "10.1016/j.knosys.2021.107267", "arxiv_id": "2011.03243", "pdf_urls": ["https://arxiv.org/pdf/2011.03243"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 228, 27 September 2021, 107267", "categories": "cs.LG stat.ML"}
{"title": "Training a quantum annealing based restricted Boltzmann machine on\n  cybersecurity data", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vivek Dixit", "Raja Selvarajan", "Tamer Aldwairi", "Yaroslav Koshka", "Mark A.\n  Novotny", "Travis S. Humble", "Muhammad A. Alam and Sabre Kais"], "abstract": "  We present a real-world application that uses a quantum computer.\nSpecifically, we train a RBM using QA for cybersecurity applications. The\nD-Wave 2000Q has been used to implement QA. RBMs are trained on the ISCX data,\nwhich is a benchmark dataset for cybersecurity. For comparison, RBMs are also\ntrained using CD. CD is a commonly used method for RBM training. Our analysis\nof the ISCX data shows that the dataset is imbalanced. We present two different\nschemes to balance the training dataset before feeding it to a classifier. The\nfirst scheme is based on the undersampling of benign instances. The imbalanced\ntraining dataset is divided into five sub-datasets that are trained separately.\nA majority voting is then performed to get the result. Our results show the\nmajority vote increases the classification accuracy up from 90.24% to 95.68%,\nin the case of CD. For the case of QA, the classification accuracy increases\nfrom 74.14% to 80.04%. In the second scheme, a RBM is used to generate\nsynthetic data to balance the training dataset. We show that both QA and\nCD-trained RBM can be used to generate useful synthetic data. Balanced training\ndata is used to evaluate several classifiers. Among the classifiers\ninvestigated, K-Nearest Neighbor (KNN) and Neural Network (NN) perform better\nthan other classifiers. They both show an accuracy of 93%. Our results show a\nproof-of-concept that a QA-based RBM can be trained on a 64-bit binary dataset.\nThe illustrative example suggests the possibility to migrate many practical\nclassification problems to QA-based techniques. Further, we show that synthetic\ndata generated from a RBM can be used to balance the original dataset.\n", "doi": "10.1109/tetci.2021.3074916", "arxiv_id": "2011.13996", "pdf_urls": ["https://arxiv.org/pdf/2011.13996"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "V. Dixit et al., \"Training a Quantum Annealing Based Restricted\n  Boltzmann Machine on Cybersecurity Data,\" in IEEE Transactions on Emerging\n  Topics in Computational Intelligence, doi: 10.1109/TETCI.2021.3074916", "categories": "quant-ph cs.LG"}
{"title": "In-flight performance of the BLAST-TNG telescope platform", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gabriele Coppi", "Peter A.R. Ade", "Peter C. Ashton", "Jason E. Austermann", "Erin G. Cox", "Mark J. Devlin", "Bradley J. Dober", "Valentina Fanfani", "Laura M.\n  Fissel", "Nicholas Galitzki", "Jiansong Gao", "Samuel Gordon", "Christopher E.\n  Groppi", "Gene C. Hilton", "Johannes Hubmayr", "Jeffrey Klein", "Dale Li", "Nathan P.\n  Lourie", "Ian Lowe", "Hamdi Mani", "Philip Mauskopf", "Christopher McKenney", "Federico\n  Nati", "Giles Novak", "Giampaolo Pisano", "L.Javier Romualdez", "Adrian Sinclair", "Juan D. Soler", "Carole Tucker", "Joel Ullom"], "abstract": "  The Next Generation Balloon-Borne Large Aperture Submillimeter Telescope\n(BLAST-TNG) was a unique instrument for characterizing the polarized\nsubmillimeter sky at high-angular resolution. BLAST-TNG flew from the Long\nDuration Balloon Facility in Antarctica in January 2020. Despite the short\nflight duration, the instrument worked very well and is providing significant\ninformation about each subsystem that will be invaluable for future balloon\nmissions. In this contribution, we discuss the performance of telescope and\ngondola.\n", "doi": "10.1117/12.2560849", "arxiv_id": "2012.01039", "pdf_urls": ["https://arxiv.org/pdf/2012.01039"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11445, Ground-based and Airborne Telescopes VIII, 2020", "categories": "astro-ph.IM"}
{"title": "The Gravitational-wave Optical Transient Observer (GOTO)", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin J. Dyer", "Danny Steeghs", "Duncan K. Galloway", "Vik S. Dhillon", "Paul O'Brien", "Gavin Ramsay", "Kanthanakorn Noysena", "Enric Pall\\'e", "Rubina\n  Kotak", "Rene Breton", "Laura Nuttall", "Don Pollacco", "Krzysztof Ulaczyk", "Joseph\n  Lyman", "Kendall Ackley"], "abstract": "  The Gravitational-wave Optical Transient Observer (GOTO) is a wide-field\ntelescope project focused on detecting optical counterparts to\ngravitational-wave sources. GOTO uses arrays of 40 cm unit telescopes (UTs) on\na shared robotic mount, which scales to provide large fields of view in a\ncost-effective manner. A complete GOTO mount uses 8 unit telescopes to give an\noverall field of view of 40 square degrees, and can reach a depth of 20th\nmagnitude in three minutes. The GOTO-4 prototype was inaugurated with 4 unit\ntelescopes in 2017 on La Palma, and was upgraded to a full 8-telescope array in\n2020. A second 8-UT mount will be installed on La Palma in early 2021, and\nanother GOTO node with two more mount systems is planned for a southern site in\nAustralia. When complete, each mount will be networked to form a robotic,\ndual-hemisphere observatory, which will survey the entire visible sky every few\nnights and enable rapid follow-up detections of transient sources.\n", "doi": "10.1117/12.2561008", "arxiv_id": "2012.02685", "pdf_urls": ["https://arxiv.org/pdf/2012.02685"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11445, Ground-based and Airborne Telescopes VIII,\n  114457G (13 December 2020)", "categories": "astro-ph.IM gr-qc"}
{"title": "Final assembly, metrology, and testing of the WEAVE fibre positioner", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sarah Hughes", "Ellen Schallig", "Ian J. Lewis", "Gavin Dalton", "David\n  Terrett", "Don Carlos Abrams", "J. Alfonso L. Aguerri", "Georgia Bishop", "Piercarlo\n  Bonifacio", "Matthew Brock", "Esperanza Carrasco", "Kevin Middleton", "Scott C.\n  Trager", "Antonella Vallenari"], "abstract": "  WEAVE is the new wide-field spectroscopy facility for the prime focus of the\nWilliam Herschel Telescope at La Palma, Spain. Its fibre positioner is\nessential for the accurate placement of the spectrograph's 960 fibre multiplex.\nWe provide an overview of the final assembly and metrology of the fibre\npositioner, and results of lab commissioning of its robot gantries. A\ncompletely new z-gantry for each positioner robot was acquired, with\nmeasurements showing a marked improvement in positioning repeatability. We also\npresent the first results of the configuration software testing, and discuss\nthe metrology procedures that must be repeated after the positioner's arrival\nat the observatory.\n", "doi": "10.1117/12.2560331", "arxiv_id": "2012.07734", "pdf_urls": ["https://arxiv.org/pdf/2012.07734"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 114477R (13 December 2020)", "categories": "astro-ph.IM"}
{"title": "Optical aspects of Near-Infrared Imager Spectrometer and Polarimeter\n  instrument (NISP)", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Archita Rai (1 and 2)", "Shashikiran Ganesh (1)", "Sukamal K. Paul (3)", "Prashanth K. Kasarla (1)", "Prachi V. Prajapati (1)", "Deekshya R. Sarkar (1)", "Alka Singh (1)", "Pitambar S. Patwal (1)", "Hitesh K L Adalja (1)", "Satya N.\n  Mathur (1)", "Sachindra Naik (1)", "Amish B. Shah (1)", "Kiran S. Baliyan (1) ((1)\n  Physical Research Laboratory", "Ahmedabad", "India", "(2) IIT", "Gandhinagar", "India", "(3) Space Application Center", "Ahmedabad", "India)"], "abstract": "  As a Near-IR instrument to PRL's upcoming 2.5 m telescope, NISP is designed\nindigeniously at PRL to serve as a multifaceted instrument. Optical, Mechanical\nand Electronics subsystems are being designed and developed in-house at PRL. It\nwill consist of imaging, spectroscopy and imaging-polarimetry mode in the\nwavelength bands Y, J, H, Ks i.e. 0.8 - 2.5 micron. The detector is an 2K x 2K\nH2RG (MCT) array detector from Teledyne, which will give a large FOV of 10' x\n10' in the imaging mode. Spectroscopic modes with resolving power of R ~ 3000,\nwill be achieved using grisms. Spectroscopy will be available in single order\nand a cross-dispersed mode shall be planned for simultaneous spectra. The\ninstrument enables multi-wavelength imaging-polarimetry using Wedged-Double\nWollaston (WeDoWo) prisms to get single shot Stokes parameters (I, Q, U) for\nlinear polarisation simultaneously, thus increasing the efficiency of\npolarisation measurements and reducing observation time.\n", "doi": "10.1117/12.2560988", "arxiv_id": "2012.08563", "pdf_urls": ["https://arxiv.org/pdf/2012.08563"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 1144765, 2020", "categories": "astro-ph.IM"}
{"title": "EMPOL: an EMCCD based optical imaging polarimeter", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shashikiran Ganesh (1)", "Archita Rai (1 and 2)", "Aravind K (1 and 2)", "Alka Singh (1)", "Prachi Vinod Prajapati (1)", "Ashish Mishra (3)", "Prashanth\n  Kasarla (1)", "Deekshya Roy Sarkar (1)", "Pitamber Singh Patwal (1)", "Namita Uppal\n  (1 and 2)", "Sunil Chandra (4)", "Satyanarain Mathur (1)", "Amish B Shah (1)", "Kiran\n  S Baliyan (1)", "U C Joshi (1) ((1) Physical Research Laboratory", "Ahmedabad", "India", "(2) IIT Gandhinagar", "India", "(3) University of Toledo", "USA", "(4) Centre\n  for Space Research", "North-West University", "Potchefstroom", "South Africa)"], "abstract": "  An Andor 1K $\\times$ 1K EMCCD detector has been used to develop an optical\nimaging polarimeter for use at the Cassegrain focus of 1.2 m telescope of PRL.\nThe optics is derived from an older single-element detector instrument and\nconsists of a rotating half-wave plate as modulator and a Foster prism as an\nanalyser. The field of view of the instrument is 3 $\\times$ 3 sq arcmin. We\ndescribe the instrument and the observational methodology in this document.\nExtensive observations have been carried out with this instrument covering a\nlarge variety of sources e.g. near-Earth asteroids, comets, Lynds dark nebulae,\nopen clusters and AGN such as blazars. In the current communication, we discuss\nsome results from the initial calibration runs while the other results will be\npresented elsewhere.\n", "doi": "10.1117/12.2560949", "arxiv_id": "2012.08768", "pdf_urls": ["https://arxiv.org/pdf/2012.08768"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 114479E, 2020", "categories": "astro-ph.IM"}
{"title": "Electronics design and development of Near-Infrared Imager, Spectrometer\n  and Polarimeter", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Deekshya Roy Sarkar (1)", "Amish B. Shah (1)", "Alka Singh (1)", "Pitamber\n  Singh Patwal (1)", "Prashanth Kumar Kasarla (1)", "Archita Rai (1 and 2)", "Prachi\n  Vinod Prajapati (1)", "Hitesh Kumar L. Adalja (1)", "Satya N. Mathur (1)", "Sachindra Naik (1)", "Shashikiran Ganesh (1)", "Kiran S. Baliyan (1) ((1)\n  Physical Research Laboratory", "Ahmedabad", "Gujarat", "India", "(2) Indian Institute\n  of Technology", "Gandhinagar", "Gujarat", "India)"], "abstract": "  NISP, a multifaceted near-infrared instrument for the upcoming 2.5m IR\ntelescope at MIRO Gurushikhar, Mount Abu, Rajasthan, India is being developed\nat PRL, Ahmedabad. NISP will have wide (FOV = 10' x 10') field imaging,\nmoderate (R=3000) spectroscopy and imaging polarimetry operating modes. It is\ndesigned based on 0.8 to 2.5 micron sensitive, 2048 X 2048 HgCdTe (MCT) array\ndetector from Teledyne. Optical, Mechanical and Electronics subsystems are\nbeing designed and developed in-house at PRL. HAWAII-2RG (H2RG) detector will\nbe mounted along with controlling SIDECAR ASIC inside LN2 filled cryogenic\ncooled Dewar. FPGA based controller for H2RG and ASIC will be mounted outside\nthe Dewar at room temperature. Smart stepper motors will facilitate motion of\nfilter wheels and optical components to realize different operating modes.\nDetector and ASIC temperatures are servo controlled using Lakeshore's\nTemperature Controller (TC) 336. Also, several cryogenic temperatures will be\nmonitored by TC for health checking of the instrument. Detector, Motion and\nTemperature controllers onboard telescope will be interfaced to USB Hub and\nfiber-optic trans-receiver. Remote Host computer interface to remote end\ntrans-receiver will be equipped with in-house developed GUI software to control\nall functionalities of NISP. Design and development aspects of NISP Electronics\nwill be presented in this conference.\n", "doi": "10.1117/12.2562113", "arxiv_id": "2012.08805", "pdf_urls": ["https://arxiv.org/pdf/2012.08805"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 1144778, 2020", "categories": "astro-ph.IM"}
{"title": "Mechanical aspects of Near-Infrared Imager Spectrometer and Polarimeter", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Prashanth Kumar Kasarla (1)", "Pitamber Singh Patwal (1)", "Hitesh Kumar\n  L. Adalja (1)", "Satya Narain Mathur (1)", "Deekshya Roy Sarkar (1)", "Alka Singh\n  (1)", "Archita Rai (1 and 2)", "Prachi Vinod Prajapati (1)", "Sachindra Naik (1)", "Amish B. Shah (1)", "Shashikiran Ganesh (1)", "Kiran S. Baliyan (1) ((1) Physical\n  Research Laboratory", "Ahmedabad", "India", "(2) Indian Institute of Technology", "Gandhinagar", "India)"], "abstract": "  Near-infrared Imager Spectrometer and Polarimeter (NISP) is a camera, an\nintermediate resolution spectrograph and an imaging polarimeter being developed\nfor upcoming 2.5m telescope of Physical Research Laboratory at Mount Abu,\nIndia. NISP is designed to work in the Near-IR (0.8-2.5 micron) using a H2RG\ndetector. Collimator and camera lenses would transfer the image from the focal\nplane of the telescope to the detector plane. The entire optics, mechanical\nsupport structures, detector-SIDECAR assembly will be cooled to\ncryo-temperatures using an open cycle Liquid Nitrogen tank inside a vacuum\nDewar. GFRP support structures would be used to isolate cryogenic system from\nthe Dewar. Two layer thermal shielding would be used to reduce the radiative\nheat transfer. Molecular sieve (getter) would be used to enhance the vacuum\nlevel inside Dewar. Magnet-reedswitch combination are used for absolute\npositioning of filterwheels. Here we describe the mechanical aspects in detail.\n", "doi": "10.1117/12.2561339", "arxiv_id": "2012.08813", "pdf_urls": ["https://arxiv.org/pdf/2012.08813"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 114476U, 2020", "categories": "astro-ph.IM"}
{"title": "The structure monitoring of the MST prototype of CTA", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Victor Barbosa Martins", "Markus Garczarczyk (for the The Cherenkov\n  Telescope Array Consortium)"], "abstract": "  The Cherenkov Telescope Array (CTA) is the next generation of ground-based\ngamma-ray observatory. The observatory will consist of two arrays, one located\nin the southern hemisphere (Paranal,Chile) and the other in the northern\nhemisphere (Canary Island, Spain), covering the whole sky in the range of\nobservation. More than 100 telescopes are planned to be in operation for as\nlong as 30 years, which motivated the development of a continuous condition\nmonitoring of the individual telescopes. The main goal of the monitoring is to\ndetect degradation and failures before critical damages occur. Two approaches\nare considered: the structure monitoring system, in which the Eigenfrequencies\nof the telescope and their damping rates are measured and monitored; and the\ndrive monitoring, in which the power spectra of rotating components are\nmeasured during telescope movements. The structure monitoring concept system\nwas applied to the prototype Medium Size telescope (MST) prototype of CTA in\nBerlin during late 2018 and in 2019, and the first results are presented here.\nThe system showed reasonable stability during periods, in which the telescope\nstructure was unchanged. The system was also capable to detect mechanical\nchanges, e.g. varying tension in the steel ropes of the camera support\nstructure. The successful implementation of the structure monitoring system\nsupports the decision of implementing the system in all future MSTs.\n", "doi": "10.1117/12.2560930", "arxiv_id": "2012.08995", "pdf_urls": ["https://arxiv.org/pdf/2012.08995"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11445, Ground-based and Airborne Telescopes VIII,\n  114456E (13 December 2020)", "categories": "astro-ph.IM"}
{"title": "FORS-Up: Making the most versatile instrument in Paranal ready for 15\n  more years of operations", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["H. M. J. Boffin", "F. Derie", "A. Manescau", "R. Siebenmorgen", "V. Baldini", "G. Calderone", "R. Cirami", "I. Coretti", "P. Di Marcantonio", "J. Kolsmanski", "P.\n  Lilley", "S. Moehler", "M. Nonino", "G. Rupprecht", "A. Silber"], "abstract": "  The FORS Upgrade project (FORS-Up) aims at bringing a new life to the highly\ndemanded workhorse instrument attached to ESO's Very Large Telescope (VLT).\nFORS2 is a multimode optical instrument, which started regular science\noperations in 2000 and since then, together with its twin, FORS1, has been one\nof the most demanded and most productive instruments of the VLT. In order to\nensure that a FORS shall remain operational for at least another 15 years, an\nupgrade has been planned. This is required as FORS2 is using technology and\nsoftware that is now obsolete and cannot be put and maintained to the standards\nin use at the Observatory. The project - carried out as a collaboration between\nESO and INAF-Astronomical Observatory of Trieste - aims at bringing to the\ntelescope in 2023/2024 a refurbished instrument with a new scientific detector,\nan upgrade of the instrument control software and electronics, a new\ncalibration unit, as well as additional filters and grisms. The new FORS will\nalso serve as a test bench for the Extremely Large Telescope (ELT) standard\ntechnologies (among them the use of programmable logic controllers and of the\nfeatures of the ELT Control Software). The project aims at minimising the\ndowntime of the instrument by performing the upgrade on the currently\ndecommissioned instrument FORS1 and retrofitting the Mask Exchange Unit and\npolarisation optics from FORS2 to FORS1.\n", "doi": "10.1117/12.2562244", "arxiv_id": "2012.09227", "pdf_urls": ["https://arxiv.org/pdf/2012.09227"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 114477A (13 December 2020)", "categories": "astro-ph.IM"}
{"title": "Topics and Treatments in Global Software Engineering Research: A\n  Systematic Snapshot", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bilal Raza", "Stephen G. MacDonell and Tony Clear"], "abstract": "  This study presents an analysis of the most recent literature addressing\nglobal software engineering (GSE). We examine the current state of GSE research\nusing a new Systematic Snapshot Mapping (SSM) technique. We analysed 275 papers\npublished between January 2011 and June 2012 in peer-reviewed conferences,\njournals and workshops. Our results provide a coarse-grained overview of the\nvery recent literature addressing GSE, by classifying studies into predefined\ncategories. We also follow and extend several prior classifications to support\nour synthesis of the data. Our results reveal that currently GSE studies are\nfocused on Management and Infrastructure related factors. Most of the studies\nare conducted at the organizational level using methods such as interviews,\nsurveys, field studies and case studies. We use inter-country network analysis\nto confirm that the USA and India are major players in GSE, with USA-India\ncollaborations being the most frequently studied, followed by USA-China.\nSpecific groups of countries have dominated the reported GSE project locations.\nIn contrast, regions including Central Asia, South Asia (except India), Africa\nand South East Asia have not been covered in these studies. While a\nconsiderable number of GSE-related studies have been published they are\ncurrently quite narrowly focused on exploratory research and explanatory\ntheories. The critical research paradigm has been untouched, perhaps due to a\nlack of criteria and principles for carrying out such research in GSE. An\nabsence of formulative research, experimentation and simulation, and a\ncomparative focus on evaluative approaches, all suggest that existing tools,\nmethods and approaches from related fields are being tested in the GSE context.\nHowever, these solutions may not scale to cover GSE-related issues or may\noverlook factors/facets specific to GSE.\n", "doi": "10.5220/0004444700850096", "arxiv_id": "2012.10839", "pdf_urls": ["https://arxiv.org/pdf/2012.10839"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 8th International Conference on Evaluation of\n  Novel Approaches to Software Engineering (ENASE2013)", "categories": "cs.SE"}
{"title": "The ALF (Algorithms for Lattice Fermions) project release 2.4. Documentation for the auxiliary-field quantum Monte Carlo code", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["ALF Collaboration: F. F. Assaad (1 and 4)", "M. Bercx (1)", "F. Goth (1)", "A. G\\\"otz (1)", "J. S. Hofmann (2)", "E. Huffman (3)", "Z. Liu (1)", "F. Parisen Toldin (1)", "J. S. E. Portela (1)", "J. Schwab (1) ((1) Institut f\\\"ur Theoretische Physik und Astrophysik", "Universit\\\"at W\\\"urzburg", "(2) Department of Condensed Matter Physics", "Weizmann Institute of Science", "(3) Perimeter Institute for Theoretical Physics", "(4) W\\\"urzburg-Dresden Cluster of Excellence ct.qmat)"], "abstract": "The Algorithms for Lattice Fermions package provides a general code for the finite-temperature and projective auxiliary-field quantum Monte Carlo algorithm. The code is engineered to be able to simulate any model that can be written in terms of sums of single-body operators, of squares of single-body operators and single-body operators coupled to a bosonic field with given dynamics. The package includes five pre-defined model classes: SU(N) Kondo, SU(N) Hubbard, SU(N) t-V and SU(N) models with long range Coulomb repulsion on honeycomb, square and N-leg lattices, as well as $Z_2$ unconstrained lattice gauge theories coupled to fermionic and $Z_2$ matter. An implementation of the stochastic Maximum Entropy method is also provided. One can download the code from our Git instance at https://git.physik.uni-wuerzburg.de/ALF/ALF/-/tree/ALF-2.4 and sign in to file issues.", "doi": "10.21468/scipostphyscodeb.1-v2.4", "arxiv_id": "2012.11914", "pdf_urls": ["https://arxiv.org/pdf/2012.11914"], "github": ["https://git.physik.uni-wuerzburg.de/ALF/ALF/-/tree/ALF-2.0"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SciPost Phys. Codebases 1-v2.4 (2025)", "categories": "cond-mat.str-el hep-lat physics.comp-ph quant-ph"}
{"title": "Design and development of the SOXS calibration unit", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hanindyo Kuncarayakti", "Jani Achren", "Sergio Campana", "Riccardo Claudi", "Pietro Schipani", "Matteo Aliverti", "Andrea Baruffolo", "Sagi Ben-Ami", "Federico\n  Biondi", "Giulio Capasso", "Rosario Cosentino", "Francesco D'Alessio", "Paolo\n  D'Avanzo", "Ofir Hershko", "Marco Landoni", "Matteo Munari", "Giuliano Pignata", "Adam\n  Rubin", "Salvatore Scuderi", "Fabrizio Vitali", "David Young", "Jose Antonio\n  Araiza-Duran", "Iair Arcavi", "Anna Brucalassi", "Rachel Bruch", "Enrico Cappellaro", "Mirko Colapietro", "Massimo Della Valle", "Marco De Pascale", "Rosario Di\n  Benedetto"], "abstract": "  SOXS is a new spectrograph for the New Technology Telescope (NTT), optimized\nfor transient and variable objects, covering a wide wavelength range from 350\nto 2000 nm. SOXS is equipped with a calibration unit that will be used to\nremove the instrument signatures and to provide wavelength calibration to the\ndata. The calibration unit will employ seven calibration lamps: a\nquartz-tungsten-halogen and a deuterium lamp for the flat-field correction, a\nThAr lamp and four pencil-style rare-gas lamps for the wavelength calibration.\nThe light from the calibration lamps is injected into the spectrograph\nmimicking the f/11 input beam of the NTT, by using an integrating sphere and a\ncustom doublet. The oversized illumination patch covers the length of the\nspectrograph slit homogeneously, with $< 1\\%$ variation. The optics also\nsupports the second mode of the unit, the star-simulator mode that emulates a\npoint source by utilizing a pinhole mask. Switching between the direct\nillumination and pinhole modes is performed by a linear stage. A safety\ninterlock switches off the main power when the lamp box cover is removed,\npreventing accidental UV exposure to the service personnel. All power supplies\nand control modules are located in an electronic rack at a distance from the\ntelescope platform. In this presentation we describe the optical, mechanical,\nand electrical designs of the SOXS calibration unit, and report the status of\ndevelopment in which the unit is currently in the test and verification stage.\n", "doi": "10.1117/12.2560951", "arxiv_id": "2012.12685", "pdf_urls": ["https://arxiv.org/pdf/2012.12685"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SPIE Proceedings Volume 11447, Ground-based and Airborne\n  Instrumentation for Astronomy VIII; 1144766 (2020)", "categories": "astro-ph.IM"}
{"title": "A Model for Software Contexts", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Diana Kirk and Stephen G. MacDonell"], "abstract": "  It is widely acknowledged by researchers and practitioners that software\ndevelopment methodologies are generally adapted to suit specific project\ncontexts. Research into practices-as-implemented has been fragmented and has\ntended to focus either on the strength of adherence to a specific methodology\nor on how the efficacy of specific practices is affected by contextual factors.\nWe submit the need for a more holistic, integrated approach to investigating\ncontext-related best practice. We propose a six-dimensional model of the\nproblem-space, with dimensions organisational drivers (why), space and time\n(where), culture (who), product life-cycle stage (when), product constraints\n(what) and engagement constraints (how). We test our model by using it to\ndescribe and explain a reported implementation study. Our contributions are a\nnovel approach to understanding situated software practices and a preliminary\nmodel for software contexts.\n", "doi": "10.5220/0004456801970204", "arxiv_id": "2012.14538", "pdf_urls": ["https://arxiv.org/pdf/2012.14538"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 8th International Conference on Evaluation of\n  Novel Approaches to Software Engineering (ENASE2013). Angers, France,\n  SCITEPRESS, pp.197-204", "categories": "cs.SE"}
{"title": "Ensembles of Localised Models for Time Series Forecasting", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rakshitha Godahewa", "Kasun Bandara", "Geoffrey I. Webb", "Slawek Smyl", "Christoph Bergmeir"], "abstract": "  With large quantities of data typically available nowadays, forecasting\nmodels that are trained across sets of time series, known as Global Forecasting\nModels (GFM), are regularly outperforming traditional univariate forecasting\nmodels that work on isolated series. As GFMs usually share the same set of\nparameters across all time series, they often have the problem of not being\nlocalised enough to a particular series, especially in situations where\ndatasets are heterogeneous. We study how ensembling techniques can be used with\ngeneric GFMs and univariate models to solve this issue. Our work systematises\nand compares relevant current approaches, namely clustering series and training\nseparate submodels per cluster, the so-called ensemble of specialists approach,\nand building heterogeneous ensembles of global and local models. We fill some\ngaps in the existing GFM localisation approaches, in particular by\nincorporating varied clustering techniques such as feature-based clustering,\ndistance-based clustering and random clustering, and generalise them to use\ndifferent underlying GFM model types. We then propose a new methodology of\nclustered ensembles where we train multiple GFMs on different clusters of\nseries, obtained by changing the number of clusters and cluster seeds. Using\nFeed-forward Neural Networks, Recurrent Neural Networks, and Pooled Regression\nmodels as the underlying GFMs, in our evaluation on eight publicly available\ndatasets, the proposed models are able to achieve significantly higher accuracy\nthan baseline GFM models and univariate forecasting methods.\n", "doi": "10.1016/j.knosys.2021.107518", "arxiv_id": "2012.15059", "pdf_urls": ["https://arxiv.org/pdf/2012.15059"], "github": ["https://github.com/rakshitha123/Localised_Ensembles"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2021) 107518", "categories": "cs.LG cs.NE stat.ML"}
{"title": "Consolidating a Model for Describing Situated Software Practices", "year": 2020, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Diana Kirk", "Stephen G. MacDonell", "and Ewan Tempero"], "abstract": "  Many prescriptive approaches to developing software intensive systems have\nbeen advocated but each is based on assumptions about context. It has been\nfound that practitioners do not follow prescribed methodologies, but rather\nselect and adapt specific practices according to local needs. As researchers,\nwe would like to be in a position to support such tailoring. However, at the\npresent time we simply do not have sufficient evidence relating practice and\ncontext for this to be possible. We have long understood that a deeper\nunderstanding of situated software practices is crucial for progress in this\narea, and have been exploring this problem from a number of perspectives. In\nthis position paper, we draw together the various aspects of our work into a\nholistic model and discuss the ways in which the model might be applied to\nsupport the long term goal of evidence-based decision support for\npractitioners. The contribution specific to this paper is a discussion on model\nevaluation, including a proof-of-concept demonstration of model utility. We map\nKernel elements from the Essence system to our model and discuss gaps and\nlimitations exposed in the Kernel. Finally, we overview our plans for further\nrefining and evaluating the model.\n", "doi": "10.5220/0007741304020409", "arxiv_id": "2012.15407", "pdf_urls": ["https://arxiv.org/pdf/2012.15407"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 14th International Conference on Evaluation of\n  Novel Approaches to Software Engineering (ENASE2019). Porto, Portugal,\n  SCITEPRESS, pp.402-409", "categories": "cs.SE"}
{"title": "Subcritical polarisations of symplectic manifolds have degree one", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hansj\\\"org Geiges", "Kevin Sporbeck", "Kai Zehmisch"], "abstract": "  We show that if the complement of a Donaldson hypersurface in a closed,\nintegral symplectic manifold has the homology of a subcritical Stein manifold,\nthen the hypersurface is of degree one. In particular, this demonstrates a\nconjecture by Biran and Cieliebak on subcritical polarisations of symplectic\nmanifolds. Our proof is based on a simple homological argument using ideas of\nKulkarni-Wood.\n", "doi": "10.1007/s00013-021-01605-0", "arxiv_id": "2101.02068", "pdf_urls": ["https://arxiv.org/pdf/2101.02068"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 117 (2021), 227-231", "categories": "math.SG"}
{"title": "Features that Predict the Acceptability of Java and JavaScript Answers\n  on Stack Overflow", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Osayande P. Omondiagbe", "Sherlock A. Licorish and Stephen G. MacDonell"], "abstract": "  Context: Stack Overflow is a popular community question and answer portal\nused by practitioners to solve problems during software development. Developers\ncan focus their attention on answers that have been accepted or where members\nhave recorded high votes in judging good answers when searching for help.\nHowever, the latter mechanism (votes) can be unreliable, and there is currently\nno way to differentiate between an answer that is likely to be accepted and\nthose that will not be accepted by looking at the answer's characteristics.\nObjective: In potentially providing a mechanism to identify acceptable answers,\nthis study examines the features that distinguish an accepted answer from an\nunaccepted answer. Methods: We studied the Stack Overflow dataset by analyzing\nquestions and answers for the two most popular tags (Java and JavaScript). Our\ndataset comprised 249,588 posts drawn from 2014-2016. We use random forest and\nneural network models to predict accepted answers, and study the features with\nthe highest predictive power in those two models. Results: Our findings reveal\nthat the length of code in answers, reputation of users, similarity of the text\nbetween questions and answers, and the time lag between questions and answers\nhave the highest predictive power for differentiating accepted and unaccepted\nanswers. Conclusion: Tools may leverage these findings in supporting developers\nand reducing the effort they must dedicate to searching for suitable answers on\nStack Overflow.\n", "doi": "10.1145/3319008.3319024", "arxiv_id": "2101.02830", "pdf_urls": ["https://arxiv.org/pdf/2101.02830"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 23rd International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2019). Copenhagen, Denmark, ACM\n  Press, pp.101-110", "categories": "cs.SE"}
{"title": "A Commonsense Reasoning Framework for Explanatory Emotion Attribution,\n  Generation and Re-classification", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Antonio Lieto", "Gian Luca Pozzato", "Stefano Zoia", "Viviana Patti", "Rossana\n  Damiano"], "abstract": "  We present DEGARI (Dynamic Emotion Generator And ReclassIfier), an\nexplainable system for emotion attribution and recommendation. This system\nrelies on a recently introduced commonsense reasoning framework, the TCL logic,\nwhich is based on a human-like procedure for the automatic generation of novel\nconcepts in a Description Logics knowledge base. Starting from an ontological\nformalization of emotions based on the Plutchik model, known as ArsEmotica, the\nsystem exploits the logic TCL to automatically generate novel commonsense\nsemantic representations of compound emotions (e.g. Love as derived from the\ncombination of Joy and Trust according to Plutchik). The generated emotions\ncorrespond to prototypes, i.e. commonsense representations of given concepts,\nand have been used to reclassify emotion-related contents in a variety of\nartistic domains, ranging from art datasets to the editorial contents available\nin RaiPlay, the online platform of RAI Radiotelevisione Italiana (the Italian\npublic broadcasting company). We show how the reported results (evaluated in\nthe light of the obtained reclassifications, the user ratings assigned to such\nreclassifications, and their explainability) are encouraging, and pave the way\nto many further research directions.\n", "doi": "10.1016/j.knosys.2021.107166", "arxiv_id": "2101.04017", "pdf_urls": ["https://arxiv.org/pdf/2101.04017"], "github": ["https://github.com/alieto/DEGARI"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 2021", "categories": "cs.AI"}
{"title": "Dimensions of Commonsense Knowledge", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Filip Ilievski", "Alessandro Oltramari", "Kaixin Ma", "Bin Zhang", "Deborah L.\n  McGuinness", "Pedro Szekely"], "abstract": "  Commonsense knowledge is essential for many AI applications, including those\nin natural language processing, visual processing, and planning. Consequently,\nmany sources that include commonsense knowledge have been designed and\nconstructed over the past decades. Recently, the focus has been on large\ntext-based sources, which facilitate easier integration with neural (language)\nmodels and application to textual tasks, typically at the expense of the\nsemantics of the sources and their harmonization. Efforts to consolidate\ncommonsense knowledge have yielded partial success, with no clear path towards\na comprehensive solution. We aim to organize these sources around a common set\nof dimensions of commonsense knowledge. We survey a wide range of popular\ncommonsense sources with a special focus on their relations. We consolidate\nthese relations into 13 knowledge dimensions. This consolidation allows us to\nunify the separate sources and to compute indications of their coverage,\noverlap, and gaps with respect to the knowledge dimensions. Moreover, we\nanalyze the impact of each dimension on downstream reasoning tasks that require\ncommonsense knowledge, observing that the temporal and desire/goal dimensions\nare very beneficial for reasoning on current downstream tasks, while\ndistinctness and lexical knowledge have little impact. These results reveal\npreferences for some dimensions in current evaluation, and potential neglect of\nothers.\n", "doi": null, "arxiv_id": "2101.04640", "pdf_urls": ["https://arxiv.org/pdf/2101.04640"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems 2021", "categories": "cs.AI"}
{"title": "Phase-bounded finite element method for two-fluid incompressible flow\n  systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tanyakarn Treeratanaphitak and Nasser Mohieddin Abukhdeir"], "abstract": "  An understanding of the hydrodynamics of multiphase processes is essential\nfor their design and operation. Multiphase computational fluid dynamics (CFD)\nsimulations enable researchers to gain insight which is inaccessible\nexperimentally. The model frequently used to simulate these processes is the\ntwo-fluid (Euler-Euler) model where fluids are treated as inter-penetrating\ncontinua. It is formulated for the multiphase flow regime where one phase is\ndispersed within another and enables simulation on experimentally relevant\nscales. Phase fractions are used to describe the composition of the mixture and\nare bounded quantities. Consequently, numerical solution methods used in\nsimulations must preserve boundedness for accuracy and physical fidelity. In\nthis work, a numerical method for the two-fluid model is developed in which\nphase fraction constraints are imposed through the use of an nonlinear\nvariational inequality solver which implicitly imposes inequality constraints.\nThe numerical method is verified and compared to an established explicit\nnumerical method.\n", "doi": "10.1016/j.ijmultiphaseflow.2019.04.024", "arxiv_id": "2101.05734", "pdf_urls": ["https://arxiv.org/pdf/2101.05734"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 117 (2019) 1-13", "categories": "math.NA cs.NA cs.SE physics.flu-dyn"}
{"title": "Design and implementation of a noise temperature measurement system for\n  the Hydrogen Intensity and Real-time Analysis eXperiment (HIRAX)", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Emily R. Kuhn", "Benjamin R. B. Saliwanchik", "Maile Harris", "Moumita Aich", "Kevin Bandura", "Tzu-Ching Chang", "H. Cynthia Chiang", "Devin Crichton", "Aaron\n  Ewall-Wice", "Austin A. Gumba", "N. Gupta", "Kabelo Calvin Kesebonye", "Jean-Paul\n  Kneib", "Martin Kunz", "Kavilan Moodley", "Laura B. Newburgh", "Viraj Nistane", "Warren\n  Naidoo", "Deniz \\\"Ol\\c{c}ek", "Jeffrey B. Peterson", "Alexandre Refregier", "Jonathan\n  L. Sievers", "Corrie Ungerer", "Alireza Vafaei Sadr", "Jacques van Dyk", "Amanda\n  Weltman", "Dallas Wulf"], "abstract": "  This paper describes the design, implementation, and verification of a\ntest-bed for determining the noise temperature of radio antennas operating\nbetween 400-800MHz. The requirements for this test-bed were driven by the HIRAX\nexperiment, which uses antennas with embedded amplification, making system\nnoise characterization difficult in the laboratory. The test-bed consists of\ntwo large cylindrical cavities, each containing radio-frequency (RF) absorber\nheld at different temperatures (300K and 77K), allowing a measurement of system\nnoise temperature through the well-known 'Y-factor' method. The apparatus has\nbeen constructed at Yale, and over the course of the past year has undergone\ndetailed verification measurements. To date, three preliminary noise\ntemperature measurement sets have been conducted using the system, putting us\non track to make the first noise temperature measurements of the HIRAX feed and\nperform the first analysis of feed repeatability.\n", "doi": "10.1117/12.2560270", "arxiv_id": "2101.06337", "pdf_urls": ["https://arxiv.org/pdf/2101.06337"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11445, Ground-based and Airborne Telescopes VIII,\n  114452Z (20 January 2021)", "categories": "astro-ph.IM astro-ph.CO physics.ins-det"}
{"title": "Curved detector-based optical design for the VLT/BlueMUSE instrument", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alexandre Jeanneau", "Johan Kosmalski", "Eduard Muslimov", "Emmanuel Hugot", "Roland Bacon", "Johan Richard"], "abstract": "  BlueMUSE (Blue Multi Unit Spectroscopic Explorer) is a blue-optimised, medium\nspectral resolution, panoramic integral field spectrograph proposed for the\nVery Large Telescope (VLT) and based on the MUSE concept. BlueMUSE will open up\na new range of galactic and extragalactic science cases allowed by its specific\ncapabilities in the 350 - 580 nm range: an optimised end-to-end transmission\ndown to 350 nm, a larger FoV (up to $1.4 \\times 1.4$ arcmin$^2$) sampled at 0.3\narcsec, and a higher spectral resolution ($\\lambda/\\Delta \\lambda \\sim 3500$)\ncompared to MUSE. To our knowledge, achieving such capabilities with a\ncomparable mechanical footprint and an identical detector format ($4\\text{k}\n\\times 4\\text{k}$, 15 $\\mathrm{\\mu m}$ CCD) would not be possible with a\nconventional spectrograph design. In this paper, we present the optomechanical\narchitecture and design of BlueMUSE at pre-phase A level, with a particular\nattention to some original aspects such as the use of curved detectors.\n", "doi": "10.1117/12.2561684", "arxiv_id": "2101.07605", "pdf_urls": ["https://arxiv.org/pdf/2101.07605"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 114475M (13 December 2020)", "categories": "astro-ph.IM"}
{"title": "Development of the SPECULOOS exoplanet search project", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["D. Sebastian", "P. P. Pedersen", "C. A. Murray", "E. Ducrot", "L. J. Garcia", "A. Burdanov", "F. J. Pozuelos", "L. Delrez", "R. Wells", "G. Dransfield", "M. Gillon", "B.-O. Demory", "D. Queloz", "A. H.M.J. Triaud", "J. de Wit", "E. Jehin", "Y. G\\'omez\n  Maqueo Chew", "M. N. G\\\"unther", "P. Niraula", "B. V. Rackham", "N. Schanche", "S.\n  Sohy", "S. Thompson"], "abstract": "  SPECULOOS (Search for habitable Planets EClipsing ULtra-cOOl Stars) aims to\nperform a transit search on the nearest ($<40$pc) ultracool ($<3000$K) dwarf\nstars. The project's main motivation is to discover potentially habitable\nplanets well-suited for detailed atmospheric characterisation with upcoming\ngiant telescopes, like the James Webb Space Telescope (JWST) and European Large\nTelescope (ELT). The project is based on a network of 1m robotic telescopes,\nnamely the four ones of the SPECULOOS-Southern Observatory (SSO) in Cerro\nParanal, Chile, one telescope of the SPECULOOS-Northern Observatory (SNO) in\nTenerife, and the SAINT-Ex telescope in San Pedro M\\'artir, Mexico. The\nprototype survey of the SPECULOOS project on the 60~cm TRAPPIST telescope\n(Chile) discovered the TRAPPIST-1 system, composed of seven temperate\nEarth-sized planets orbiting a nearby (12~pc) Jupiter-sized star. In this\npaper, we review the current status of SPECULOOS, its first results, the plans\nfor its development, and its connection to the Transiting Exoplanet Survey\nSatellite (TESS) and JWST.\n", "doi": "10.1117/12.2563563", "arxiv_id": "2101.10970", "pdf_urls": ["https://arxiv.org/pdf/2101.10970"], "github": ["https://github.com/educrot/SPOCK"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11445, Ground-based and Airborne Telescopes VIII,\n  1144521 (13 December 2020)", "categories": "astro-ph.EP astro-ph.IM"}
{"title": "A Spatial-Temporal Graph Neural Network Framework for Automated Software\n  Bug Triaging", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hongrun Wu", "Yutao Ma", "Zhenglong Xiang", "Chen Yang", "Keqing He"], "abstract": "  The bug triaging process, an essential process of assigning bug reports to\nthe most appropriate developers, is related closely to the quality and costs of\nsoftware development. As manual bug assignment is a labor-intensive task,\nespecially for large-scale software projects, many machine-learning-based\napproaches have been proposed to automatically triage bug reports. Although\ndeveloper collaboration networks (DCNs) are dynamic and evolving in the\nreal-world, most automated bug triaging approaches focus on static tossing\ngraphs at a single time slice. Also, none of the previous studies consider\nperiodic interactions among developers. To address the problems mentioned\nabove, in this article, we propose a novel spatial-temporal dynamic graph\nneural network (ST-DGNN) framework, including a joint random walk (JRWalk)\nmechanism and a graph recurrent convolutional neural network (GRCNN) model. In\nparticular, JRWalk aims to sample local topological structures in a graph with\ntwo sampling strategies by considering both node importance and edge\nimportance. GRCNN has three components with the same structure, i.e.,\nhourly-periodic, daily-periodic, and weekly-periodic components, to learn the\nspatial-temporal features of dynamic DCNs. We evaluated our approach's\neffectiveness by comparing it with several state-of-the-art graph\nrepresentation learning methods in two domain-specific tasks that belong to\nnode classification. In the two tasks, experiments on two real-world,\nlarge-scale developer collaboration networks collected from the Eclipse and\nMozilla projects indicate that the proposed approach outperforms all the\nbaseline methods.\n", "doi": "10.1016/j.knosys.2022.108308", "arxiv_id": "2101.11846", "pdf_urls": ["https://arxiv.org/pdf/2101.11846"], "github": ["https://github.com/ssea-lab/BugTriage/tree/master/GRCNN"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 2022, 241: 108308", "categories": "cs.SE cs.SI"}
{"title": "Simons Observatory Small Aperture Telescope overview", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kenji Kiuchi", "Shunsuke Adachi", "Aamir M. Ali", "Kam Arnold", "Peter Ashton", "Jason E. Austermann", "Andrew Bazako", "James A. Beall", "Yuji Chinone", "Gabriele\n  Coppi", "Kevin D. Crowley", "Kevin T. Crowley", "Simon Dicker", "Bradley Dober", "Shannon M. Duff", "Giulio Fabbian", "Nicholas Galitzki", "Joseph E. Golec", "Jon E.\n  Gudmundsson", "Kathleen Harrington", "Masaya Hasegawa", "Makoto Hattori", "Charles A.\n  Hill", "Shuay-Pwu Patty Ho", "Johannes Hubmayr", "Bradley R. Johnson", "Daisuke\n  Kaneko", "Nobuhiko Katayama", "Brian Keating", "Akito Kusaka"], "abstract": "  The Simons Observatory (SO) is a cosmic microwave background (CMB) experiment\nfrom the Atacama Desert in Chile comprising three small-aperture telescopes\n(SATs) and one large-aperture telescope (LAT). In total, SO will field over\n60,000 transition-edge sensor (TES) bolometers in six spectral bands centered\nbetween 27 and 280 GHz in order to achieve the sensitivity necessary to measure\nor constrain numerous cosmological quantities. In this work, we focus on the\nSATs which are optimized to search for primordial gravitational waves that are\ndetected as parity-odd polarization patterns called a B-modes on degree scales\nin the CMB. Each SAT employs a single optics tube with TES arrays operating at\n100 mK. The high throughput optics system has a 42 cm aperture and a 35-degree\nfield of view coupled to a 36 cm diameter focal plane. The optics consist of\nthree metamaterial anti-re ection coated silicon lenses. Cryogenic ring baffles\nwith engineered blackbody absorbers are installed in the optics tube to\nminimize the stray light. The entire optics tube is cooled to 1 K. A cryogenic\ncontinuously rotating half-wave plate near the sky side of the aperture stop\nhelps to minimize the effect of atmospheric uctuations. The telescope warm\nbaffling consists of a forebaffle, an elevation stage mounted co-moving shield,\nand a fixed ground shield that together control the far side-lobes and\nmitigates ground-synchronous systematics. We present the status of the SAT\ndevelopment.\n", "doi": "10.1117/12.2562016", "arxiv_id": "2101.11917", "pdf_urls": ["https://arxiv.org/pdf/2101.11917"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11445, Ground-based and Airborne Telescopes VIII,\n  114457L (18 December 2020)", "categories": "astro-ph.IM"}
{"title": "Testing the 10 spectrograph units for DESI: approach and results", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["S. Perruchot", "P.-E. Blanc", "J. Guy", "L. Le Guillou", "S. Ronayette", "X.\n  R\\'egal", "G. Castagnoli", "A. Le Van Suu", "E. Sepulveda", "E. Jullo", "J.-G. Cuby", "S.\n  Karkar", "P. Ghislain", "P. Repain", "P.-H.Carton", "C. Magneville", "A. Ealet", "S.\n  Escoffier", "A. Secroun", "K. Honscheid", "A. Elliot", "P. Jelinsky", "D. Brooks", "P.\n  Doel", "Y. Duan", "J. Edelstein", "J. C. Estrada", "E. Gasta\\~naga", "A. Karcher", "M.\n  Landriau"], "abstract": "  The recently commissioned Dark Energy Spectroscopic Instrument (DESI) will\nmeasure the expansion history of the Universe using the Baryon Acoustic\nOscillation technique. The spectra of 35 million galaxies and quasars over\n14000 sqdeg will be measured during the life of the experiment. A new prime\nfocus corrector for the KPNO Mayall telescope delivers light to 5000 fiber\noptic positioners. The fibers in turn feed ten broad-band spectrographs. A\nconsortium of Aix-Marseille University (AMU) and CNRS laboratories (LAM, OHP\nand CPPM) together with LPNHE (CNRS, IN2P3, Sorbonne Universit\\'e and\nUniversit\\'e de Paris) and the WINLIGHT Systems company based in Pertuis\n(France), were in charge of integrating and validating the performance\nrequirements of the ten full spectrographs, equipped with their cryostats,\nshutters and other mechanisms. We present a summary of our activity which\nallowed an efficient validation of the systems in a short-time schedule. We\ndetail the main results. We emphasize the benefits of our approach and also its\nlimitations.\n", "doi": "10.1117/12.2561275", "arxiv_id": "2101.12181", "pdf_urls": ["https://arxiv.org/pdf/2101.12181"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 1144786 (13 December 2020)", "categories": "astro-ph.IM"}
{"title": "Canvas Adoption Assessment and Acceptance of the Learning Management\n  System on a Web-Based Platform", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julius G. Garcia", "Mark Gil T. Gangan", "Marita N. Tolentino", "Marc Ligas", "Shirley D. Moraga and Amelia A. Pasilan"], "abstract": "  The acquisition of non-proprietary and proprietary learning management system\nhas provided a richer learning experience to users and raised interest among\neducation providers. This study aims to assess student adoption of Canvas as a\nnew learning management system and its potential as a web-based platform in the\ne-learning programme of the University of the East. This study also assessed\nstudent readiness in using Canvas. A survey was administered to 214 students of\nthe University of the East through snowball sampling. An Exploratory Factor\nAnalysis was conducted to examine the validity of the model. A Confirmatory\nFactory Analysis was used to validate the Exploratory Factor Analysis results\nand analyse the correlation of the constructs. A Structural Equation Modelling\nwas conducted to analyse the relationships between the constructs, which were\nevaluated using fit indices. Adopted from the Technology Acceptance Model, the\nconstructs perceived ease of use, perceived usefulness, and attitude were\nstudied. The study reveals that students perceived usefulness and attitude\ntowards using Canvas in a web-based platform have direct and significant\neffects on their intention to use Canvas. The students perceived ease of use\nhas a significant effect on their perceived usefulness but has no significant\neffects on their attitude towards the use of Canvas. The students technological\nmaturity and prior experience in using a learning management system influenced\ntheir beliefs on the adaptation of similar technology. Exploring the potential\nbenefits of Canvas and factors affecting the students adoption amplifies access\nto quality education to fulfil educational directives. Furthermore, educational\ninstitutions should explore technological migration related to teaching and\nlearning processes.\n", "doi": null, "arxiv_id": "2101.12344", "pdf_urls": ["https://arxiv.org/pdf/2101.12344"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ASEAN Journal of Open Distance Learning 2020, Vol. 12, No. 1", "categories": "cs.CY"}
{"title": "TAUKAM: a new prime-focus camera for the Tautenburg Schmidt Telescope", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bringfried Stecklum (1)", "Jochen Eisl\\\"offel (1)", "Sylvio Klose (1)", "Uwe\n  Laux (1)", "Tom L\\\"owinger (1)", "Helmut Meusinger (1)", "Michael Pluto (1)", "Johannes Winkler (1)", "Frank Dionies (2) ((1) Th\\\"uringer Landessternwarte\n  Tautenburg", "(2) Astrophysikalisches Institut Potsdam)"], "abstract": "  TAUKAM stands for \"TAUtenburg KAMera\", which will become the new prime-focus\nimager for the Tautenburg Schmidt telescope. It employs an e2v 6kx6k CCD and is\nunder manufacture by Spectral Instruments Inc. We describe the design of the\ninstrument and the auxiliary components, its specifications as well as the\nconcept for integrating the device into the telescope infrastructure. First\nlight is foreseen in 2017. TAUKAM will boost the observational capabilities of\nthe telescope for what concerns optical wide-field surveys.\n", "doi": "10.1117/12.2232872", "arxiv_id": "2101.12554", "pdf_urls": ["https://arxiv.org/pdf/2101.12554"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 9908, Ground-based and Airborne Instrumentation for\n  Astronomy VI, 99084U (9 August 2016)", "categories": "astro-ph.IM"}
{"title": "The wide-field infrared transient explorer (WINTER)", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nathan P. Lourie", "John W. Baker", "Richard S. Burruss", "Mark Egan", "G\\'abor F\\H{u}r\\'esz", "Danielle Frostig", "Allan A. Garcia-Zych", "Nicolae Ganciu", "Kari Haworth", "Erik Hinrichsen", "Mansi M. Kasliwal", "Viraj R. Karambelkar", "Andrew Malonis", "Robert A. Simcoe", "Jeffry Zolkower"], "abstract": "  The Wide-Field Infrared Transient Explorer (WINTER) is a new infrared\ntime-domain survey instrument which will be deployed on a dedicated 1 meter\nrobotic telescope at Palomar Observatory. WINTER will perform a seeing-limited\ntime domain survey of the infrared (IR) sky, with a particular emphasis on\nidentifying r-process material in binary neutron star (BNS) merger remnants\ndetected by LIGO. We describe the scientific goals and survey design of the\nWINTER instrument. With a dedicated trigger and the ability to map the full\nLIGO O4 positional error contour in the IR to a distance of 190 Mpc within four\nhours, WINTER will be a powerful kilonova discovery engine and tool for\nmulti-messenger astrophysics investigations. In addition to follow-up\nobservations of merging binaries, WINTER will facilitate a wide range of\ntime-domain astronomical observations, all the while building up a deep coadded\nimage of the static infrared sky suitable for survey science.\n  WINTER's custom camera features six commercial large-format Indium Gallium\nArsenide (InGaAs) sensors and a tiled optical system which covers a\n$>$1-square-degree field of view with 90% fill factor. The instrument observes\nin Y, J and a short-H (Hs) band tuned to the long-wave cutoff of the InGaAs\nsensors, covering a wavelength range from 0.9 - 1.7 microns. We present the\ndesign of the WINTER instrument and current progress towards final integration\nat Palomar Observatory and commissioning planned for mid-2021.\n", "doi": "10.1117/12.2561210", "arxiv_id": "2102.01109", "pdf_urls": ["https://arxiv.org/pdf/2102.01109"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 2020", "categories": "astro-ph.IM"}
{"title": "Furtherance of Numerical radius inequalities of Hilbert space operators", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pintu Bhunia and Kallol Paul"], "abstract": "  If $A,B$ are bounded linear operators on a complex Hilbert space, then %\n$w(A) \\leq \\frac{1}{2}\\left( \\|A\\|+\\sqrt{r\\left(|A||A^*|\\right)}\\right)$ and\n$w(AB \\pm BA)\\leq 2\\sqrt{2}\\|B\\|\\sqrt{ w^2(A)-\\frac{c^2(\\Re (A))+c^2(\\Im\n(A))}{2} },$ \\begin{eqnarray*} w(A) &\\leq& \\frac{1}{2}\\left(\n\\|A\\|+\\sqrt{r\\left(|A||A^*|\\right)}\\right),\\\\ w(AB \\pm BA)&\\leq&\n2\\sqrt{2}\\|B\\|\\sqrt{ w^2(A)-\\frac{c^2(\\Re (A))+c^2(\\Im (A))}{2} },\n\\end{eqnarray*} where $w(.),\\|.\\|,c(.)$ and $r(.)$ are the numerical radius,\nthe operator norm, the Crawford number and the spectral radius respectively,\nand $\\Re (A)$, $\\Im (A)$ are the real part, the imaginary part of $A$\nrespectively. The inequalities obtained here generalize and improve on the\nexisting well known inequalities.\n", "doi": "10.1007/s00013-021-01641-w", "arxiv_id": "2102.01953", "pdf_urls": ["https://arxiv.org/pdf/2102.01953"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 117 (2021), no.5, 537-546", "categories": "math.FA"}
{"title": "Challenges in Digital Twin Development for Cyber-Physical Production\n  Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Heejong Park", "Arvind Easwaran", "Sidharta Andalam"], "abstract": "  The recent advancement of information and communication technology makes\ndigitalisation of an entire manufacturing shop-floor possible where physical\nprocesses are tightly intertwined with their cyber counterparts. This led to an\nemergence of a concept of digital twin, which is a realistic virtual copy of a\nphysical object. Digital twin will be the key technology in Cyber-Physical\nProduction Systems (CPPS) and its market is expected to grow significantly in\nthe coming years. Nevertheless, digital twin is still relatively a new concept\nthat people have different perspectives on its requirements, capabilities, and\nlimitations. To better understand an effect of digital twin's operations,\nmitigate complexity of capturing dynamics of physical phenomena, and improve\nanalysis and predictability, it is important to have a development tool with a\nstrong semantic foundation that can accurately model, simulate, and synthesise\nthe digital twin. This paper reviews current state-of-art on tools and\ndevelopments of digital twin in manufacturing and discusses potential design\nchallenges.\n", "doi": "10.1007/978-3-030-23703-5_2", "arxiv_id": "2102.03341", "pdf_urls": ["https://arxiv.org/pdf/2102.03341"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Cyber Physical Systems. Model-Based Design (2018)", "categories": "cs.SE"}
{"title": "A Visual Analysis Approach to Update Systematic Reviews", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Katia Romero Felizardo", "Elisa Yumi Nakagawa", "Stephen G. MacDonell", "and\n  Jos\\'e Carlos Maldonado"], "abstract": "  Context: In order to preserve the value of Systematic Reviews (SRs), they\nshould be frequently updated considering new evidence that has been produced\nsince the completion of the previous version of the reviews. However, the\nupdate of an SR is a time consuming, manual task. Thus, many SRs have not been\nupdated as they should be and, therefore, they are currently outdated.\nObjective: The main contribution of this paper is to support the update of SRs.\nMethod: We propose USR-VTM, an approach based on Visual Text Mining (VTM)\ntechniques, to support selection of new evidence in the form of primary\nstudies. We then present a tool, named Revis, which supports our approach.\nFinally, we evaluate our approach through a comparison of outcomes achieved\nusing USR-VTM versus the traditional (manual) approach. Results: Our results\nshow that USR-VTM increases the number of studies correctly included compared\nto the traditional approach. Conclusions: USR-VTM effectively supports the\nupdate of SRs.\n", "doi": "10.1145/2601248.2601252", "arxiv_id": "2102.06345", "pdf_urls": ["https://arxiv.org/pdf/2102.06345"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 18th International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2014). London, UK, ACM Press, pp.1-10", "categories": "cs.SE"}
{"title": "Low precision logarithmic number systems: Beyond base-2", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Syed Asad Alam", "James Garland and David Gregg"], "abstract": "  Logarithmic number systems (LNS) are used to represent real numbers in many\napplications using a constant base raised to a fixed-point exponent making its\ndistribution exponential. This greatly simplifies hardware multiply, divide and\nsquare root. LNS with base-2 is most common, but in this paper we show that for\nlow-precision LNS the choice of base has a significant impact.\n  We make four main contributions. First, LNS is not closed under addition and\nsubtraction, so the result is approximate. We show that choosing a suitable\nbase can manipulate the distribution to reduce the average error. Second, we\nshow that low-precision LNS addition and subtraction can be implemented\nefficiently in logic rather than commonly used ROM lookup tables, the\ncomplexity of which can be reduced by an appropriate choice of base. A similar\neffect is shown where the result of arithmetic has greater precision than the\ninput. Third, where input data from external sources is not expected to be in\nLNS, we can reduce the conversion error by selecting a LNS base to match the\nexpected distribution of the input. Thus, there is no one base which gives the\nglobal optimum, and base selection is a trade-off between different factors.\nFourth, we show that circuits realized in LNS require lower area and power\nconsumption for short word lengths.\n", "doi": "10.1145/3461699", "arxiv_id": "2102.06681", "pdf_urls": ["https://arxiv.org/pdf/2102.06681"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Syed Asad Alam, James Garland, and David Gregg. 2021.\n  Low-precision Logarithmic Number Systems: Beyond Base-2. ACM Trans. Archit.\n  Code Optim. 18, 4, Article 47 (December 2021), 25 pages", "categories": "math.NA cs.NA eess.SP"}
{"title": "Investigating a Conceptual Construct for Software Context", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Diana Kirk and Stephen G. MacDonell"], "abstract": "  A growing number of empirical software engineering researchers suggest that a\ncomplementary focus on theory is required if the discipline is to mature. A\nfirst step in theory-building involves the establishment of suitable\ntheoretical constructs. For researchers studying software projects, the lack of\na theoretical construct for context is problematic for both experimentation and\neffort estimation. For experiments, insufficiently understood contextual\nfactors confound results, and for estimation, unstated contextual factors\naffect estimation reliability. We have earlier proposed a framework that we\nsuggest may be suitable as a construct for context i.e. represents a minimal,\nspanning set for the space of software contexts. The framework has six\ndimensions, described as Who, Where, What, When, How and Why. In this paper, we\nreport the outcomes of a pilot study to test its suitability by categorising\ncontextual factors from the software engineering literature into the framework.\nWe found that one of the dimensions, Why, does not represent context, but\nrather is associated with objectives. We also identified some factors that do\nnot clearly fit into the framework and require further investigation. Our\ncontributions are the pursuing of a theoretical approach to understanding\nsoftware context, the initial establishment and evaluation of a construct for\ncontext and the exposure of a lack of clarity of meaning in many 'contexts'\ncurrently applied as factors for estimating project outcomes.\n", "doi": "10.1145/2601248.2601263", "arxiv_id": "2102.09088", "pdf_urls": ["https://arxiv.org/pdf/2102.09088"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 18th International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2014). London, UK, ACM Press, pp.1-10", "categories": "cs.SE"}
{"title": "Formalization of Bohr's contextuality within theory of open quantum\n  systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andrei Khrennikov"], "abstract": "  In quantum physics, the notion of contextuality has a variety of\ninterpretations which are typically associated with the names of their\ninventors, say Bohr, Bell, Kochen and Specker, and recently Dzhafarov. In fact,\nBohr was the first who pointed to contextuality of quantum measurements as a\npart of formulation of his principle of complementarity. (Instead of\n\"contextuality\", he considered dependence on \"experimental conditions.\")\nUnfortunately, the contextuality counterpart of the complementarity principle\nwas overshadowed by the issue of incompatibility of observables. And the\ninterest for contextuality of quantum measurements rose again only in\nconnection with the Bell inequality. The original Bohr's contextuality, as\ncontextuality of each quantum measurement, was practically forgotten. It was\nhighlighted in the works of the author of this paper, with applications both to\nphysics and cognition. In this note, the theory of open quantum systems is\napplied to formalization of Bohr's contextuality within the the scheme of\nindirect measurements. This scheme is widely used in quantum information theory\nand it leads to the theory of quantum instruments (Davis-Lewis-Ozawa). In this\nscheme, Bohr's viewpoint on contextuality of quantum measurements is\nrepresented in the formal mathematical framework.\n", "doi": "10.1007/s10946-021-09972-3", "arxiv_id": "2102.09184", "pdf_urls": ["https://arxiv.org/pdf/2102.09184"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J Russian Laser Research 42, 371-377 (2021)", "categories": "quant-ph"}
{"title": "WALOP-South: A wide-field one-shot linear optical polarimeter for\n  PASIPHAE survey", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Siddharth Maharana", "John A. Kypriotakis", "A. N. Ramaprakash", "Pravin\n  Khodade", "Chaitanya Rajarshi", "Bhushan S. Joshi", "Pravin Chordia", "Ramya M.\n  Anche", "Shrish Mishra", "Dmitry Blinov", "Hans Kristian Eriksen", "Tuhin Ghosh", "Eirik Gjerl{\\o}w", "Nikolaos Mandarakas", "Georgia V. Panopoulou", "Vasiliki\n  Pavlidou", "Timothy J. Pearson", "Vincent Pelgrims", "Stephen B. Potter", "Anthony C.\n  S. Readhead", "Raphail Skalidis", "Konstantinos Tassis", "Ingunn K. Wehus"], "abstract": "  WALOP (Wide-Area Linear Optical Polarimeter)-South, to be mounted on the 1m\nSAAO telescope in South Africa, is first of the two WALOP instruments currently\nunder development for carrying out the PASIPHAE survey. Scheduled for\ncommissioning in the year 2021, the WALOP instruments will be used to measure\nthe linear polarization of around $10^{6}$ stars in the SDSS-r broadband with\n$0.1~\\%$ polarimetric accuracy, covering 4000 square degrees in the Galactic\npolar regions. The combined capabilities of one-shot linear polarimetry, high\npolarimetric accuracy ($< 0.1~\\%$) and polarimetric sensitivity ($< 0.05~\\%$),\nand a large field of view (FOV) of $35\\times35~arcminutes$ make WALOP-South a\nunique astronomical instrument. In a single exposure, it is designed to measure\nthe Stokes parameters $I$, $q$ and $u$ in the SDSS-r broadband and narrowband\nfilters between $500-700~nm$. During each measurement, four images of the full\nfield corresponding to the polarization angles of $0^{\\circ}$, $45^{\\circ}$,\n$90^{\\circ}$ and $135^{\\circ}$ will be imaged on four detectors and carrying\nout differential photometry on these images will yield the Stokes parameters.\nMajor challenges in designing WALOP-South instrument include- (a) in the\noptical design, correcting for the spectral dispersion introduced by large\nsplit angle Wollaston Prisms used as polarization analyzers as well as\naberrations from the wide field, and (b) making an optomechanical design\nadherent to the tolerances required to obtain good imaging and polarimetric\nperformance under all temperature conditions as well as telescope pointing\npositions. We present the optical and optomechanical design for WALOP-South\nwhich overcomes these challenges.\n", "doi": "10.1117/12.2554396", "arxiv_id": "2102.09519", "pdf_urls": ["https://arxiv.org/pdf/2102.09519"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings Volume 11447, Ground-based and Airborne\n  Instrumentation for Astronomy VIII; 114475E (2020)", "categories": "astro-ph.IM"}
{"title": "Personality Profiles of Global Software Developers", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sherlock A. Licorish and Stephen G. MacDonell"], "abstract": "  Context: Individuals' personality traits have been shown to influence their\nbehavior during team work. In particular, positive group attitudes are said to\nbe essential for distributed and global software development efforts where\ncollaboration is critical to project success. Objective: Given this, we have\nsought to study the influence of global software practitioners' personality\nprofiles from a psycholinguistic perspective. Method: Artifacts from ten teams\nwere selected from the IBM Rational Jazz repository and mined. We employed\nsocial network analysis (SNA) techniques to identify and group practitioners\ninto two clusters based on the numbers of messages they communicated, Top\nMembers and Others, and used standard statistical techniques to assess\npractitioners' engagement in task changes associated with work items. We then\nperformed psycholinguistic analysis on practitioners' messages using linguistic\ndimensions of the LIWC tool that had been previously correlated with the Big\nFive personality profiles. Results: For our sample of 146 practitioners, we\nfound that the Top Members demonstrated more openness to experience than the\nOther practitioners. Additionally, practitioners involved in usability-related\ntasks were found to be highly extroverted, and coders were most neurotic and\nconscientious. Conclusion: High levels of organizational and inter-personal\nskills may be useful for those operating in distributed settings, and\npersonality diversity is likely to boost team performance.\n", "doi": "10.1145/2601248.2601265", "arxiv_id": "2102.09732", "pdf_urls": ["https://arxiv.org/pdf/2102.09732"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 18th International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2014). London, UK, ACM Press, pp.1-10", "categories": "cs.SE"}
{"title": "Inverse Design of Quantum Holograms in Three-Dimensional Nonlinear\n  Photonic Crystals", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eyal Rozenberg", "Aviv Karnieli", "Ofir Yesharim", "Sivan Trajtenberg-Mills", "Daniel Freedman", "Alex M. Bronstein and Ady Arie"], "abstract": "  We introduce a systematic approach for designing 3D nonlinear photonic\ncrystals and pump beams for generating desired quantum correlations between\nstructured photon-pairs. Our model is fully differentiable, allowing accurate\nand efficient learning and discovery of novel designs.\n", "doi": "10.1364/cleo_qels.2021.fm1n.7", "arxiv_id": "2102.10344", "pdf_urls": ["https://arxiv.org/pdf/2102.10344"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Conference on Lasers and Electro-Optics, Optical Society of\n  America (2021), paper FM1N.7", "categories": "quant-ph cs.LG"}
{"title": "A High-dimensional Sparse Fourier Transform in the Continuous Setting", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Liang Chen"], "abstract": "  In this paper, we theoretically propose a new hashing scheme to establish the\nsparse Fourier transform in high-dimensional space. The estimation of the\nalgorithm complexity shows that this sparse Fourier transform can overcome the\ncurse of dimensionality. To the best of our knowledge, this is the first\npolynomial-time algorithm to recover the high-dimensional continuous\nfrequencies.\n", "doi": "10.1088/1361-6420/ac3c16", "arxiv_id": "2102.10939", "pdf_urls": ["https://arxiv.org/pdf/2102.10939"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "There are some minor errors in the previous version, please refer\n  to <Inverse problems, 2022 (38)>for the correct version", "categories": "cs.DS cs.IT cs.NA math.IT math.NA"}
{"title": "Analyzing Confidentiality and Privacy Concerns: Insights from Android\n  Issue Logs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sherlock A. Licorish", "Stephen G. MacDonell and Tony Clear"], "abstract": "  Context: Post-release user feedback plays an integral role in improving\nsoftware quality and informing new features. Given its growing importance,\nfeedback concerning security enhancements is particularly noteworthy. In\nconsidering the rapid uptake of Android we have examined the scale and severity\nof Android security threats as reported by its stakeholders. Objective: We\nsystematically mine Android issue logs to derive insights into stakeholder\nperceptions and experiences in relation to certain Android security issues.\nMethod: We employed contextual analysis techniques to study issues raised\nregarding confidentiality and privacy in the last three major Android releases,\nconsidering covariance of stakeholder comments, and the level of consistency in\nuser preferences and priorities. Results: Confidentiality and privacy concerns\nvaried in severity, and were most prevalent over Jelly Bean releases. Issues\nraised in regard to confidentiality related mostly to access, user credentials\nand permission management, while privacy concerns were mainly expressed about\nphone locking. Community users also expressed divergent preferences for new\nsecurity features, ranging from more relaxed to very strict. Conclusion:\nStrategies that support continuous corrective measures for both old and new\nAndroid releases would likely maintain stakeholder confidence. An approach that\nprovides users with basic default security settings, but with the power to\nconfigure additional security features if desired, would provide the best\nbalance for Android's wide cohort of stakeholders.\n", "doi": "10.1145/2745802.2745819", "arxiv_id": "2102.12566", "pdf_urls": ["https://arxiv.org/pdf/2102.12566"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 19th International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2015). Nanjing, China, ACM Press,\n  pp.1-10", "categories": "cs.CR cs.SE"}
{"title": "EDS-MEMBED: Multi-sense embeddings based on enhanced distributional\n  semantic structures via a graph walk over word senses", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Eniafe Festus Ayetiran (1)", "Petr Sojka (1)", "V\\'it Novotn\\'y (1) ((1)\n  Faculty of Informatics Masaryk University)"], "abstract": "  Several language applications often require word semantics as a core part of\ntheir processing pipeline, either as precise meaning inference or semantic\nsimilarity. Multi-sense embeddings (M-SE) can be exploited for this important\nrequirement. M-SE seeks to represent each word by their distinct senses in\norder to resolve the conflation of meanings of words as used in different\ncontexts. Previous works usually approach this task by training a model on a\nlarge corpus and often ignore the effect and usefulness of the semantic\nrelations offered by lexical resources. However, even with large training data,\ncoverage of all possible word senses is still an issue. In addition, a\nconsiderable percentage of contextual semantic knowledge are never learned\nbecause a huge amount of possible distributional semantic structures are never\nexplored. In this paper, we leverage the rich semantic structures in WordNet\nusing a graph-theoretic walk technique over word senses to enhance the quality\nof multi-sense embeddings. This algorithm composes enriched texts from the\noriginal texts. Furthermore, we derive new distributional semantic similarity\nmeasures for M-SE from prior ones. We adapt these measures to word sense\ndisambiguation (WSD) aspect of our experiment. We report evaluation results on\n11 benchmark datasets involving WSD and Word Similarity tasks and show that our\nmethod for enhancing distributional semantic structures improves embeddings\nquality on the baselines. Despite the small training data, it achieves\nstate-of-the-art performance on some of the datasets.\n", "doi": "10.1016/j.knosys.2021.106902", "arxiv_id": "2103.00232", "pdf_urls": ["https://arxiv.org/pdf/2103.00232"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems. 219 (2021) 106902", "categories": "cs.CL cs.LG"}
{"title": "Architectural Challenges in Migrating Plan-driven Projects to Agile", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vinod Menon", "Roopak Sinha", "and Stephen MacDonell"], "abstract": "  Software development has steadily embraced agile software development\nmethodology/method (ASDM) and has been moving away from the plan driven\nsoftware development methodology (PDM) approaches like waterfall. Given the\niterative nature of agile development, the integration of software architecture\ninto the agile way has become challenging. This research identifies the\nchallenges of having a robust architecture in projects already executed by plan\ndriven methods and new projects likewise by conducting a literature review and\na case study analysis. The ensuing analysis finds that there are three major\nareas: people, process and technology, in which these challenges could be\nmapped.\n", "doi": "10.5220/0005383502230228", "arxiv_id": "2103.00371", "pdf_urls": ["https://arxiv.org/pdf/2103.00371"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 10th International Conference on Evaluation of\n  Novel Approaches to Software Engineering (ENASE2015). Barcelona, Spain,\n  SCITEPRESS, pp.223-228", "categories": "cs.SE"}
{"title": "Video Sentiment Analysis with Bimodal Information-augmented Multi-Head\n  Attention", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ting Wu", "Junjie Peng", "Wenqiang Zhang", "Huiran Zhang", "Chuanshuai Ma", "Yansong Huang"], "abstract": "  Humans express feelings or emotions via different channels. Take language as\nan example, it entails different sentiments under different visual-acoustic\ncontexts. To precisely understand human intentions as well as reduce the\nmisunderstandings caused by ambiguity and sarcasm, we should consider\nmultimodal signals including textual, visual and acoustic signals. The crucial\nchallenge is to fuse different modalities of features for sentiment analysis.\nTo effectively fuse the information carried by different modalities and better\npredict the sentiments, we design a novel multi-head attention based fusion\nnetwork, which is inspired by the observations that the interactions between\nany two pair-wise modalities are different and they do not equally contribute\nto the final sentiment prediction. By assigning the acoustic-visual,\nacoustic-textual and visual-textual features with reasonable attention and\nexploiting a residual structure, we attend to attain the significant features.\nWe conduct extensive experiments on four public multimodal datasets including\none in Chinese and three in English. The results show that our approach\noutperforms the existing methods and can explain the contributions of bimodal\ninteraction in multiple modalities.\n", "doi": "10.1016/j.knosys.2021.107676", "arxiv_id": "2103.02362", "pdf_urls": ["https://arxiv.org/pdf/2103.02362"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge Based Systems 235 (2022) 107676", "categories": "cs.AI"}
{"title": "Natural Language Understanding for Argumentative Dialogue Systems in the\n  Opinion Building Domain", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Waheed Ahmed Abro", "Annalena Aicher", "Niklas Rach", "Stefan Ultes", "Wolfgang Minker", "Guilin Qi"], "abstract": "  This paper introduces a natural language understanding (NLU) framework for\nargumentative dialogue systems in the information-seeking and opinion building\ndomain. The proposed framework consists of two sub-models, namely intent\nclassifier and argument similarity. Intent classifier model stacks BiLSTM with\nattention mechanism on top of the pre-trained BERT model and fine-tune the\nmodel for recognizing the user intent, whereas the argument similarity model\nemploys BERT+BiLSTM for identifying system arguments the user refers to in his\nor her natural language utterances. Our model is evaluated in an argumentative\ndialogue system that engages the user to inform him-/herself about a\ncontroversial topic by exploring pro and con arguments and build his/her\nopinion towards the topic. In order to evaluate the proposed approach, we\ncollect user utterances for the interaction with the respective system labeling\nintent and referenced argument in an extensive online study. The data\ncollection includes multiple topics and two different user types (native\nEnglish speakers from the UK and non-native English speakers from China).\nAdditionally, we evaluate the proposed intent classifier and argument\nsimilarity models separately on the publicly available Banking77 and STS\nbenchmark datasets. The evaluation indicates a clear advantage of the utilized\ntechniques over baseline approaches on several datasets, as well as the\nrobustness of the proposed approach against new topics and different language\nproficiency as well as the cultural background of the user. Furthermore,\nresults show that our intent classifier model outperforms DIET, DistillBERT,\nand BERT fine-tuned models in few-shot setups (i.e., with 10, 20, or 30 labeled\nexamples per intent) and full data setup.\n", "doi": "10.1016/j.knosys.2022.108318", "arxiv_id": "2103.02691", "pdf_urls": ["https://arxiv.org/pdf/2103.02691"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2022): 108318", "categories": "cs.CL cs.LG"}
{"title": "NF-GNN: Network Flow Graph Neural Networks for Malware Detection and\n  Classification", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Julian Busch", "Anton Kocheturov", "Volker Tresp", "Thomas Seidl"], "abstract": "  Malicious software (malware) poses an increasing threat to the security of\ncommunication systems as the number of interconnected mobile devices increases\nexponentially. While some existing malware detection and classification\napproaches successfully leverage network traffic data, they treat network flows\nbetween pairs of endpoints independently and thus fail to leverage rich\ncommunication patterns present in the complete network. Our approach first\nextracts flow graphs and subsequently classifies them using a novel edge\nfeature-based graph neural network model. We present three variants of our base\nmodel, which support malware detection and classification in supervised and\nunsupervised settings. We evaluate our approach on flow graphs that we extract\nfrom a recently published dataset for mobile malware detection that addresses\nseveral issues with previously available datasets. Experiments on four\ndifferent prediction tasks consistently demonstrate the advantages of our\napproach and show that our graph neural network model can boost detection\nperformance by a significant margin.\n", "doi": "10.1145/3468791.3468814", "arxiv_id": "2103.03939", "pdf_urls": ["https://arxiv.org/pdf/2103.03939"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "33rd International Conference on Scientific and Statistical\n  Database Management (SSDBM 2021)", "categories": "cs.LG cs.CR"}
{"title": "Expert System Gradient Descent Style Training: Development of a\n  Defensible Artificial Intelligence Technique", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jeremy Straub"], "abstract": "  Artificial intelligence systems, which are designed with a capability to\nlearn from the data presented to them, are used throughout society. These\nsystems are used to screen loan applicants, make sentencing recommendations for\ncriminal defendants, scan social media posts for disallowed content and more.\nBecause these systems don't assign meaning to their complex learned correlation\nnetwork, they can learn associations that don't equate to causality, resulting\nin non-optimal and indefensible decisions being made. In addition to making\ndecisions that are sub-optimal, these systems may create legal liability for\ntheir designers and operators by learning correlations that violate\nanti-discrimination and other laws regarding what factors can be used in\ndifferent types of decision making. This paper presents the use of a machine\nlearning expert system, which is developed with meaning-assigned nodes (facts)\nand correlations (rules). Multiple potential implementations are considered and\nevaluated under different conditions, including different network error and\naugmentation levels and different training levels. The performance of these\nsystems is compared to random and fully connected networks.\n", "doi": "10.1016/j.knosys.2021.107275", "arxiv_id": "2103.04314", "pdf_urls": ["https://arxiv.org/pdf/2103.04314"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge Based-Systems (2021)", "categories": "cs.LG cs.AI"}
{"title": "Session-based Social and Dependency-aware Software Recommendation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dengcheng Yan", "Tianyi Tang", "Wenxin Xie", "Yiwen Zhang", "Qiang He"], "abstract": "  With the increase of complexity of modern software, social collaborative\ncoding and reuse of open source software packages become more and more popular,\nwhich thus greatly enhances the development efficiency and software quality.\nHowever, the explosive growth of open source software packages exposes\ndevelopers to the challenge of information overload. While this can be\naddressed by conventional recommender systems, they usually do not consider\nparticular constraints of social coding such as social influence among\ndevelopers and dependency relations among software packages. In this paper, we\naim to model the dynamic interests of developers with both social influence and\ndependency constraints, and propose the Session-based Social and\nDependency-aware software Recommendation (SSDRec) model. This model integrates\nrecurrent neural network (RNN) and graph attention network (GAT) into a unified\nframework. An RNN is employed to model the short-term dynamic interests of\ndevelopers in each session and two GATs are utilized to capture social\ninfluence from friends and dependency constraints from dependent software\npackages, respectively. Extensive experiments are conducted on real-world\ndatasets and the results demonstrate that our model significantly outperforms\nthe competitive baselines.\n", "doi": "10.1016/j.asoc.2022.108463", "arxiv_id": "2103.06109", "pdf_urls": ["https://arxiv.org/pdf/2103.06109"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Yan, D., Tang, T., Xie, W., Zhang, Y., & He, Q. (2022).\n  Session-based social and dependency-aware software recommendation. Applied\n  Soft Computing, 118, 108463", "categories": "cs.IR cs.SE"}
{"title": "Heterogeneous Information Network-based Interest Composition with Graph\n  Neural Network for Recommendation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dengcheng Yan", "Wenxin Xie", "Yiwen Zhang"], "abstract": "  Heterogeneous information networks (HINs) are widely applied to\nrecommendation systems due to their capability of modeling various auxiliary\ninformation with meta-paths. However, existing HIN-based recommendation models\nusually fuse the information from various meta-paths by simple weighted sum or\nconcatenation, which limits performance improvement because it lacks the\ncapability of interest compositions among meta-paths. In this article, we\npropose an HIN-based Interest Composition model for Recommendation (HicRec).\nSpecifically, user and item representations are learned with a graph neural\nnetwork on both the graph structure and features in each meta-path, and a\nparameter sharing mechanism is utilized here to ensure that the user and item\nrepresentations are in the same latent space. Then, users' interests in each\nitem from each pair of related meta-paths are calculated by a combination of\nthe user and item representations. The composed user interests are obtained by\ntheir single interest from both intra- and inter-meta-paths for recommendation.\nExtensive experiments are conducted on three real-world datasets and the\nresults demonstrate that our proposed HicRec model outperforms the baselines.\n", "doi": "10.1007/s10489-021-03018-6", "arxiv_id": "2103.06560", "pdf_urls": ["https://arxiv.org/pdf/2103.06560"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Cite this article Yan, D., Xie, W. & Zhang, Y. Heterogeneous\n  information network-based interest composition with graph neural network for\n  recommendation. Appl Intell (2022)", "categories": "cs.IR"}
{"title": "Picosecond Laser Ablation of Millimeter-Wave Subwavelength Structures on\n  Alumina and Sapphire", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qi Wen", "Elena Fadeeva", "Shaul Hanany", "J\\\"urgen Koch", "Tomotake\n  Matsumura", "Ryota Takaku", "Karl Young"], "abstract": "  We use a 1030 nm laser with 7 ps pulse duration and average power up to 100 W\nto ablate pyramid-shape subwavelength structures (SWS) on alumina and sapphire.\nThe SWS give an effective and cryogenically robust anti-reflection coating in\nthe millimeter-wave band. We demonstrate average ablation rate of up to 34\nmm$^3$/min and 20 mm$^3$/min for structure heights of 900 $\\mu$m and 750 $\\mu$m\non alumina and sapphire, respectively. These rates are a factor of 34 and 9\nhigher than reported previously on similar structures. We propose a model that\nrelates structure height to cumulative laser fluence. The model depends on the\nabsorption length $\\delta$, which is assumed to depend on peak fluence, and on\nthe threshold fluence $\\phi_{th}$. Using a best-fit procedure we find an\naverage $\\delta = 630$ nm and 650 nm, and $\\phi_{th} = 2.0^{+0.5}_{-0.5}$\nJ/cm$^2$ and $2.3^{+0.1}_{-0.1}$ J/cm$^2$ for alumina and sapphire,\nrespectively, for peak fluence values between 30 and 70 J/cm$^{2}$. With the\nbest fit values, the model and data values for cumulative fluence agree to\nwithin 10%. Given inputs for $\\delta$ and $\\phi_{th}$ the model is used to\npredict average ablation rates as a function of SWS height and average laser\npower.\n", "doi": "10.1016/j.optlastec.2021.107207", "arxiv_id": "2103.06974", "pdf_urls": ["https://arxiv.org/pdf/2103.06974"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics & Laser Technology, Volume 142, October 2021, 107207", "categories": "physics.app-ph astro-ph.IM physics.optics"}
{"title": "A concise and universal method for deriving arbitrary paraxial and\n  non-paraxial cylindrical Gaussian-type light modes", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tomasz Rado\\.zycki"], "abstract": "  A concise method of deriving expressions for Gaussian-like solutions of the\nparaxial and d'Alembert equations is presented. This method is based on the\nHankel transform. Choosing some Gaussian base functions with slight\nmodifications of the prefactor all basic beams of cylindrical character can be\neasily obtained. This refers to Gaussian, Bessel-Gaussian, modified\nBessel-Gaussian, Laguerre-Gaussian and Kummer-Gaussian (i.e.,\nHypergeometric-Gaussian) beams although potentially other beams can come into\nplay as well. For instance a new type of a beam that can be derived in this way\nis described through the incomplete gamma function so it may be called a\n$\\gamma$ beam.\n", "doi": "10.1016/j.optlastec.2021.107670", "arxiv_id": "2103.06988", "pdf_urls": ["https://arxiv.org/pdf/2103.06988"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics & Laser Technology 147, 107670(2022)", "categories": "physics.optics"}
{"title": "Interplay between powder catchment efficiency and layer height in\n  self-stabilized laser metal deposition", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Simone Donadello", "Valentina Furlan", "Ali G\\\"okhan Demir", "Barbara\n  Previtali"], "abstract": "  In laser metal deposition (LMD) the height of the deposited track can vary\nwithin and between layers, causing significant deviations during the process\nevolution. Previous works have shown that in certain conditions a\nself-stabilizing mechanism occurs, maintaining a regular height growth and a\nconstant standoff distance between the part and the deposition nozzle. Here we\nanalyze the link between the powder catchment efficiency and the deposition\nheight stability. To this purpose, a monitoring system was developed to study\nthe deposition in different process conditions, using inline measurements of\nthe specimen weight in combination with the layer height information obtained\nwith coaxial optical triangulation. An analytical model was used to estimate\nthe deposition efficiency in real-time from the height monitoring and the\nprocess parameters, which was verified by the direct mass measurements. The\nresults show that the track height stabilization is associated to a reduction\nof the powder catchment efficiency, which is governed by the melt pool relative\nposition with respect to the powder cone and the laser beam. For a given set of\nparameters, the standoff distance can be estimated to achieve the highest\npowder catchment efficiency and a regular height through the build direction.\n", "doi": "10.1016/j.optlaseng.2021.106817", "arxiv_id": "2103.12103", "pdf_urls": ["https://arxiv.org/pdf/2103.12103"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Lasers in Engineering 149 (2022): 106817", "categories": "physics.app-ph"}
{"title": "Thermal laser evaporation of elements from across the periodic table", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Thomas J. Smart", "Jochen Mannhart", "Wolfgang Braun"], "abstract": "  We propose and demonstrate that thermal laser evaporation can be applied to\nall solid, non-radioactive elements in the periodic table. By depositing thin\nfilms, we achieve growth rates exceeding 1 angstrom/s with output laser powers\nless than 500 W, using identical beam parameters for many different elements.\nThe source temperature is found to vary linearly with laser power within the\nexamined power range. High growth rates are possible using free-standing\nsources for most of the elements tested, eliminating the need for crucibles.\n", "doi": "10.2351/7.0000348", "arxiv_id": "2103.12596", "pdf_urls": ["https://arxiv.org/pdf/2103.12596"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Laser Applications, 2021 (Vol.33, Issue 2)", "categories": "cond-mat.mtrl-sci physics.app-ph"}
{"title": "The domestic localization of knowledge flows as evidenced by publication\n  citation: The case of Italy", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Giovanni Abramo", "Ciriaco Andrea D'Angelo"], "abstract": "  This work applies a new approach to measure knowledge flows. Assuming that\ncitation linkages between articles imply a flow of knowledge from the cited to\nthe citing authors, we investigate the geographic flows of scientific knowledge\nproduced in Italy across its regions, at both overall and field level.\nFurthermore, we measure the the specialization indexes for outflows and inflows\nof knowledge by a given region. Findings show that larger regions in terms of\nresearch output are more likely net exporters of new knowledge. At the same\ntime, we register a positive correlation between the share of intraregional\nflows and the size of overall scientific output of a region.\n", "doi": "10.1007/s11192-020-03487-5", "arxiv_id": "2103.13817", "pdf_urls": ["https://arxiv.org/pdf/2103.13817"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "The case of Italy. Scientometrics, 125(2), 1305-1329", "categories": "cs.DL"}
{"title": "Beyond Low-Pass Filters: Adaptive Feature Propagation on Graphs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sean Li", "Dongwoo Kim", "Qing Wang"], "abstract": "  Graph neural networks (GNNs) have been extensively studied for prediction\ntasks on graphs. As pointed out by recent studies, most GNNs assume local\nhomophily, i.e., strong similarities in local neighborhoods. This assumption\nhowever limits the generalizability power of GNNs. To address this limitation,\nwe propose a flexible GNN model, which is capable of handling any graphs\nwithout being restricted by their underlying homophily. At its core, this model\nadopts a node attention mechanism based on multiple learnable spectral filters;\ntherefore, the aggregation scheme is learned adaptively for each graph in the\nspectral domain. We evaluated the proposed model on node classification tasks\nover eight benchmark datasets. The proposed model is shown to generalize well\nto both homophilic and heterophilic graphs. Further, it outperforms all\nstate-of-the-art baselines on heterophilic graphs and performs comparably with\nthem on homophilic graphs.\n", "doi": "10.1007/978-3-030-86520-7_28", "arxiv_id": "2103.14187", "pdf_urls": ["https://arxiv.org/pdf/2103.14187"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In Machine Learning and Knowledge Discovery in Databases. Research\n  Track (pp. 450-465) 2021", "categories": "cs.LG"}
{"title": "Direct laser-driven electron acceleration and energy gain in helical beams", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Etele Moln\\'ar", "Dan Stutman"], "abstract": "A detailed study of direct laser-driven electron acceleration in paraxial Laguerre-Gaussian modes corresponding to helical beams $\\text{LG}_{0m}$ with azimuthal modes $m=\\left\\{1,2,3,4,5\\right\\}$ is presented. Due to the difference between the ponderomotive force of the fundamental Gaussian beam $\\text{LG}_{00}$ and helical beams $\\text{LG}_{0m}$ we found that the optimal beam waist leading to the most energetic electrons at full width at half maximum is more than twice smaller for the latter and corresponds to a few wavelengths $\\Delta w_0=\\left\\{6,11,19\\right\\}\\lambda_0$ for laser powers of $P_0 = \\left\\{0.1,1,10\\right\\}$ PW. We also found that for azimuthal modes $m\\geq 3$ the optimal waist should be smaller than $\\Delta w_0 < 19 \\lambda_0$. Using these optimal values we have observed that the average kinetic energy gain of electrons is about an order of magnitude larger in helical beams compared to the fundamental Gaussian beam. This average energy gain increases with the azimuthal index $m$ leading to collimated electrons of a few $100$ MeV energy in the direction of the laser propagation.", "doi": "10.1155/2021/6645668", "arxiv_id": "2103.14346", "pdf_urls": ["https://arxiv.org/pdf/2103.14346"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Part. Beams 2021 (2021) e11", "categories": "physics.plasm-ph physics.acc-ph"}
{"title": "The InfraRed Imaging Spectrograph (IRIS) for TMT: photometric\n  characterization of anisoplanatic PSFs and testing of PSF-Reconstruction via\n  AIROPA", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Nils Rundquist", "Shelley A. Wright", "Matthias Schoeck", "Arun Surya", "Jessica Lu", "Paolo Turri", "Edward L. Chapin", "Eric Chisholm", "Tuan Dod", "Jennifer\n  Dunn", "Andrea Ghez", "Yutaka Hayano", "Chris Johnson", "James E. Larkin", "Reed L.\n  Riddle", "Ji Man Sohn", "Ryuji Suzuki", "Gregory Walth", "Andrea Zonca"], "abstract": "  The InfraRed Imaging Spectrograph (IRIS) is a first-light instrument for the\nThirty Meter Telescope (TMT) that will be used to sample the corrected adaptive\noptics field by the Narrow-Field Infrared Adaptive Optics System (NFIRAOS) with\na near-infrared (0.8 - 2.4 $\\mu$m) imaging camera and integral field\nspectrograph. To better understand IRIS science specifications we use the IRIS\ndata simulator to characterize relative photometric precision and accuracy\nacross the IRIS imaging camera 34\"x34\" field of view. Because the Point Spread\nFunction (PSF) varies due to the effects of anisoplanatism, we use the\nAnisoplanatic and Instrumental Reconstruction of Off-axis PSFs for AO (AIROPA)\nsoftware package to conduct photometric measurements on simulated frames using\nPSF-fitting as the PSF varies in single-source, binary, and crowded field use\ncases. We report photometric performance of the imaging camera as a function of\nthe instrumental noise properties including dark current and read noise. Using\nthe same methods, we conduct comparisons of photometric performance with\nreconstructed PSFs, in order to test the veracity of the current\nPSF-Reconstruction algorithms for IRIS/TMT.\n", "doi": "10.1117/12.2562773", "arxiv_id": "2103.15779", "pdf_urls": ["https://arxiv.org/pdf/2103.15779"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings Volume 11447, Ground-based and Airborne\n  Instrumentation for Astronomy VIII, 114472Z (13 December 2020)", "categories": "astro-ph.IM"}
{"title": "Tossing Quantum Coins and Dice", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["V.I. Yukalov"], "abstract": "  The procedure of tossing quantum coins and dice is described. This case is an\nimportant example of a quantum procedure because it presents a typical\nframework employed in quantum information processing and quantum computing. The\nemphasis is on the clarification of the difference between quantum and\nclassical conditional probabilities. These probabilities are designed for\ncharacterizing different systems, either quantum or classical, and they,\ngenerally, cannot be reduced to each other. Thus the L\\\"{u}ders probability\ncannot be treated as a generalization of the classical conditional probability.\nThe analogies between quantum theory of measurements and quantum decision\ntheory are elucidated.\n", "doi": "10.1088/1555-6611/abee8f", "arxiv_id": "2103.17007", "pdf_urls": ["https://arxiv.org/pdf/2103.17007"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics 31 (2021) 055201", "categories": "quant-ph cs.AI cs.IT math.IT"}
{"title": "First radiative shock experiments on the SG-II laser", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Francisco Suzuki-Vidal", "Thomas Clayson", "Chantal Stehl\\'e", "Uddhab\n  Chaulagain", "Jack W.D. Halliday", "Mingying Sun", "Lei Ren", "Ning Kang", "Huiya Liu", "Baoqiang Zhu", "Jianqiang Zhu", "Carolina de Almeida Rossi", "Teodora Mihailescu", "Pedro Velarde", "Manuel Cotelo", "John M. Foster", "Colin N. Danson", "Christopher\n  Spindloe", "Jeremy P. Chittenden", "Carolyn Kuranz"], "abstract": "  We report on the design and first results from experiments looking at the\nformation of radiative shocks on the Shenguang-II (SG-II) laser at the Shanghai\nInstitute of Optics and Fine Mechanics in China. Laser-heating of a two-layer\nCH/CH-Br foil drives a $\\sim$40 km/s shock inside a gas-cell filled with argon\nat an initial pressure of 1 bar. The use of gas-cell targets with large\n(several mm) lateral and axial extent allows the shock to propagate freely\nwithout any wall interactions, and permits a large field of view to image\nsingle and colliding counter-propagating shocks with time resolved,\npoint-projection X-ray backlighting ($\\sim20$ $\\mu$m source size, 4.3 keV\nphoton energy). Single shocks were imaged up to 100 ns after the onset of the\nlaser drive allowing to probe the growth of spatial non-uniformities in the\nshock apex. These results are compared with experiments looking at\ncounter-propagating shocks, showing a symmetric drive which leads to a\ncollision and stagnation from $\\sim$40 ns onward. We present a preliminary\ncomparison with numerical simulations with the radiation hydrodynamics code\nARWEN, which provides expected plasma parameters for the design of future\nexperiments in this facility.\n", "doi": "10.1017/hpl.2021.17", "arxiv_id": "2103.17052", "pdf_urls": ["https://arxiv.org/pdf/2103.17052"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "High Pow Laser Sci Eng 9 (2021) e27", "categories": "physics.plasm-ph"}
{"title": "Liger for Next Generation Keck AO: Filter Wheel and Pupil Design", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Maren Cosens (1 and 2)", "Shelley A. Wright (1 and 2)", "Pauline Arriaga\n  (3 and 4)", "Aaron Brown (2)", "Michael Fitzgerald (3)", "Tucker Jones (5)", "Marc\n  Kassis (6)", "Evan Kress (3)", "Renate Kupke (7)", "James E. Larkin (3)", "Jim Lyke\n  (6)", "Eric Wang (3)", "James Wiley (1 and 2)", "and Sherry Yeh (6) ((1) Department\n  of Physics", "University of California San Diego", "USA", "(2) Center for\n  Astrophysics and Space Sciences", "University of California San Diego", "USA", "(3)\n  Department of Physics & Astronomy", "University of California Los Angeles", "USA", "(4) Arete Associates", "Northridge", "CA", "(5) Department of Physics", "University\n  of California Davis", "USA", "(6) W.M. Keck Observatory", "Waimea"], "abstract": "  Liger is a next-generation near-infrared imager and integral field\nspectrograph (IFS) for the W.M. Keck Observatory designed to take advantage of\nthe Keck All-Sky Precision Adaptive Optics (KAPA) upgrade. Liger will operate\nat spectral resolving powers between R$\\sim$4,000 - 10,000 over a wavelength\nrange of 0.8-2.4$\\mu$m. Liger takes advantage of a sequential imager and\nspectrograph design that allows for simultaneous observations between the two\nchannels using the same filter wheel and cold pupil stop. We present the design\nfor the filter wheels and pupil mask and their location and tolerances in the\noptical design. The filter mechanism is a multi-wheel design drawing from the\nheritage of the current Keck/OSIRIS imager single wheel design. The Liger\nmulti-wheel configuration is designed to allow future upgrades to the number\nand range of filters throughout the life of the instrument. The pupil mechanism\nis designed to be similarly upgradeable with the option to add multiple pupil\nmask options. A smaller wheel mechanism allows the user to select the desired\npupil mask with open slots being designed in for future upgrade capabilities.\nAn ideal pupil would match the shape of the image formed of the primary and\nwould track its rotation. For different pupil shapes without tracking we model\nthe additional exposure time needed to achieve the same signal to noise of an\nideal pupil and determine that a set of fixed masks of different shapes\nprovides a mechanically simpler system with little compromise in performance.\n", "doi": "10.1117/12.2561837", "arxiv_id": "2104.01226", "pdf_urls": ["https://arxiv.org/pdf/2104.01226"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 114474X, (December 13, 2020)", "categories": "astro-ph.IM"}
{"title": "Liger for Next Generation Keck Adaptive Optics: Opto-Mechanical Dewar\n  for Imaging Camera and Slicer", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["James Wiley (1 and 2)", "Kalp Mathur (1 and 2)", "Aaron Brown (2)", "Shelley\n  A. Wright (1 and 2)", "Maren Cosens (1 and 2)", "Jerome Maire (2)", "Michael\n  Fitzgerald (3)", "Tucker Jones (4)", "Marc Kassis (5)", "Evan Kress (3)", "Renate\n  Kupke (6)", "James E. Larkin (3)", "Jim Lyke (5)", "Eric Wang (3)", "Sherry Yeh (5)\n  ((1) Department of Physics", "University of California San Diego", "USA", "(2)\n  Center for Astrophysics and Space Sciences", "University of California San\n  Diego", "USA", "(3) Department of Physics & Astronomy", "University of California\n  Los Angeles", "USA", "(4) Department of Physics", "University of California Davis", "USA", "(5) W.M. Keck Observatory", "Waimea", "HI", "(6) Department of Astronomy &\n  Astrophysics"], "abstract": "  Liger is a next generation adaptive optics (AO) fed integral field\nspectrograph (IFS) and imager for the W. M. Keck Observatory. This new\ninstrument is being designed to take advantage of the upgraded AO system\nprovided by Keck All-Sky Precision Adaptive-optics (KAPA). Liger will provide\nhigher spectral resolving power (R$\\sim$4,000-10,000), wider wavelength\ncoverage ($\\sim$0.8-2.4 $\\mu$m), and larger fields of view than any current\nIFS. We present the design and analysis for a custom-made dewar chamber for\ncharacterizing the Liger opto-mechanical system. This dewar chamber is designed\nto test and assemble the Liger imaging camera and slicer IFS components while\nbeing adaptable for future experiments. The vacuum chamber will operate below\n$10^{-5}$ Torr with a cold shield that will be kept below 90 K. The dewar test\nchamber will be mounted to an optical vibration isolation platform and further\nisolated from the cryogenic and vacuum systems with bellows. The cold head and\nvacuums will be mounted to a custom cart that will also house the electronics\nand computer that interface with the experiment. This test chamber will provide\nan efficient means of calibrating and characterizing the Liger instrument and\nperforming future experiments.\n", "doi": "10.1117/12.2563028", "arxiv_id": "2104.01228", "pdf_urls": ["https://arxiv.org/pdf/2104.01228"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 1144758, (December 13, 2020)", "categories": "astro-ph.IM"}
{"title": "Alignment of Stakeholder Expectations about User Involvement in Agile\n  Software Development", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jim Buchan", "Muneera Bano", "Didar Zowghi", "Stephen MacDonell and Amrita\n  Shinde"], "abstract": "  Context: User involvement is generally considered to contributing to user\nsatisfaction and project success and is central to Agile software development.\nIn theory, the expectations about user involvement, such as the PO's, are quite\ndemanding in this Agile way of working. But what are the expectations seen in\npractice, and are the expectations of user involvement aligned among the\ndevelopment team and users? Any misalignment could contribute to conflict and\nmiscommunication among stakeholders that may result in ineffective user\ninvolvement. Objective: Our aim is to compare and contrast the expectations of\ntwo stakeholder groups (software development team, and software users) about\nuser involvement in order to understand the expectations and assess their\nalignment. Method: We have conducted an exploratory case study of expectations\nabout user involvement in an Agile software development. Qualitative data was\ncollected through interviews to design a novel method for the assessing the\nalignment of expectations about user involvement by applying Repertory Grids\n(RG). Results: By aggregating the results from the interviews and RGs, varying\ndegrees of expectation alignments were observed between the development team\nand user representatives. Conclusion: Alignment of expectations can be assessed\nin practice using the proposed RG instrument and can reveal misalignment\nbetween user roles and activities they participate in Agile software\ndevelopment projects. Although we used RG instrument retrospectively in this\nstudy, we posit that it could also be applied from the start of a project, or\nproactively as a diagnostic tool throughout a project to assess and ensure that\nexpectations are aligned.\n", "doi": "10.1145/3084226.3084251", "arxiv_id": "2104.04205", "pdf_urls": ["https://arxiv.org/pdf/2104.04205"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 21st International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2017). Karlskrona, Sweden, ACM Press,\n  pp.334-343", "categories": "cs.SE"}
{"title": "Robotic needle steering in deformable tissues with extreme learning\n  machines", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pedro Henrique Suruagy Perrusi", "Anna Cazzaniga", "Paul Baksic", "Eleonora\n  Tagliabue", "Elena de Momi", "Hadrien Courtecuisse"], "abstract": "  Control strategies for robotic needle steering in soft tissues must account\nfor complex interactions between the needle and the tissue to achieve accurate\nneedle tip positioning. Recent findings show faster robotic command rate can\nimprove the control stability in realistic scenarios. This study proposes the\nuse of Extreme Learning Machines to provide fast commands for robotic needle\nsteering. A synthetic dataset based on the inverse finite element simulation\ncontrol framework is used to train the model. Results show the model is capable\nto infer commands 66% faster than the inverse simulation and reaches acceptable\nprecision even on previously unseen trajectories.\n", "doi": null, "arxiv_id": "2104.06510", "pdf_urls": ["https://arxiv.org/pdf/2104.06510"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "AUTOMED 2021, Jun 2021, Basel, Switzerland", "categories": "cs.RO cs.AI cs.NE"}
{"title": "Analytical Solution of a Gas Release Problem Considering Permeation with\n  Time-Dependent Boundary Conditions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marvin R. Schulz", "Kaori Nagatou", "Axel von der Weth", "Frederik Arbeiter\n  and Volker Pasler"], "abstract": "  In this paper the determination of material properties such as Sieverts'\nconstant (solubility) and diffusivity (transport rate) via so-called gas\nrelease experiments is discussed. In order to simulate the time-dependent\nhydrogen fluxes and concentration profiles efficiently, we make use of an\nanalytical method, namely we provide an analytical solution for the\ncorresponding diffusion equations on a cylindrical specimen and a cylindrical\ncontainer for three boundary conditions. These conditions occur in three phases\n-- loading phase, evacuation phase and gas release phase. In the loading phase\nthe specimen is charged with hydrogen assuring a constant partial pressure of\nhydrogen. Then the gas will be quickly removed by a vacuum pump in the second\nphase, and finally in the third time interval, the hydrogen is released from\nthe specimen to the gaseous phase, where the pressure increase will be measured\nby an equipment which is attached to the cylindrical container. The\ninvestigated diffusion equation in each phase is a simple homogeneous equation,\nbut due to the complex time-dependent boundary conditions which include the\nSieverts' constant and the pressure, we transform the homogeneous equations to\nthe non-homogeneous ones with a zero Dirichlet boundary condition. Compared\nwith the time consuming numerical methods our analytical approach has an\nadvantage that the flux of desorbed hydrogen can be explicitly given and\ntherefore can be evaluated efficiently. Our analytical solution also assures\nthat the time-dependent boundary conditions are exactly satisfied and\nfurthermore that the interaction between specimen and container is correctly\ntaken into account.\n", "doi": "10.1080/23324309.2020.1828469", "arxiv_id": "2104.07101", "pdf_urls": ["https://arxiv.org/pdf/2104.07101"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Analytical Solution of a Gas Release Problem considering\n  Permeation with Time-Dependent Boundary Conditions, Journal of Computational\n  and Theoretical Transport, vol. 49, no. 7, p. 389-412, year 2020", "categories": "physics.app-ph"}
{"title": "Do Deep Neural Networks Forget Facial Action Units? -- Exploring the\n  Effects of Transfer Learning in Health Related Facial Expression Recognition", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pooja Prajod", "Dominik Schiller", "Tobias Huber", "Elisabeth Andr\\'e"], "abstract": "  In this paper, we present a process to investigate the effects of transfer\nlearning for automatic facial expression recognition from emotions to pain. To\nthis end, we first train a VGG16 convolutional neural network to automatically\ndiscern between eight categorical emotions. We then fine-tune successively\nlarger parts of this network to learn suitable representations for the task of\nautomatic pain recognition. Subsequently, we apply those fine-tuned\nrepresentations again to the original task of emotion recognition to further\ninvestigate the differences in performance between the models. In the second\nstep, we use Layer-wise Relevance Propagation to analyze predictions of the\nmodel that have been predicted correctly previously but are now wrongly\nclassified. Based on this analysis, we rely on the visual inspection of a human\nobserver to generate hypotheses about what has been forgotten by the model.\nFinally, we test those hypotheses quantitatively utilizing concept embedding\nanalysis methods. Our results show that the network, which was fully fine-tuned\nfor pain recognition, indeed payed less attention to two action units that are\nrelevant for expression recognition but not for pain recognition.\n", "doi": "10.1007/978-3-030-93080-6_16", "arxiv_id": "2104.07389", "pdf_urls": ["https://arxiv.org/pdf/2104.07389"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "AI for Disease Surveillance and Pandemic Intelligence. W3PHAI\n  2021. Studies in Computational Intelligence, vol 1013. Springer, Cham", "categories": "cs.CV cs.LG"}
{"title": "Personalized Semi-Supervised Federated Learning for Human Activity Recognition", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Riccardo Presotto", "Gabriele Civitarese", "Claudio Bettini"], "abstract": "One of the major open problems in sensor-based Human Activity Recognition (HAR) is the scarcity of labeled data. Among the many solutions to address this challenge, semi-supervised learning approaches represent a promising direction. However, their centralised architecture incurs in the scalability and privacy problems that arise when the process involves a large number of users. Federated Learning (FL) is a promising paradigm to address these problems. However, the FL methods that have been proposed for HAR assume that the participating users can always obtain labels to train their local models (i.e., they assume a fully supervised setting). In this work, we propose FedAR: a novel hybrid method for HAR that combines semi-supervised and federated learning to take advantage of the strengths of both approaches. FedAR combines active learning and label propagation to semi-automatically annotate the local streams of unlabeled sensor data, and it relies on FL to build a global activity model in a scalable and privacy-aware fashion. FedAR also includes a transfer learning strategy to fine-tune the global model on each user. We evaluated our method on two public datasets, showing that FedAR reaches recognition rates and personalization capabilities similar to state-of-the-art FL supervised approaches. As a major advantage, FedAR only requires a very limited number of annotated data to populate a pre-trained model and a small number of active learning questions that quickly decrease while using the system, leading to an effective and scalable solution for the data scarcity problem of HAR.", "doi": "10.1007/s00779-021-01627-z", "arxiv_id": "2104.08094", "pdf_urls": ["https://arxiv.org/pdf/2104.08094"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Presotto, R., Civitarese, G., Bettini, C. (2022). Semi-supervised and personalized federated activity recognition based on active learning and label propagation. Personal and Ubiquitous Computing, 26(5), 1281-1298", "categories": "cs.LG cs.DC"}
{"title": "Fine-grained Anomaly Detection via Multi-task Self-Supervision", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Loic Jezequel", "Ngoc-Son Vu", "Jean Beaudet", "Aymeric Histace"], "abstract": "  Detecting anomalies using deep learning has become a major challenge over the\nlast years, and is becoming increasingly promising in several fields. The\nintroduction of self-supervised learning has greatly helped many methods\nincluding anomaly detection where simple geometric transformation recognition\ntasks are used. However these methods do not perform well on fine-grained\nproblems since they lack finer features. By combining in a multi-task framework\nhigh-scale shape features oriented task with low-scale fine features oriented\ntask, our method greatly improves fine-grained anomaly detection. It\noutperforms state-of-the-art with up to 31% relative error reduction measured\nwith AUROC on various anomaly detection problems.\n", "doi": "10.1109/avss52988.2021.9663783", "arxiv_id": "2104.09993", "pdf_urls": ["https://arxiv.org/pdf/2104.09993"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "L. J\\'ez\\'equel, N. -S. Vu, J. Beaudet and A. Histace,\n  \"Fine-grained anomaly detection via multi-task self-supervision,\" 2021 17th\n  IEEE International Conference on Advanced Video and Signal Based Surveillance\n  (AVSS), 2021, pp. 1-8", "categories": "cs.CV"}
{"title": "Higgs-strahlung boson production in the presence of a circularly\n  polarized laser field", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M. Ouhammou", "M. Ouali", "S. Taj", "and B. Manaut"], "abstract": "  In the framework of the electroweak standard model, we investigated, in the\ncenter of mass frame, the Higgs boson production in the presence of an intense\nlaser field via ${e}^{+} {e}^{-}$ annihilation $({e}^{+} {e}^{-}\\rightarrow\nZH)$. By comparing our results with those obtained by Djouadi \\cite{1} for\nlaser-free process, we show that the circularly polarized laser field affects\nsignificantly the $s$-channel Higgs boson production. We find that for a given\nnumber of exchanged photons, laser field strength and frequency, the total\ncross section decreases by several orders of magnitude. These effects of laser\nfield on cross section are found to be consistent with what was found for muon\npair production via QED process in the presence of a circularly polarized laser\nfield \\cite{2}.\n", "doi": "10.1088/1612-202x/ac0919", "arxiv_id": "2104.11155", "pdf_urls": ["https://arxiv.org/pdf/2104.11155"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 18 (2021) 076002", "categories": "hep-ph hep-th"}
{"title": "A Deep Reinforcement Learning Approach for the Meal Delivery Problem", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hadi Jahanshahi", "Aysun Bozanta", "Mucahit Cevik", "Eray Mert Kavuk", "Ay\\c{s}e Tosun", "Sibel B. Sonuc", "Bilgin Kosucu", "Ay\\c{s}e Ba\\c{s}ar"], "abstract": "  We consider a meal delivery service fulfilling dynamic customer requests\ngiven a set of couriers over the course of a day. A courier's duty is to\npick-up an order from a restaurant and deliver it to a customer. We model this\nservice as a Markov decision process and use deep reinforcement learning as the\nsolution approach. We experiment with the resulting policies on synthetic and\nreal-world datasets and compare those with the baseline policies. We also\nexamine the courier utilization for different numbers of couriers. In our\nanalysis, we specifically focus on the impact of the limited available\nresources in the meal delivery problem. Furthermore, we investigate the effect\nof intelligent order rejection and re-positioning of the couriers. Our\nnumerical experiments show that, by incorporating the geographical locations of\nthe restaurants, customers, and the depot, our model significantly improves the\noverall service quality as characterized by the expected total reward and the\ndelivery times. Our results present valuable insights on both the courier\nassignment process and the optimal number of couriers for different order\nfrequencies on a given day. The proposed model also shows a robust performance\nunder a variety of scenarios for real-world implementation.\n", "doi": "10.1016/j.knosys.2022.108489", "arxiv_id": "2104.12000", "pdf_urls": ["https://arxiv.org/pdf/2104.12000"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2022)", "categories": "cs.LG cs.AI math.OC"}
{"title": "Bio-SODA: Enabling Natural Language Question Answering over Knowledge\n  Graphs without Training Data", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ana Claudia Sima", "Tarcisio Mendes de Farias", "Maria Anisimova", "Christophe Dessimoz", "Marc Robinson-Rechavi", "Erich Zbinden", "and Kurt\n  Stockinger"], "abstract": "  The problem of natural language processing over structured data has become a\ngrowing research field, both within the relational database and the Semantic\nWeb community, with significant efforts involved in question answering over\nknowledge graphs (KGQA). However, many of these approaches are either\nspecifically targeted at open-domain question answering using DBpedia, or\nrequire large training datasets to translate a natural language question to\nSPARQL in order to query the knowledge graph. Hence, these approaches often\ncannot be applied directly to complex scientific datasets where no prior\ntraining data is available.\n  In this paper, we focus on the challenges of natural language processing over\nknowledge graphs of scientific datasets. In particular, we introduce Bio-SODA,\na natural language processing engine that does not require training data in the\nform of question-answer pairs for generating SPARQL queries. Bio-SODA uses a\ngeneric graph-based approach for translating user questions to a ranked list of\nSPARQL candidate queries. Furthermore, Bio-SODA uses a novel ranking algorithm\nthat includes node centrality as a measure of relevance for selecting the best\nSPARQL candidate query. Our experiments with real-world datasets across several\nscientific domains, including the official bioinformatics Question Answering\nover Linked Data (QALD) challenge, show that Bio-SODA outperforms publicly\navailable KGQA systems by an F1-score of least 20% and by an even higher factor\non more complex bioinformatics datasets.\n", "doi": null, "arxiv_id": "2104.13744", "pdf_urls": ["https://arxiv.org/pdf/2104.13744"], "github": ["https://github.com/anazhaw/Bio-SODA"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "33rd International Conference on Scientific and Statistical\n  Database Management (SSDBM 2021)", "categories": "cs.DB"}
{"title": "Deep Insights of Deepfake Technology : A Review", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Bahar Uddin Mahmud", "Afsana Sharmin"], "abstract": "  Under the aegis of computer vision and deep learning technology, a new\nemerging techniques has introduced that anyone can make highly realistic but\nfake videos, images even can manipulates the voices. This technology is widely\nknown as Deepfake Technology. Although it seems interesting techniques to make\nfake videos or image of something or some individuals but it could spread as\nmisinformation via internet. Deepfake contents could be dangerous for\nindividuals as well as for our communities, organizations, countries religions\netc. As Deepfake content creation involve a high level expertise with\ncombination of several algorithms of deep learning, it seems almost real and\ngenuine and difficult to differentiate. In this paper, a wide range of articles\nhave been examined to understand Deepfake technology more extensively. We have\nexamined several articles to find some insights such as what is Deepfake, who\nare responsible for this, is there any benefits of Deepfake and what are the\nchallenges of this technology. We have also examined several creation and\ndetection techniques. Our study revealed that although Deepfake is a threat to\nour societies, proper measures and strict regulations could prevent this.\n", "doi": null, "arxiv_id": "2105.00192", "pdf_urls": ["https://arxiv.org/pdf/2105.00192"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "DUJASE Vol. 5(1 & 2) 13-23, 2020 (January & July)", "categories": "cs.LG"}
{"title": "Design Requirements for the Wide-field Infrared TransientExplorer\n  (WINTER)", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Danielle Frostig", "John W. Baker", "Joshua Brown", "Richard S. Burruss", "Kristin Clark", "G\\'abor F\\H{u}r\\'esz", "Nicolae Ganciu", "Erik Hinrichsen", "Viraj\n  R. Karambelkar", "Mansi M. Kasliwal", "Nathan P. Lourie", "Andrew Malonis", "Robert\n  A. Simcoe", "Jeffry Zolkower"], "abstract": "  The Wide-field Infrared Transient Explorer (WINTER) is a 1x1 degree infrared\nsurvey telescope under development at MIT and Caltech, and slated for\ncommissioning at Palomar Observatory in 2021. WINTER is a seeing-limited\ninfrared time-domain survey and has two main science goals: (1) the discovery\nof IR kilonovae and r-process materials from binary neutron star mergers and\n(2) the study of general IR transients, including supernovae, tidal disruption\nevents, and transiting exoplanets around low mass stars.\n  We plan to meet these science goals with technologies that are relatively new\nto astrophysical research: hybridized InGaAs sensors as an alternative to\ntraditional, but expensive, HgCdTe arrays and an IR-optimized 1-meter COTS\ntelescope. To mitigate risk, optimize development efforts, and ensure that\nWINTER meets its science objectives, we use model-based systems engineering\n(MBSE) techniques commonly featured in aerospace engineering projects. Even as\nground-based instrumentation projects grow in complexity, they do not often\nhave the budget for a full-time systems engineer. We present one example of\nsystems engineering for the ground-based WINTER project, featuring software\ntools that allow students or staff to learn the fundamentals of MBSE and\ncapture the results in a formalized software interface. We focus on the\ntop-level science requirements with a detailed example of how the goal of\ndetecting kilonovae flows down to WINTER's optical design. In particular, we\ndiscuss new methods for tolerance simulations, eliminating stray light, and\nmaximizing image quality of a fly's-eye design that slices the telescope's\nfocus onto 6 non-buttable, IR detectors. We also include a discussion of safety\nconstraints for a robotic telescope.\n", "doi": "10.1117/12.2562842", "arxiv_id": "2105.01219", "pdf_urls": ["https://arxiv.org/pdf/2105.01219"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 2020", "categories": "astro-ph.IM"}
{"title": "The Temporal Dictionary Ensemble (TDE) Classifier for Time Series\n  Classification", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Matthew Middlehurst", "James Large", "Gavin Cawley", "Anthony Bagnall"], "abstract": "  Using bag of words representations of time series is a popular approach to\ntime series classification. These algorithms involve approximating and\ndiscretising windows over a series to form words, then forming a count of words\nover a given dictionary. Classifiers are constructed on the resulting\nhistograms of word counts. A 2017 evaluation of a range of time series\nclassifiers found the bag of symbolic-fourier approximation symbols (BOSS)\nensemble the best of the dictionary based classifiers. It forms one of the\ncomponents of hierarchical vote collective of transformation-based ensembles\n(HIVE-COTE), which represents the current state of the art. Since then, several\nnew dictionary based algorithms have been proposed that are more accurate or\nmore scalable (or both) than BOSS. We propose a further extension of these\ndictionary based classifiers that combines the best elements of the others\ncombined with a novel approach to constructing ensemble members based on an\nadaptive Gaussian process model of the parameter space. We demonstrate that the\ntemporal dictionary ensemble (TDE) is more accurate than other dictionary based\napproaches. Furthermore, unlike the other classifiers, if we replace BOSS in\nHIVE-COTE with TDE, HIVE-COTE is significantly more accurate. We also show this\nnew version of HIVE-COTE is significantly more accurate than the current best\ndeep learning approach, a recently proposed hybrid tree ensemble and a recently\nintroduced competitive classifier making use of highly randomised convolutional\nkernels. This advance represents a new state of the art for time series\nclassification.\n", "doi": "10.1007/978-3-030-67658-2_38", "arxiv_id": "2105.03841", "pdf_urls": ["https://arxiv.org/pdf/2105.03841"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ECML PKDD 2020: Machine Learning and Knowledge Discovery in\n  Databases, pages 660-676, 2020", "categories": "cs.LG"}
{"title": "TopicsRanksDC: Distance-based Topic Ranking applied on Two-Class Data", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Malik Yousef", "Jamal Al Qundus", "Silvio Peikert", "and Adrian Paschke"], "abstract": "  In this paper, we introduce a novel approach named TopicsRanksDC for topics\nranking based on the distance between two clusters that are generated by each\ntopic. We assume that our data consists of text documents that are associated\nwith two-classes. Our approach ranks each topic contained in these text\ndocuments by its significance for separating the two-classes. Firstly, the\nalgorithm detects topics using Latent Dirichlet Allocation (LDA). The words\ndefining each topic are represented as two clusters, where each one is\nassociated with one of the classes. We compute four distance metrics, Single\nLinkage, Complete Linkage, Average Linkage and distance between the centroid.\nWe compare the results of LDA topics and random topics. The results show that\nthe rank for LDA topics is much higher than random topics. The results of\nTopicsRanksDC tool are promising for future work to enable search engines to\nsuggest related topics.\n", "doi": null, "arxiv_id": "2105.07826", "pdf_urls": ["https://arxiv.org/pdf/2105.07826"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Conference on Database and Expert Systems\n  Applications DEXA 2020: Database and Expert Systems Applications pp 11-21", "categories": "cs.IR cs.AI cs.LG"}
{"title": "Data Quality in Empirical Software Engineering: A Targeted Review", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Michael Franklin Bosu and Stephen G. MacDonell"], "abstract": "  Context: The utility of prediction models in empirical software engineering\n(ESE) is heavily reliant on the quality of the data used in building those\nmodels. Several data quality challenges such as noise, incompleteness, outliers\nand duplicate data points may be relevant in this regard. Objective: We\ninvestigate the reporting of three potentially influential elements of data\nquality in ESE studies: data collection, data pre-processing, and the\nidentification of data quality issues. This enables us to establish how\nresearchers view the topic of data quality and the mechanisms that are being\nused to address it. Greater awareness of data quality should inform both the\nsound conduct of ESE research and the robust practice of ESE data collection\nand processing. Method: We performed a targeted literature review of empirical\nsoftware engineering studies covering the period January 2007 to September\n2012. A total of 221 relevant studies met our inclusion criteria and were\ncharacterized in terms of their consideration and treatment of data quality.\nResults: We obtained useful insights as to how the ESE community considers\nthese three elements of data quality. Only 23 of these 221 studies reported on\nall three elements of data quality considered in this paper. Conclusion: The\nreporting of data collection procedures is not documented consistently in ESE\nstudies. It will be useful if data collection challenges are reported in order\nto improve our understanding of why there are problems with software\nengineering data sets and the models developed from them. More generally, data\nquality should be given far greater attention by the community. The improvement\nof data sets through enhanced data collection, pre-processing and quality\nassessment should lead to more reliable prediction models, thus improving the\npractice of software engineering.\n", "doi": "10.1145/2460999.2461024", "arxiv_id": "2105.10895", "pdf_urls": ["https://arxiv.org/pdf/2105.10895"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 17th International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2013)", "categories": "cs.SE"}
{"title": "Towards Teachable Autotelic Agents", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Olivier Sigaud and Ahmed Akakzia and Hugo Caselles-Dupr\\'e and\n  C\\'edric Colas and Pierre-Yves Oudeyer and Mohamed Chetouani"], "abstract": "  Autonomous discovery and direct instruction are two distinct sources of\nlearning in children but education sciences demonstrate that mixed approaches\nsuch as assisted discovery or guided play result in improved skill acquisition.\nIn the field of Artificial Intelligence, these extremes respectively map to\nautonomous agents learning from their own signals and interactive learning\nagents fully taught by their teachers. In between should stand teachable\nautotelic agents (TAA): agents that learn from both internal and teaching\nsignals to benefit from the higher efficiency of assisted discovery. Designing\nsuch agents will enable real-world non-expert users to orient the learning\ntrajectories of agents towards their expectations. More fundamentally, this may\nalso be a key step to build agents with human-level intelligence. This paper\npresents a roadmap towards the design of teachable autonomous agents. Building\non developmental psychology and education sciences, we start by identifying key\nfeatures enabling assisted discovery processes in child-tutor interactions.\nThis leads to the production of a checklist of features that future TAA will\nneed to demonstrate. The checklist allows us to precisely pinpoint the various\nlimitations of current reinforcement learning agents and to identify the\npromising first steps towards TAA. It also shows the way forward by\nhighlighting key research directions towards the design or autonomous agents\nthat can be taught by ordinary people via natural pedagogy.\n", "doi": "10.1109/tcds.2022.3231731.", "arxiv_id": "2105.11977", "pdf_urls": ["https://arxiv.org/pdf/2105.11977"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Sigaud, O., Akakzia, A., Caselles-Dupr\\'e, H., Colas, C., Oudeyer,\n  P. Y., & Chetouani, M. (2022). Towards Teachable Autotelic Agents. IEEE\n  Transactions on Cognitive and Developmental Systems", "categories": "cs.LG cs.AI"}
{"title": "Designing ECG Monitoring Healthcare System with Federated Transfer\n  Learning and Explainable AI", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali Raza", "Kim Phuc Tran", "Ludovic Koehl and Shujun Li"], "abstract": "  Deep learning play a vital role in classifying different arrhythmias using\nthe electrocardiography (ECG) data. Nevertheless, training deep learning models\nnormally requires a large amount of data and it can lead to privacy concerns.\nUnfortunately, a large amount of healthcare data cannot be easily collected\nfrom a single silo. Additionally, deep learning models are like black-box, with\nno explainability of the predicted results, which is often required in clinical\nhealthcare. This limits the application of deep learning in real-world health\nsystems. In this paper, we design a new explainable artificial intelligence\n(XAI) based deep learning framework in a federated setting for ECG-based\nhealthcare applications. The federated setting is used to solve issues such as\ndata availability and privacy concerns. Furthermore, the proposed framework\nsetting effectively classifies arrhythmia's using an autoencoder and a\nclassifier, both based on a convolutional neural network (CNN). Additionally,\nwe propose an XAI-based module on top of the proposed classifier to explain the\nclassification results, which help clinical practitioners make quick and\nreliable decisions. The proposed framework was trained and tested using the\nMIT-BIH Arrhythmia database. The classifier achieved accuracy up to 94% and 98%\nfor arrhythmia detection using noisy and clean data, respectively, with\nfive-fold cross-validation.\n", "doi": "10.1016/j.knosys.2021.107763", "arxiv_id": "2105.12497", "pdf_urls": ["https://arxiv.org/pdf/2105.12497"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 236, 5 January 2022,107763", "categories": "cs.LG cs.AI eess.SP"}
{"title": "Fooling Partial Dependence via Data Poisoning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hubert Baniecki", "Wojciech Kretowicz", "Przemyslaw Biecek"], "abstract": "  Many methods have been developed to understand complex predictive models and\nhigh expectations are placed on post-hoc model explainability. It turns out\nthat such explanations are not robust nor trustworthy, and they can be fooled.\nThis paper presents techniques for attacking Partial Dependence (plots,\nprofiles, PDP), which are among the most popular methods of explaining any\npredictive model trained on tabular data. We showcase that PD can be\nmanipulated in an adversarial manner, which is alarming, especially in\nfinancial or medical applications where auditability became a must-have trait\nsupporting black-box machine learning. The fooling is performed via poisoning\nthe data to bend and shift explanations in the desired direction using genetic\nand gradient algorithms. We believe this to be the first work using a genetic\nalgorithm for manipulating explanations, which is transferable as it\ngeneralizes both ways: in a model-agnostic and an explanation-agnostic manner.\n", "doi": "10.1007/978-3-031-26409-2_8", "arxiv_id": "2105.12837", "pdf_urls": ["https://arxiv.org/pdf/2105.12837"], "github": ["https://github.com/MI2DataLab/fooling-partial-dependence"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Machine Learning and Knowledge Discovery in Databases, vol. 3, pp.\n  121-136, 2022", "categories": "cs.LG stat.ML"}
{"title": "Mid-Infrared Drift Scanning Up The SNR Slope", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Christopher Packham", "Am\\'ilcar R. Torres-Quijano", "Sergio Fernandez\n  Acosta"], "abstract": "  Mid-infrared (MIR) observations are typically accomplished from the ground\nthrough oscillating the secondary mirror a few times a second. This chopping\nserves to remove the fast time variable components of (a) sky variation and (b)\narray background. However, there is a significant price to pay for this,\nincluding reduced on-object photon collection time, stringent demands on the\nsecondary mirror, nodding the telescope to remove the radiative offset\nimprinted by the chopping, and an often-fixed chop-frequency regardless of the\nsky conditions in the actual observations. Worse, in the era of 30m telescopes\nit is wholly impracticable to chop the secondary mirror. If the array is stable\nenough, drift scanning holds the promise to remove the necessity of chopping.\nIn this paper we report our experiments using the CanariCam MIR instrument on\nthe 10.4m GranTeCan and the implications to future instruments and experiments.\n", "doi": "10.1117/12.2588815", "arxiv_id": "2106.01468", "pdf_urls": ["https://arxiv.org/pdf/2106.01468"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings Volume 11447, Ground-based and Airborne\n  Instrumentation for Astronomy VIII; 114477P (2021)", "categories": "astro-ph.IM"}
{"title": "Graph Barlow Twins: A self-supervised representation learning framework\n  for graphs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Piotr Bielak", "Tomasz Kajdanowicz", "Nitesh V. Chawla"], "abstract": "  The self-supervised learning (SSL) paradigm is an essential exploration area,\nwhich tries to eliminate the need for expensive data labeling. Despite the\ngreat success of SSL methods in computer vision and natural language\nprocessing, most of them employ contrastive learning objectives that require\nnegative samples, which are hard to define. This becomes even more challenging\nin the case of graphs and is a bottleneck for achieving robust representations.\nTo overcome such limitations, we propose a framework for self-supervised graph\nrepresentation learning - Graph Barlow Twins, which utilizes a\ncross-correlation-based loss function instead of negative samples. Moreover, it\ndoes not rely on non-symmetric neural network architectures - in contrast to\nstate-of-the-art self-supervised graph representation learning method BGRL. We\nshow that our method achieves as competitive results as the best\nself-supervised methods and fully supervised ones while requiring fewer\nhyperparameters and substantially shorter computation time (ca. 30 times faster\nthan BGRL).\n", "doi": "10.1016/j.knosys.2022.109631", "arxiv_id": "2106.02466", "pdf_urls": ["https://arxiv.org/pdf/2106.02466"], "github": ["https://github.com/pbielak/graph-barlow-twins"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 256, 28 November 2022, 109631", "categories": "cs.LG"}
{"title": "Attend and select: A segment selective transformer for microblog hashtag\n  generation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qianren Mao", "Xi Li", "Bang Liu", "Shu Guo", "Peng Hao", "Jianxin Li", "Lihong\n  Wang"], "abstract": "  Hashtag generation aims to generate short and informal topical tags from a\nmicroblog post, in which tokens or phrases form the hashtags. These tokens or\nphrases may originate from primary fragmental textual pieces (e.g., segments)\nin the original text and are separated into different segments. However,\nconventional sequence-to-sequence generation methods are hard to filter out\nsecondary information from different textual granularity and are not good at\nselecting crucial tokens. Thus, they are suboptimal in generating more\ncondensed hashtags. In this work, we propose a modified Transformer-based\ngeneration model with adding a segments-selection procedure for the original\nencoding and decoding phases. The segments-selection phase is based on a novel\nSegments Selection Mechanism (SSM) to model different textual granularity on\nglobal text, local segments, and tokens, contributing to generating condensed\nhashtags. Specifically, it first attends to primary semantic segments and then\ntransforms discontinuous segments from the source text into a sequence of\nhashtags by selecting crucial tokens. Extensive evaluations on the two datasets\nreveal our approach's superiority with significant improvements to the\nextraction and generation baselines. The code and datasets are available at\nhttps://github.com/OpenSUM/HashtagGen.\n", "doi": "10.1016/j.knosys.2022.109581", "arxiv_id": "2106.03151", "pdf_urls": ["https://arxiv.org/pdf/2106.03151"], "github": ["https://github.com/OpenSUM/HashtagGen"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems 254 (2022): 109581", "categories": "cs.CL cs.AI cs.IR"}
{"title": "Adopting Softer Approaches in the Study of Repository Data: A\n  Comparative Analysis", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sherlock A. Licorish and Stephen G. MacDonell"], "abstract": "  Context: Given the acknowledged need to understand the people processes\nenacted during software development, software repositories and mailing lists\nhave become a focus for many studies. However, researchers have tended to use\nmostly mathematical and frequency-based techniques to examine the software\nartifacts contained within them. Objective: There is growing recognition that\nthese approaches uncover only a partial picture of what happens during software\nprojects, and deeper contextual approaches may provide further understanding of\nthe intricate nature of software teams' dynamics. We demonstrate the relevance\nand utility of such approaches in this study. Method: We use psycholinguistics\nand directed content analysis (CA) to study the way project tasks drive teams'\nattitudes and knowledge sharing. We compare the outcomes of these two\napproaches and offer methodological advice for researchers using similar forms\nof repository data. Results: Our analysis reveals significant differences in\nthe way teams work given their portfolio of tasks and the distribution of\nroles. Conclusion: We overcome the limitations associated with employing purely\nquantitative approaches, while avoiding the time-intensive and potentially\ninvasive nature of field work required in full case studies.\n", "doi": "10.1145/2460999.2461035", "arxiv_id": "2106.03309", "pdf_urls": ["https://arxiv.org/pdf/2106.03309"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 17th International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2013). Porto de Galinhas, Brazil, ACM\n  Press, pp.240-245", "categories": "cs.SE"}
{"title": "Adversarially Regularized Graph Attention Networks for Inductive\n  Learning on Partially Labeled Graphs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiaren Xiao", "Quanyu Dai", "Xiaochen Xie", "James Lam", "Ka-Wai Kwok"], "abstract": "  The high cost of data labeling often results in node label shortage in real\napplications. To improve node classification accuracy, graph-based\nsemi-supervised learning leverages the ample unlabeled nodes to train together\nwith the scarce available labeled nodes. However, most existing methods require\nthe information of all nodes, including those to be predicted, during model\ntraining, which is not practical for dynamic graphs with newly added nodes. To\naddress this issue, an adversarially regularized graph attention model is\nproposed to classify newly added nodes in a partially labeled graph. An\nattention-based aggregator is designed to generate the representation of a node\nby aggregating information from its neighboring nodes, thus naturally\ngeneralizing to previously unseen nodes. In addition, adversarial training is\nemployed to improve the model's robustness and generalization ability by\nenforcing node representations to match a prior distribution. Experiments on\nreal-world datasets demonstrate the effectiveness of the proposed method in\ncomparison with the state-of-the-art methods. The code is available at\nhttps://github.com/JiarenX/AGAIN.\n", "doi": "10.1016/j.knosys.2023.110456", "arxiv_id": "2106.03393", "pdf_urls": ["https://arxiv.org/pdf/2106.03393"], "github": ["https://github.com/JiarenX/AGAIN"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2023)", "categories": "cs.LG cs.SI"}
{"title": "Transportation dynamics of dielectric particles with the gradient forces\n  in the field of orthogonal standing laser waves", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["A.A. Afanas'ev", "V.M. Volkov", "Yu.A. Kurochkin", "D.V. Novitsky"], "abstract": "  We develop the theory of transportation and localization of a transparent\ndielectric spherical particle with the gradient forces in the interference\nfield of orthogonally directed standing laser waves $E_z (\\cos kz)$ and $E_x\n(\\cos kx)$. It is shown that, when the waves $E_z$ and $E_x$ are coherent, the\ninterference radiation field contains two harmonic components with the periods\n$\\Lambda_0=\\pi/k$ and $\\Lambda_\\Delta=\\pi/(k \\sin (\\pi/4))$. The amplitudes of\nthe gradient force components depend on the ratio of the particle radius $R$ to\nthe modulation periods due to inhomogeneity of radiation in the particle volume\nand are given by the Bessel functions $J_{3/2} (2 \\pi R/\\Lambda_0)$ and\n$J_{3/2} (2 \\pi R/\\Lambda_\\Delta)$. We find the critical particle radii $R_0$\nand $R_\\Delta=\\sqrt{2} R_0$ defined by the Bessel functions zeros and\ncorresponding to the vanishing components of the gradient forces. In\nparticular, for the radiation with the wavelength $\\lambda_0=1.064$ {\\mu}m and\na particle in water, the smallest critical radii are $R_0=0.286$ $\\mu$m and\n$0.492$ {\\mu}m and $R_\\Delta=0.404$ $\\mu$m and $0.696$ $\\mu$m, respectively.\nFor a number of special cases, we obtain the analytical solutions of the Newton\nequations and the particle trajectories that depend on the ratio of wave\nintensities and the particle radius. The results can be used to study the\ndynamics of the \"optical assembly\" of a two-dimensional particles matrix which\nbehaves as a molecular crystal.\n", "doi": "10.1016/j.optlastec.2021.107300", "arxiv_id": "2106.03627", "pdf_urls": ["https://arxiv.org/pdf/2106.03627"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics & Laser Technology 143, 107300 (2021)", "categories": "physics.optics"}
{"title": "Enhancing user creativity: Semantic measures for idea generation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Georgi V. Georgiev", "Danko D. Georgiev"], "abstract": "  Human creativity generates novel ideas to solve real-world problems. This\nthereby grants us the power to transform the surrounding world and extend our\nhuman attributes beyond what is currently possible. Creative ideas are not just\nnew and unexpected, but are also successful in providing solutions that are\nuseful, efficient and valuable. Thus, creativity optimizes the use of available\nresources and increases wealth. The origin of human creativity, however, is\npoorly understood, and semantic measures that could predict the success of\ngenerated ideas are currently unknown. Here, we analyze a dataset of design\nproblem-solving conversations in real-world settings by using 49 semantic\nmeasures based on WordNet 3.1 and demonstrate that a divergence of semantic\nsimilarity, an increased information content, and a decreased polysemy predict\nthe success of generated ideas. The first feedback from clients also enhances\ninformation content and leads to a divergence of successful ideas in creative\nproblem solving. These results advance cognitive science by identifying\nreal-world processes in human problem solving that are relevant to the success\nof produced solutions and provide tools for real-time monitoring of problem\nsolving, student training and skill acquisition. A selected subset of\ninformation content (IC S\\'anchez-Batet) and semantic similarity\n(Lin/S\\'anchez-Batet) measures, which are both statistically powerful and\ncomputationally fast, could support the development of technologies for\ncomputer-assisted enhancements of human creativity or for the implementation of\ncreativity in machines endowed with general artificial intelligence.\n", "doi": "10.1016/j.knosys.2018.03.016", "arxiv_id": "2106.10131", "pdf_urls": ["https://arxiv.org/pdf/2106.10131"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems 2018; 151: 1-15", "categories": "cs.CL"}
{"title": "Test case prioritization using test case diversification and\n  fault-proneness estimations", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mostafa Mahdieh", "Seyed-Hassan Mirian-Hosseinabadi", "Mohsen Mahdieh"], "abstract": "  Regression testing activities greatly reduce the risk of faulty software\nrelease. However, the size of the test suites grows throughout the development\nprocess, resulting in time-consuming execution of the test suite and delayed\nfeedback to the software development team. This has urged the need for\napproaches such as test case prioritization (TCP) and test-suite reduction to\nreach better results in case of limited resources. In this regard, proposing\napproaches that use auxiliary sources of data such as bug history can be\ninteresting. We aim to propose an approach for TCP that takes into account test\ncase coverage data, bug history, and test case diversification. To evaluate\nthis approach we study its performance on real-world open-source projects. The\nbug history is used to estimate the fault-proneness of source code areas. The\ndiversification of test cases is preserved by incorporating fault-proneness on\na clustering-based approach scheme. The proposed methods are evaluated on\ndatasets collected from the development history of five real-world projects\nincluding 357 versions in total. The experiments show that the proposed methods\nare superior to coverage-based TCP methods. The proposed approach shows that\nimprovement of coverage-based and fault-proneness-based methods is possible by\nusing a combination of diversification and fault-proneness incorporation.\n", "doi": "10.1007/s10515-022-00344-y", "arxiv_id": "2106.10524", "pdf_urls": ["https://arxiv.org/pdf/2106.10524"], "github": ["https://github.com/mostafamahdieh/ClusteringFaultPronenessTCP"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Automated Software Engineering 29, 50 (2022)", "categories": "cs.SE"}
{"title": "Differences in Jazz Project Leaders' Competencies and Behaviors: A\n  Preliminary Empirical Investigation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sherlock A. Licorish and Stephen G. MacDonell"], "abstract": "  Studying the human factors that impact on software development, and assigning\nindividuals with specific competencies and qualities to particular software\nroles, have been shown to aid software project performance. For instance, prior\nevidence suggests that extroverted software project leaders are most\nsuccessful. Role assignment based on individuals' competencies and behaviors\nmay be especially relevant in distributed software development contexts where\nteams are often affected by distance, cultural, and personality issues. Project\nleaders in these environments need to possess high levels of inter-personal,\nintra-personal and organizational competencies if they are to appropriately\nmanage such issues and maintain positive project performance. With a view to\nunderstanding and explaining the specific competencies and behaviors that are\nrequired of project leaders in these settings, we used psycholinguistic and\ndirected content analysis to study the way six successful IBM Rational Jazz\nleaders operated while coordinating their three distributed projects. Contrary\nto previous evidence reported in personality studies, our results did not\nreveal universal competencies and behaviors among these Jazz leaders. Instead,\nJazz project leaders' competencies and behaviors varied with their project\nportfolio of tasks. Our findings suggest that a pragmatic approach that\nconsiders the nature of the software tasks being developed is likely to be a\nmore effective strategy for assigning leaders to distributed software teams, as\nagainst a strategy that promotes a specific personality type. We discuss these\nfindings and outline implications for distributed software project governance.\n", "doi": "10.1109/chase.2013.6614725", "arxiv_id": "2106.10613", "pdf_urls": ["https://arxiv.org/pdf/2106.10613"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 6th International Workshop on Cooperative and\n  Human Aspects of Software Engineering (CHASE2013). San Francisco CA, USA,\n  IEEE Computer Society Press, pp.1-8", "categories": "cs.SE"}
{"title": "How do Globally Distributed Agile Teams Self-organise? Initial Insights\n  from a Case Study", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sherlock A. Licorish and Stephen G. MacDonell"], "abstract": "  Agile software developers are required to self-organize, occupying various\ninformal roles as needed in order to successfully deliver software features.\nHowever, previous research has reported conflicting evidence about the way\nteams actually undertake this activity. The ability to self-organize is\nparticularly necessary for software development in globally distributed\nenvironments, where distance has been shown to exacerbate human-centric issues.\nUnderstanding the way successful teams self-organise should inform distributed\nteam composition strategies and software project governance. We have used\npsycholinguistics to study the way IBM Rational Jazz practitioners enacted\nvarious roles, expressed attitudes and shared competencies to successfully\nself-organize in their global projects. Among our findings, we uncovered that\npractitioners enacted various roles depending on their teams' cohort of\nfeatures; and that team leaders were most critical to IBM Jazz teams'\nself-organisation. We discuss these findings and highlight their implications\nfor software project governance.\n", "doi": "10.5220/0004437001570164", "arxiv_id": "2106.10614", "pdf_urls": ["https://arxiv.org/pdf/2106.10614"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 8th International Conference on Evaluation of\n  Novel Approaches to Software Engineering (ENASE2013). Angers, France,\n  SCITEPRESS, pp.157-164", "categories": "cs.SE"}
{"title": "The True Role of Active Communicators: An Empirical Study of Jazz Core\n  Developers", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sherlock A. Licorish and Stephen G. MacDonell"], "abstract": "  Context: Interest in software engineering (SE) methodologies and tools has\nbeen complemented in recent years by research efforts oriented towards\nunderstanding the human processes involved in software development. This shift\nhas been imperative given reports of inadequately performing teams and the\nconsequent growing emphasis on individuals and team relations in contemporary\nSE methods. Objective: While software repositories have frequently been studied\nwith a view to explaining such human processes, research has tended to use\nprimarily quantitative analysis approaches. There is concern, however, that\nsuch approaches can provide only a partial picture of the software process.\nGiven the way human behavior is nuanced within psychological and social\ncontexts, it has been asserted that a full understanding may only be achieved\nthrough deeper contextual enquiries. Method: We have followed such an approach\nand have applied data mining, SNA, psycholinguistic analysis and directed\ncontent analysis (CA) to study the way core developers at IBM Rational Jazz\ncontribute their social and intellectual capital, and have compared the\nattitudes, interactions and activities of these members to those of their less\nactive counterparts. Results: Among our results, we uncovered that Jazz's core\ndevelopers worked across multiple roles, and were crucial to their teams'\norganizational, intra-personal and inter-personal processes. Additionally,\nalthough these individuals were highly task- and achievement-focused, they were\nalso largely responsible for maintaining positive team atmosphere, and for\nproviding context awareness in support of their colleagues. Conclusion: Our\nresults suggest that high-performing distributed agile teams rely on both\nindividual and collective efforts, as well as organizational environments that\npromote informal and organic work structures.(Abridged)\n", "doi": "10.1145/2460999.2461034", "arxiv_id": "2106.10616", "pdf_urls": ["https://arxiv.org/pdf/2106.10616"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 17th International Conference on Evaluation and\n  Assessment in Software Engineering (EASE2013). Porto de Galinhas, Brazil, ACM\n  Press, pp.228-239", "categories": "cs.SE"}
{"title": "Graph Pattern Loss based Diversified Attention Network for Cross-Modal\n  Retrieval", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Xueying Chen", "Rong Zhang", "Yibing Zhan"], "abstract": "  Cross-modal retrieval aims to enable flexible retrieval experience by\ncombining multimedia data such as image, video, text, and audio. One core of\nunsupervised approaches is to dig the correlations among different object\nrepresentations to complete satisfied retrieval performance without requiring\nexpensive labels. In this paper, we propose a Graph Pattern Loss based\nDiversified Attention Network(GPLDAN) for unsupervised cross-modal retrieval to\ndeeply analyze correlations among representations. First, we propose a\ndiversified attention feature projector by considering the interaction between\ndifferent representations to generate multiple representations of an instance.\nThen, we design a novel graph pattern loss to explore the correlations among\ndifferent representations, in this graph all possible distances between\ndifferent representations are considered. In addition, a modality classifier is\nadded to explicitly declare the corresponding modalities of features before\nfusion and guide the network to enhance discrimination ability. We test GPLDAN\non four public datasets. Compared with the state-of-the-art cross-modal\nretrieval methods, the experimental results demonstrate the performance and\ncompetitiveness of GPLDAN.\n", "doi": null, "arxiv_id": "2106.13552", "pdf_urls": ["https://arxiv.org/pdf/2106.13552"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "[1] Chen X , Zhang R , Zhan Y . Graph Pattern Loss Based\n  Diversified Attention Network For Cross-Modal Retrieval[C]// 2020 IEEE\n  International Conference on Image Processing (ICIP). IEEE, 2020", "categories": "cs.CV cs.AI"}
{"title": "Continual Learning via Inter-Task Synaptic Mapping", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mao Fubing", "Weng Weiwei", "Mahardhika Pratama", "Edward Yapp Kien Yee"], "abstract": "  Learning from streaming tasks leads a model to catastrophically erase unique\nexperiences it absorbs from previous episodes. While regularization techniques\nsuch as LWF, SI, EWC have proven themselves as an effective avenue to overcome\nthis issue by constraining important parameters of old tasks from changing when\naccepting new concepts, these approaches do not exploit common information of\neach task which can be shared to existing neurons. As a result, they do not\nscale well to large-scale problems since the parameter importance variables\nquickly explode. An Inter-Task Synaptic Mapping (ISYANA) is proposed here to\nunderpin knowledge retention for continual learning. ISYANA combines\ntask-to-neuron relationship as well as concept-to-concept relationship such\nthat it prevents a neuron to embrace distinct concepts while merely accepting\nrelevant concept. Numerical study in the benchmark continual learning problems\nhas been carried out followed by comparison against prominent continual\nlearning algorithms. ISYANA exhibits competitive performance compared to state\nof the arts. Codes of ISYANA is made available in\n\\url{https://github.com/ContinualAL/ISYANAKBS}.\n", "doi": "10.1016/j.knosys.2021.106947", "arxiv_id": "2106.13954", "pdf_urls": ["https://arxiv.org/pdf/2106.13954"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-based Systems, 2021", "categories": "cs.LG cs.AI"}
{"title": "AMU-EURANOVA at CASE 2021 Task 1: Assessing the stability of\n  multilingual BERT", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["L\\'eo Bouscarrat (LIS", "TALEP", "QARMA)", "Antoine Bonnefoy", "C\\'ecile\n  Capponi (LIS", "QARMA)", "Carlos Ramisch (LIS", "TALEP)"], "abstract": "  This paper explains our participation in task 1 of the CASE 2021 shared task.\nThis task is about multilingual event extraction from news. We focused on\nsub-task 4, event information extraction. This sub-task has a small training\ndataset and we fine-tuned a multilingual BERT to solve this sub-task. We\nstudied the instability problem on the dataset and tried to mitigate it.\n", "doi": null, "arxiv_id": "2106.14625", "pdf_urls": ["https://arxiv.org/pdf/2106.14625"], "github": ["https://github.com/euranova/AMU-EURANOVA-CASE-2021"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 4th Workshop on Challenges and Applications of\n  Automated Extraction of Socio-political Events from Text (CASE 2021), Aug\n  2021, Online, Unknown Region", "categories": "cs.CL cs.AI"}
{"title": "Laser pulse-droplet interaction enables the deformation and\n  fragmentation of droplet array", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["D. Chaitanya Kumar Rao", "Awanish Pratap Singh", "Saptarshi Basu"], "abstract": "  Droplet-droplet interactions is ubiquitous in various applications ranging\nfrom medical diagnostics to enhancing and optimizing liquid jet propulsion. We\nemploy an experimental technique where the laser pulse interacts with a\nmicron-sized droplet and causes optical breakdown. The synergy of a nanosecond\nlaser pulse and an isolated spherical droplet is accurately controlled and\nmanipulated to influence the deformation and fragmentation of an array of\ndroplets. We elucidate how the fluid dynamic response (such as drop-drop and\nshock-drop interactions) of an arrangement of droplets can be regulated and\noptimally shaped by laser pulse energy and its interplay with the optical\ndensity of liquid target. A new butterfly type breakup is revealed, which is\nfound to result in controlled and efficient fragmentation of the outer droplets\nin an array. The spatio-temporal characteristics of a laser-induced breakdown\ndictate how shock wave and central droplet fragments can influence outer\ndroplets. The incident laser energy and pulse width employed in this work are\nrepresentative of diverse industrial applications such as surface cleaning,\nnano-lithography, microelectronics, and medical procedures such as intraocular\nmicrosurgery.\n", "doi": "10.1016/j.ijmultiphaseflow.2021.103925", "arxiv_id": "2106.14690", "pdf_urls": ["https://arxiv.org/pdf/2106.14690"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, 148, 103925 (2022)", "categories": "physics.flu-dyn physics.app-ph"}
{"title": "A Study of the Quality of Wikidata", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kartik Shenoy and Filip Ilievski and Daniel Garijo and Daniel Schwabe\n  and Pedro Szekely"], "abstract": "  Wikidata has been increasingly adopted by many communities for a wide variety\nof applications, which demand high-quality knowledge to deliver successful\nresults. In this paper, we develop a framework to detect and analyze\nlow-quality statements in Wikidata by shedding light on the current practices\nexercised by the community. We explore three indicators of data quality in\nWikidata, based on: 1) community consensus on the currently recorded knowledge,\nassuming that statements that have been removed and not added back are\nimplicitly agreed to be of low quality; 2) statements that have been\ndeprecated; and 3) constraint violations in the data. We combine these\nindicators to detect low-quality statements, revealing challenges with\nduplicate entities, missing triples, violated type rules, and taxonomic\ndistinctions. Our findings complement ongoing efforts by the Wikidata community\nto improve data quality, aiming to make it easier for users and editors to find\nand correct mistakes.\n", "doi": null, "arxiv_id": "2107.00156", "pdf_urls": ["https://arxiv.org/pdf/2107.00156"], "github": ["https://github.com/usc-isi-i2/wd-quality"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Web Semantics, Special issue on Community-Based\n  Knowledge Bases, 2021", "categories": "cs.AI"}
{"title": "Asymptotic Statistical Analysis of Sparse Group LASSO via Approximate\n  Message Passing Algorithm", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kan Chen", "Zhiqi Bu", "Shiyun Xu"], "abstract": "  Sparse Group LASSO (SGL) is a regularized model for high-dimensional linear\nregression problems with grouped covariates. SGL applies $l_1$ and $l_2$\npenalties on the individual predictors and group predictors, respectively, to\nguarantee sparse effects both on the inter-group and within-group levels. In\nthis paper, we apply the approximate message passing (AMP) algorithm to\nefficiently solve the SGL problem under Gaussian random designs. We further use\nthe recently developed state evolution analysis of AMP to derive an\nasymptotically exact characterization of SGL solution. This allows us to\nconduct multiple fine-grained statistical analyses of SGL, through which we\ninvestigate the effects of the group information and $\\gamma$ (proportion of\n$\\ell_1$ penalty). With the lens of various performance measures, we show that\nSGL with small $\\gamma$ benefits significantly from the group information and\ncan outperform other SGL (including LASSO) or regularized models which do not\nexploit the group information, in terms of the recovery rate of signal, false\ndiscovery rate and mean squared error.\n", "doi": null, "arxiv_id": "2107.01266", "pdf_urls": ["https://arxiv.org/pdf/2107.01266"], "github": ["https://github.com/dosen4552/Sparse-Group-Lasso-AMP"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Joint European Conference on Machine Learning and Knowledge\n  Discovery in Databases. Springer, Cham, 2021", "categories": "math.ST stat.ME stat.TH"}
{"title": "Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Barna P\\'asztor", "Ilija Bogunovic", "Andreas Krause"], "abstract": "  Learning in multi-agent systems is highly challenging due to several factors\nincluding the non-stationarity introduced by agents' interactions and the\ncombinatorial nature of their state and action spaces. In particular, we\nconsider the Mean-Field Control (MFC) problem which assumes an asymptotically\ninfinite population of identical agents that aim to collaboratively maximize\nthe collective reward. In many cases, solutions of an MFC problem are good\napproximations for large systems, hence, efficient learning for MFC is valuable\nfor the analogous discrete agent setting with many agents. Specifically, we\nfocus on the case of unknown system dynamics where the goal is to\nsimultaneously optimize for the rewards and learn from experience. We propose\nan efficient model-based reinforcement learning algorithm, $M^3-UCRL$, that\nruns in episodes, balances between exploration and exploitation during policy\nlearning, and provably solves this problem. Our main theoretical contributions\nare the first general regret bounds for model-based reinforcement learning for\nMFC, obtained via a novel mean-field type analysis. To learn the system's\ndynamics, $M^3-UCRL$ can be instantiated with various statistical models, e.g.,\nneural networks or Gaussian Processes. Moreover, we provide a practical\nparametrization of the core optimization problem that facilitates\ngradient-based optimization techniques when combined with differentiable\ndynamics approximation methods such as neural networks.\n", "doi": null, "arxiv_id": "2107.04050", "pdf_urls": ["https://arxiv.org/pdf/2107.04050"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "P\\'asztor, B., Krause, A., & Bogunovic, I. (2023). Efficient\n  Model-Based Multi-Agent Mean-Field Reinforcement Learning. Transactions on\n  Machine Learning Research", "categories": "stat.ML cs.LG cs.MA"}
{"title": "CatVRNN: Generating Category Texts via Multi-task Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Pengsen Cheng", "Jinqiao Dai", "Jiayong Liu"], "abstract": "  Controlling the model to generate texts of different categories is a\nchallenging task that is receiving increasing attention. Recently, generative\nadversarial networks (GANs) have shown promising results for category text\ngeneration. However, the texts generated by GANs usually suffer from problems\nof mode collapse and training instability. To avoid the above problems, in this\nstudy, inspired by multi-task learning, a novel model called category-aware\nvariational recurrent neural network (CatVRNN) is proposed. In this model,\ngeneration and classification tasks are trained simultaneously to generate\ntexts of different categories. The use of multi-task learning can improve the\nquality of the generated texts, when the classification task is appropriate. In\naddition, a function is proposed to initialize the hidden state of the CatVRNN\nto force the model to generate texts of a specific category. Experimental\nresults on three datasets demonstrate that the model can outperform\nstate-of-the-art text generation methods based on GAN in terms of diversity of\ngenerated texts.\n", "doi": "10.1016/j.knosys.2022.108491", "arxiv_id": "2107.05219", "pdf_urls": ["https://arxiv.org/pdf/2107.05219"], "github": ["https://github.com/cps11/catvrnn"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 244 (2022) 108491", "categories": "cs.CL"}
{"title": "Zentropy Theory for Positive and Negative Thermal Expansions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zi-Kui Liu", "Yi Wang", "Shun-Li Shang"], "abstract": "  It has been observed in both natural and man-made materials that volume\nsometimes decreases with increasing temperature. Though mechanistic\nunderstanding has been gained for some individual materials, a general answer\nto the question \"Why does volume sometimes decrease with the increase of\ntemperature?\" remains lacking. Based on the thermodynamic relation that the\nderivative of volume with respect to temperature, i.e., thermal expansion, is\nequal to the negative derivative of entropy with respect to pressure, we\ndeveloped a general theory in terms of multiscale entropy to understand and\npredict the change of volume as a function of temperature, which is termed as\nzentropy theory in the present work. It is shown that a phase at high\ntemperatures is a statistical representation of the ground-state stable and\nmultiple nonground-state metastable configurations. It is demonstrated that\nwhen the volumes of the major nonground-state configurations are smaller than\nthat of the ground-state configuration, the volume of the phase may decrease\nwith the increase of temperature in certain ranges of temperature-pressure\ncombinations, depicting the negative divergency of thermal expansion at the\ncritical point. As examples, positive and negative divergencies of thermal\nexpansion are predicted at the critical points of Ce and Fe3Pt, respectively,\nalong with the temperature and pressure ranges for abnormally positive and\nnegative thermal expansion. The authors believe that the zentropy theory is\napplicable to predict anomalies of other physical properties of phases because\nthe change of entropy drives the responses of a system to external stimuli.\n", "doi": "10.1007/s11669-022-00942-z", "arxiv_id": "2107.06455", "pdf_urls": ["https://arxiv.org/pdf/2107.06455"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Phase Equilibria Diffus. 43 (2022) 598-605", "categories": "cond-mat.mtrl-sci"}
{"title": "Multi-objective Test Case Selection Through Linkage Learning-based\n  Crossover", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Mitchell Olsthoorn and Annibale Panichella"], "abstract": "  Test Case Selection (TCS) aims to select a subset of the test suite to run\nfor regression testing. The selection is typically based on past coverage and\nexecution cost data. Researchers have successfully used multi-objective\nevolutionary algorithms (MOEAs), such as NSGA-II and its variants, to solve\nthis problem. These MOEAs use traditional crossover operators to create new\ncandidate solutions through genetic recombination. Recent studies in numerical\noptimization have shown that better recombinations can be made using machine\nlearning, in particular link-age learning. Inspired by these recent advances in\nthis field, we propose a new variant of NSGA-II, called L2-NSGA, that uses\nlinkage learning to optimize test case selection. In particular, we use an\nunsupervised clustering algorithm to infer promising patterns among the\nsolutions (subset of test suites). Then, these patterns are used in the next\niterations of L2-NSGA to create solutions that preserve these inferred\npatterns. Our results show that our customizations make NSGA-II more effective\nfor test case selection. The test suite sub-sets generated by L2-NSGA are less\nexpensive and detect more faults than those generated by MOEAs used in the\nliterature for regression testing.\n", "doi": null, "arxiv_id": "2107.08454", "pdf_urls": ["https://arxiv.org/pdf/2107.08454"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "13th Symposium on Search-Based Software Engineering (SSBSE) 2021", "categories": "cs.SE cs.NE"}
{"title": "Two-phase Optimization of Binary Sequences with Low Peak Sidelobe Level\n  Value", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Borko Bo\\v{s}kovi\\'c", "Janez Brest"], "abstract": "  The search for binary sequences with low peak sidelobe level value represents\na formidable computational problem. To locate better sequences for this\nproblem, we designed a stochastic algorithm that uses two fitness functions. In\nthese fitness functions, the value of the autocorrelation function has a\ndifferent impact on the final fitness value. It is defined with the value of\nthe exponent over the autocorrelation function values. Each function is used in\nthe corresponding optimization phase, and the optimization process switches\nbetween these two phases until the stopping condition is satisfied. The\nproposed algorithm was implemented using the compute unified device\narchitecture and therefore allowed us to exploit the computational power of\ngraphics processing units. This algorithm was tested on sequences with lengths\n$L = 2^m - 1$, for $14 \\le m \\le 20$. From the obtained results it is evident\nthat the usage of two fitness functions improved the efficiency of the\nalgorithm significantly, new-best known solutions were achieved, and the\nachieved PSL values were significantly less than $\\sqrt{L}$.\n", "doi": "10.1016/j.eswa.2024.124032", "arxiv_id": "2107.09801", "pdf_urls": ["https://arxiv.org/pdf/2107.09801"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Borko Bo\\v{s}kovi\\'c, Janez Brest, Two-phase optimization of\n  binary sequences with low peak sidelobe level value, Expert Systems with\n  Applications, Volume 251, 2024", "categories": "cs.AI"}
{"title": "A cubic ring of integers with the smallest Pythagoras number", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jakub Kr\\'asensk\\'y"], "abstract": "  We prove that the ring of integers in the totally real cubic subfield\n$K^{(49)}$ of the cyclotomic field $\\mathbb{Q}(\\zeta_7)$ has Pythagoras number\nequal to $4$. This is the smallest possible value for a totally real number\nfield of odd degree. Moreover, we determine which numbers are sums of integral\nsquares in this field, and use this knowledge to construct a diagonal universal\nquadratic form in five variables.\n", "doi": "10.1007/s00013-021-01662-5", "arxiv_id": "2107.11772", "pdf_urls": ["https://arxiv.org/pdf/2107.11772"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 118, 39--48 (2022)", "categories": "math.NT"}
{"title": "DYPLODOC: Dynamic Plots for Document Classification", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Anastasia Malysheva", "Alexey Tikhonov", "Ivan P. Yamshchikov"], "abstract": "  Narrative generation and analysis are still on the fringe of modern natural\nlanguage processing yet are crucial in a variety of applications. This paper\nproposes a feature extraction method for plot dynamics. We present a dataset\nthat consists of the plot descriptions for thirteen thousand TV shows alongside\nmeta-information on their genres and dynamic plots extracted from them. We\nvalidate the proposed tool for plot dynamics extraction and discuss possible\napplications of this method to the tasks of narrative analysis and generation.\n", "doi": "10.3233/faia210283", "arxiv_id": "2107.12226", "pdf_urls": ["https://arxiv.org/pdf/2107.12226"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "in Modern Management based on Big Data II and Machine Learning and\n  Intelligent Systems III 2021 (pp. 511-519). IOS Press", "categories": "cs.CL cs.AI"}
{"title": "Digital Twin As A Cost Reduction Method", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Suleyman Yukcu", "Omer Aydin"], "abstract": "  Many fields have been affected by the introduction of concepts such as\nsensors, industry 4.0, internet of things, machine learning and artificial\nintelligence in recent years. As a result of the interaction of cyber physical\nsystems with these concepts, digital twin model has emerged. The concept of\ndigital twin has been used in many areas with its emergence. The use of this\nmodel has made significant gains, especially in decision making processes. The\ngains in decision making processes contribute to every field and cause changes\nin terms of cost. In this study, the historical development of the concept of\ndigital twin has been mentioned and general information about the usage areas\nof digital twin has been given. In the light of this information, the cost\neffect of the digital twin model, therefore its appearance from the cost\naccounting window and its use as a cost reduction method were evaluated. This\nstudy was carried out in order to shed light on the studies with the\ninsufficient resources in the Turkish literature and the cost accounting\nperspective.\n", "doi": "10.31460/mbdd.694571", "arxiv_id": "2107.14109", "pdf_urls": ["https://arxiv.org/pdf/2107.14109"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Muhasebe Bilim Dunyas{\\i} Dergisi , 22 (3) , 563-579", "categories": "cs.OH econ.GN q-fin.EC q-fin.GN"}
{"title": "Adaptive Optimizers with Sparse Group Lasso for Neural Networks in CTR\n  Prediction", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yun Yue", "Yongchao Liu", "Suo Tong", "Minghao Li", "Zhen Zhang", "Chunyang Wen", "Huanjun Bao", "Lihong Gu", "Jinjie Gu", "Yixiang Mu"], "abstract": "  We develop a novel framework that adds the regularizers of the sparse group\nlasso to a family of adaptive optimizers in deep learning, such as Momentum,\nAdagrad, Adam, AMSGrad, AdaHessian, and create a new class of optimizers, which\nare named Group Momentum, Group Adagrad, Group Adam, Group AMSGrad and Group\nAdaHessian, etc., accordingly. We establish theoretically proven convergence\nguarantees in the stochastic convex settings, based on primal-dual methods. We\nevaluate the regularized effect of our new optimizers on three large-scale\nreal-world ad click datasets with state-of-the-art deep learning models. The\nexperimental results reveal that compared with the original optimizers with the\npost-processing procedure which uses the magnitude pruning method, the\nperformance of the models can be significantly improved on the same sparsity\nlevel. Furthermore, in comparison to the cases without magnitude pruning, our\nmethods can achieve extremely high sparsity with significantly better or highly\ncompetitive performance. The code is available at\nhttps://github.com/intelligent-machine-learning/tfplus/tree/main/tfplus.\n", "doi": "10.1007/978-3-030-86523-8\\_19", "arxiv_id": "2107.14432", "pdf_urls": ["https://arxiv.org/pdf/2107.14432"], "github": ["https://github.com/intelligent-machine-learning/dlrover", "https://github.com/intelligent-machine-learning/tfplus"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Machine Learning and Knowledge Discovery in Databases. Research\n  Track - European Conference, ECML PKDD 2021, Bilbao, Spain, September 13-17,\n  2021, Proceedings, Part III", "categories": "cs.LG"}
{"title": "Two-sample goodness-of-fit tests on the flat torus based on Wasserstein\n  distance and their relevance to structural biology", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Javier Gonz\\'alez-Delgado", "Alberto Gonz\\'alez-Sanz", "Juan Cort\\'es and\n  Pierre Neuvial"], "abstract": "  This work is motivated by the study of local protein structure, which is\ndefined by two variable dihedral angles that take values from probability\ndistributions on the flat torus. Our goal is to provide the space\n$\\mathcal{P}(\\mathbb{R}^2/\\mathbb{Z}^2)$ with a metric that quantifies local\nstructural modifications due to changes in the protein sequence, and to define\nassociated two-sample goodness-of-fit testing approaches. Due to its\nadaptability to the space geometry, we focus on the Wasserstein distance as a\nmetric between distributions.\n  We extend existing results of the theory of Optimal Transport to the\n$d$-dimensional flat torus $\\mathbb{T}^d=\\mathbb{R}^d/\\mathbb{Z}^d$, in\nparticular a Central Limit Theorem. Moreover, we propose different approaches\nfor two-sample goodness-of-fit testing for the one and two-dimensional case,\nbased on the Wasserstein distance. We prove their validity and consistency. We\nprovide an implementation of these tests in \\textsf{R}. Their performance is\nassessed by numerical experiments on synthetic data and illustrated by an\napplication to protein structure data.\n", "doi": "10.1214/23-ejs2135", "arxiv_id": "2108.00165", "pdf_urls": ["https://arxiv.org/pdf/2108.00165"], "github": ["https://github.com/gonzalez-delgado/torustest"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Gonz\\'alez-Delgado, A. Gonz\\'alez-Sanz, J. Cort\\'es, P.\n  Neuvial. Two-sample goodness-of-fit tests on the flat torus based on\n  Wasserstein distance and their relevance to structural biology. Electron. J.\n  Statist., 17(1) 1547-1586, 2023", "categories": "stat.ME"}
{"title": "Groot: An Event-graph-based Approach for Root Cause Analysis in\n  Industrial Settings", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hanzhang Wang", "Zhengkai Wu", "Huai Jiang", "Yichao Huang", "Jiamu Wang", "Selcuk Kopru", "Tao Xie"], "abstract": "  For large-scale distributed systems, it's crucial to efficiently diagnose the\nroot causes of incidents to maintain high system availability. The recent\ndevelopment of microservice architecture brings three major challenges (i.e.,\noperation, system scale, and monitoring complexities) to root cause analysis\n(RCA) in industrial settings. To tackle these challenges, in this paper, we\npresent Groot, an event-graph-based approach for RCA. Groot constructs a\nreal-time causality graph based on events that summarize various types of\nmetrics, logs, and activities in the system under analysis. Moreover, to\nincorporate domain knowledge from site reliability engineering (SRE) engineers,\nGroot can be customized with user-defined events and domain-specific rules.\nCurrently, Groot supports RCA among 5,000 real production services and is\nactively used by the SRE teamin a global e-commerce system serving more than\n185 million active buyers per year. Over 15 months, we collect a data\nsetcontaining labeled root causes of 952 real production incidents for\nevaluation. The evaluation results show that Groot is able to achieve 95% top-3\naccuracy and 78% top-1 accuracy. To share our experience in deploying and\nadopting RCA in industrial settings, we conduct survey to show that users of\nGrootfindit helpful and easy to use. We also share the lessons learnedfrom\ndeploying and adopting Grootto solve RCA problems inproduction environments.\n", "doi": null, "arxiv_id": "2108.00344", "pdf_urls": ["https://arxiv.org/pdf/2108.00344"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the thirty-sixth IEEE/ACM international conference\n  on Automated software engineering, 2021", "categories": "cs.SE"}
{"title": "Particle resolved simulation of sediment transport by a hybrid parallel\n  approach", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhengping Zhu", "Ruifeng Hu", "Yinghaonan Lei", "Lian Shen", "Xiaojing Zheng"], "abstract": "  Sediment transport over an erodible sediment bed is studied by particle\nresolved simulations with a hybrid parallel approach. To overcome the\nchallenges of load imbalance in the traditional domain decomposition method\nwhen encountering highly uneven distributions of particles in sediment\ntransport, the parallel approach of Darmana et al.(2006) originally developed\nfor point particle simulations is modified and implemented into particle\nresolved simulations. A novel memory optimization technique is proposed to\nreduce the memory requirement of the hybrid approach for spherical particles\nwith equal size. The present hybrid parallel approach shows good scalability\nand high parallel efficiency in a challenging sediment transport test case with\nmore than a million spherical particles. Our code is validated by several\nbenchmark cases, and the results show good agreement with experimental and\ncomputational data in the literature. Furthermore, a turbulent flow over an\nerodible sediment bed is simulated. An extraction method is proposed to\ndistinguish the saltating and rolling particles and extract impact and rebound\ninformation of the particle-mobile bed interaction. The probability\ndistribution functions (PDF) of several saltation parameters such as velocity,\nangle, and spanwise angular velocity of impact and rebound events are\npresented. Splash functions are established for the particle-mobile bed\ninteraction in the turbulent flow, which was rarely investigated in the\nexperiments and is helpful to model the complex particle-bed interactions in\nturbulent flow.\n", "doi": "10.1016/j.ijmultiphaseflow.2022.104072", "arxiv_id": "2108.01814", "pdf_urls": ["https://arxiv.org/pdf/2108.01814"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow, 152, 104072 (2022)", "categories": "physics.flu-dyn physics.comp-ph"}
{"title": "Privacy-Preserving Synthetic Location Data in the Real World", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Teddy Cunningham", "Graham Cormode", "Hakan Ferhatosmanoglu"], "abstract": "  Sharing sensitive data is vital in enabling many modern data analysis and\nmachine learning tasks. However, current methods for data release are\ninsufficiently accurate or granular to provide meaningful utility, and they\ncarry a high risk of deanonymization or membership inference attacks. In this\npaper, we propose a differentially private synthetic data generation solution\nwith a focus on the compelling domain of location data. We present two methods\nwith high practical utility for generating synthetic location data from real\nlocations, both of which protect the existence and true location of each\nindividual in the original dataset. Our first, partitioning-based approach\nintroduces a novel method for privately generating point data using kernel\ndensity estimation, in addition to employing private adaptations of classic\nstatistical techniques, such as clustering, for private partitioning. Our\nsecond, network-based approach incorporates public geographic information, such\nas the road network of a city, to constrain the bounds of synthetic data points\nand hence improve the accuracy of the synthetic data. Both methods satisfy the\nrequirements of differential privacy, while also enabling accurate generation\nof synthetic data that aims to preserve the distribution of the real locations.\nWe conduct experiments using three large-scale location datasets to show that\nthe proposed solutions generate synthetic location data with high utility and\nstrong similarity to the real datasets. We highlight some practical\napplications for our work by applying our synthetic data to a range of location\nanalytics queries, and we demonstrate that our synthetic data produces\nnear-identical answers to the same queries compared to when real data is used.\nOur results show that the proposed approaches are practical solutions for\nsharing and analyzing sensitive location data privately.\n", "doi": "10.1145/3469830.3470893", "arxiv_id": "2108.02089", "pdf_urls": ["https://arxiv.org/pdf/2108.02089"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "17th International Symposium on Spatial and Temporal Databases\n  (SSTD '21), 2021", "categories": "cs.DB cs.CR"}
{"title": "On rank statistics of PageRank and MarkovRank", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yoichi Nishiyama"], "abstract": "  The well-known statistic PageRank was created in 1998 by co-founders of\nGoogle, Sergey Brin and Larry Page, to optimize the ranking of websites for\ntheir search engine outcomes. It is computed using an iterative algorithm,\nbased on the idea that nodes with a larger number of incoming edges are more\nimportant. Google's PageRank involves some information from ``aliens''; the 15%\nof information is regarded as the connections from the outside of the network\nsystem under consideration.\n  In this paper, seeking a stable statistic which is ``close'' to an\n``intrinsic'' version of PageRank, we will introduce a new statistic called\nMarkovRank. A special attention will be paid to the comparison of rank\nstatistics among standard-PageRank,``intrinsic-PageRank'' and MarkovRank. It is\nconcluded that the rank statistic of MarkovRank, which is always well-defined,\nis identical to that of ``intrinsic-PageRank'', as far as the latter is\nwell-defined.\n", "doi": null, "arxiv_id": "2108.02826", "pdf_urls": ["https://arxiv.org/pdf/2108.02826"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Waseda Global Forum No.19, 2022. 159-180", "categories": "stat.CO"}
{"title": "jVMC: Versatile and performant variational Monte Carlo leveraging\n  automated differentiation and GPU acceleration", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Markus Schmitt and Moritz Reh"], "abstract": "  The introduction of Neural Quantum States (NQS) has recently given a new\ntwist to variational Monte Carlo (VMC). The ability to systematically reduce\nthe bias of the wave function ansatz renders the approach widely applicable.\nHowever, performant implementations are crucial to reach the numerical state of\nthe art. Here, we present a Python codebase that supports arbitrary NQS\narchitectures and model Hamiltonians. Additionally leveraging automatic\ndifferentiation, just-in-time compilation to accelerators, and distributed\ncomputing, it is designed to facilitate the composition of efficient NQS\nalgorithms.\n", "doi": "10.21468/scipostphyscodeb.2", "arxiv_id": "2108.03409", "pdf_urls": ["https://arxiv.org/pdf/2108.03409"], "github": ["https://github.com/markusschmitt/vmc_jax"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SciPost Phys. Codebases 2 (2022)", "categories": "physics.comp-ph cond-mat.dis-nn cond-mat.str-el"}
{"title": "Recommender Systems for Software Project Managers", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Liang Wei", "Luiz Fernando Capretz"], "abstract": "  The design of recommendation systems is based on complex information\nprocessing and big data interaction. This personalized view has evolved into a\nhot area in the past decade, where applications might have been proved to help\nfor solving problem in the software development field. Therefore, with the\nevolvement of Recommendation System in Software Engineering (RSSE), the\ncoordination of software projects with their stakeholders is improving. This\nexperiment examines four open source recommender systems and implemented a\ncustomized recommender engine with two industrial-oriented packages: Lenskit\nand Mahout. Each of the main functions was examined and issues were identified\nduring the experiment.\n", "doi": "10.1145/3463274.3463951", "arxiv_id": "2108.04311", "pdf_urls": ["https://arxiv.org/pdf/2108.04311"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Evaluation and Assessment in Software\n  Engineering (EASE 2021), Trondheim, Norway, pp. 412-417, ACM Press, June 2021", "categories": "cs.SE"}
{"title": "An electron as a wave packet in the relativistic strophotron fel", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["M. Hnatic", "P. Kopcansky", "K.B. Oganesyan"], "abstract": "  We study the initial distribution of electrons in relativistic strophotron\nFEL over vibrational levels determined by the expansion coefficients. We show\nthe quantity of the vibrational level can be expressed in terms of the initial\nparameters of the electron beam.\n", "doi": "10.1088/1612-202x/ac3eeb", "arxiv_id": "2108.05394", "pdf_urls": ["https://arxiv.org/pdf/2108.05394"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Lett. 2022, v.19, 1", "categories": "physics.acc-ph"}
{"title": "Colour remote sensing of the impact of artificial light at night (II):\n  Calibration of DSLR-based images from the International Space Station", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Alejandro S\\'anchez de Miguel and Jaime Zamorano and Martin Aub\\'e and\n  Jonathan Bennie and Jes\\'us Gallego and Francisco Oca\\~na and Donald R.Pettit\n  and William L.Stefanov and Kevin J.Gaston"], "abstract": "  Nighttime images taken with DSLR cameras from the International Space Station\n(ISS) can provide valuable information on the spatial and temporal variation of\nartificial nighttime lighting on Earth. In particular, this is the only source\nof historical and current visible multispectral data across the world (DMSP/OLS\nand SNPP/VIIRS-DNB data are panchromatic and multispectral in the infrared but\nnot at visible wavelengths). The ISS images require substantial processing and\nproper calibration to exploit intensities and ratios from the RGB channels.\nHere we describe the different calibration steps, addressing in turn\nDecodification, Linearity correction (ISO dependent), Flat field/Vignetting,\nSpectral characterization of the channels, Astrometric\ncalibration/georeferencing, Photometric calibration (stars)/Radiometric\ncorrection (settings correction - by exposure time, ISO, lens transmittance,\netc) and Transmittance correction (window transmittance, atmospheric\ncorrection). We provide an example of the application of this processing method\nto an image of Spain.\n", "doi": "10.1016/j.rse.2021.112611", "arxiv_id": "2108.07050", "pdf_urls": ["https://arxiv.org/pdf/2108.07050"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "S\\'anchez de Miguel et. al. (2021). Colour remote sensing of the\n  impact of artificial light at night (II): Calibration of DSLR-based images\n  from the International Space Station. Remote Sensing of Environment, 112611", "categories": "astro-ph.IM physics.app-ph physics.ins-det physics.optics"}
{"title": "Dynamics of Evaporating Respiratory Droplets in the Vicinity of Vortex\n  Dipoles", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Orr Avni and Yuval Dagan"], "abstract": "  A new mathematical analysis of exhaled respiratory droplet dynamics and\nsettling distances in the vicinity of vortical environments is presented.\nRecent experimental and theoretical studies suggest that vortical flow\nstructures may enhance the settling distances of exhaled respiratory droplets\nbeyond the two-meter distancing rule recommended by health authorities lately.\nWe propose a mathematical framework to study the underlying physical mechanism\nresponsible for the entrapment and subsequently delayed settling times of\nevaporating droplets and solid particles. A dipolar vortex is considered\nself-propelling through a cloud of micron-sized evaporating droplets. This\nconfiguration might be utilized to approximate an indoor environment in which\nsimilar unsteady vortical flow structures interact with exhaled respiratory\ndroplets. We demonstrate the vortex dipole effect on droplet and solid\nparticles settling distances, depending on the evaporation rate, the vorticity\nof the dipole, and the droplet's initial diameter and location relative to the\nvortex core. Our theoretical analysis reveals non-intuitive interactions\nbetween the vortex dipole, droplet relaxation time, gravity, and mass transfer.\nThe existence of optimal conditions for maximum displacement is suggested,\nwhere the droplet entrainment reaches up to an order of magnitude larger than\nthe vortex core length scale. We present a basic model that may be applied for\nevaluating the spread of exhaled respiratory droplets in vortical environments.\nOur theoretical study suggests that exhaled respiratory droplets initially at\nrest can translate to significant distances, hence implying that vortical flow\nmight enhance the transmission of airborne pathogens.\n", "doi": "10.1016/j.ijmultiphaseflow.2021.103901", "arxiv_id": "2108.07068", "pdf_urls": ["https://arxiv.org/pdf/2108.07068"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Orr Avni, Yuval Dagan, Dynamics of evaporating respiratory\n  droplets in the vicinity of vortex dipoles, International Journal of\n  Multiphase Flow, Volume 148, 2022, 103901, ISSN 0301-9322,", "categories": "physics.flu-dyn physics.med-ph"}
{"title": "Accounting for multiple imputation-induced variability for differential\n  analysis in mass spectrometry-based label-free quantitative proteomics", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marie Chion", "Christine Carapito and Fr\\'ed\\'eric Bertrand"], "abstract": "  Imputing missing values is common practice in label-free quantitative\nproteomics. Imputation aims at replacing a missing value with a user-defined\none. However, the imputation itself may not be optimally considered downstream\nof the imputation process, as imputed datasets are often considered as if they\nhad always been complete. Hence, the uncertainty due to the imputation is not\nadequately taken into account. We provide a rigorous multiple imputation\nstrategy, leading to a less biased estimation of the parameters' variability\nthanks to Rubin's rules. The imputation-based peptide's intensities' variance\nestimator is then moderated using Bayesian hierarchical models. This estimator\nis finally included in moderated t-test statistics to provide differential\nanalyses results. This workflow can be used both at peptide and protein-level\nin quantification datasets. For protein-level results based on peptide-level\nquantification data, an aggregation step is also included. Our methodology,\nnamed mi4p, was compared to the state-of-the-art limma workflow implemented in\nthe DAPAR R package, both on simulated and real datasets. We observed a\ntrade-off between sensitivity and specificity, while the overall performance of\nmi4p outperforms DAPAR in terms of F-Score.\n", "doi": "10.1371/journal.pcbi.1010420", "arxiv_id": "2108.07086", "pdf_urls": ["https://arxiv.org/pdf/2108.07086"], "github": ["https://github.com/cran/mi4p", "https://github.com/mariechion/mi4p"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Chion M, Carapito C, Bertrand F (2022) Accounting for multiple\n  imputation-induced variability for differential analysis in mass\n  spectrometry-based label-free quantitative proteomics. PLoS Comput Biol\n  18(8): e1010420", "categories": "stat.ME q-bio.QM stat.AP"}
{"title": "Challenges and Applications of Automated Extraction of Socio-political\n  Events from Text (CASE 2021): Workshop and Shared Task Report", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ali H\\\"urriyeto\\u{g}lu", "Hristo Tanev", "Vanni Zavarella", "Jakub\n  Piskorski", "Reyyan Yeniterzi", "and Erdem Y\\\"or\\\"uk"], "abstract": "  This workshop is the fourth issue of a series of workshops on automatic\nextraction of socio-political events from news, organized by the Emerging\nMarket Welfare Project, with the support of the Joint Research Centre of the\nEuropean Commission and with contributions from many other prominent scholars\nin this field. The purpose of this series of workshops is to foster research\nand development of reliable, valid, robust, and practical solutions for\nautomatically detecting descriptions of socio-political events, such as\nprotests, riots, wars and armed conflicts, in text streams. This year workshop\ncontributors make use of the state-of-the-art NLP technologies, such as Deep\nLearning, Word Embeddings and Transformers and cover a wide range of topics\nfrom text classification to news bias detection. Around 40 teams have\nregistered and 15 teams contributed to three tasks that are i) multilingual\nprotest news detection, ii) fine-grained classification of socio-political\nevents, and iii) discovering Black Lives Matter protest events. The workshop\nalso highlights two keynote and four invited talks about various aspects of\ncreating event data sets and multi- and cross-lingual machine learning in few-\nand zero-shot settings.\n", "doi": null, "arxiv_id": "2108.07865", "pdf_urls": ["https://arxiv.org/pdf/2108.07865"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 4th Workshop on Challenges and Applications of\n  Automated Extraction of Socio-political Events from Text (CASE 2021)", "categories": "cs.CL"}
{"title": "Mapping of Ebola virus spillover: Suitability and seasonal variability\n  at the landscape scale", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Larisa Lee-Cruz", "Maxime Lenormand", "Julien Cappelle", "Alexandre Caron", "H\\'el\\`ene De Nys", "Martine Peeters", "Mathieu Bourgarel", "Fran\\c{c}ois Roger and\n  Annelise Tran"], "abstract": "  The unexpected Ebola virus outbreak in West Africa in 2014 involving the\nZaire ebolavirus made clear that other regions outside Central Africa, its\npreviously documented niche, were at risk of future epidemics. The complex\ntransmission cycle and a lack of epidemiological data make mapping areas at\nrisk of the disease challenging. We used a Geographic Information System-based\nmulticriteria evaluation (GIS-MCE), a knowledge-based approach, to identify\nareas suitable for Ebola virus spillover to humans in regions of Guinea, Congo\nand Gabon where Ebola viruses already emerged. We identified environmental,\nclimatic and anthropogenic risk factors and potential hosts from a literature\nreview. Geographical data layers, representing risk factors, were combined to\nproduce suitability maps of Ebola virus spillover at the landscape scale. Our\nmaps show high spatial and temporal variability in the suitability for Ebola\nvirus spillover at a fine regional scale. Reported spillover events fell in\nareas of intermediate to high suitability in our maps, and a sensitivity\nanalysis showed that the maps produced were robust. There are still important\ngaps in our knowledge about what factors are associated with the risk of Ebola\nvirus spillover. As more information becomes available, maps produced using the\nGIS-MCE approach can be easily updated to improve surveillance and the\nprevention of future outbreaks.\n", "doi": "10.1371/journal.pntd.0009683", "arxiv_id": "2108.10708", "pdf_urls": ["https://arxiv.org/pdf/2108.10708"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "PLOS Neglected Tropical Diseases 15, e0009683 (2021)", "categories": "q-bio.PE q-bio.QM"}
{"title": "Learning Highly Recursive Input Grammars", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Neil Kulkarni", "Caroline Lemieux", "Koushik Sen"], "abstract": "  This paper presents Arvada, an algorithm for learning context-free grammars\nfrom a set of positive examples and a Boolean-valued oracle. Arvada learns a\ncontext-free grammar by building parse trees from the positive examples.\nStarting from initially flat trees, Arvada builds structure to these trees with\na key operation: it bubbles sequences of sibling nodes in the trees into a new\nnode, adding a layer of indirection to the tree. Bubbling operations enable\nrecursive generalization in the learned grammar. We evaluate Arvada against\nGLADE and find it achieves on average increases of 4.98x in recall and 3.13x in\nF1 score, while incurring only a 1.27x slowdown and requiring only 0.87x as\nmany calls to the oracle. Arvada has a particularly marked improvement over\nGLADE on grammars with highly recursive structure, like those of programming\nlanguages.\n", "doi": null, "arxiv_id": "2108.13340", "pdf_urls": ["https://arxiv.org/pdf/2108.13340"], "github": ["https://github.com/neil-kulkarni/arvada"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In Proceedings of the 36th IEEE/ACM International Conference on\n  Automated Software Engineering (ASE 2021)", "categories": "cs.SE cs.PL"}
{"title": "A note on uncertainty relations of arbitrary N quantum channels", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Qing-Hua Zhang", "Jing-Feng Wu and Shao-Ming Fei"], "abstract": "  Uncertainty principle plays a vital role in quantum physics. The\nWigner-Yanase skew information characterizes the uncertainty of an observable\nwith respect to the measured state. We generalize the uncertainty relations for\ntwo quantum channels to arbitrary N quantum channels based on Wigner-Yanase\nskew information. We illustrate that these uncertainty inequalities are tighter\nthan the existing ones by detailed examples. Especially, we also discuss the\nuncertainty relations for N unitary channels, which could be regarded as\nvariance-based sum uncertainty relations with respect to any pure state.\n", "doi": "10.1088/1612-202x/ac1e30", "arxiv_id": "2109.01345", "pdf_urls": ["https://arxiv.org/pdf/2109.01345"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 18 (2021) 095204 (6pp)", "categories": "quant-ph"}
{"title": "Multi-party Semi-quantum Secret Sharing Protocol based on Measure-flip\n  and Reflect Operations", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Li Jian", "Chong-Qiang Ye"], "abstract": "  Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks\nin quantum secure multi-party computations, offering the advantage of not\nrequiring all users to possess intricate quantum devices. However, the current\nlandscape of SQSS protocols predominantly caters to bipartite scenarios,\nrendering them inadequate for practical multi-party secret sharing\nrequirements. Addressing this gap, this paper proposes a novel SQSS protocol\nbased on multi-particle GHZ states. In this protocol, the quantum user\ndistributes predetermined secret information to multiple classical users with\nlimited quantum capabilities, necessitating collaborative efforts among all\nclassical users to reconstruct the correct secret information. By utilizing\nmeasure-flip and reflect operations, the transmitted multi-particle GHZ states\ncan all contribute keys, thereby improving the utilization of transmitted\nparticles. Security analysis shows that the protocol's resilience against\nprevalent external and internal threats. Additionally, employing IBM Qiskit, we\nconduct quantum circuit simulations to validate the protocol's accuracy and\nfeasibility. Compared with similar studies, the proposed protocol has\nadvantages in terms of protocol scalability, qubit efficiency, and shared\nmessage types.\n", "doi": null, "arxiv_id": "2109.01380", "pdf_urls": ["https://arxiv.org/pdf/2109.01380"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Physics Letters 2024", "categories": "quant-ph"}
{"title": "N-extension closed subcategories of (n+2)-angulated categories", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Panyue Zhou"], "abstract": "  Let $\\mathscr C$ be a Krull-Schmidt $(n+2)$-angulated category and $\\mathscr\nA$ be an $n$-extension closed subcategory of $\\mathscr C$. Then $\\mathscr A$\nhas the structure of an $n$-exangulated category in the sense of\nHerschend-Liu-Nakaoka. This construction gives $n$-exangulated categories which\nare not $n$-exact categories in the sense of Jasso nor $(n+2)$-angulated\ncategories in the sense of Geiss-Keller-Oppermann in general. As an\napplication, our result can lead to a recent main result of Klapproth.\n", "doi": null, "arxiv_id": "2109.02068", "pdf_urls": ["https://arxiv.org/pdf/2109.02068"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel) 118 (2022), no. 4, 375-382", "categories": "math.RT math.CT"}
{"title": "A theory of reflective X-ray multilayer structures with graded period\n  and its applications", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["R.M. Feshchenko"], "abstract": "  In this paper a theory of reflective X-ray multilayer structures with a\ngraded (slowly varying) period based on the coupled waves method and\nquasi-classical asymptotic expansions is reported. A number of exact solutions\nof the coupled wave equations is obtained and analyzed demonstrating\nsuitability of this method for the description of the reflective properties of\nthe graded multilayers. The developed theory is then used as a basis for the\nsolution of the inverse problem, i.e. designing multilayer structures with a\npre-specified reflectivity dependence on the wavelength or grazing angle. A\nnumber numerical experiments is conducted to demonstrate the capabilities of\nthe proposed method in designing reflective multilayer coatings with an\narbitrary shape of the reflectivity curve. The problem of maximization of the\nintegral reflectivity is considered and a second order differential equation,\nwhich solutions correspond to multilayer structures with the maximal\nreflectivity, is derived. Finally, an upper limit on the integral reflectivity\nachievable with a graded multilayer is estimated.\n", "doi": "10.1007/s10946-022-10032-7", "arxiv_id": "2109.05330", "pdf_urls": ["https://arxiv.org/pdf/2109.05330"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, 43(2), 148-161 (2022)", "categories": "physics.optics"}
{"title": "Modelling the Utility of Group Testing for Public Health Surveillance", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["G\\\"unther Koliander and Georg Pichler"], "abstract": "  In epidemic or pandemic situations, resources for testing the infection\nstatus of individuals may be scarce. Although group testing can help to\nsignificantly increase testing capabilities, the (repeated) testing of entire\npopulations can exceed the resources of any country. We thus propose an\nextension of the theory of group testing that takes into account the fact that\ndefinitely specifying the infection status of each individual is impossible.\nOur theory builds on assigning to each individual an infection status\n(healthy/infected), as well as an associated cost function for erroneous\nassignments. This cost function is versatile, e.g., it could take into account\nthat false negative assignments are worse than false positive assignments and\nthat false assignments in critical areas, such as health care workers, are more\nsevere than in the general population. Based on this model, we study the\noptimal use of a limited number of tests to minimize the expected cost. More\nspecifically, we utilize information-theoretic methods to give a lower bound on\nthe expected cost and describe simple strategies that can significantly reduce\nthe expected cost over currently known strategies. A detailed example is\nprovided to illustrate our theory.\n", "doi": "10.1016/j.idm.2021.08.002", "arxiv_id": "2109.05378", "pdf_urls": ["https://arxiv.org/pdf/2109.05378"], "github": ["https://github.com/g-pichler/group-testing"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Infectious Disease Modelling, vol. 6, 2021, p. 1009-1024", "categories": "q-bio.PE cs.IT math.IT"}
{"title": "SAFRAN: An interpretable, rule-based link prediction method\n  outperforming embedding models", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Simon Ott", "Christian Meilicke", "Matthias Samwald"], "abstract": "  Neural embedding-based machine learning models have shown promise for\npredicting novel links in knowledge graphs. Unfortunately, their practical\nutility is diminished by their lack of interpretability. Recently, the fully\ninterpretable, rule-based algorithm AnyBURL yielded highly competitive results\non many general-purpose link prediction benchmarks. However, current approaches\nfor aggregating predictions made by multiple rules are affected by\nredundancies. We improve upon AnyBURL by introducing the SAFRAN rule\napplication framework, which uses a novel aggregation approach called\nNon-redundant Noisy-OR that detects and clusters redundant rules prior to\naggregation. SAFRAN yields new state-of-the-art results for fully interpretable\nlink prediction on the established general-purpose benchmarks FB15K-237, WN18RR\nand YAGO3-10. Furthermore, it exceeds the results of multiple established\nembedding-based algorithms on FB15K-237 and WN18RR and narrows the gap between\nrule-based and embedding-based algorithms on YAGO3-10.\n", "doi": null, "arxiv_id": "2109.08002", "pdf_urls": ["https://arxiv.org/pdf/2109.08002"], "github": ["https://github.com/OpenBioLink/SAFRAN"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "3rd Conference on Automated Knowledge Base Construction (AKBC\n  2021)", "categories": "cs.AI cs.LG"}
{"title": "Segmentation of Brain MRI using an Altruistic Harris Hawks' Optimization\n  algorithm", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Rajarshi Bandyopadhyay", "Rohit Kundu", "Diego Oliva", "Ram Sarkar"], "abstract": "  Segmentation is an essential requirement in medicine when digital images are\nused in illness diagnosis, especially, in posterior tasks as analysis and\ndisease identification. An efficient segmentation of brain Magnetic Resonance\nImages (MRIs) is of prime concern to radiologists due to their poor\nillumination and other conditions related to de acquisition of the images.\nThresholding is a popular method for segmentation that uses the histogram of an\nimage to label different homogeneous groups of pixels into different classes.\nHowever, the computational cost increases exponentially according to the number\nof thresholds. In this paper, we perform the multi-level thresholding using an\nevolutionary metaheuristic. It is an improved version of the Harris Hawks\nOptimization (HHO) algorithm that combines the chaotic initialization and the\nconcept of altruism. Further, for fitness assignment, we use a hybrid objective\nfunction where along with the cross-entropy minimization, we apply a new\nentropy function, and leverage weights to the two objective functions to form a\nnew hybrid approach. The HHO was originally designed to solve numerical\noptimization problems. Earlier, the statistical results and comparisons have\ndemonstrated that the HHO provides very promising results compared with\nwell-established metaheuristic techniques. In this article, the altruism has\nbeen incorporated into the HHO algorithm to enhance its exploitation\ncapabilities. We evaluate the proposed method over 10 benchmark images from the\nWBA database of the Harvard Medical School and 8 benchmark images from the\nBrainweb dataset using some standard evaluation metrics.\n", "doi": "10.1016/j.knosys.2021.107468", "arxiv_id": "2109.08688", "pdf_urls": ["https://arxiv.org/pdf/2109.08688"], "github": ["https://github.com/rohit-kundu/segmentation-hho_altruism"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems,2021,107468, ISSN 0950-7051", "categories": "eess.IV cs.AI cs.CV cs.LG"}
{"title": "Community detection for weighted bipartite networks", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Huan Qing and Jingli Wang"], "abstract": "  The bipartite network appears in various areas, such as biology, sociology,\nphysiology, and computer science. \\cite{rohe2016co} proposed Stochastic\nco-Blockmodel (ScBM) as a tool for detecting community structure of binary\nbipartite graph data in network studies. However, ScBM completely ignores edge\nweight and is unable to explain the block structure of a weighted bipartite\nnetwork. Here, to model a weighted bipartite network, we introduce a Bipartite\nDistribution-Free model by releasing ScBM's distribution restriction. We also\nbuild an extension of the proposed model by considering the variation of node\ndegree. Our models do not require a specific distribution on generating\nelements of the adjacency matrix but only a block structure on the expected\nadjacency matrix. Spectral algorithms with theoretical guarantees on the\nconsistent estimation of node labels are presented to identify communities. Our\nproposed methods are illustrated by simulated and empirical examples.\n", "doi": "10.1016/j.knosys.2023.110643", "arxiv_id": "2109.10319", "pdf_urls": ["https://arxiv.org/pdf/2109.10319"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems (2023)", "categories": "stat.ML cs.IT cs.LG math.IT"}
{"title": "The SpinParser software for pseudofermion functional renormalization\n  group calculations on quantum magnets", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Finn Lasse Buessen"], "abstract": "  We present the SpinParser open-source software [\nhttps://github.com/fbuessen/SpinParser ]. The software is designed to perform\npseudofermion functional renormalization group (pf-FRG) calculations for\nfrustrated quantum magnets in two and three spatial dimensions. It aims to make\nsuch calculations readily accessible without the need to write specialized\nprogram code; instead, custom lattice graphs and microscopic spin models can be\ndefined as plain-text input files. Underlying symmetries of the model are\nautomatically analyzed and exploited by the numerical core written in C++ in\norder to optimize the performance across large-scale shared memory and/or\ndistributed memory computing platforms.\n", "doi": "10.21468/scipostphyscodeb.5", "arxiv_id": "2109.13317", "pdf_urls": ["https://arxiv.org/pdf/2109.13317"], "github": ["https://github.com/fbuessen/spinparser"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SciPost Phys. Codebases 5 (2022)", "categories": "physics.comp-ph cond-mat.mtrl-sci cond-mat.str-el"}
{"title": "On polyharmonic helices in space forms", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Volker Branding"], "abstract": "  In this article we study polyharmonic curves of constant curvature where we\nmostly focus on the case of curves on the sphere. We classify polyharmonic\ncurves of constant curvature in three-dimensional space forms and derive an\nexplicit family of polyharmonic curves on the sphere. Our results give new\ninsights into the geometric structure of higher order variational problems.\n", "doi": "10.1007/s00013-022-01809-y", "arxiv_id": "2109.13747", "pdf_urls": ["https://arxiv.org/pdf/2109.13747"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Arch. Math. (Basel), 120(2), 213-225, 2023", "categories": "math.DG"}
{"title": "Toxicity of Carbon Nanomaterials", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Arpita Adhikari and Joydip Sengupta"], "abstract": "  The outstanding multidisciplinary applicability of nanomaterials has paved\nthe path for the rapid advancement of nanoscience during the last few decades.\nSuch technological progress subsequently results in an inevitable environmental\nexposure of nanomaterials. Presently, nanomaterials are employed in an\nextensive range of commercial products. Safe and sustainable incorporation of\nnanomaterials in industrial products requires a profound and comprehensive\nunderstanding of their potential toxicity. Among different nanomaterials,\ncarbon nanomaterials marked its notable superiority toward the development of\nstate-of-the-art nanotechnology due to the significant contribution of each of\nthe carbon allotropes with varied dimensionality. The zero-dimensional\nfullerene, one-dimensional carbon nanotube, and two-dimensional graphene\npossess an exclusive combination of distinctive properties that are utilized in\nmost of the nanotechnology-based products nowadays. However, potential risk\nfactors are associated with the production and the use of carbon nanomaterials.\nConsequently, the number of studies regarding the assessment of the toxicity of\nthese nanomaterials has increased rapidly in the past decade. This chapter will\nsummarize the recent scientific efforts on the toxicity evaluation of different\ncarbon nanomaterials.\n", "doi": "10.1002/9783527830978.ch6", "arxiv_id": "2109.13918", "pdf_urls": ["https://arxiv.org/pdf/2109.13918"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In Environmental Applications of Carbon Nanomaterials-Based\n  Devices (eds S. Mallakpour and C.M. Hussain)", "categories": "cond-mat.mtrl-sci"}
{"title": "The impact of non-target events in synthetic soundscapes for sound event\n  detection", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Francesca Ronchini", "Romain Serizel", "Nicolas Turpault", "Samuele Cornell"], "abstract": "  Detection and Classification Acoustic Scene and Events Challenge 2021 Task 4\nuses a heterogeneous dataset that includes both recorded and synthetic\nsoundscapes. Until recently only target sound events were considered when\nsynthesizing the soundscapes. However, recorded soundscapes often contain a\nsubstantial amount of non-target events that may affect the performance. In\nthis paper, we focus on the impact of these non-target events in the synthetic\nsoundscapes. Firstly, we investigate to what extent using non-target events\nalternatively during the training or validation phase (or none of them) helps\nthe system to correctly detect target events. Secondly, we analyze to what\nextend adjusting the signal-to-noise ratio between target and non-target events\nat training improves the sound event detection performance. The results show\nthat using both target and non-target events for only one of the phases\n(validation or training) helps the system to properly detect sound events,\noutperforming the baseline (which uses non-target events in both phases). The\npaper also reports the results of a preliminary study on evaluating the system\non clips that contain only non-target events. This opens questions for future\nwork on non-target subset and acoustic similarity between target and non-target\nevents which might confuse the system.\n", "doi": "10.5281/zenodo.5770113", "arxiv_id": "2109.14061", "pdf_urls": ["https://arxiv.org/pdf/2109.14061"], "github": ["https://github.com/dcase-repo/desed_task"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 6th Detection and Classification of Acoustic\n  Scenes and Events 2021 Workshop (DCASE2021)", "categories": "eess.AS cs.LG cs.SD"}
{"title": "Demystifying Algorithmic Complexities and Geometric Review of the\n  'h'-Index", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Kaushik Ghosh and Mayukh Mukhopadhyay"], "abstract": "  The current discourse delves into the effectiveness of h-index as an author\nlevel metric. It further reviews and explains the algorithmic complexity of\ncalculating h-index through algebraic method. To conduct the algebraic analysis\npropositional algebra, algorithm and coding techniques have been used. Some use\ncases have been identified with a finite-data-set/set-of-array to demonstrate\nthe coding techniques and for further analysis. Finally, the explanation and\ncalculative complexities to determine the index have been further simplified\nthrough geometric method of calculating the h-index using the similar use cases\nthat was used for coding. It is concluded that determination of the h-index\nusing Euclidean geometric method with Cartesian frame of reference provides a\nthrough and visual clarification. Finally, a set of postulates has been\nproposed at the end of the paper, based on the case studies.\n", "doi": "10.5281/zenodo.5654779", "arxiv_id": "2109.15123", "pdf_urls": ["https://arxiv.org/pdf/2109.15123", "https://arxiv.org/pdf/2112.03172"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Five Shades of Emerging Business Cases, Eliva Press, Moldova, EU,\n  Chapter 6, pp. 91-110, 2021, ISBN 9781636483955", "categories": "cs.DL", "cited_by": 0}
{"title": "Molecular dynamics and optimization studies of horse prion protein wild\n  type and its S167D mutant", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiapu Zhang"], "abstract": "  Prion diseases or called transmissible spongiform encephalopathies are fatal\nneurodegenerative diseases characterised by the accumulation of an abnormal\nprion protein isoform (rich in beta-sheets - about 30% alpha-helix and 43%\nbeta-sheet), which is converted from the normal prion protein (predominant in\nalpha-helix - about 42% alpha-helix and 3% beta-sheet). However, prion disease\nhas not been reported in horses up to now; therefore, horses are known to be a\nspecies resistant to prion diseases. Residue S167 in horse has been cited as\ncritical protective residue for encoding prion protein conformational stability\nin prion-resistance. According to the protein-only hypothesis, abnormal prion\nprotein is responsible for both spongiform degeneration of the brain and\ndisease transmissibility. Thus, understanding the conformational dynamics of\nabnormal prion protein from normal prion protein is a key to developing\neffective therapies. This article is to do molecular dynamics and optimization\nstudies on the horse normal prion protein wild-type and its S167D mutant\nrespectively to understand their conformational dynamics and optimized\nconfirmation; interesting results will be discussed.\n", "doi": "10.3390/zoonoticdis4030017", "arxiv_id": "2110.00365", "pdf_urls": ["https://arxiv.org/pdf/2110.00365"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "MDPI journal Zoonotic Diseases 4(3):187-200 (2024)", "categories": "physics.bio-ph physics.med-ph"}
{"title": "Molten pool characteristics of a nickel-titanium shape memory alloy for\n  directed energy deposition", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Shiming Gao", "Yuncong Feng", "Jianjian Wang", "Mian Qin", "Ojo Philip\n  Bodunde", "Wei-Hsin Liao", "Ping Guo"], "abstract": "  Fabrication of nickel-titanium shape memory alloy through additive\nmanufacturing has attracted increasing interest due to its advantages of\nflexible manufacturing capability, low-cost customization, and minimal defects.\nThe process parameters in directed energy deposition (DED) have a crucial\nimpact on its molten pool characteristics (geometry, microstructure, etc.),\nthus influencing the final properties of shape memory effect and\npseudoelasticity. In this paper, a three-dimensional numerical model\nconsidering heat transfer, phase change, and fluid flow has been developed to\nsimulate the cladding geometry, melt pool depth, and deposition rate. The\nexperimental and simulated results indicated that laser power plays a critical\nrole in determining the melt pool width and deposition rate while scan speed\nand powder feed rate have less effect on cladding geometry and deposition rate.\nThe fluid velocity has a huge influence on the distribution of elements in the\nmolten pool. The temperature gradient G, solidification rate R, as well as\nshape factor G/R were calculated to illustrate the underlying mechanisms of\ngrain structure evolution. The grain morphology distribution of cross-section\nfrom the experimental samples agreed well with the simulation results. The\nmodel reported in this paper is expected to shed light on the optimization of\nthe deposition process and grain structure prediction.\n", "doi": "10.1016/j.optlastec.2021.107215", "arxiv_id": "2110.01145", "pdf_urls": ["https://arxiv.org/pdf/2110.01145"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics & Laser Technology, 142, 107215 (2021)", "categories": "cond-mat.mtrl-sci physics.app-ph"}
{"title": "Internal Data Imputation in Data Warehouse Dimensions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Yuzhao Yang (IRIT-SIG)", "Fatma Abdelhedi", "J\\'er\\^ome Darmont (ERIC)", "Franck Ravat (IRIT-SIG)", "Olivier Teste (IRIT-SIG)"], "abstract": "  Missing values occur commonly in the multidimensional data warehouses. They\nmay generate problems of usefulness of data since the analysis performed on a\nmultidimensional data warehouse is through different dimensions with\nhierarchies where we can roll up or drill down to the different parameters of\nanalysis. Therefore, it's essential to complete these missing values in order\nto carry out a better analysis. There are existing data imputation methods\nwhich are suitable for numeric data, so they can be applied for fact tables but\nnot for dimension tables. Some other data imputation methods need extra time\nand effort costs. As consequence, we propose in this article an internal data\nimputation method for multidimensional data warehouse based on the existing\ndata and considering the intra-dimension and inter-dimension relationships.\n", "doi": "10.1007/978-3-030-86472-9_22", "arxiv_id": "2110.01228", "pdf_urls": ["https://arxiv.org/pdf/2110.01228"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "32nd International Conference on Database and Expert Systems\n  Applications (DEXA 2021), Sep 2021, Linz, Austria. pp.237-244", "categories": "cs.DB"}
{"title": "Local and Global Context-Based Pairwise Models for Sentence Ordering", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ruskin Raj Manku and Aditya Jyoti Paul"], "abstract": "  Sentence Ordering refers to the task of rearranging a set of sentences into\nthe appropriate coherent order. For this task, most previous approaches have\nexplored global context-based end-to-end methods using Sequence Generation\ntechniques. In this paper, we put forward a set of robust local and global\ncontext-based pairwise ordering strategies, leveraging which our prediction\nstrategies outperform all previous works in this domain. Our proposed encoding\nmethod utilizes the paragraph's rich global contextual information to predict\nthe pairwise order using novel transformer architectures. Analysis of the two\nproposed decoding strategies helps better explain error propagation in pairwise\nmodels. This approach is the most accurate pure pairwise model and our encoding\nstrategy also significantly improves the performance of other recent approaches\nthat use pairwise models, including the previous state-of-the-art,\ndemonstrating the research novelty and generalizability of this work.\nAdditionally, we show how the pre-training task for ALBERT helps it to\nsignificantly outperform BERT, despite having considerably lesser parameters.\nThe extensive experimental results, architectural analysis and ablation studies\ndemonstrate the effectiveness and superiority of the proposed models compared\nto the previous state-of-the-art, besides providing a much better understanding\nof the functioning of pairwise models.\n", "doi": "10.1016/j.knosys.2022.108453", "arxiv_id": "2110.04291", "pdf_urls": ["https://arxiv.org/pdf/2110.04291"], "github": ["https://github.com/ruskinmanku/pairwisemodels4so"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 243, May 2022, 108453", "categories": "cs.CL cs.AI cs.IR cs.LG cs.LO"}
{"title": "Empathetic Response Generation through Graph-based Multi-hop Reasoning\n  on Emotional Causality", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jiashuo Wang", "Wenjie LI", "Peiqin Lin and Feiteng Mu"], "abstract": "  Empathetic response generation aims to comprehend the user emotion and then\nrespond to it appropriately. Most existing works merely focus on what the\nemotion is and ignore how the emotion is evoked, thus weakening the capacity of\nthe model to understand the emotional experience of the user for generating\nempathetic responses. To tackle this problem, we consider the emotional\ncausality, namely, what feelings the user expresses (i.e., emotion) and why the\nuser has such feelings (i.e., cause). Then, we propose a novel graph-based\nmodel with multi-hop reasoning to model the emotional causality of the\nempathetic conversation. Finally, we demonstrate the effectiveness of our model\non EMPATHETICDIALOGUES in comparison with several competitive models.\n", "doi": "10.1016/j.knosys.2021.107547", "arxiv_id": "2110.04614", "pdf_urls": ["https://arxiv.org/pdf/2110.04614"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems 233 (2021) 107547", "categories": "cs.CL"}
{"title": "A Taxonomy and Archetypes of Business Analytics in Smart Manufacturing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jonas Wanner", "Christopher Wissuchek", "Giacomo Welsch", "Christian\n  Janiesch"], "abstract": "  Fueled by increasing data availability and the rise of technological advances\nfor data processing and communication, business analytics is a key driver for\nsmart manufacturing. However, due to the multitude of different local advances\nas well as its multidisciplinary complexity, both researchers and practitioners\nstruggle to keep track of the progress and acquire new knowledge within the\nfield, as there is a lack of a holistic conceptualization. To address this\nissue, we performed an extensive structured literature review, yielding 904\nrelevant hits, to develop a quadripartite taxonomy as well as to derive\narchetypes of business analytics in smart manufacturing. The taxonomy comprises\nthe following meta-characteristics: application domain, orientation as the\nobjective of the analysis, data origins, and analysis techniques. Collectively,\nthey comprise eight dimensions with a total of 52 distinct characteristics.\nUsing a cluster analysis, we found six archetypes that represent a synthesis of\nexisting knowledge on planning, maintenance (reactive, offline, and online\npredictive), monitoring, and quality management. A temporal analysis highlights\nthe push beyond predictive approaches and confirms that deep learning already\ndominates novel applications. Our results constitute an entry point to the\nfield but can also serve as a reference work and a guide with which to assess\nthe adequacy of one's own instruments.\n", "doi": "10.1145/3583581.3583584", "arxiv_id": "2110.06124", "pdf_urls": ["https://arxiv.org/pdf/2110.06124"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ACM SIGMIS Database: the DATABASE for Advances in Information\n  Systems, Volume 54, Issue 1, 2023", "categories": "cs.CY"}
{"title": "Assessing the Impact of (Self)-Quarantine Through a Basic Model of\n  Infectious Disease Dynamics", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jozsef Z. Farkas", "Roxane Chatzopoulos"], "abstract": "  We introduce a system of differential equations to assess the impact of\n(self-)quarantine of symptomatic infectious individuals on disease dynamics. To\nthis end we depart from using the classic bilinear infection process, but\nremain still within the framework of the mass-action assumption. From the\nmathematical point of view our model is interesting due to the lack of\ncontinuous differentiability at disease free steady states, which implies also\nthat the basic reproductive number cannot be computed following established\napproaches for certain parameter values. However, we parametrise our\nmathematical model using published values from the COVID-19 literature, and\nanalyse the model simulations. We also contrast model simulations against\npublicly available COVID-19 test data focusing on the first wave of the\npandemic during March - July 2020 in the UK. Our simulations indicate that\nactual peak case numbers might have been as much as 200 times higher than the\nreported positive test cases during the first wave in the UK. We find that very\nstrong adherence to self-quarantine rules yields (only) a reduction of 22$\\%$\nof peak numbers and delays the onset of the peak by approximately 30-35 days.\nHowever, during the early phase of the outbreak the impact of (self)-quarantine\nis much more significant. We also take into account the effect of a national\nlockdown in a simplistic way by reducing the effective susceptible population\nsize. We find that in case of a 90$\\%$ reduction of the effective susceptible\npopulation size, strong adherence to self-quarantine still only yields a 25$\\%$\nreduction of peak infectious numbers when compared to low adherence. This is\ndue to the significant number of asymptomatic infectious individuals in the\npopulation.\n", "doi": "10.3390/idr13040090", "arxiv_id": "2110.07416", "pdf_urls": ["https://arxiv.org/pdf/2110.07416"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Infectious Disease Reports, 2021, 13(4), 978-992", "categories": "q-bio.PE"}
{"title": "DPGNN: Dual-Perception Graph Neural Network for Representation Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Li Zhou", "Wenyu Chen", "Dingyi Zeng", "Shaohuan Cheng", "Wanlong Liu", "Malu\n  Zhang", "Hong Qu"], "abstract": "  Graph neural networks (GNNs) have drawn increasing attention in recent years\nand achieved remarkable performance in many graph-based tasks, especially in\nsemi-supervised learning on graphs. However, most existing GNNs are based on\nthe message-passing paradigm to iteratively aggregate neighborhood information\nin a single topology space. Despite their success, the expressive power of GNNs\nis limited by some drawbacks, such as inflexibility of message source\nexpansion, negligence of node-level message output discrepancy, and restriction\nof single message space. To address these drawbacks, we present a novel\nmessage-passing paradigm, based on the properties of multi-step message source,\nnode-specific message output, and multi-space message interaction. To verify\nits validity, we instantiate the new message-passing paradigm as a\nDual-Perception Graph Neural Network (DPGNN), which applies a node-to-step\nattention mechanism to aggregate node-specific multi-step neighborhood\ninformation adaptively. Our proposed DPGNN can capture the structural\nneighborhood information and the feature-related information simultaneously for\ngraph representation learning. Experimental results on six benchmark datasets\nwith different topological structures demonstrate that our method outperforms\nthe latest state-of-the-art models, which proves the superiority and\nversatility of our method. To our knowledge, we are the first to consider\nnode-specific message passing in the GNNs.\n", "doi": "10.1016/j.knosys.2023.110377", "arxiv_id": "2110.07869", "pdf_urls": ["https://arxiv.org/pdf/2110.07869"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems 268 (2023): 110377", "categories": "cs.LG"}
{"title": "Knowledge-driven Active Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gabriele Ciravegna", "Fr\\'ed\\'eric Precioso", "Alessandro Betti", "Kevin\n  Mottin", "Marco Gori"], "abstract": "  The deployment of Deep Learning (DL) models is still precluded in those\ncontexts where the amount of supervised data is limited. To answer this issue,\nactive learning strategies aim at minimizing the amount of labelled data\nrequired to train a DL model. Most active strategies are based on uncertain\nsample selection, and even often restricted to samples lying close to the\ndecision boundary. These techniques are theoretically sound, but an\nunderstanding of the selected samples based on their content is not\nstraightforward, further driving non-experts to consider DL as a black-box. For\nthe first time, here we propose to take into consideration common\ndomain-knowledge and enable non-expert users to train a model with fewer\nsamples. In our Knowledge-driven Active Learning (KAL) framework, rule-based\nknowledge is converted into logic constraints and their violation is checked as\na natural guide for sample selection. We show that even simple relationships\namong data and output classes offer a way to spot predictions for which the\nmodel need supervision. We empirically show that KAL (i) outperforms many\nactive learning strategies, particularly in those contexts where domain\nknowledge is rich, (ii) it discovers data distribution lying far from the\ninitial training data, (iii) it ensures domain experts that the provided\nknowledge is acquired by the model, (iv) it is suitable for regression and\nobject recognition tasks unlike uncertainty-based strategies, and (v) its\ncomputational demand is low.\n", "doi": "10.1007/978-3-031-43412-9_3", "arxiv_id": "2110.08265", "pdf_urls": ["https://arxiv.org/pdf/2110.08265"], "github": ["https://github.com/gabrieleciravegna/knowledge-driven-active-learning"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In Machine Learning and Knowledge Discovery in Databases: Research\n  Track. pp. 38-54. vol 14169. Springer (2023)", "categories": "cs.LG cs.AI"}
{"title": "A novel use of time separation technique to improve flat detector CT\n  perfusion imaging in stroke patients", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vojt\\v{e}ch Kulvait (1", "2)", "Philip Hoelter (3)", "Robert Frysch (1)", "Hana\n  Haselji\\'c (1)", "Arnd Doerfler (3)", "Georg Rose (1) ((1) Institute for Medical\n  Engineering and Research Campus STIMULATE", "University of Magdeburg", "Magdeburg", "Germany", "(2) Institute of Materials Physics", "Helmholtz-Zentrum\n  Hereon", "Geesthacht", "Germany", "(3) Department of Neuroradiology", "University\n  Hospital Erlangen", "Friedrich-Alexander-Universit\\\"at (FAU)\n  Erlangen-N\\\"urnberg", "Erlangen", "Germany)"], "abstract": "  CT perfusion imaging (CTP) is used in the diagnostic workup of acute ischemic\nstroke (AIS). CTP may be performed within the angio suite using flat detector\nCT (FDCT) to help reduce patient management time. In order to significantly\nimprove FDCT perfusion (FDCTP) imaging, data-processing algorithms need to be\nable to compensate for the higher levels of noise, slow rotation speed, and a\nlower frame rate of current FDCT devices. We performed a realistic simulation\nof FDCTP acquisition based on CTP data from seven subjects. We used the time\nseparation technique (TST) as a model-based approach for FDCTP data processing.\nWe propose a novel dimension reduction in which we approximate the time\nattenuation curves by a linear combination of trigonometric functions. Our goal\nwas to show that the TST can be used even without prior assumptions on the\nshape of the attenuation profiles. We first demonstrated that a trigonometric\nbasis is suitable for dimension reduction of perfusion data. Using simulated\nFDCTP data, we have shown that a trigonometric basis in the TST provided better\nresults than the classical straightforward processing even with additional\nnoise. Average correlation coefficients of perfusion maps were improved for\ncerebral blood flow (CBF), cerebral blood volume, mean transit time (MTT) maps.\nIn a moderate noise scenario, the average Pearson's coefficient for the CBF map\nwas improved using the TST from 0.76 to 0.81. For the MTT map, it was improved\nfrom 0.37 to 0.45. Furthermore, we achieved a total processing time from the\nreconstruction of FDCTP data to the generation of perfusion maps of under 5\nmin. In our study cohort, perfusion maps created from FDCTP data using the TST\nwith a trigonometric basis showed equivalent perfusion deficits to classic CT\nperfusion maps. It follows, that this novel FDCTP technique has potential to\nprovide fast and accurate FDCTP imaging for AIS patients.\n", "doi": "10.1002/mp.15640", "arxiv_id": "2110.09438", "pdf_urls": ["https://arxiv.org/pdf/2110.09438"], "github": ["https://github.com/kulvait/kpct_perfviz"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Kulvait, V, Hoelter, P, Frysch, R, Haselji\\'c, H, Doerfler, A,\n  Rose, G. A novel use of time separation technique to improve flat detector CT\n  perfusion imaging in stroke patients. Med Phys. 2022; 1- 14.\n  https://doi.org/10.1002/mp.15640", "categories": "physics.med-ph eess.IV"}
{"title": "Tighter constraints of multiqubit entanglement in terms of unified\n  entropy", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ya-Ya Ren", "Zhi-Xi Wang", "and Shao-Ming Fei"], "abstract": "  We present classes of monogamy inequalities related to the $\\alpha$-th\n($\\alpha \\geq 1$) power of the entanglement measure based on the\nunified-($q,s$) entropy, and polygamy inequalities related to the $\\beta$-th\n($0 \\leq \\beta \\leq 1$) power of the unified-($q,s$) entanglement of assistance\nby using Hamming weight. We show that these monogamy and polygamy inequalities\nare tighter than the existing ones. Detailed examples are given for\nillustrating the advantages.\n", "doi": "10.1088/1612-202x/ac2cd0", "arxiv_id": "2110.11565", "pdf_urls": ["https://arxiv.org/pdf/2110.11565"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. 18 (2021) 115204", "categories": "quant-ph"}
{"title": "Stabilization of Spatiotemporal Dissipative Solitons in Multimode Fiber\n  Lasers by External Phase Modulation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vladimir L. Kalashnikov and Stefan Wabnitz"], "abstract": "  In this work, we introduce a method for stabilizing spatiotemporal solitons.\nThese solitons correspond to light bullets in multimode optical fiber lasers,\nenergy-scalable waveguide oscillators and amplifiers, localized coherent\npatterns in Bose-Einstein condensates, etc. We show that a three-dimensional\nconfinement potential, formed by a spatial transverse (radial) parabolic graded\nrefractive index and dissipation profile, combined with quadratic temporal\nphase modulation, may permit the generation of stable spatiotemporal\ndissipative solitons. This corresponds to combining phase mode-locking with the\ndistributed Kerr-lens mode-locking. Our study of the soliton characteristics\nand stability is based on analytical and numerical solutions of the generalized\ndissipative Gross-Pitaevskii equation. This approach could lead to higher\nenergy (or condensate mass) harvesting in coherent spatio-temporal beam\nstructures formed in multimode fiber lasers, waveguide oscillators, and\nweakly-dissipative Bose-Einstein condensates.\n", "doi": "10.1088/1612-202x/ac8678", "arxiv_id": "2110.12472", "pdf_urls": ["https://arxiv.org/pdf/2110.12472"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Laser Phys. Lett. Vol. 19, 105101 (2022)", "categories": "physics.optics nlin.PS"}
{"title": "Abstractified Multi-instance Learning (AMIL) for Biomedical Relation\n  Extraction", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["William Hogan", "Molly Huang", "Yannis Katsis", "Tyler Baldwin", "Ho-Cheol\n  Kim", "Yoshiki Vazquez Baeza", "Andrew Bartko", "Chun-Nan Hsu"], "abstract": "  Relation extraction in the biomedical domain is a challenging task due to a\nlack of labeled data and a long-tail distribution of fact triples. Many works\nleverage distant supervision which automatically generates labeled data by\npairing a knowledge graph with raw textual data. Distant supervision produces\nnoisy labels and requires additional techniques, such as multi-instance\nlearning (MIL), to denoise the training signal. However, MIL requires multiple\ninstances of data and struggles with very long-tail datasets such as those\nfound in the biomedical domain. In this work, we propose a novel reformulation\nof MIL for biomedical relation extraction that abstractifies biomedical\nentities into their corresponding semantic types. By grouping entities by\ntypes, we are better able to take advantage of the benefits of MIL and further\ndenoise the training signal. We show this reformulation, which we refer to as\nabstractified multi-instance learning (AMIL), improves performance in\nbiomedical relationship extraction. We also propose a novel relationship\nembedding architecture that further improves model performance.\n", "doi": null, "arxiv_id": "2110.12501", "pdf_urls": ["https://arxiv.org/pdf/2110.12501"], "github": ["https://github.com/ibm/aihn-ucsd"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "3rd Conference on Automated Knowledge Base Construction (2021)", "categories": "cs.CL cs.LG"}
{"title": "Handshakes AI Research at CASE 2021 Task 1: Exploring different\n  approaches for multilingual tasks", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Vivek Kalyan and Paul Tan and Shaun Tan and Martin Andrews"], "abstract": "  The aim of the CASE 2021 Shared Task 1 (H\\\"urriyeto\\u{g}lu et al., 2021) was\nto detect and classify socio-political and crisis event information at\ndocument, sentence, cross-sentence, and token levels in a multilingual setting,\nwith each of these subtasks being evaluated separately in each test language.\nOur submission contained entries in all of the subtasks, and the scores\nobtained validated our research finding: That the multilingual aspect of the\ntasks should be embraced, so that modeling and training regimes use the\nmultilingual nature of the tasks to their mutual benefit, rather than trying to\ntackle the different languages separately. Our code is available at\nhttps://github.com/HandshakesByDC/case2021/\n", "doi": null, "arxiv_id": "2110.15599", "pdf_urls": ["https://arxiv.org/pdf/2110.15599"], "github": ["https://github.com/handshakesbydc/case2021"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the 4th Workshop on Challenges and Applications of\n  Automated Extraction of Socio-political Events from Text (CASE 2021)", "categories": "cs.CL cs.AI"}
{"title": "Bi-modal photothermal/optical microscopy for complementary bio-imaging\n  with high resolution and contrast", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Sergiy Litvinenko", "Pavlo Lishchuk", "Vladimir Lysenko", "Mykola Isaiev\n  (LEMTA)"], "abstract": "  In the paper, combined bimodal microscopic visualization of biological\nobjects based on reflection-mode optical and photoacoustic measurements was\npresented. Gasmicrophone configuration was chosen for the registration of\nphotothermal response. Precise positioning of the scanning laser beam with\nmodulated intensity was performed employing acousto-optic deflectors.\nPhotoacoustic images are shown to give complementary details to the optical\nimages obtained in the reflected light. Specifically, the photoacoustic imaging\nmode allows much better visualization of the features with enhanced heat\nlocalization due to the reduced heat outflow. For example, the application of\nthe photoacoustic imaging mode was especially successful to visualize\nDrosophila fly's micro-hairs. Furthermore, the photoacoustic image quality was\nshown to be adjusted through modulation frequency.\n", "doi": "10.1007/s00340-021-07686-7", "arxiv_id": "2110.15614", "pdf_urls": ["https://arxiv.org/pdf/2110.15614"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Applied Physics B - Laser and Optics, Springer Verlag, 2021, 127\n  (10)", "categories": "physics.app-ph physics.bio-ph"}
{"title": "Calling to CNN-LSTM for Rumor Detection: A Deep Multi-channel Model for\n  Message Veracity Classification in Microblogs", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Abderrazek Azri (ERIC)", "C\\'ecile Favre (ERIC)", "Nouria Harbi (ERIC)", "J\\'er\\^ome Darmont (ERIC)", "Camille No\\^us"], "abstract": "  Reputed by their low-cost, easy-access, real-time and valuable information,\nsocial media also wildly spread unverified or fake news. Rumors can notably\ncause severe damage on individuals and the society. Therefore, rumor detection\non social media has recently attracted tremendous attention. Most rumor\ndetection approaches focus on rumor feature analysis and social features, i.e.,\nmetadata in social media. Unfortunately, these features are data-specific and\nmay not always be available, e.g., when the rumor has just popped up and not\nyet propagated. In contrast, post contents (including images or videos) play an\nimportant role and can indicate the diffusion purpose of a rumor. Furthermore,\nrumor classification is also closely related to opinion mining and sentiment\nanalysis. Yet, to the best of our knowledge, exploiting images and sentiments\nis little investigated.Considering the available multimodal features from\nmicroblogs, notably, we propose in this paper an end-to-end model called\ndeepMONITOR that is based on deep neural networks and allows quite accurate\nautomated rumor verification, by utilizing all three characteristics: post\ntextual and image contents, as well as sentiment. deepMONITOR concatenates\nimage features with the joint text and sentiment features to produce a\nreliable, fused classification. We conduct extensive experiments on two\nlarge-scale, real-world datasets. The results show that deepMONITOR achieves a\nhigher accuracy than state-of-the-art methods.\n", "doi": "10.1007/978-3-030-86517-7_31", "arxiv_id": "2110.15727", "pdf_urls": ["https://arxiv.org/pdf/2110.15727"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Joint European Conference on Machine Learning and Knowledge\n  Discovery in Databases (ECML PKDD 2021), Sep 2021, Bilbao, Spain. pp.497-513", "categories": "cs.CL cs.AI"}
{"title": "Protecting the Edge: Ultrafast Laser Modified C-shaped Glass Edges", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daniel Flamm and Myriam Kaiser and Marvin Feil and Max Kahmann and\n  Michael Lang and Jonas Kleiner and Tim Hesse"], "abstract": "  A procedure and optical concept is introduced for ultrashort pulsed laser\ncleaving of transparent materials with tailored edges in a single pass. The\nprocedure is based on holographically splitting a number of foci along the\ndesired edge geometry including C-shaped edges with local 45{\\deg} tangential\nangles to the surface. Single-pass, full thickness laser modifications are\nachieved requiring single-side access to the workpiece only without inclining\nthe optical head. After having induced laser modifications with feed rates of 1\nm/s actual separation is performed using a selective etching strategy.\n", "doi": "10.2351/7.0000592", "arxiv_id": "2111.01612", "pdf_urls": ["https://arxiv.org/pdf/2111.01612"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "J. Laser Appl. 34, 012014 (2022)", "categories": "physics.optics cond-mat.mtrl-sci"}
{"title": "Polaritons in an electron gas -- quasiparticles and Landau effective\n  interactions", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Miguel Angel Bastarrachea-Magnani", "Jannie Thomsen", "Arturo\n  Camacho-Guardian", "Georg M. Bruun"], "abstract": "  Two-dimensional semiconductors inside optical microcavities have emerged as a\nversatile platform to explore new hybrid light-matter quantum states. The\nstrong light-matter coupling leads to the formation of exciton-polaritons,\nwhich in turn interact with the surrounding electron gas to form quasiparticles\ncalled polaron-polaritons. Here, we develop a general microscopic framework to\ncalculate the properties of these quasiparticles such as their energy and the\ninteractions between them. From this, we give microscopic expressions for the\nparameters entering a Landau theory for the polaron-polaritons, which offers a\nsimple yet powerful way to describe such interacting light-matter many-body\nsystems. As an example of the application of our framework, we then use the\nladder approximation to explore the properties of the polaron-polaritons. We\nfurthermore show that they can be measured in a non-demolition way via the\nlight transmission/reflection spectrum of the system. Finally, we demonstrate\nthat the Landau effective interaction mediated by electron-hole excitation is\nattractive leading to red shifts of the polaron-polaritons. Our work provides a\nsystematic framework to study exciton-polaritons in electronically doped\ntwo-dimensional materials such as novel van der Waals heterostructures.\n", "doi": "10.3390/atoms9040081", "arxiv_id": "2111.02658", "pdf_urls": ["https://arxiv.org/pdf/2111.02658"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Atoms 2021, 9(4), 81 (Special Issue \"Physics of Impurities in\n  Quantum Gases)", "categories": "cond-mat.mes-hall cond-mat.quant-gas"}
{"title": "When Neural Networks Using Different Sensors Create Similar Features", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Hugues Moreau (CEA-LETI", "LIRIS)", "Andr\\'ea Vassilev (CEA-LETI)", "Liming\n  Chen (LIRIS", "ECL)"], "abstract": "  Multimodal problems are omnipresent in the real world: autonomous driving,\nrobotic grasping, scene understanding, etc... We draw from the well-developed\nanalysis of similarity to provide an example of a problem where neural networks\nare trained from different sensors, and where the features extracted from these\nsensors still carry similar information. More precisely, we demonstrate that\nfor each sensor, the linear combination of the features from the last layer\nthat correlates the most with other sensors corresponds to the classification\ncomponents of the classification layer.\n", "doi": null, "arxiv_id": "2111.02732", "pdf_urls": ["https://arxiv.org/pdf/2111.02732"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "EAI MobiCase 2021, Nov 2021, Online, China", "categories": "cs.LG cs.CV"}
{"title": "How Developers and Managers Define and Trade Productivity for Quality", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Margaret-Anne Storey", "Brian Houck", "Thomas Zimmermann"], "abstract": "  In this paper, we present the findings from a survey study to investigate how\ndevelopers and managers define and trade-off developer productivity and\nsoftware quality (two related lenses into software development). We found that\ndevelopers and managers, as cohorts, are not well aligned in their views of\nwhat it means to be productive (developers think of productivity in terms of\nactivity, while more managers think of productivity in terms of performance).\nWe also found that developers are not accurate at predicting their managers'\nviews of productivity. In terms of quality, we found that individual developers\nand managers have quite varied views of what quality means to them, but as\ncohorts they are closely aligned in their different views, with the majority in\nboth groups defining quality in terms of robustness. Over half of the\ndevelopers and managers reported that quality can be traded for higher\nproductivity and why this trade-off can be justified, while one third consider\nquality as a necessary part of productivity that cannot be traded. We also\npresent a new descriptive framework for quality, TRUCE, that we synthesize from\nthe survey responses. We call for more discussion between developers and\nmanagers about what they each consider as important software quality\nattributes, and to have open debate about how software quality relates to\ndeveloper productivity and what trade-offs should or should not be made.\n", "doi": "10.1145/3528579.3529177", "arxiv_id": "2111.04302", "pdf_urls": ["https://arxiv.org/pdf/2111.04302"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "CHASE 2022: 15th International Conference on Cooperative and Human\n  Aspects of Software Engineering", "categories": "cs.SE"}
{"title": "Physics-informed neural networks for understanding shear migration of\n  particles in viscous flow", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Daihui Lu and Ivan C. Christov"], "abstract": "  We harness the physics-informed neural network (PINN) approach to extend the\nutility of phenomenological models for particle migration in shear flow.\nSpecifically, we propose to constrain the neural network training via a model\nfor the physics of shear-induced particle migration in suspensions. Then, we\ntrain the PINN against experimental data from the literature, showing that this\napproach provides both better fidelity to the experiments, and a novel\nunderstanding of the relative roles of the hypothesized migration fluxes. We\nfirst verify the PINN approach for solving the inverse problem of radial\nparticle migration in a non-Brownian suspension in an annular Couette flow. In\nthis classical case, the PINN yields the same value (as reported in the\nliterature) for the ratio of the two parameters of the empirical model. Next,\nwe apply the PINN approach to analyze experiments on particle migration in both\nnon-Brownian and Brownian suspensions in Poiseuille slot flow, for which a\ndefinitive calibration of the phenomenological migration model has been\nlacking. Using the PINN approach, we identify the unknown/empirical parameters\nin the physical model through the inverse solver capability of PINNs.\nSpecifically, the values are significantly different from those for the Couette\ncell, highlighting an inconsistency in the literature that uses the latter\nvalue for Poiseuille flow. Importantly, the PINN results also show that the\ninferred values of the empirical model's parameters vary with the shear\nP\\'eclet number and the particle bulk volume fraction of the suspension,\ninstead of being constant as assumed in some previous literature.\n", "doi": "10.1016/j.ijmultiphaseflow.2023.104476", "arxiv_id": "2111.04684", "pdf_urls": ["https://arxiv.org/pdf/2111.04684"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "International Journal of Multiphase Flow 165 (2023) 104476", "categories": "physics.flu-dyn cs.CE"}
{"title": "\"How Does It Detect A Malicious App?\" Explaining the Predictions of\n  AI-based Android Malware Detector", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Zhi Lu and Vrizlynn L.L. Thing"], "abstract": "  AI methods have been proven to yield impressive performance on Android\nmalware detection. However, most AI-based methods make predictions of\nsuspicious samples in a black-box manner without transparency on models'\ninference. The expectation on models' explainability and transparency by cyber\nsecurity and AI practitioners to assure the trustworthiness increases. In this\narticle, we present a novel model-agnostic explanation method for AI models\napplied for Android malware detection. Our proposed method identifies and\nquantifies the data features relevance to the predictions by two steps: i) data\nperturbation that generates the synthetic data by manipulating features'\nvalues; and ii) optimization of features attribution values to seek significant\nchanges of prediction scores on the perturbed data with minimal feature values\nchanges. The proposed method is validated by three experiments. We firstly\ndemonstrate that our proposed model explanation method can aid in discovering\nhow AI models are evaded by adversarial samples quantitatively. In the\nfollowing experiments, we compare the explainability and fidelity of our\nproposed method with state-of-the-arts, respectively.\n", "doi": "10.1109/bigdatasecurityhpscids54978.2022.00045", "arxiv_id": "2111.05108", "pdf_urls": ["https://arxiv.org/pdf/2111.05108"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "IEEE 8th Intl Conference on Big Data Security on Cloud\n  (BigDataSecurity), IEEE Intl Conference on High Performance and Smart\n  Computing, (HPSC) and IEEE Intl Conference on Intelligent Data and Security\n  (IDS), 2022, pp. 194-199", "categories": "cs.CR cs.AI cs.LG"}
{"title": "One model Packs Thousands of Items with Recurrent Conditional Query\n  Learning", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dongda Li", "Zhaoquan Gu", "Yuexuan Wang", "Changwei Ren", "Francis C.M. Lau"], "abstract": "  Recent studies have revealed that neural combinatorial optimization (NCO) has\nadvantages over conventional algorithms in many combinatorial optimization\nproblems such as routing, but it is less efficient for more complicated\noptimization tasks such as packing which involves mutually conditioned action\nspaces. In this paper, we propose a Recurrent Conditional Query Learning (RCQL)\nmethod to solve both 2D and 3D packing problems. We first embed states by a\nrecurrent encoder, and then adopt attention with conditional queries from\nprevious actions. The conditional query mechanism fills the information gap\nbetween learning steps, which shapes the problem as a Markov decision process.\nBenefiting from the recurrence, a single RCQL model is capable of handling\ndifferent sizes of packing problems. Experiment results show that RCQL can\neffectively learn strong heuristics for offline and online strip packing\nproblems (SPPs), outperforming a wide range of baselines in space utilization\nratio. RCQL reduces the average bin gap ratio by 1.83% in offline 2D 40-box\ncases and 7.84% in 3D cases compared with state-of-the-art methods. Meanwhile,\nour method also achieves 5.64% higher space utilization ratio for SPPs with\n1000 items than the state of the art.\n", "doi": "10.1016/j.knosys.2021.107683", "arxiv_id": "2111.06726", "pdf_urls": ["https://arxiv.org/pdf/2111.06726"], "github": ["https://github.com/dongdongbh/RCQL"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, Volume 235, 2022, 107683, ISSN 0950-7051", "categories": "cs.AI cs.LG cs.NE"}
{"title": "SMACE: A New Method for the Interpretability of Composite Decision\n  Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Gianluigi Lopardo", "Damien Garreau", "Frederic Precioso", "Greger Ottosson"], "abstract": "  Interpretability is a pressing issue for decision systems. Many post hoc\nmethods have been proposed to explain the predictions of a single machine\nlearning model. However, business processes and decision systems are rarely\ncentered around a unique model. These systems combine multiple models that\nproduce key predictions, and then apply decision rules to generate the final\ndecision. To explain such decisions, we propose the Semi-Model-Agnostic\nContextual Explainer (SMACE), a new interpretability method that combines a\ngeometric approach for decision rules with existing interpretability methods\nfor machine learning models to generate an intuitive feature ranking tailored\nto the end user. We show that established model-agnostic approaches produce\npoor results on tabular data in this setting, in particular giving the same\nimportance to several features, whereas SMACE can rank them in a meaningful\nway.\n", "doi": "10.1007/978-3-031-26387-3_20", "arxiv_id": "2111.08749", "pdf_urls": ["https://arxiv.org/pdf/2111.08749"], "github": ["https://github.com/gianluigilopardo/smace"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Machine Learning and Knowledge Discovery in Databases: European\n  Conference, ECML PKDD 2022, Grenoble, France, September 19--23, 2022,\n  Proceedings, Part I", "categories": "cs.LG cs.AI"}
{"title": "Deep neural networks-based denoising models for CT imaging and their\n  efficacy", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Prabhat KC", "Rongping Zeng", "M. Mehdi Farhangi", "Kyle J. Myers"], "abstract": "  Most of the Deep Neural Networks (DNNs) based CT image denoising literature\nshows that DNNs outperform traditional iterative methods in terms of metrics\nsuch as the RMSE, the PSNR and the SSIM. In many instances, using the same\nmetrics, the DNN results from low-dose inputs are also shown to be comparable\nto their high-dose counterparts. However, these metrics do not reveal if the\nDNN results preserve the visibility of subtle lesions or if they alter the CT\nimage properties such as the noise texture. Accordingly, in this work, we seek\nto examine the image quality of the DNN results from a holistic viewpoint for\nlow-dose CT image denoising. First, we build a library of advanced DNN\ndenoising architectures. This library is comprised of denoising architectures\nsuch as the DnCNN, U-Net, Red-Net, GAN, etc. Next, each network is modeled, as\nwell as trained, such that it yields its best performance in terms of the PSNR\nand SSIM. As such, data inputs (e.g. training patch-size, reconstruction\nkernel) and numeric-optimizer inputs (e.g. minibatch size, learning rate, loss\nfunction) are accordingly tuned. Finally, outputs from thus trained networks\nare further subjected to a series of CT bench testing metrics such as the\ncontrast-dependent MTF, the NPS and the HU accuracy. These metrics are employed\nto perform a more nuanced study of the resolution of the DNN outputs'\nlow-contrast features, their noise textures, and their CT number accuracy to\nbetter understand the impact each DNN algorithm has on these underlying\nattributes of image quality.\n", "doi": "10.1117/12.2581418", "arxiv_id": "2111.09539", "pdf_urls": ["https://arxiv.org/pdf/2111.09539"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Prabhat KC, Rongping Zeng, M. Mehdi Farhangi, Kyle J. Myers, \"Deep\n  neural networks-based denoising models for CT imaging and their efficacy,\"\n  Proc. SPIE 11595, Medical Imaging 2021: Physics of Medical Imaging, 115950H\n  (15 February 2021)", "categories": "cs.CV physics.med-ph"}
{"title": "Formal verification of space systems designed with TASTE", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["I Dragomir (GMV)", "M Bozga (VERIMAG - IMAG)", "Iulian Ober\n  (ISAE-SUPAERO)", "D Silveira", "T Jorge", "E Ala\\~na (GMV)", "M Perrotin (ESTEC)"], "abstract": "  Model-Based Systems Engineering (MBSE) is a development approach aiming to\nbuild correct-by-construction systems, provided the use of clear, unambiguous\nand complete models to describe them along the design process. The approach is\nsupported by several engineering tools that automate the development steps, for\nexample the production of code, documentation, test cases and more. TASTE [1]\nis pragmatic MBSE toolset supported by ESA that encapsulates several\ntechnologies to design a system (data modelling, architecture modelling,\nbehaviour modelling/implementation), to automatically generate the binary\napplication(s), and to validate it. One topic left open in TASTE is the formal\nverification of a system design with respect to specified properties. In this\npaper we describe our approach based on the IF model-checker [4] to enable the\nformal verification of properties on TASTE designs. The approach is currently\nunder development in the ESA MoC4Space project.\n", "doi": null, "arxiv_id": "2111.10132", "pdf_urls": ["https://arxiv.org/pdf/2111.10132"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "ESA's Second Virtual Workshop on Model Based Space Systems and\n  Software Engineering (MBSE2021), Sep 2021, Nordwijk, Netherlands", "categories": "cs.SE"}
{"title": "Panoramic SETI: Overall focal plane electronics and timing and network\n  protocols", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wei Liu", "Dan Werthimer", "Ryan Lee", "Franklin Antonio", "Michael Aronson", "Aaron Brown", "Frank Drake", "Andrew Howard", "Paul Horowitz", "Jerome Maire", "Rick\n  Raffanti", "Remington Stone", "Richard Treffers and Shelley A. Wright"], "abstract": "  The PANOSETI experiment is an all-sky, all-the-time visible search for\nnanosecond to millisecond time-scale transients. The experiment will deploy\nobservatory domes at several sites, each dome containing ~45 telescopes and\ncovering ~4,440 square degrees. Here we describe the focal-plane electronics\nfor the visible wavelength telescopes, each of which contains a Mother Board\nand four Quadrant Boards. On each quadrant board, 256 silicon photomultiplier\n(SiPM) photon detectors are arranged to measure pulse heights to search for\nnanosecond time-scale pulses. To simultaneously examine pulse widths over a\nlarge range of time scales (nanoseconds to milliseconds), the instrument\nimplements both a Continuous Imaging Mode (CI-Mode) and a Pulse Height Mode\n(PH-Mode). Precise timing is implemented in the gateware with the White Rabbit\nprotocol.\n", "doi": "10.1117/12.2561203", "arxiv_id": "2111.11476", "pdf_urls": ["https://arxiv.org/pdf/2111.11476"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proc. SPIE 11447, Ground-based and Airborne Instrumentation for\n  Astronomy VIII, 114477G (13 December 2020)", "categories": "astro-ph.IM"}
{"title": "Track Boosting and Synthetic Data Aided Drone Detection", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Fatih Cagatay Akyon", "Ogulcan Eryuksel", "Kamil Anil Ozfuttu", "Sinan Onur\n  Altinuc"], "abstract": "  This is the paper for the first place winning solution of the Drone vs. Bird\nChallenge, organized by AVSS 2021. As the usage of drones increases with\nlowered costs and improved drone technology, drone detection emerges as a vital\nobject detection task. However, detecting distant drones under unfavorable\nconditions, namely weak contrast, long-range, low visibility, requires\neffective algorithms. Our method approaches the drone detection problem by\nfine-tuning a YOLOv5 model with real and synthetically generated data using a\nKalman-based object tracker to boost detection confidence. Our results indicate\nthat augmenting the real data with an optimal subset of synthetic data can\nincrease the performance. Moreover, temporal information gathered by object\ntracking methods can increase performance further.\n", "doi": "10.1109/avss52988.2021.9663759", "arxiv_id": "2111.12389", "pdf_urls": ["https://arxiv.org/pdf/2111.12389"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "2021 17th IEEE International Conference on Advanced Video and\n  Signal Based Surveillance (AVSS)", "categories": "cs.CV cs.LG"}
{"title": "The AiiDA-Spirit plugin for automated spin-dynamics simulations and\n  multi-scale modelling based on first-principles calculations", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Philipp R\\\"u{\\ss}mann", "Jordi Ribas Sobreviela", "Moritz Sallermann", "Markus Hoffmann", "Florian Rhiem", "Stefan Bl\\\"ugel"], "abstract": "  Landau-Lifshitz-Gilbert (LLG) spin-dynamics calculations based on the\nextended Heisenberg Hamiltonian is an important tool in computational materials\nscience involving magnetic materials. LLG simulations allow to bridge the gap\nfrom expensive quantum mechanical calculations with small unit cells to large\nsupercells where the collective behavior of millions of spins can be studied.\nIn this work we present the AiiDA-Spirit plugin that connects the spin-dynamics\ncode Spirit to the AiiDA framework. AiiDA provides a Python interface that\nfacilitates performing high-throughput calculations while automatically\naugmenting the calculations with metadata describing the data provenance\nbetween calculations in a directed acyclic graph. The AiiDA-Spirit interface\nthus provides an easy way for high-throughput spin-dynamics calculations. The\ninterface to the AiiDA infrastructure furthermore has the advantage that input\nparameters for the extended Heisenberg model can be extracted from\nhigh-throughput first-principles calculations including a proper treatment of\nthe data provenance that ensures reproducibility of the calculation results in\naccordance to the FAIR principles. We describe the layout of the AiiDA-Spirit\nplugin and demonstrate its capabilities using selected examples for LLG\nspin-dynamics and Monte Carlo calculations. Furthermore, the integration with\nfirst-principles calculations through AiiDA is demonstrated at the example of\n$\\gamma$-Fe, where the complex spin-spiral ground state is investigated.\n", "doi": "10.3389/fmats.2022.825043", "arxiv_id": "2111.15229", "pdf_urls": ["https://arxiv.org/pdf/2111.15229"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "R\\\"u{\\ss}mann P, Ribas Sobreviela J, Sallermann M, Hoffmann M,\n  Rhiem F and Bl\\\"ugel S (2022) The AiiDA-Spirit Plugin for Automated\n  Spin-Dynamics Simulations and Multi-Scale Modeling Based on First-Principles\n  Calculations. Front. Mater. 9:825043", "categories": "cond-mat.mtrl-sci physics.comp-ph"}
{"title": "Three proofs of the Benedetto-Fickus theorem", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Dustin G. Mixon", "Tom Needham", "Clayton Shonkwiler", "Soledad Villar"], "abstract": "In 2003, Benedetto and Fickus introduced a vivid intuition for an objective function called the frame potential, whose global minimizers are fundamental objects known today as unit norm tight frames. Their main result was that the frame potential exhibits no spurious local minimizers, suggesting local optimization as an approach to construct these objects. Local optimization has since become the workhorse of cutting-edge signal processing and machine learning, and accordingly, the community has identified a variety of techniques to study optimization landscapes. This chapter applies some of these techniques to obtain three modern proofs of the Benedetto-Fickus theorem.", "doi": "10.1007/978-3-031-41130-4_14", "arxiv_id": "2112.02916", "pdf_urls": ["https://arxiv.org/pdf/2112.02916"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "In: Stephen D. Casey, M. Maurice Dodson, Paulo J.S.G. Ferreira, Ahmed Zayed, editors, Sampling, Approximation, and Signal Analysis: Harmonic Analysis in the Spirit of J. Rowland Higgins, Birkh\\\"auser, Cham, 2023, 371-391", "categories": "math.MG"}
{"title": "Against identification of contextuality with violation of the Bell\n  inequalities: lessons from theory of randomness", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Andrei Khrennikov"], "abstract": "  Nowadays contextuality is the hotest topic of quantum foundations and,\nespecially, foundations of quantum information theory. This notion is\ncharacterized by the huge diversity of approaches and interpretations. One of\nthe strongest trends in contextual research is to identify contextuality with\nviolation of the Bell inequalities. We call this sort of contextuality {\\it\nBell test contextuality} (BTC). In this note, we criticize the BTC-approach. It\ncan be compared with an attempt to identify the complex and theoretically\nnontrivial notion of randomness with a test for randomness (or a batch of\ntests, as the NIST-test). We advertize {\\it Bohr contextuality} -- taking into\naccount all experimental conditions (context). In the simplest case, the\nmeasurement context of an observable $A$ is reduced to joint measurement with a\ncompatible observable $B.$ The latter definition was originally considered by\nBell in relation to his inequality. We call it {\\it joint measurement\ncontextuality} (JMC). Although JMC is based on the use of counterfactuals, by\nconsidering it in the general Bohr's framework it is possible to handle JMC on\nphysical grounds. We suggest (similarly to randomness) to certify JMC in\nexperimental data with Bell tests, but only certify and not reduce.\n", "doi": null, "arxiv_id": "2112.03910", "pdf_urls": ["https://arxiv.org/pdf/2112.03910"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Russian Laser Research, 43(1), 48-59 (2022)", "categories": "quant-ph math.PR"}
{"title": "Performance comparison of computational ghost imaging versus\n  single-pixel camera in light disturbance environment", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Wenlin Gong"], "abstract": "  Computational ghost imaging (CGI) and single-pixel camera (SPC) are two types\nof single-pixel imaging and attracts increasing interest in recent years. The\nperformance differences of CGI and SPC in difference light disturbance\nenvironment are investigated. In comparison with CGI, we demonstrate that the\nquality of SPC is always better in the same conditions and local light\ndisturbance has a larger influence to CGI/SPC than global light disturbance. In\naddition, a method to improve the reconstruction result of SPC is proposed if\nthe source's energy is unstable and there is light disturbance in the detection\nprocess, and its validity is also verified by numerical simulation.\n", "doi": "10.1016/j.optlastec.2022.108140", "arxiv_id": "2112.08368", "pdf_urls": ["https://arxiv.org/pdf/2112.08368"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Optics and Laser Technology, 152, 108140, 2022", "categories": "eess.IV physics.optics"}
{"title": "Dimension reduction, exact recovery, and error estimates for sparse\n  reconstruction in phase space", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Martin Holler", "Alexander Schl\\\"uter", "Benedikt Wirth"], "abstract": "  An important theme in modern inverse problems is the reconstruction of\ntime-dependent data from only finitely many measurements. To obtain\nsatisfactory reconstruction results in this setting it is essential to strongly\nexploit temporal consistency between the different measurement times. The\nstrongest consistency can be achieved by reconstructing data directly in phase\nspace, the space of positions and velocities. However, this space is usually\ntoo high-dimensional for feasible computations. We introduce a novel dimension\nreduction technique, based on projections of phase space onto lower-dimensional\nsubspaces, which provably circumvents this curse of dimensionality: Indeed, in\nthe exemplary framework of superresolution we prove that known exact\nreconstruction results stay true after dimension reduction, and we additionally\nprove new error estimates of reconstructions from noisy data in optimal\ntransport metrics which are of the same quality as one would obtain in the\nnon-dimension-reduced case.\n", "doi": "10.1016/j.acha.2024.101631", "arxiv_id": "2112.09743", "pdf_urls": ["https://arxiv.org/pdf/2112.09743"], "github": ["https://github.com/alexschlueter/supermops"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "M. Holler, A. Schl\\\"uter, B. Wirth, Dimension reduction, exact\n  recovery, and error estimates for sparse reconstruction in phase space,\n  Applied and Computational Harmonic Analysis, Volume 70, 2024, 101631, ISSN\n  1063-5203", "categories": "math.NA cs.NA math.OC"}
{"title": "TECM: Transfer Learning-based Evidential C-Means Clustering", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Lianmeng Jiao", "Feng Wang", "Zhun-ga Liu", "and Quan Pan"], "abstract": "  As a representative evidential clustering algorithm, evidential c-means (ECM)\nprovides a deeper insight into the data by allowing an object to belong not\nonly to a single class, but also to any subset of a collection of classes,\nwhich generalizes the hard, fuzzy, possibilistic, and rough partitions.\nHowever, compared with other partition-based algorithms, ECM must estimate\nnumerous additional parameters, and thus insufficient or contaminated data will\nhave a greater influence on its clustering performance. To solve this problem,\nin this study, a transfer learning-based ECM (TECM) algorithm is proposed by\nintroducing the strategy of transfer learning into the process of evidential\nclustering. The TECM objective function is constructed by integrating the\nknowledge learned from the source domain with the data in the target domain to\ncluster the target data. Subsequently, an alternate optimization scheme is\ndeveloped to solve the constraint objective function of the TECM algorithm. The\nproposed TECM algorithm is applicable to cases where the source and target\ndomains have the same or different numbers of clusters. A series of experiments\nwere conducted on both synthetic and real datasets, and the experimental\nresults demonstrated the effectiveness of the proposed TECM algorithm compared\nto ECM and other representative multitask or transfer-clustering algorithms.\n", "doi": "10.1016/j.knosys.2022.109937", "arxiv_id": "2112.10152", "pdf_urls": ["https://arxiv.org/pdf/2112.10152"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Knowledge-Based Systems, 2022(257): 109937", "categories": "cs.LG"}
{"title": "NetKet 3: Machine Learning Toolbox for Many-Body Quantum Systems", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Filippo Vicentini", "Damian Hofmann", "Attila Szab\\'o", "Dian Wu", "Christopher Roth", "Clemens Giuliani", "Gabriel Pescia", "Jannes Nys", "Vladimir\n  Vargas-Calderon", "Nikita Astrakhantsev and Giuseppe Carleo"], "abstract": "  We introduce version 3 of NetKet, the machine learning toolbox for many-body\nquantum physics. NetKet is built around neural-network quantum states and\nprovides efficient algorithms for their evaluation and optimization. This new\nversion is built on top of JAX, a differentiable programming and accelerated\nlinear algebra framework for the Python programming language. The most\nsignificant new feature is the possibility to define arbitrary neural network\nans\\\"atze in pure Python code using the concise notation of machine-learning\nframeworks, which allows for just-in-time compilation as well as the implicit\ngeneration of gradients thanks to automatic differentiation. NetKet 3 also\ncomes with support for GPU and TPU accelerators, advanced support for discrete\nsymmetry groups, chunking to scale up to thousands of degrees of freedom,\ndrivers for quantum dynamics applications, and improved modularity, allowing\nusers to use only parts of the toolbox as a foundation for their own code.\n", "doi": "10.21468/scipostphyscodeb.7", "arxiv_id": "2112.10526", "pdf_urls": ["https://arxiv.org/pdf/2112.10526"], "github": ["https://github.com/netket/netket"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SciPost Phys. Codebases 7 (2022)", "categories": "quant-ph cs.LG cs.MS physics.comp-ph"}
{"title": "The Antenna Base Plays a Crucial Role in Mosquito Courtship Behavior", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Tim Ziemer", "Fabian Wetjen", "Alexander Herbst"], "abstract": "  Mosquitoes are vectors of diseases like malaria, dengue fever, yellow fever,\nchikungunya and Zika. For mosquito control it is crucial to understand their\nhearing system, as mosquitoes' courting behavior is mostly auditory. Many\nnonlinear characteristics of the mosquito hearing organ have been observed\nthrough behavioral studies and neural measurements. These enable mosquitoes to\ndetect and synchronize to other mosquitoes. Many hypotheses concerning the role\nof the flagellum and the fibrillae of the antenna in mosquito hearing have been\nmade, and neural processes have been considered as the origin of the\nnonlinearities. In this study we introduce a geometric model based on the\nmorphology of the mosquito antenna base. The model produces many of the\nobserved nonlinear characteristics, providing evidence that the base of the\nantenna plays a crucial role in mosquito hearing. Even without neural\nprocessing, the antenna response to sound produces behaviorally relevant cues\nthat can inform about the presence, location and sex of other mosquitoes.\n", "doi": "10.3389/fitd.2022.803611", "arxiv_id": "2112.10734", "pdf_urls": ["https://arxiv.org/pdf/2112.10734"], "github": ["https://github.com/hughidiyit/mosquito_antenna"], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Frontiers in Tropical Diseases, 18 March 2022", "categories": "nlin.AO physics.bio-ph"}
{"title": "Collaboration is not Evil: A Systematic Look at Security Research for\n  Industrial Use", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Jan Pennekamp", "Erik Buchholz", "Markus Dahlmanns", "Ike Kunze", "Stefan\n  Braun", "Eric Wagner", "Matthias Brockmann", "Klaus Wehrle", "Martin Henze"], "abstract": "  Following the recent Internet of Things-induced trends on digitization in\ngeneral, industrial applications will further evolve as well. With a focus on\nthe domains of manufacturing and production, the Internet of Production pursues\nthe vision of a digitized, globally interconnected, yet secure environment by\nestablishing a distributed knowledge base. Background. As part of our\ncollaborative research of advancing the scope of industrial applications\nthrough cybersecurity and privacy, we identified a set of common challenges and\npitfalls that surface in such applied interdisciplinary collaborations. Aim.\nOur goal with this paper is to support researchers in the emerging field of\ncybersecurity in industrial settings by formalizing our experiences as\nreference for other research efforts, in industry and academia alike. Method.\nBased on our experience, we derived a process cycle of performing such\ninterdisciplinary research, from the initial idea to the eventual dissemination\nand paper writing. This presented methodology strives to successfully bootstrap\nfurther research and to encourage further work in this emerging area. Results.\nApart from our newly proposed process cycle, we report on our experiences and\nconduct a case study applying this methodology, raising awareness for\nchallenges in cybersecurity research for industrial applications. We further\ndetail the interplay between our process cycle and the data lifecycle in\napplied research data management. Finally, we augment our discussion with an\nindustrial as well as an academic view on this research area and highlight that\nboth areas still have to overcome significant challenges to sustainably and\nsecurely advance industrial applications. Conclusions. With our proposed\nprocess cycle for interdisciplinary research in the intersection of\ncybersecurity and industrial application, we provide a foundation for further\nresearch.\n", "doi": "10.14722/laser-acsac.2020.23088", "arxiv_id": "2112.11417", "pdf_urls": ["https://arxiv.org/pdf/2112.11417"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Proceedings of the Workshop on Learning from Authoritative\n  Security Experiment Results (LASER '20), 2021, ACSAC", "categories": "cs.CR"}
{"title": "Theoretical simulation and experimental verification of dynamic caustic\n  manipulation using a deformable mirror for laser material processing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Marco Smarra", "Evgeny L. Gurevich and Andreas Ostendorf"], "abstract": "  The influence of a deformable mirror on spatial light modulation in ultrafast\nlasers processing is demonstrated. The deformable mirror was integrated into an\noptical setup which contains an additional lens for generating a nearly linear\nfocus shift in the focal plane behind the f-theta lens. The deformation of the\nmirror surface can be described by the Zernike terms Defocus, Astigmatism, and\na combination of both, resulting in a cylindric lens behavior. The influence of\nthe mirror surface deformation in this optical setup on the intensity\ndistribution in the focal plane was simulated. From the simulation results, the\ncaustic in the focal plane was calculated. The simulation results were compared\nto experiments using a picosecond laser with a maximum pulse energy of about 60\n$\\mu$J. We demonstrate that the initial astigmatism of the raw beam can be\nreduced using the deformable mirror. High linearity in the focus shift ($R^2\n>98$%) and the generation of elliptical/ line intensity distributions are\nshown. Line intensity distribution was used to demonstrate slit drilling\napplication in thin metal foils.\n", "doi": "10.1016/j.optlastec.2021.107814", "arxiv_id": "2112.11843", "pdf_urls": ["https://arxiv.org/pdf/2112.11843"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "Journal of Optics & Laser Technology, 149, 107814 (2022)", "categories": "physics.optics"}
{"title": "Vegetation Stratum Occupancy Prediction from Airborne LiDAR 3D Point\n  Clouds", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Ekaterina Kalinicheva", "Loic Landrieu", "Cl\\'ement Mallet", "Nesrine\n  Chehata"], "abstract": "  We propose a new deep learning-based method for estimating the occupancy of\nvegetation strata from 3D point clouds captured from an aerial platform. Our\nmodel predicts rasterized occupancy maps for three vegetation strata: lower,\nmedium, and higher strata. Our training scheme allows our network to only being\nsupervized with values aggregated over cylindrical plots, which are easier to\nproduce than pixel-wise or point-wise annotations. Our method outperforms\nhandcrafted and deep learning baselines in terms of precision while\nsimultaneously providing visual and interpretable predictions. We provide an\nopen-source implementation of our method along along a dataset of 199\nagricultural plots to train and evaluate occupancy regression algorithms.\n", "doi": null, "arxiv_id": "2112.13583", "pdf_urls": ["https://arxiv.org/pdf/2112.13583"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "SilviLaser 2021 Conference", "categories": "cs.CV"}
{"title": "Improved Algorithm for the Network Alignment Problem with Application to\n  Binary Diffing", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Elie Mengin (SAMM)", "Fabrice Rossi (CEREMADE)"], "abstract": "  In this paper, we present a novel algorithm to address the Network Alignment\nproblem. It is inspired from a previous message passing framework of Bayati et\nal. [2] and includes several modifications designed to significantly speed up\nthe message updates as well as to enforce their convergence. Experiments show\nthat our proposed model outperforms other state-of-the-art solvers. Finally, we\npropose an application of our method in order to address the Binary Diffing\nproblem. We show that our solution provides better assignment than the\nreference differs in almost all submitted instances and outline the importance\nof leveraging the graphical structure of binary programs.\n", "doi": "10.1016/j.procs.2021.08.099", "arxiv_id": "2112.15336", "pdf_urls": ["https://arxiv.org/pdf/2112.15336"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "25th International Conference on Knowledge Based and Intelligent\n  information and Engineering Systems (KES2021), Aug 2021, Szczecin, Poland.\n  pp.961-970", "categories": "cs.LG cs.DC stat.ML"}
{"title": "Binary Diffing as a Network Alignment Problem via Belief Propagation", "year": 2021, "venue_abbr": "ASE", "venue_name": "IEEE/ACM International Conference on Automated Software Engineering", "authors": ["Elie Mengin (SAMM)", "Fabrice Rossi (CEREMADE)"], "abstract": "  In this paper, we address the problem of finding a correspondence, or\nmatching, between the functions of two programs in binary form, which is one of\nthe most common task in binary diffing. We introduce a new formulation of this\nproblem as a particular instance of a graph edit problem over the call graphs\nof the programs. In this formulation, the quality of a mapping is evaluated\nsimultaneously with respect to both function content and call graph\nsimilarities. We show that this formulation is equivalent to a network\nalignment problem. We propose a solving strategy for this problem based on\nmax-product belief propagation. Finally, we implement a prototype of our\nmethod, called QBinDiff, and propose an extensive evaluation which shows that\nour approach outperforms state of the art diffing tools.\n", "doi": null, "arxiv_id": "2112.15337", "pdf_urls": ["https://arxiv.org/pdf/2112.15337"], "github": [], "is_oa": true, "sources": ["open-arxiv"], "type": "conference", "journal_ref": "36th IEEE/ACM International Conference on Automated Software\n  Engineering (ASE 2021), IEEE; ACM, Nov 2021, Melbourne, Australia", "categories": "cs.LG cs.AI stat.ML"}