Understanding Open Source Software through Software Archaeology: The Case of Nethack

Melissa M. Simmons, P. Vercellone-Smith, P. Laplante
{"title":"Understanding Open Source Software through Software Archaeology: The Case of Nethack","authors":"Melissa M. Simmons, P. Vercellone-Smith, P. Laplante","doi":"10.1109/SEW.2006.37","DOIUrl":null,"url":null,"abstract":"In this study open source software was examined from an archaeological perspective. The objective: to explore the evolution of a long-lived open source project with the intention of learning how code evolution has progressed over time. This investigation provides a case study of Nethack, an enormously popular open source game that has been in development for more than a decade. The goal question metric approach was employed to derive measurement goals for the evaluation of open source software (OSS) evolution in Nethack. According to Lehman's laws, the incremental growth size of successive releases tends to decline during the active life of an evolving program. Our results demonstrate that the evolution patterns observed for Nethack do not consistently conform to Lehman's laws. The growth in Nethack's tarball distribution size, as well as lines of code, exhibited a linear increase in growth in this investigation. Additionally, Lehman's laws dictate that the complexity of a system will increase as it ages. Interestingly, in Nethack, the McCabe cyclomatic complexity was found to decrease with successive releases while the Halstead complexity increased. These results suggest that while the structure complexity of Nethack declined with successive releases, the complexity of calculational logic increased. These findings raise questions concerning the evolution of other OSS applications","PeriodicalId":127158,"journal":{"name":"2006 30th Annual IEEE/NASA Software Engineering Workshop","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 30th Annual IEEE/NASA Software Engineering Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEW.2006.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this study open source software was examined from an archaeological perspective. The objective: to explore the evolution of a long-lived open source project with the intention of learning how code evolution has progressed over time. This investigation provides a case study of Nethack, an enormously popular open source game that has been in development for more than a decade. The goal question metric approach was employed to derive measurement goals for the evaluation of open source software (OSS) evolution in Nethack. According to Lehman's laws, the incremental growth size of successive releases tends to decline during the active life of an evolving program. Our results demonstrate that the evolution patterns observed for Nethack do not consistently conform to Lehman's laws. The growth in Nethack's tarball distribution size, as well as lines of code, exhibited a linear increase in growth in this investigation. Additionally, Lehman's laws dictate that the complexity of a system will increase as it ages. Interestingly, in Nethack, the McCabe cyclomatic complexity was found to decrease with successive releases while the Halstead complexity increased. These results suggest that while the structure complexity of Nethack declined with successive releases, the complexity of calculational logic increased. These findings raise questions concerning the evolution of other OSS applications
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过软件考古理解开源软件:以《Nethack》为例
在这项研究中,开源软件是从考古学的角度来考察的。目的:探索一个长期存在的开源项目的演变,目的是了解代码的演变是如何随着时间的推移而发展的。这项调查以《Nethack》为例,这是一款非常受欢迎的开源游戏,已经开发了10多年。采用目标问题度量方法推导了Nethack中开源软件(OSS)演进评估的度量目标。根据雷曼定律,在不断发展的程序的有效寿命期间,连续发布的增量增长规模趋于下降。我们的研究结果表明,在《Nethack》中观察到的进化模式并不总是符合雷曼定律。在这项调查中,《Nethack》的tarball分布大小和代码行数呈现出线性增长。此外,雷曼法则规定,系统的复杂性将随着年龄的增长而增加。有趣的是,在《Nethack》中,McCabe圈复杂度会随着连续发行而降低,而Halstead复杂度则会增加。这些结果表明,尽管《Nethack》的结构复杂性随着连续发行而下降,但计算逻辑的复杂性却在增加。这些发现提出了有关其他OSS应用程序发展的问题
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
What Have We Not Learned about Teaching Programming? Using Simulation to Validate Style-Specific Architectural Refactoring Patterns The Role of Empirical Study in Software Engineering Formal Verification of Abstract System and Protocol Specifications Targeting Prediction: Engineering a Distributed Event Processor for an Autonomic Biometric System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1