FM 2005: Formal Methods

Volume 3582 of the series Lecture Notes in Computer Science pp 512-528

Dynamic Component Substitutability Analysis

  • Natasha SharyginaAffiliated withLancaster UniversityCarnegie Mellon University
  • , Sagar ChakiAffiliated withLancaster UniversityCarnegie Mellon University
  • , Edmund ClarkeAffiliated withLancaster UniversityCarnegie Mellon University
  • , Nishant SinhaAffiliated withLancaster UniversityCarnegie Mellon University

* Final gross prices may vary according to local VAT.

Get Access


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 assume-guarantee 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.


Software Model Checking Verification of Evolving Software Learning Regular Sets Assume/Guarantee Reasoning