By Topic

2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE)

9-13 Nov. 2015

Filter Results

Displaying Results 1 - 25 of 115
  • [Title page i]

    Publication Year: 2015, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (123 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2015, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (157 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2015, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (114 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2015, Page(s):v - xiv
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • Message from the Chairs

    Publication Year: 2015, Page(s):xv - xvi
    Request permission for commercial reuse | PDF file iconPDF (121 KB) | HTML iconHTML
    Freely Available from IEEE
  • ASE 2015 Organization

    Publication Year: 2015, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (102 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2015, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • Expert Review Panel

    Publication Year: 2015, Page(s): xix
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2015, Page(s): xx
    Request permission for commercial reuse | PDF file iconPDF (94 KB)
    Freely Available from IEEE
  • Doctoral Symposium and Tool Demonstrations Committees

    Publication Year: 2015, Page(s): xxi
    Request permission for commercial reuse | PDF file iconPDF (101 KB)
    Freely Available from IEEE
  • ASE Steering Committee and ASE Fellows

    Publication Year: 2015, Page(s): xxii
    Request permission for commercial reuse | PDF file iconPDF (81 KB)
    Freely Available from IEEE
  • Keynotes

    Publication Year: 2015, Page(s):xxiii - xxv
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    Provides an abstract for each of the keynote presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sponsors and supporters

    Publication Year: 2015, Page(s): xxvi
    Request permission for commercial reuse | PDF file iconPDF (338 KB)
    Freely Available from IEEE
  • Learning to Rank for Question-Oriented Software Text Retrieval (T)

    Publication Year: 2015, Page(s):1 - 11
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (466 KB) | HTML iconHTML

    Question-oriented text retrieval, aka natural language-based text retrieval, has been widely used in software engineering. Earlier work has concluded that questions with the same keywords but different interrogatives (such as how, what) should result in different answers. But what is the difference? How to identify the right answers to a question? In this paper, we propose to investigate the "answ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development Emails Content Analyzer: Intention Mining in Developer Discussions (T)

    Publication Year: 2015, Page(s):12 - 23
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (958 KB) | HTML iconHTML

    Written development communication (e.g. mailing lists, issue trackers) constitutes a precious source of information to build recommenders for software engineers, for example aimed at suggesting experts, or at redocumenting existing source code. In this paper we propose a novel, semi-supervised approach named DECA (Development Emails Content Analyzer) that uses Natural Language Parsing to classify ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CodeExchange: Supporting Reformulation of Internet-Scale Code Queries in Context (T)

    Publication Year: 2015, Page(s):24 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (933 KB) | HTML iconHTML

    Programming today regularly involves searching for source code online, whether through a general search engine such as Google or a specialized code search engine such as SearchCode, Ohloh, or GitHub. Searching typically is an iterative process, with develop-ers adjusting the keywords they use based on the results of the previous query. However, searching in this manner is not ideal, because just u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How do Developers Document Database Usages in Source Code? (N)

    Publication Year: 2015, Page(s):36 - 41
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (163 KB) | HTML iconHTML

    Database-centric applications (DCAs) usually contain a large number of tables, attributes, and constraints describing the underlying data model. Understanding how database tables and attributes are used in the source code along with the constraints related to these usages is an important component of DCA maintenance. However, documenting database-related operations and their constraints in the sou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Data Model Verification with Many-Sorted Logic (T)

    Publication Year: 2015, Page(s):42 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    Misuse or loss of web application data can have catastrophic consequences in today's Internet oriented world. Hence, verification of web application data models is of paramount importance. We have developed a framework for verification of web application data models via translation to First Order Logic (FOL), followed by automated theorem proving. Due to the undecidability of FOL, this automated a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesising Interprocedural Bit-Precise Termination Proofs (T)

    Publication Year: 2015, Page(s):53 - 64
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems, interprocedural termination analysis seems essential, which is a largely unexplored area of research in termination analysis, where most effort has focussed on difficult ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interpolation Guided Compositional Verification (T)

    Publication Year: 2015, Page(s):65 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    Model checking suffers from the state space explosion problem. Compositional verification techniques such as assume-guarantee reasoning (AGR) have been proposed to alleviate the problem. However, there are at least three challenges in applying AGR. Firstly, given a system M1 ? M2, how do we automatically construct and refine (in the presence of spurious counterexamples) an assumption A2, which mus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Crust: A Bounded Verifier for Rust (N)

    Publication Year: 2015, Page(s):75 - 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (155 KB) | HTML iconHTML

    Rust is a modern systems language that provides guaranteed memory safety through static analysis. However, Rust includes an escape hatch in the form of "unsafe code," which the compiler assumes to be memory safe and to preserve crucial pointer aliasing invariants. Unsafe code appears in many data structure implementations and other essential libraries, and bugs in this code can lead to memory safe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General LTL Specification Mining (T)

    Publication Year: 2015, Page(s):81 - 92
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB) | HTML iconHTML

    Temporal properties are useful for describing and reasoning about software behavior, but developers rarely write down temporal specifications of their systems. Prior work on inferring specifications developed tools to extract likely program specifications that fit particular kinds of tool-specific templates. This paper introduces Texada, a new temporal specification mining tool for extracting spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Have We Seen Enough Traces? (T)

    Publication Year: 2015, Page(s):93 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (315 KB) | HTML iconHTML

    Dynamic specification mining extracts candidate specifications from logs of execution traces. Existing algorithms differ in the kinds of traces they take as input and in the kinds of candidate specification they present as output. One challenge common to all approaches relates to the faithfulness of the mining results: how can we be confident that the extracted specifications faithfully characteri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting Visual Contracts from Java Programs (T)

    Publication Year: 2015, Page(s):104 - 114
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2066 KB) | HTML iconHTML

    Visual contracts model the operations of components or services by pre-and post-conditions formalised as graph transformation rules. They provide a precise intuitive notation to support testing, understanding and analysis of software. However, due to their detailed specification of data states and transformations, modelling real applications is an error-prone process. In this paper we propose a dy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synergizing Specification Miners through Model Fissions and Fusions (T)

    Publication Year: 2015, Page(s):115 - 125
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    Software systems are often developed and released without formal specifications. For those systems that are formally specified, developers have to continuously maintain and update the specifications or have them fall out of date. To deal with the absence of formal specifications, researchers have proposed techniques to infer the missing specifications of an implementation in a variety of forms, su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.