Learning regular sets from queries and counterexamples
Information and Computation
Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Inference of finite automata using homing sequences
Information and Computation
Concurrency: state models & Java programs
Concurrency: state models & Java programs
Model checking
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Assumption Generation for Software Component Verification
Proceedings of the 17th IEEE international conference on Automated software engineering
Assume-Guarantee Verification of Source Code with Design-Level Assumptions
Proceedings of the 26th International Conference on Software Engineering
Compositional Verification of Middleware-Based Software Architecture Descriptions
Proceedings of the 26th International Conference on Software Engineering
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
On Accurate Automatic Verification of Publish-Subscribe Architectures
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Three optimizations for Assume---Guarantee reasoning with L*
Formal Methods in System Design
Modular Conformance Testing and Assume-Guarantee Verification for Evolving Component-Based Software
APSEC '08 Proceedings of the 2008 15th Asia-Pacific Software Engineering Conference
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Model checking publish-subscribe systems
SPIN'03 Proceedings of the 10th international conference on Model checking software
| Hi-index | 0.00 |
This paper proposes an effective framework for the assume-guarantee verification of component-based software in the context of component evolution at system design level. In this framework, when a component is evolved after adapting some refinements, we do not recheck all components in the evolved system, but only the evolved component. For this purpose, if the design model of the evolved component satisfies the current assumption of the system before evolving, the evolved system still satisfies the required property. Otherwise, if the assumption is too strong to be satisfied by the model, a new assumption must be generated again. We propose two methods for regenerating the new assumption called assumption regeneration and minimized assumption regeneration. The methods reuse the assumption to reduce a large number of required membership queries and candidate assumptions which are needed to generate again the new assumption. An implementation and experimental results are presented.