Jehak Woo, Jongwook Woo, I. Attali, D. Caromel, J. Gaudiot, A. Wendelborn
{"title":"Alias Analysis for Exceptions in Java","authors":"Jehak Woo, Jongwook Woo, I. Attali, D. Caromel, J. Gaudiot, A. Wendelborn","doi":"10.1145/563857.563838","DOIUrl":"https://doi.org/10.1145/563857.563838","url":null,"abstract":"We propose a flow-sensitive alias analysis algorithm that computes safe and efficient alias sets in Java. For that, we propose a references-set representation of aliased elements, its type table, and its propagation rules. Also, for an exception construct, we consider try/catch/finally blocks as well as potential exception statement nodes while building a control flow graph. Finally, for the safe alias computation on a control flow graph, we present a structural order traverse of each block and node.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126345834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application Rates to Undergraduate Programs in Information Technology in Australian Universities","authors":"J. Roddick, Adrienne L. Nieuwenhuis","doi":"10.1145/563857.563827","DOIUrl":"https://doi.org/10.1145/563857.563827","url":null,"abstract":"Over the past decade, there has been much discussion regarding both the supply and the current and potential demand for information technology-oriented graduates in Australia with numerous surveys and market analyses being undertaken. some surveys have focussed on the supply of graduates from the tertiary and VET sectors and their demand in Australian industry, while others discuss enrolment statistics into IT based University and VET sector courses. Few, however, investigate application rates to IT courses.At the same time, there has been a general, and in some cases significant, decline in the application rates for some science and engineering courses prompting universities to review their awards with a view to making them more attractive to students and industry. In many cases this has resulted in the development of more highly specialised awards and in others in substantial shifts in quota.In this paper we investigate application trends for information technology-oriented awards from a number of perspectives, including the market perceptions of the institution offering the degree and the manner in which the award is combined with other disciplines. Although this study takes advantage of the centralised admissions systems used in Australia, data available elsewhere shows that the results may be applicable more broadly.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126870259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Learning and the Reflective Journal in Computer Science","authors":"S. George","doi":"10.1145/563857.563811","DOIUrl":"https://doi.org/10.1145/563857.563811","url":null,"abstract":"This paper describes the use of the reflective journal in a computer programming course at the University of South Australia. We describe rationale for the journal relating it to the contribution it can make to generic skills of lifelong learning, problem-solving, communication and awareness of personal learning strategies. We also relate it to the Personal Software Process (PSP) used by industry to encourage software engineers to improve productivity by 'review', with collation of software productivity metrics and awareness of personal and team level practice.We introduce the detail how students were asked to use the journal and evaluate its influence on learning. We present a selection of student reflections on the journal and summarise attainment comparing attainment in the journal with other more traditional items of assessment. We conclude that there is a place for the reflective journal in programming courses - a number of students reported benefits to their learning along a number of dimensions - and this was supported with evidence both in their journal itself and by their absolute attainment. We also note that the reflective journal is not universally accepted (or even recognised as a 'valid' learning activity by some). However, we recommend further use and development of such reflective techniques in computer science to stimulate good software practice and deep learning.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132166954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. I. Faulconbridge, Mark R. Pickering, Michael J. Ryan
{"title":"Unsupervised band removal leading to improved classification accuracy of hyperspectral images","authors":"R. I. Faulconbridge, Mark R. Pickering, Michael J. Ryan","doi":"10.1145/1151699.1151704","DOIUrl":"https://doi.org/10.1145/1151699.1151704","url":null,"abstract":"Remotely-sensed images of the earth's surface are used across a wide range of industries and applications including agriculture, mining, defence, geography and geology, to name but a few. Hyperspectral sensors produce these images by providing reflectance data from the earth's surface over a broad range of wavelengths or bands. Some of the bands suffer from a low signal-to noise ratio (SNR) and do not contribute to the subsequent classification of pixels within the hyperspectral image. Users of hyperspectral images typically become familiar with individual images or sensors and often manually omit these bands before classification.We propose a process that automatically determines the spectral bands that may not contribute to classification and removes these bands from the image. Removal of these bands improves the classification performance of a well-researched hyperspectral test image by over 10% whilst reducing the size of the image from a data storage perspective by almost 30%. The process does not rely on prior knowledge of the sensor, the image or the phenomenology causing the SNR problem.In future work, we aim to develop compression algorithms that incorporate this process to achieve satisfactory compression ratios whilst maintaining acceptable classification accuracies.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126007994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SPiKE: engineering malware analysis tools using unobtrusive binary-instrumentation","authors":"Amit Vasudevan, R. Yerraballi","doi":"10.1145/1151699.1151734","DOIUrl":"https://doi.org/10.1145/1151699.1151734","url":null,"abstract":"Malware -- a generic term that encompasses viruses, trojans, spywares and other intrusive code -- is widespread today. Malware analysis is a multi-step process providing insight into malware structure and functionality, facilitating the development of an antidote. Behavior monitoring, an important step in the analysis process, is used to observe malware interaction with respect to the system and is achieved by employing dynamic coarse-grained binary-instrumentation on the target system. However, current research involving dynamic binary-instrumentation, categorized into probe-based and just-in-time compilation (JIT), fail in the context of malware. Probe-based schemes are not transparent. Most if not all malware are sensitive to code modification incorporating methods to prevent their analysis and even instrument the system themselves for their functionality and stealthness. Current JIT schemes, though transparent, do not support multithreading, self-modifying and/or self-checking (SM-SC) code and are unable to capture code running in kernel-mode. Also, they are an overkill in terms of latency for coarse-grained instrumentation.To address this problem, we have developed a new dynamic coarse-grained binary-instrumentation framework codenamed SPiKE, that aids in the construction of powerful malware analysis tools to combat malware that are becoming increasingly hard to analyze. Our goal is to provide a binary-instrumentation framework that is unobtrusive, portable, efficient, easy-to-use and reusable, supporting multithreading and SM-SC code, both in user- and kernel-mode. In this paper, we discuss the concept of unobtrusive binary-instrumentation and present the design, implementation and evaluation of SPiKE. We also illustrate the framework utility by describing our experience with a tool employing SPiKE to analyze a real world malware.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126202188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards security labelling","authors":"Chuchang Liu, M. Orgun","doi":"10.1145/1151699.1151708","DOIUrl":"https://doi.org/10.1145/1151699.1151708","url":null,"abstract":"Security labels are applied for numerous reasons, including the handling of data communicated between open systems. The information contained within a security label can be utilised to perform access control decisions, specify protective measure, and aid in the determination of additional handling restrictions required by a communications security policy. This paper concerns the issues regarding security labelling in open systems. We propose a security labelling framework for such systems; and further, based on this framework, we develop a mechanically checkable model for security labelling systems and discuss its implementation issues. This model provides a functional base for future design and implementation of security labelling systems.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129034368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Metaphor and Metonymy in Object-Oriented Design Patterns","authors":"J. Noble, R. Biddle, E. Tempero","doi":"10.1145/563857.563823","DOIUrl":"https://doi.org/10.1145/563857.563823","url":null,"abstract":"The key principle of object-oriented design is that each program object should correspond to an object in the real world, that is to say, a program is a metaphor for the world. More advanced object-oriented designs, such as many of Gamma et. al.'s Design Patterns, are not directly metaphorical: State objects, Strategy objects and Visitor objects, for example, do not correspond to objects in the real world. We show how these patterns, and other similar designs, can be understood as metonymy, rather than metaphor, that is, they are based on an attribute, cause, or effect, rather than being based on something in the world, in terms of Jakobson and Lodge's typology. Understanding how both metaphor and metonymy can be used in design can illustrate how design patterns work alongside more traditional object-oriented modelling to produce designs that are accurate, flexible, and better understood.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"20 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129036539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Translating Refined Logic Programs to Mercury","authors":"R. Colvin, I. Hayes, D. Hemer, P. Strooper","doi":"10.1145/563857.563806","DOIUrl":"https://doi.org/10.1145/563857.563806","url":null,"abstract":"A refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification. In this paper we investigate the use of Mercury as the target implementation language for a refinement calculus for logic programs. We describe a prototype tool for translating programs in our specification language to Mercury code. More generally, we investigate the advantages that Mercury has over standard Prolog, with respect to developing correct programs from specifications.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124584566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Implementation of Parallel Pattern-Matching via Concurrent Haskell","authors":"R. L. While, G. Mildenhall","doi":"10.1145/563857.563835","DOIUrl":"https://doi.org/10.1145/563857.563835","url":null,"abstract":"Parallel pattern-matching offers the maximum laziness for programs written in lazy functional languages. Function arguments are evaluated concurrently and all arguments are given equal precedence, so functions can return results whenever possible in the presence of errors or infinite computations. We describe the motivation for and the semantics of parallel pattern-matching. We also describe the first available implementation of Haskell with parallel pattern-matching. The implementation works via a source-to-source translation into Concurrent Haskell, using the existing facilities of GHC to provide the required concurrency. Various transformation techniques are outlined which can help to reduce the degree and cost of the concurrency required to satisfy the semantics.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131028485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search","authors":"K. Tokoro, Kazuaki Yamaguchi, S. Masuda","doi":"10.1145/1151699.1151709","DOIUrl":"https://doi.org/10.1145/1151699.1151709","url":null,"abstract":"Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (closest k objects) to a query object. Although the definition of the distance between objects depends on applications, its computation is generally complicated and time-consuming. It is therefore important to reduce the number of distance computations. TLAESA (Tree Linear Approximating and Eliminating Search Algorithm) is one of the fastest algorithms for NN searches. This method reduces distance computations by using a branch and bound algorithm. In this paper we improve both the data structure and the search algorithm of TLAESA. The proposed method greatly reduces the number of distance computations. Moreover, we extend the improved method to an approximation search algorithm which ensures the quality of solutions. Experimental results show that the proposed method is efficient and finds an approximate solution with a very low error rate.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131183828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}