DOCSLIB.ORG

Program Committee MSR 2005

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Program Committee MSR 2005 Proceedings 2nd International Workshop on Mining Software Repositories MSR 2005 Proceedings 2nd International Workshop on Mining Software Repositories MSR 2005 Saint Louis, Missouri, USA 17th May 2004 Co-located With International Conference on Software Engineering (ICSE 2005) Edited by Ahmed E. Hassan, Richard C. Holt, and Stephan Diehl Contents International Workshop on Mining Software Repositories MSR 2005 Message from the Workshop Chairs.................................................................................... i Program Committee............................................................................................................ ii Additional Reviewers ......................................................................................................... ii Program..............................................................................................................................iii Understanding Evolution and Change Patterns Understanding Source Code Evolution Using Abstract Syntax Tree Matching...........................2 Iulian Neamtiu, Jeffrey Foster, and Michael Hicks Recovering System Specific Rules from Software Repositories……………...............................7 Chadd Williams, and Jeffrey K. Hollingsworth Mining Evolution Data of a Product Family………….............................................................12 Michael Fischer, Johann Oberleitner, Jacek Ratzinger, and Harald Gall Using a Clone Genealogy Extractor for Understanding and Supporting Evolution of Code Clones …………..................................................................................................................17 Miryung Kim, and David Notkin Defect Analysis When do changes induce fixes?.............................................................................................24 Jacek Śliwerski, Thomas Zimmermann, and Andreas Zeller Error Detection by Refactoring Reconstruction…………………………………….....................29 Carsten Görg, and Peter Weißgerber Education Software Repository Mining with Marmoset: An Automated Programming Project Snapshot and Testing System...............................................................................................................................36 Jaime Spacco, Jaymie Strecker, David Hovemeyer, and William Pugh Mining Student CVS Repositories for Performance Indicators.....................................................41 Keir Mierle, Kevin Laven, Sam Roweis, and Greg Wilson Text Mining Toward Mining "Concept Keywords" from Identifiers in Large Software Projects......................48 Masaru Ohba, and Katsuhiko Gondow Source code that talks: an exploration of Eclipse task comments and their implication to repository mining ...........................................................................................................................53 Annie Ying, James Wright, and Steven Abrams Text Mining for Software Engineering: How Analyst Feedback Impacts Final Results…...........58 Jane Huffman Hayes, Alex Dekhtyar, and Senthil Karthikeyan Sundara Software Changes and Evolution Analysis of Signature Change Patterns..........................................................................................64 Sunghun Kim, James Whitehead, and Jennifer Bevan Improving Evolvability through Refactoring..........................................................................69 Jacek Ratzinger, Michael Fischer, Johann Oberleitner, and Harald Gall Linear Predictive Coding and Cepstrum coefficients for mining time variant information from software repositories.............................................................................................................74 Giuliano Antoniol, Vincenzo Fabio Rollo, and Gabriele Venturi Process and Collaboration Repository Mining and Six Sigma for Process Improvement...................................................80 Michael VanHilst, Pankaj Garg, and Christopher Lo Mining Version Histories for Verifying Learning Process of Legitimate Peripheral Participants………………….................................................................................................84 Shih-Kun Huang, and Kang-Min Liu Taxonomies & Formal Representations Towards a Taxonomy of Approaches for Mining of Source Code Repositories.........................90 Huzefa Kagdi, Michael Collard, and Jonathan Maletic A Framework for Describing and Understanding Mining Tools in Software Development….....95 Daniel German, Davor Cubranic, and Margaret-Anne D. Storey SCQL: A formal model and a query language for source control repositories………………....100 Abram Hindle, and Daniel German Integration and Collaboration Developer identification methods for integrated data from various sources……......................106 Gregorio Robles, and Jesús M. González-Barahona Accelerating Cross-Project knowledge Collaboration Using Collaborative Filtering and Social Networks…........................................................................................................................111 Masao Ohira, Naoki Ohsugi, Tetsuya Ohoka, and Ken-ichi Matsumoto Collaboration Using OSSmole: A repository of FLOSS data and analyses………..................116 Megan Conklin, James Howison, and Kevin Crowston Message From Workshop Chairs MSR 2005 Welcome to MSR 2005, the 2nd international workshop on Mining Software Repositories. MSR 2005 brings together researchers and practitioners to consider methods of using data stored in software repositories to further understanding of software development practices. We expect the presentations and discussions in this workshop to facilitate the definition of challenges, ideas and approaches to transform software repositories from static record keeping systems to active repositories used by researchers to gain empirical understanding of software development, and by software practitioners to predict and plan various aspects of their project. We received a large number of submissions – 38 papers from 14 countries. After the review process, 22 papers were chosen for publication. All accepted papers are presented. In order to fit all talks within the workshop day and based on input from the Program Committee during the review process, 11 papers are presented as Regular talks and 11 papers are presented as Lightning talks. Following the Lightning talks, we allocated an hour of informal discussions and demos, in which attendees are encouraged to interact with all presenters on topics of interest. We are grateful for the excellent and professional review job done by the reviewers on such a tight schedule. Ahmed E. Hassan Richard C. Holt University of Waterloo Stephan Diehl Catholic University Eichstätt i Program Committee MSR 2005 Alexander Dekhtyar, University of Kentucky, USA Premkumar T. Devanbu, University of California at Davis, USA Stephen G. Eick, SSS Research Inc., USA Harald Gall, University of Zurich, Switzerland Les Gasser, University of Illinois at Urbana Champaign, USA Daniel German, University of Victoria, Canada Jane Huffman Hayes, University of Kentucky, USA Katsuro Inoue, Osaka University, Japan Philip Johnson, University of Hawaii, USA Timothy C. Lethbridge, University of Ottawa, Canada Gail Murphy, University of British Colombia, Canada Audris Mockus, Avaya Labs Research, USA Thomas J. Ostrand, AT&T Research, USA Dewayne Perry, University of Texas, USA Jelber Sayyad Shirabad, University of Ottawa, Canada Annie Ying, IBM Research, USA Andreas Zeller, Saarland University, Germany Additional Reviewers MSR 2005 Davor Cubranic, University of Victoria, Canada Cory Kapser, University of Waterloo, Canada Jingwei Wu, University of Waterloo, Canada Thomas Zimmermann, Saarland University, Germany ii MSR 2005: International Workshop on Mining Software Repositories msr.uwaterloo.ca Welcome and Introduction [slides] 9:00-9:15 Ahmed E. Hassan, Richard C. Holt, and Stephan Diehl Session 1: Understanding Evolution and Change Patterns z Understanding Source Code Evolution Using Abstract Syntax Tree Matching [slides] Iulian Neamtiu, Jeffrey Foster, and Michael Hicks (University of Maryland) z Recovering System Specific Rules from Software Repositories [slides] Chadd Williams, and Jeffrey K. Hollingsworth (University of Maryland) 9:15-10:30 z Mining Evolution Data of a Product Family [slides] Michael Fischer, Johann Oberleitner, Jacek Ratzinger (Vienna University of Technology), and Harald Gall (University of Zürich) z Using a Clone Genealogy Extractor for Understanding and Supporting Evolution of Code Clones [slides] Miryung Kim, and David Notkin (University of Washington) 10:30-11:00 Coffee Break Session 2: Defect Analysis z When do changes induce fixes? [slides] 11:00-11:45 Jacek Sliwerski (Max Planck Institute for Computer Science), Thomas Zimmermann, and Andreas Zeller (Saarland University) z Error Detection by Refactoring Reconstruction [slides] Carsten Görg (Saarland University), and Peter Weißgerber (Catholic University Eichstätt) Session 3: Education z Software Repository Mining with Marmoset: An Automated Programming Project 11:45-12:30 Snapshot and Testing System [slides] Jaime Spacco, Jaymie Strecker, David Hovemeyer, and William Pugh (University of Maryland) z Mining Student CVS Repositories for Performance Indicators [slides] Keir Mierle,Kevin Laven, Sam Roweis, and Greg Wilson (University of Toronto) 12:30-1:45 Lunch iii Session 4: Lightning Talks (5 mins each) and Walkaround Presentations [info] z Session 4A: Text Mining { Toward Mining "Concept Keywords" from Identifiers in Large Software Projects [slides] Masaru Ohba, and Katsuhiko Gondow (Tokyo
Load more

Recommended publications
  • Emacspeak — the Complete Audio Desktop User Manual
    Emacspeak | The Complete Audio Desktop User Manual T. V. Raman Last Updated: 19 November 2016 Copyright c 1994{2016 T. V. Raman. All Rights Reserved. Permission is granted to make and distribute verbatim copies of this manual without charge provided the copyright notice and this permission notice are preserved on all copies. Short Contents Emacspeak :::::::::::::::::::::::::::::::::::::::::::::: 1 1 Copyright ::::::::::::::::::::::::::::::::::::::::::: 2 2 Announcing Emacspeak Manual 2nd Edition As An Open Source Project ::::::::::::::::::::::::::::::::::::::::::::: 3 3 Background :::::::::::::::::::::::::::::::::::::::::: 4 4 Introduction ::::::::::::::::::::::::::::::::::::::::: 6 5 Installation Instructions :::::::::::::::::::::::::::::::: 7 6 Basic Usage. ::::::::::::::::::::::::::::::::::::::::: 9 7 The Emacspeak Audio Desktop. :::::::::::::::::::::::: 19 8 Voice Lock :::::::::::::::::::::::::::::::::::::::::: 22 9 Using Online Help With Emacspeak. :::::::::::::::::::: 24 10 Emacs Packages. ::::::::::::::::::::::::::::::::::::: 26 11 Running Terminal Based Applications. ::::::::::::::::::: 45 12 Emacspeak Commands And Options::::::::::::::::::::: 49 13 Emacspeak Keyboard Commands. :::::::::::::::::::::: 361 14 TTS Servers ::::::::::::::::::::::::::::::::::::::: 362 15 Acknowledgments.::::::::::::::::::::::::::::::::::: 366 16 Concept Index :::::::::::::::::::::::::::::::::::::: 367 17 Key Index ::::::::::::::::::::::::::::::::::::::::: 368 Table of Contents Emacspeak :::::::::::::::::::::::::::::::::::::::::: 1 1 Copyright :::::::::::::::::::::::::::::::::::::::
    [Show full text]
  • The Design & Implementation of an Abstract Semantic Graph For
    Clemson University TigerPrints All Dissertations Dissertations 12-2011 The esiD gn & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications Edward Duffy Clemson University, [email protected] Follow this and additional works at: https://tigerprints.clemson.edu/all_dissertations Part of the Computer Sciences Commons Recommended Citation Duffy, Edward, "The eD sign & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications" (2011). All Dissertations. 832. https://tigerprints.clemson.edu/all_dissertations/832 This Dissertation is brought to you for free and open access by the Dissertations at TigerPrints. It has been accepted for inclusion in All Dissertations by an authorized administrator of TigerPrints. For more information, please contact [email protected]. THE DESIGN &IMPLEMENTATION OF AN ABSTRACT SEMANTIC GRAPH FOR STATEMENT-LEVEL DYNAMIC ANALYSIS OF C++ APPLICATIONS A Dissertation Presented to the Graduate School of Clemson University In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Computer Science by Edward B. Duffy December 2011 Accepted by: Dr. Brian A. Malloy, Committee Chair Dr. James B. von Oehsen Dr. Jason P. Hallstrom Dr. Pradip K. Srimani In this thesis, we describe our system, Hylian, for statement-level analysis, both static and dynamic, of a C++ application. We begin by extending the GNU gcc parser to generate parse trees in XML format for each of the compilation units in a C++ application. We then provide verification that the generated parse trees are structurally equivalent to the code in the original C++ application. We use the generated parse trees, together with an augmented version of the gcc test suite, to recover a grammar for the C++ dialect that we parse.
    [Show full text]
  • The Journal of AUUG Inc. Volume 25 ¯ Number 3 September 2004
    The Journal of AUUG Inc. Volume 25 ¯ Number 3 September 2004 Features: mychart Charting System for Recreational Boats 8 Lions Commentary, part 1 17 Managing Debian 24 SEQUENT: Asynchronous Distributed Data Exchange 51 Framework News: Minutes to AUUG board meeting of 5 May 2004 13 Liberal license for ancient UNIX sources 16 First Australian UNIX Developer’s Symposium: CFP 60 First Digital Pest Symposium 61 Regulars: Editorial 1 President’s Column 3 About AUUGN 4 My Home Network 5 AUUG Corporate Members 23 A Hacker’s Diary 29 Letters to AUUG 58 Chapter Meetings and Contact Details 62 AUUG Membership AppLication Form 63 ISSN 1035-7521 Print post approved by Australia Post - PP2391500002 AUUGN The journal of AUUG Inc. Volume 25, Number 3 September 2004 Editor ial Gr eg Lehey <[email protected]> After last quarter's spectacularly late delivery of For those newcomers who don't recall the “Lions AUUGN, things aregradually getting back to nor- Book”, this is the “Commentary on the Sixth Edi- mal. I had hoped to have this on your desk by tion UNIX Operating System” that John Lions the end of September,but it wasn't to be. Given wr ote for classes at UNSW back in 1977. Suppos- that that was only a couple of weeks after the “Ju- edly they werethe most-photocopied of all UNIX- ly” edition, this doesn’t seem to be such a prob- related documents. Ihad mislaid my photocopy, lem. I'm fully expecting to get the December is- poor as it was (weren't they all?) some time earli- sue out in time to keep you from boredom over er,soIwas delighted to have an easy to read ver- the Christmas break.
    [Show full text]
  • Application of Graph Databases for Static Code Analysis of Web-Applications
    Application of Graph Databases for Static Code Analysis of Web-Applications Daniil Sadyrin [0000-0001-5002-3639], Andrey Dergachev [0000-0002-1754-7120], Ivan Loginov [0000-0002-6254-6098], Iurii Korenkov [0000-0002-8948-2776], and Aglaya Ilina [0000-0003-1866-7914] ITMO University, Kronverkskiy prospekt, 49, St. Petersburg, 197101, Russia [email protected], [email protected], [email protected], [email protected], [email protected] Abstract. Graph databases offer a very flexible data model. We present the approach of static code analysis using graph databases. The main stage of the analysis algorithm is the construction of ASG (Abstract Source Graph), which represents relationships between AST (Abstract Syntax Tree) nodes. The ASG is saved to a graph database (like Neo4j) and queries to the database are made to get code properties for analysis. The approach is applied to detect and exploit Object Injection vulnerability in PHP web-applications. This vulnerability occurs when unsanitized user data enters PHP unserialize function. Successful exploitation of this vulnerability means building of “object chain”: a nested object, in the process of deserializing of it, a sequence of methods is being called leading to dangerous function call. In time of deserializing, some “magic” PHP methods (__wakeup or __destruct) are called on the object. To create the “object chain”, it’s necessary to analyze methods of classes declared in web-application, and find sequence of methods called from “magic” methods. The main idea of author’s approach is to save relationships between methods and functions in graph database and use queries to the database on Cypher language to find appropriate method calls.
    [Show full text]
  • Dense Semantic Graph and Its Application in Single Document Summarisation
    Dense Semantic Graph and its Application in Single Document Summarisation Monika Joshi1, Hui Wang1 and Sally McClean2 1 University of Ulster, Co. Antrim, BT37 0QB, UK [email protected] , [email protected] 2 University of Ulster, Co. Londonderry, BT52 1SA, UK [email protected] Abstract Semantic graph representation of text is an important part of natural language processing applications such as text summarisation. We have studied two ways of constructing the semantic graph of a document from dependency parsing of its sentences. The first graph is derived from the subject-object-verb representation of sentence, and the second graph is derived from considering more dependency relations in the sentence by a shortest distance dependency path calculation, resulting in a dense semantic graph. We have shown through experiments that dense semantic graphs gives better performance in semantic graph based unsupervised extractive text summarisation. 1 Introduction Information can be categorized into many forms -- numerical, visual, text, and audio. Text is abundantly present in online resources. Online blogs, Wikipedia knowledge base, patent documents and customer reviews are potential information sources for different user requirements. One of these requirements is to present a short summary of the originally larger document. The summary is expected to include important in- formation from the original text documents. This is usually achieved by keeping the informative parts of the document and reducing repetitive information. There are two types of text summarization: multiple document summarisation and single document summarization. The former is aimed at removing repetitive content in a collection of documents.
    [Show full text]
  • Autowig: Automatic Generation of Python Bindings for C++ Libraries
    AutoWIG: automatic generation of python bindings for C++ libraries Pierre Fernique and Christophe Pradal EPI Virtual Plants, Inria, Montpellier, France AGAP, CIRAD, INRA, Montpellier SupAgro, Univ Montpellier, Montpellier, France ABSTRACT Most of Python and R scientific packages incorporate compiled scientific libraries to speed up the code and reuse legacy libraries. While several semi-automatic solutions exist to wrap these compiled libraries, the process of wrapping a large library is cumbersome and time consuming. In this paper, we introduce AutoWIG, a Python package that wraps automatically compiled libraries into high-level languages using LLVM/Clang technologies and the Mako templating engine. Our approach is auto- matic, extensible, and applies to complex C++ libraries, composed of thousands of classes or incorporating modern meta-programming constructs. Subjects Data Science, Scientific Computing and Simulation, Programming Languages, Software Engineering Keywords C++, Python, Automatic bindings generation INTRODUCTION Many scientific libraries are written in low-level programming languages such as C and C++. Such libraries entail the usage of the traditional edit/compile/execute cycle in order to produce high-performance programs. This leads to lower computer processing time at the cost of high scientist coding time. At the opposite end of the spectrum, scripting languages such as MATLAB, Octave (John, David Bateman & Wehbring, 2014, Submitted 6 July 2017 Accepted 26 February 2018 for numerical work) Sage (The Sage Developers, 2015, for symbolic mathematics), R (R Published 2 April 2018 Core Team, 2014, for statistical analyses) or Python (Oliphant, 2007, for general purposes) Corresponding author provide an interactive framework that allows data scientists to explore their data, test new Pierre Fernique, [email protected] ideas, combine algorithmic approaches and evaluate their results on the fly.
    [Show full text]
  • ⅀ Xref Local PDF
    ⬉ Topic Index Cross Reference Creation and Navigation Description Keystroke Function Note Cross References Emacs provides several cross reference tools. Some tools are unified under the unified xref interface some others are independent. with Emacs PEL support several of them: • The unified xref interface is available since Emacs version 25.1. This includes: • The xref unified interface can be used with various back-ends: 1. major-mode specific load/interpretation backend (such as what is used for Emacs Lisp) 2. Tags-based tools using external TAGS file with the etags syntax supported by the etags utility and other etags-compatible tools: • etags (Emacs tags utility) ; see how to create TAGS files with etags, used by the xref-etag-mode. • Universal Ctags (successor of Exuberant Ctags) • GNU GLOBAL gtags utility with Universal Ctags and Pygments plugin. • The gxref xref back-end 3. other specialized parsers based tools that do not use tags: • Programming language agnostic packages: • dumb-jump, a fast grep/ag/ripgrep-based engine to navigate in over 40 programming languages without tags/database index files. • Specialized packages for specific major modes: • rtag-xref, a RTags backend specialized for C/C++ code. It uses a client/server application. • info-xref an internal package used to navigate into info document external references. • The xref unified interface can also be used with various front-end selectors when several entries are found for a search: • The default xref selector that uses a *xref* buffer to show all search result • The ivy-xref interface to select candidates with ivy • The helm-xref interface to select candidates with helm.
    [Show full text]
  • DART@AI*IA 2013 Proceedings
    Cristian Lai, Giovanni Semeraro, Alessandro Giuliani (Eds.) Proceedings of the 7th International Workshop on Information Filtering and Retrieval Workshop of the XIII AI*IA Conference December 6, 2013 Turin, Italy http://aixia2013.i-learn.unito.it/course/view.php?id=26 i Preface The series of DART workshops provides an interactive and focused platform for researchers and practitioners for presenting and discussing new and emerging ideas. Focusing on research and study on new challenges in intelligent information filtering and retrieval, DART aims to investigate novel systems and tools to web scenarios and semantic computing. Therefore, DART contributes to discuss and compare suitable novel solutions based on intelligent techniques and applied in real-world applications. Information Retrieval attempts to address similar filtering and ranking problems for pieces of information such as links, pages, and documents. Information Retrieval systems generally focus on the development of global retrieval techniques, often neglecting individual user needs and preferences. Information Filtering has drastically changed the way information seekers find what they are searching for. In fact, they effectively prune large information spaces and help users in selecting items that best meet their needs, interests, preferences, and tastes. These systems rely strongly on the use of various machine learning tools and algorithms for learning how to rank items and predict user evaluation. Submitted proposals received two or three review reports from Program Committee members. Based on the recommendations of the reviewers, 7 full papers have been selected for publication and presentation at DART 2013. When organizing a scientific conference, one always has to count on the efforts of many volunteers.
    [Show full text]
  • Graph-Based Source Code Analysis of Javascript Repositories
    Budapest University of Technology and Economics Faculty of Electrical Engineering and Informatics Department of Measurement and Information Systems Graph-Based Source Code Analysis of JavaScript Repositories Master’s Thesis Author: Dániel Stein Supervisors: Gábor Szárnyas Ádám Lippai Dávid Honfi 2016 ii Contents Contents ii Kivonat v Abstract vi 1 Introduction1 1.1 Context.......................................... 1 1.2 Problem Statement................................... 2 1.3 Objectives and Contributions............................. 2 1.4 Structure of the Thesis................................. 3 2 Preliminaries4 2.1 JavaScript......................................... 4 2.1.1 From Glue Language to a Full-Fledged Language............ 4 2.1.2 ECMAScript .................................. 4 2.2 Static Analysis...................................... 5 2.2.1 Use Cases.................................... 6 2.2.2 Advantages and Disadvantages....................... 6 2.2.3 Source Code Processing and Analysis................... 7 2.3 Handling Large Interconnected Data ........................ 12 2.3.1 On Graph Computing............................. 12 2.3.2 Evaluating Queries on a Data Structure.................. 14 2.3.3 Graph Databases ............................... 15 2.4 Integrated Development Environment (IDE).................... 17 2.4.1 Visual Studio Code .............................. 17 2.4.2 Alternative IDEs................................ 18 3 Related Work 20 3.1 Static Analysis Frameworks.............................. 20 3.1.1 Tern......................................
    [Show full text]
  • How to Deal with Your Raspberry Spy
    How To Deal With Your Raspberry Spy Gavin L. Rebeiro March 2, 2021 2 Cover The artwork on the cover of this work is used under ex- plicit written permission by the artist. Any copying, dis- tributing or reproduction of this artwork without the same explicit permission is considered theft and/or misuse of in- tellectual and creative property. • Artist: Cay • Artist Contact Details: [email protected] • Artist Portfolio: https://thecayart.wixsite.com/artwork/ contact These covers are here to spice things up a bit. Want to have your artwork showcased? Just send an email over to [email protected] 3 4 COVER and let us know! For encrypted communications, you can use the OpenPGP Key provided in chapter 6. Copyright • Author: Gavin L. Rebeiro • Copyright Holder: Gavin L. Rebeiro, 2021 • Contact Author: [email protected] • Publisher: E2EOPS PRESS LIMITED • Contact Publisher: [email protected] This work is licensed under a Creative Commons Attribution- ShareAlike 4.0 International License. For encrypted communications, you can use the OpenPGP Key provided in chapter 6. 5 6 COPYRIGHT Chapter 1 Acknowledgements Techrights techrights.org (TR) deserves credit for coverage of the Raspberry Spy Foundation’s underhand tactics; a heart- felt thanks to everyone who participated and notified TR about the Raspberry Spy espionage. TR has been robbed of credit they deserved in the early days of news coverage. The fol- lowing links go over some of the news coverage from TR: • Raspberry Pi (at Least Raspbian GNU/Linux and/or Rasp- berry Pi Foundation) Appears to
    [Show full text]
  • Domain Specific Languages and Their Type Systems
    Domain specific languages and their type systems Citation for published version (APA): Meer, van der, A. P. (2014). Domain specific languages and their type systems. Technische Universiteit Eindhoven. https://doi.org/10.6100/IR778421 DOI: 10.6100/IR778421 Document status and date: Published: 01/01/2014 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Experience with ANSI C Markup Language for a Cross-Referencer
    Experience with ANSI C Markup Language for a cross-referencer Hayato Kawashima and Katsuhiko Gondow Department of Information Science, Japan Advanced Institute of Science and Technology (JAIST) 1-1 Asahidai Tatsunokuchi Nomi Ishikawa, 923-1292, JAPAN {hayato-k, gondow}@jaist.ac.jp Abstract duced ACML (ANSI C Markup Language) [6]. ACML is a kind of domain-specific language (DSL) to describe a com- The purpose of this paper is twofold: (1) to examine mon data format specific to ANSI C in the domain of CASE the properties of our ANSI C Markup Language (ACML) tools. That is, ACML is defined as a set of XML [1] tags as a domain-specific language (DSL); and (2) to show that and attributes, which describe ANSI C program’s syntax ACML is useful as a DSL by implementing an ANSI C cross- trees, types, symbol tables, and relationships among lan- referencer using ACML. guage constructs. We have introduced ACML as a DSL for developing A DSL is a programming language dedicated to a par- CASE tools. ACML is defined as a set of XML tags and ticular domain or problem. For example, Lex and Yacc are attributes, and describes ANSI C program’s syntax trees, used for lexers and parsers; VHDL for electronic hardware types, symbol tables, and so on. That is, ACML is the DSL description. Furthermore, even markup languages can also which plays the role of intermediate representation among be viewed as DSLs, because they can be good languages to CASE tools. ACML-tagged documents are automatically describe some data’s structures, relationships and semantics generated from ANSI C programs, and then used as input specific to some particular domain, even though they are of CASE tools.
    [Show full text]