发布求助
文献互助 智能选刊 最新文献

Australasian Computer Science Conference最新文献

筛选
英文 中文
A Generalised Spreadsheet Verification Methodology 通用电子表格验证方法
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563826
N. Randolph, John Morris, Gareth Lee
{"title":"A Generalised Spreadsheet Verification Methodology","authors":"N. Randolph, John Morris, Gareth Lee","doi":"10.1145/563857.563826","DOIUrl":"https://doi.org/10.1145/563857.563826","url":null,"abstract":"Although spreadsheets have been around for over thirty years, we are only just realising their importance. Most companies use spreadsheets in their decision-making processes, but rarely employ any form of testing. This paper shows how an \"all-uses\" test adequacy technique can be integrated into Microsoft's Excel. The modular technique adopted makes the implementation spreadsheet package independent. It also includes a user interface, to assist developers specify test cases and a technique for recording test cases and session information. In particular it presents a systematic technique for constructing test cases. As a key problem with spreadsheet development is the inexperience of developers, this paper describes an easy to use tool that will improve the standard of spreadsheets developed.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"49 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":"116917988","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}
引用次数: 8
Repairing Syntax Errors in LR-based Parsers 修复基于lr的解析器中的语法错误
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563804
C. Cerecke
{"title":"Repairing Syntax Errors in LR-based Parsers","authors":"C. Cerecke","doi":"10.1145/563857.563804","DOIUrl":"https://doi.org/10.1145/563857.563804","url":null,"abstract":"When a compiler encounters a syntax error, it usually attempts to restart parsing to check the remainder of the input for any further errors. One common method of recovering from syntax errors is to repair the incorrect input string, allowing parsing to continue. This research presents a language independent method for repairing the input string to an LALR(1) parser. The method results in much faster repairs in general than an existing method, enabling some errors to be repaired that were previously too costly. Results are based on repairing syntax errors in Java programs from first year computer science students.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"182 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":"114176113","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}
引用次数: 12
Supporting Component-Based Reuse in CARE 在CARE中支持基于组件的重用
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563813
D. Hemer, P. Lindsay
{"title":"Supporting Component-Based Reuse in CARE","authors":"D. Hemer, P. Lindsay","doi":"10.1145/563857.563813","DOIUrl":"https://doi.org/10.1145/563857.563813","url":null,"abstract":"The increased reliance on software in critical applications suggests a greater need for formal methods to be used in the development of such software. A number of formal languages and toolsets exist for developing formally specified and verified software; however experience tells us that the development of formally verified software, even with the current tool support, is an expensive process.By adopting a component-based development methodology, whereby software is developed from reusable components, significant savings can be made. In particular the amount of proof --- arguably the most expensive and difficult part of formal development --- can be greatly reduced by proving the correctness of reusable components once, off-line, prior to their use.Tools are required which support the user in adapting and retrieving components from libraries of formally specified components. This paper describes extensions to the CARE toolset that support adaptation and retrieval of reusable components.","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":"117272067","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}
引用次数: 13
Relative simulation and model checking of real-time processes 实时过程的相关仿真和模型校核
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1378279.1378306
C. Fidge
{"title":"Relative simulation and model checking of real-time processes","authors":"C. Fidge","doi":"10.1145/1378279.1378306","DOIUrl":"https://doi.org/10.1145/1378279.1378306","url":null,"abstract":"Simulation and model checking are commonly used to compare the behaviour of a computer-based system with its requirements specification. However, when upgrading an operational legacy system the challenge is usually to compare the behaviour of a proposed new system against an old trusted one. Doing this for time-sensitive control systems is awkward because the behaviour of the system is dependent on that of its physical environment. Consequently, the old and new systems can be compared meaningfully only when they are simulated under exactly the same conditions. In this paper we show how this can be done by simulating both the old and new systems simultaneously, with both system models linked to the same environment model. The resulting simulation traces and model checking counterexamples allow the behaviours of a legacy real-time system and its proposed replacement to be compared directly and easily.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"56 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":"122992676","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}
引用次数: 0
A Local Broker enabled MobiPass architecture for enhancing trusted interaction efficiency 本地代理启用了MobiPass架构，以增强可信交互效率
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1378279.1378291
Will Tao, R. Steele
{"title":"A Local Broker enabled MobiPass architecture for enhancing trusted interaction efficiency","authors":"Will Tao, R. Steele","doi":"10.1145/1378279.1378291","DOIUrl":"https://doi.org/10.1145/1378279.1378291","url":null,"abstract":"While mobile computing provides a potentially vast business opportunity for many industry participants, it also raises issues such as security and performance. This paper proposes a Local Broker enabled MobiPass architecture based on our previous research outcomes. Our MobiPass architecture can convert the unpredictable and highly dynamic mobile environment into a trusted business platform. By setting customised rules against a MobiPolicy, the Mobipass architecture enables fine grained access control without necessarily having a prior knowledge or interaction with other encountered parties and environments. This paper extends our MobiPass architecture by introducing an additional element -- the Local Broker, to enhance the architecture's performance and efficiency. A detailed case study has been provided to explain the role that the Local Broker takes in the architecture.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"86 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":"123329059","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}
引用次数: 3
Ticket-Based Service Access Scheme for Mobile Users 流动用户以票证为基础的服务接达方案
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563834
Hua Wang, Jinli Cao, Yanchuan Zhang
{"title":"Ticket-Based Service Access Scheme for Mobile Users","authors":"Hua Wang, Jinli Cao, Yanchuan Zhang","doi":"10.1145/563857.563834","DOIUrl":"https://doi.org/10.1145/563857.563834","url":null,"abstract":"Security is one of the important issues in mobile computing, especially in mobile database systems since mobile environments are dynamic and traditional protection mechanisms do not work very well in such environments. For mobile database access across multiple service domains, the traditional access mechanisms rely on the concept of starting home location and cross domain authentication using roaming agreements. However, the cross domain authentications will involve many complicated authentication activities when the roam path is long. This limits the future mobile applications.This paper presents a global solution for all kinds of mobile services, by a ticket-based service access model that allows anonymous service usage in mobile application and access. The service provider can avoid roaming to multiple service domains, only contacting the Credential Centre to check the user's certification. The user can preserve anonymity and read a clear record of charges in the Credential Centre at anytime. Furthermore, the identity of misbehaving users can be revealed by a Trusted Centre.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"16 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":"128909785","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}
引用次数: 39
Segregated failures model for availability evaluation of fault-tolerant systems 容错系统可用性评估的分离故障模型
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1151699.1151706
S. Vilkomir, D. Parnas, V. Mendiratta, E. Murphy
{"title":"Segregated failures model for availability evaluation of fault-tolerant systems","authors":"S. Vilkomir, D. Parnas, V. Mendiratta, E. Murphy","doi":"10.1145/1151699.1151706","DOIUrl":"https://doi.org/10.1145/1151699.1151706","url":null,"abstract":"This paper presents a method of estimating the availability of fault-tolerant computer systems with several recovery procedures. A segregated failures model has been proposed recently for this purpose. This paper provides further analysis and extension of this model. The segregated failures model is compared with a Markov chain model and is extended for the situation when the coverage factor is unknown and failure escalation rates must be used instead. This situation is illustrated in detail by estimating availability of a Lucent Technologies Reliable Clustered Computing architecture. For this example, numeric values are provided for availability indexes and the contribution of each recovery procedure to total system availability is analysed.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"26 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":"128803788","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}
引用次数: 12
Manufacturing opaque predicates in distributed systems for code obfuscation 在分布式系统中为代码混淆制造不透明的谓词
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1151699.1151721
A. Majumdar, C. Thomborson
{"title":"Manufacturing opaque predicates in distributed systems for code obfuscation","authors":"A. Majumdar, C. Thomborson","doi":"10.1145/1151699.1151721","DOIUrl":"https://doi.org/10.1145/1151699.1151721","url":null,"abstract":"Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfuscation is to make the logic embedded in code incomprehensible to automated program analysis tools used by adversaries. Opaque predicates act as tool for obfuscating control flow logic embedded within code. In this position paper, we address the problem of control-flow code obfuscation of processes executing in distributed computing environments by proposing a novel method of combining the open problems of distributed global state detection with a well-known hard combinatorial problem to manufacture opaque predicates. We name this class of new opaque predicates as distributed opaque predicates. We demonstrate our approach with an illustration and provide an extensive security analysis of code obfuscated with distributed opaque predicates. We show that our class of opaque predicates is capable of withstanding most known forms of automated static analysis attacks and a restricted class of dynamic analysis attack that could be mounted by adversaries.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"4 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":"128833246","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}
引用次数: 43
Specifying Mode Requirements of Embedded Systems 指定嵌入式系统的模式要求
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563830
Graeme Smith
{"title":"Specifying Mode Requirements of Embedded Systems","authors":"Graeme Smith","doi":"10.1145/563857.563830","DOIUrl":"https://doi.org/10.1145/563857.563830","url":null,"abstract":"This paper presents a formal notation for specifying requirements of embedded systems which exhibit continuous, real-time behaviour and move through various modes under digital control. It does this by extending an existing formal notation supporting continuous, real-time behaviour with an explicit concept of modes. The resulting notation avoids the subtleties which would otherwise arise when specifying mode-related requirements. It is therefore ideal as a means of specifying and communicating requirements of embedded systems.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"139 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":"122432562","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}
引用次数: 3
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees 后缀向量:空间和时间效率替代后缀树
Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563820
K. Monostori, A. Zaslavsky, H. Schmidt
{"title":"Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees","authors":"K. Monostori, A. Zaslavsky, H. Schmidt","doi":"10.1145/563857.563820","DOIUrl":"https://doi.org/10.1145/563857.563820","url":null,"abstract":"Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its space requirement. This paper describes a new structure called suffix vector, which is not only better in terms of storage space but also simpler than the most efficient suffix tree representation known to date. Alternatives of storage representations are discussed and a linear-time construction algorithm is also proposed in this paper. Space requirement of the suffix vector structure is compared to the space requirement of alternative suffix tree representations. We also make a theoretical comparison on the number of operations required to run algorithms on the suffix vector.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"8 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":"124180817","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}
引用次数: 11
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信