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

Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)最新文献

筛选
英文 中文
Object-oriented cohesion as a surrogate of software comprehension: an empirical study 面向对象内聚作为软件理解的替代品:一项实证研究
Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05) Pub Date : 2005-09-30 DOI: 10.1109/SCAM.2005.19
S. Counsell, S. Swift, A. Tucker
{"title":"Object-oriented cohesion as a surrogate of software comprehension: an empirical study","authors":"S. Counsell, S. Swift, A. Tucker","doi":"10.1109/SCAM.2005.19","DOIUrl":"https://doi.org/10.1109/SCAM.2005.19","url":null,"abstract":"The concept of software cohesion in both the procedural and object-oriented paradigm is well known and documented. What is not so well known or documented is the perception of what empirically constitutes a cohesive 'unit' by software engineers. In this paper, we describe an empirical investigation using object-oriented (OO) classes as a basis. Twenty-four subjects (drawn from IT experienced and IT inexperienced groups) were asked to rate ten classes sampled from two industrial systems in terms of their overall cohesiveness; a class environment was used to carry out the study. Four key results were observed. Firstly, class size (when expressed in terms of number of methods) did not tend to influence the perception of cohesion by any subjects. Secondly, well-commented classes were rated most highly amongst both IT experienced and inexperienced subjects. Thirdly, the empirical study suggests that cohesion comprises a combination of various class factors including low coupling, small numbers of attributes and well-commented methods, rather than any single, individual class feature per se. Finally, the research supports the view that cohesion is a subjective concept reflecting a cognitive combination of class features; as such it is a surrogate for class comprehension.","PeriodicalId":394744,"journal":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131274345","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}
引用次数: 21
A fast analysis for thread-local garbage collection with dynamic class loading 具有动态类加载的线程本地垃圾收集的快速分析
Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05) Pub Date : 2005-09-30 DOI: 10.1109/SCAM.2005.1
Richard E. Jones, A. King
{"title":"A fast analysis for thread-local garbage collection with dynamic class loading","authors":"Richard E. Jones, A. King","doi":"10.1109/SCAM.2005.1","DOIUrl":"https://doi.org/10.1109/SCAM.2005.1","url":null,"abstract":"Long-running, heavily multi-threaded, Java server applications make stringent demands of garbage collector (GC) performance. Synchronisation of all application threads before garbage collection is a significant bottleneck for JVMs that use native threads. We present a new static analysis and a novel GC framework designed to address this issue by allowing independent collection of thread-local heaps. In contrast to previous work, our solution safely classifies objects even in the presence of dynamic class loading, requires neither write-barriers that may do unbounded work, nor synchronisation, nor locks during thread-local collections; our analysis is sufficiently fast to permit its integration into a high-performance, production-quality virtual machine.","PeriodicalId":394744,"journal":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122994479","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}
引用次数: 25
Transforming embedded Java code into custom tags 将嵌入式Java代码转换为自定义标记
Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05) Pub Date : 2005-09-30 DOI: 10.1109/SCAM.2005.27
Shannon Xu, T. Dean
{"title":"Transforming embedded Java code into custom tags","authors":"Shannon Xu, T. Dean","doi":"10.1109/SCAM.2005.27","DOIUrl":"https://doi.org/10.1109/SCAM.2005.27","url":null,"abstract":"When a new technology is introduced, the migration of existing applications to the new technology must be carefully considered. Automation can make some migrations feasible that otherwise may be too risky or expensive to be worth the advantages of the new technology. In this paper we describe a technique for migrating Web applications using embedded Java code into a custom tag implementation. The technique uses source code transformation techniques to analyze and separate the Java from the Web pages. The code is then automatically transformed to custom Java classes which are invoked from the modified Web pages containing custom tags. The result is a Web application with identical function and appearance, but where the business logic (the Java code) has been separated from the presentation (the Web pages).","PeriodicalId":394744,"journal":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127277731","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}
引用次数: 6
Minimal slicing and the relationships between forms of slicing 最小切片和切片形式之间的关系
Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05) Pub Date : 2005-09-30 DOI: 10.1109/SCAM.2005.18
D. Binkley, S. Danicic, T. Gyimóthy, M. Harman, Ákos Kiss, B. Korel
{"title":"Minimal slicing and the relationships between forms of slicing","authors":"D. Binkley, S. Danicic, T. Gyimóthy, M. Harman, Ákos Kiss, B. Korel","doi":"10.1109/SCAM.2005.18","DOIUrl":"https://doi.org/10.1109/SCAM.2005.18","url":null,"abstract":"The widespread interest in program slicing within the source code analysis and manipulation community has led to the introduction of a large number of different slicing techniques. Each preserves some aspect of a program's behaviour and simplifies the program to focus exclusively upon this behaviour. In order to understand the similarities and differences between slicing techniques, a formal mechanism is required. This paper establishes a formal mechanism for comparing slicing techniques using a theory of program projection. Sets of minimal slices, which form the ideal for any slicing algorithm, are used to reveal the ordering relationship between various static and dynamic slicing techniques.","PeriodicalId":394744,"journal":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125715785","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
Measuring the impact of friends on the internal attributes of software systems 测量好友对软件系统内部属性的影响
Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05) Pub Date : 2005-09-30 DOI: 10.1109/SCAM.2005.16
M. English, J. Buckley, Tony Cahill, Kristian Lynch
{"title":"Measuring the impact of friends on the internal attributes of software systems","authors":"M. English, J. Buckley, Tony Cahill, Kristian Lynch","doi":"10.1109/SCAM.2005.16","DOIUrl":"https://doi.org/10.1109/SCAM.2005.16","url":null,"abstract":"Differing views have been expressed on the appropriateness of the friend construct in the design and implementation of object-oriented software in C++. However, little empirical analysis of its usage in the development of systems has taken place. This paper describes an empirical study of the top 100 most downloaded open-source software systems from sourceforge.net, to assess the design implications of the use of the friend construct. On a larger cohort of systems our results provide further evidence that classes declared as friends are coupling hotspots. Our findings also indicate that class size does not seem to have the confounding effect on this relationship that has been suggested in previous research. In addition, there seems to be no indication that friendship is used as an alternative to inheritance although a small number of systems seem to use friendship as an alternative to multiple inheritance and vice versa.","PeriodicalId":394744,"journal":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131574365","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
Control flow graph reconstruction for assembly language programs with delayed instructions 具有延迟指令的汇编语言程序的控制流图重建
Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05) Pub Date : 2005-09-30 DOI: 10.1109/SCAM.2005.6
N. Bermudo, A. Krall, N. Horspool
{"title":"Control flow graph reconstruction for assembly language programs with delayed instructions","authors":"N. Bermudo, A. Krall, N. Horspool","doi":"10.1109/SCAM.2005.6","DOIUrl":"https://doi.org/10.1109/SCAM.2005.6","url":null,"abstract":"Most software for embedded systems, including digital signal processing systems, is coded in assembly language. For both understanding the software and for reverse compiling it to a higher level language, we need to construct a control flow graph (CFG). However CFG construction is complicated by architectural features which include VLIW parallelism, predicated instructions and branches with delay slots. We describe an efficient algorithm for the construction of a CFG, where the parallelism has been eliminated, instructions are reordered and delay slots have been eliminated. The algorithm's effectiveness has been demonstrated by its use in a reverse compiler for the Texas Instruments C60 series of digital signal processors.","PeriodicalId":394744,"journal":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123438076","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
Implementation and verification of implicit-invocation systems using source transformation 使用源转换实现和验证隐式调用系统
Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05) Pub Date : 2005-09-30 DOI: 10.1109/SCAM.2005.15
Hongyu Zhang, J. S. Bradbury, J. Cordy, J. Dingel
{"title":"Implementation and verification of implicit-invocation systems using source transformation","authors":"Hongyu Zhang, J. S. Bradbury, J. Cordy, J. Dingel","doi":"10.1109/SCAM.2005.15","DOIUrl":"https://doi.org/10.1109/SCAM.2005.15","url":null,"abstract":"In this paper we present a source transformation-based framework to support uniform testing and model checking of implicit-invocation software systems. The framework includes a new domain-specific programming language, the Implicit-Invocation Language (IIL), explicitly designed for directly expressing implicit-invocation software systems, and a set of formal rule-based source transformation tools that allow automatic generation of both executable and formal verification artifacts. We provide details of these transformation tools, evaluate the framework in practice, and discuss the benefits of formal automatic transformation in this context. Our approach is designed not only to advance the state-of-the-art in validating implicit-invocation systems, but also to further explore the use of automated source transformation as a uniform vehicle to assist in the implementation, validation and verification of programming languages and software systems in general.","PeriodicalId":394744,"journal":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130801009","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
Concept assignment as a debugging technique for code generators 概念分配作为代码生成器的调试技术
Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05) Pub Date : 2005-09-30 DOI: 10.1109/SCAM.2005.4
Jeremy Singer
{"title":"Concept assignment as a debugging technique for code generators","authors":"Jeremy Singer","doi":"10.1109/SCAM.2005.4","DOIUrl":"https://doi.org/10.1109/SCAM.2005.4","url":null,"abstract":"Code generators are notoriously difficult to debug, yet their correctness is crucial. This paper demonstrates that concept assignment can be performed in an entirely syntax-directed manner for code generators and other highly structured program modules. Anomalies in this concept assignment indicate the possible existence of bugs. These insights enable the formulation of a new debugging technique for code generators. This paper describes the procedure, a practical implementation, and results from the application of this debugging technique to an experimental code generator.","PeriodicalId":394744,"journal":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133116450","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}
引用次数: 6
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信