中文
相关论文

相关论文: Software Libraries and Their Reuse: Entropy, Kolmo…

200 篇论文

Software is now a vital scientific instrument, providing the tools for data collection and analysis across disciplines from bioinformatics and computational physics, to the humanities. The software used in research is often home-grown and…

软件工程 · 计算机科学 2019-03-15 Mario Rosado de Souza , Robert Haines , Markel Vigo , Caroline Jay

One of the purported ways to increase productivity and reduce development time is to reuse existing features and modules. If reuse is adopted, logically then, it will have a direct impact on a system's evolution. However, the evidence in…

软件工程 · 计算机科学 2021-04-06 Amjed Tahir , Sherlock A. Licorish , Stephen G. MacDonell

Software reuse is a crucial external quality attribute targeted by open-source and commercial projects. Despite that software reuse has experienced an increased adoption throughout the years, little is known about what aspects of code reuse…

软件工程 · 计算机科学 2023-11-02 Eman Abdullah AlOmara , Anthony Peruma , Mohamed Wiem Mkaouer , Christian Newman , Ali Ouni

Software component reuse is the software engineering practice of developing new software products from existing components. A reuse library or component reuse repository organizes stores and manages reusable components. This paper describes…

软件工程 · 计算机科学 2010-07-30 P. Shireesha , S. S. V. N. Sharma

With the advent of open source software, a veritable treasure trove of previously proprietary software development data was made available. This opened the field of empirical software engineering research to anyone in academia. Data that is…

软件工程 · 计算机科学 2022-04-19 Adam Tutko , Austin Z. Henley , Audris Mockus

A definition of entropy via the Kolmogorov algorithmic complexity is discussed. As examples, we show how the meanfield theory for the Ising model, and the entropy of a perfect gas can be recovered. The connection with computations are…

统计力学 · 物理学 2007-05-23 Somendra M. Bhattacharjee

The Kolmogorov complexity of x, denoted C(x), is the length of the shortest program that generates x. For such a simple definition, Kolmogorov complexity has a rich and deep theory, as well as applications to a wide variety of topics…

计算复杂性 · 计算机科学 2017-02-17 Stephen Fenner , Lance Fortnow

Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…

机器学习 · 计算机科学 2007-05-23 Andrei N. Soklakov

We consider the problem of inferring the probability distribution associated with a language, given data consisting of an infinite sequence of elements of the languge. We do this under two assumptions on the algorithms concerned: (i) like a…

机器学习 · 计算机科学 2014-07-16 Paul M. B. Vitanyi , Nick Chater

Open source software ecosystems consist of thousands of interdependent libraries, which users can combine to great effect. Recent work has pointed out two kinds of risks in these systems: that technical problems like bugs and…

软件工程 · 计算机科学 2022-05-11 William Schueller , Johannes Wachs

The importance of low power consumption is widely acknowledged due to the increasing use of portable devices, which require minimizing the consumption of energy. The energy in a computational system depends heavily on the software being…

适应与自组织系统 · 物理学 2024-04-15 Kostas Zotos , Andreas Litke , Alexander Chatzigeorgiou , Spyros Nikolaidis , George Stephanides

To comply with high productivity demands, software developers reuse free open-source software (FOSS) code to avoid reinventing the wheel when incorporating software features. The reliance on FOSS reuse has been shown to improve productivity…

软件工程 · 计算机科学 2025-06-19 Haya Samaana , Diego Elias Costa , Ahmad Abdellatif , Emad Shihab

We introduce Repro, an open-source library which aims at improving the reproducibility and usability of research code. The library provides a lightweight Python API for running software released by researchers within Docker containers which…

计算与语言 · 计算机科学 2022-05-02 Daniel Deutsch , Dan Roth

According to Kolmogorov complexity, every finite binary string is compressible to a shortest code -- its information content -- from which it is effectively recoverable. We investigate the extent to which this holds for infinite binary…

信息论 · 计算机科学 2019-01-23 George Barmpalias , Andrew Lewis-Pye

Program comprehension concerns the ability of an individual to make an understanding of an existing software system to extend or transform it. Software systems comprise of data that are noisy and missing, which makes program understanding…

软件工程 · 计算机科学 2019-02-05 Amir Saeidi , Jurriaan Hage , Ravi Khadka , Slinger Jansen

Dedicated software search engines that index open source software repositories or in-house software assets significantly enhance the chance of finding software components suitable for reuse. However, they still leave the work of evaluating…

软件工程 · 计算机科学 2013-03-25 Werner Janjic , Dietmar Stoll , Philipp Bostan , Colin Atkinson

Increased availability of open-source software repositories and recent advances in code analysis using large language models (LLMs) has triggered a wave of new work to automate software engineering tasks that were previously very difficult…

软件工程 · 计算机科学 2024-01-24 Marc Dillmann , Julien Siebert , Adam Trendowicz

Continuous testing during development is a well-established technique for software-quality assurance. Continuous model checking from revision to revision is not yet established as a standard practice, because the enormous resource…

软件工程 · 计算机科学 2013-05-30 Dirk Beyer , Stefan Löwe , Evgeny Novikov , Andreas Stahlbauer , Philipp Wendler

The availability of vast amounts of publicly accessible data of source code and the advances in modern language models, coupled with increasing computational resources, have led to a remarkable surge in the development of large language…

软件工程 · 计算机科学 2024-10-01 Zhou Yang , Jieke Shi , Premkumar Devanbu , David Lo

The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theorem for resource-bounded Kolmogorov complexity is the key to…

计算复杂性 · 计算机科学 2024-09-20 Shuichi Hirahara , Zhenjian Lu , Mikito Nanashima