Dynamic component substitutability analysis

33Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniques for checking correctness of software upgrades: 1) a technique based on simultaneous use of over and under approximations obtained via existential and universal abstractions; 2) a dynamic assumeguarantee reasoning algorithm - previously generated component assumptions are reused and altered on-the-fly to prove or disprove the global safety properties on the updated system. When upgrades are found to be non-substitutable our solution generates constructive feedback to developers showing how to improve the components. The substitutability approach has been implemented and validated in the COMFORT model checking tool set and we report encouraging results on an industrial benchmark. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Sharygina, N., Chaki, S., Clarke, E., & Sinha, N. (2005). Dynamic component substitutability analysis. In Lecture Notes in Computer Science (Vol. 3582, pp. 512–528). Springer Verlag. https://doi.org/10.1007/11526841_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free