Software Components Compatibility Verification Based on Static Byte-Code Analysis

Jezek, Kamil; Holý, Lukáš; Slezacek, Antonin; Brada, Přemek

doi:10.1109/seaa.2013.58

Cited by 10 publications

(13 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To face this challenge, both approaches parse dependencies from these sources and extract information in their own models: the Knowledge Discovery Meta-model (KDM) [34,39] and the Software Universe Graph (SUG) [28]. Jezek et al statically extract dependencies and potential smells from the source code and bytecode of applications [20]. Similarly, Abate et al dig into Debian, OPAM, and Drupal repositories to identify failing dependencies and to present actionable information to the final user [1].…”

Section: Related Workmentioning

confidence: 99%

An empirical evaluation of OSGi dependencies best practices in the eclipse IDE

Ochoa

Degueule

Vinju

2018

Proceedings of the 15th International Conference on Mining Software Repositories

View full text Add to dashboard Cite

OSGi is a module system and service framework that aims to fill Java's lack of support for modular development. Using OSGi, developers divide software into multiple bundles that declare constrained dependencies towards other bundles. However, there are various ways of declaring and managing such dependencies, and it can be confusing for developers to choose one over another. Over the course of time, experts and practitioners have defined "best practices" related to dependency management in OSGi. The underlying assumptions are that these best practices (i) are indeed relevant and (ii) help to keep OSGi systems manageable and efficient. In this paper, we investigate these assumptions by first conducting a systematic review of the best practices related to dependency management issued by the OSGi Alliance and OSGi-endorsed organizations. Using a large corpus of OSGi bundles (1,124 core plug-ins of the Eclipse IDE), we then analyze the use and impact of 6 selected best practices. Our results show that the selected best practices are not widely followed in practice. Besides, we observe that following them strictly reduces classpath size of individual bundles by up to 23% and results in up to ±13% impact on performance at bundle resolution time. In summary, this paper contributes an initial empirical validation of industry-standard OSGi best practices. Our results should influence practitioners especially, by providing evidence of the impact of these best practices in real-world systems.

show abstract

Section: Related Workmentioning

confidence: 99%

An empirical evaluation of OSGi dependencies best practices in the eclipse IDE

Ochoa

Degueule

Vinju

2018

Proceedings of the 15th International Conference on Mining Software Repositories

View full text Add to dashboard Cite

show abstract

“…These inconsistencies can arise even in statically-typed languages (e.g., Java), considering the component-based application. Because each component is compiled separately, the mutual dependencies of the components are not considered by the compiler [17].…”

Section: Static Byte Code Analysismentioning

confidence: 99%

“…A solution of this issue proposed in [17] is the byte code analysis. It consists of three steps -the discovery of component dependencies, the matching of component dependencies, and the consistency verification.…”

Section: Static Byte Code Analysismentioning

confidence: 99%

“…For example, if a method returns null instead of an expected instance, the problem will not be detected [17].…”

Section: Static Byte Code Analysismentioning

confidence: 99%

“…A difference on the methods level or on the services level implies the change in the public interface of the component. Our method is of course capable to detect these changes, but they can be detected also by the other means such as advanced methods of static analysis (e.g., see [17]). However, discovering differences in the invocations and consequences level by the static verification is difficult.…”

Section: B Testing Application Evolution: Comparison Of Tree Data Stmentioning

confidence: 99%

See 2 more Smart Citations

Interface-based Semi-automated Testing of Software Components

Potužák

Lipka

Brada

2017

Proceedings of the 2017 Federated Conference on Computer Science and Information Systems

Self Cite

View full text Add to dashboard Cite

Abstract-The component-based software development enables to construct applications from reusable components providing particular functionalities and simplifies application evolution. To ensure the correct functioning of a given component-based application and its preservation across evolution steps, it is necessary to test not only the functional properties of the individual components but also the correctness of their mutual interactions and cooperation. This is complicated by the fact that third-party components often come without source code and/or documentation of functional and interaction properties. In this paper, we describe an approach for performing rigorous semi-automated testing of software components with unavailable source code. Utilizing an automated analysis of the component interfaces, scenarios invoking methods with generated parameter values are created. When they are performed on a stable application version and their runtime effects (component interactions) are recorded, the resulting scenarios with recorded effects can be used for accurate regression testing of newly installed versions of selected components. Our experiences with a prototype implementation show that the approach has acceptable demands on manual work and computational resources.

show abstract

Runtime deadlock tracking and prevention of concurrent multithreaded programs: A learning‐based approach

Ghorbani

Babamir

2019

Concurrency and Computation

View full text Add to dashboard Cite

Allocation of shared resources by multithreaded programs faces problem of deadlock. Many solutions have been presented to resolve this problem. Among others, the deadlock prevention is stressed when the deadlock detection and removal are costly. Removing deadlocks, which is carried out by aborting/recovering deadlocked threads, causes the waste of the resources used by the deadlocked threads. In such case, deadlock prevention can lead to avoiding the waste of resources. To this end, the runtime behavior of threads should be monitored in order to predict possible future deadlocks. In such case, the prediction mechanism becomes significant because a proper prediction helps us deny the allocation request of a resource by a thread if the allocation leads to a potential deadlock. A method to attain to proper prediction is learning the behavior of threads based on runtime monitoring their past behavior. In fact, based on past behavior of threads, potential deadlocks in their future behavior are verified, and current allocation request of a resource is denied if a future deadlock is predicted. The current study is an extension of our previous work where just deadlock tracking was predicted and no adaptation was suggested. In this study, a composite structure of a recurrent Neural Network (NN) called NARX (to track a potential deadlock) and a Multi-perceptron NN called MLP (to select a suitable action to resolve the potential deadlock) is proposed. Based on the experimental results, the accuracy of the first NN was about 80%, leading to high performance of the second NN, and more than 82% of the real deadlocks were prevented by selecting suitable actions.

show abstract

Software Components Compatibility Verification Based on Static Byte-Code Analysis

Cited by 10 publications

References 13 publications

An empirical evaluation of OSGi dependencies best practices in the eclipse IDE

An empirical evaluation of OSGi dependencies best practices in the eclipse IDE

Interface-based Semi-automated Testing of Software Components

Runtime deadlock tracking and prevention of concurrent multithreaded programs: A learning‐based approach

Contact Info

Product

Resources

About