Verification of evolving software via component substitutability analysis

Chaki, Sagar; Clarke, Edmund M.; Sharygina, Natasha; Sinha, Nishant

doi:10.1007/s10703-008-0053-x

Cited by 32 publications

(31 citation statements)

References 43 publications

(72 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chaki et al, [4] reduce the verification effort by reusing previously generated results and by focusing only on the portion of the system that has been changed. Even if the problem is the same, the approach is quite different.…”

Section: Related Workmentioning

confidence: 99%

Verifying incomplete and evolving specifications

Menghi

2014

Companion Proceedings of the 36th International Conference on Software Engineering

View full text Add to dashboard Cite

Classical verification techniques rely on the assumption that the model of the system under analysis is completely specified and does not change over time. However, most modern development life-cycles and even run-time environments (as in the case of adaptive systems), are implicitly based on incompleteness and evolution. Incompleteness occurs when some parts of the system are not specified. Evolution concerns a set of gradual and progressive changes that amend systems over time.Modern development life-cycles are founded on a sequence of iterative and incremental steps through which the initial incomplete description of the system evolves into its final, fully detailed, specification. Similarly, adaptive systems evolve through a set of adaptation actions, such as plugging and removing components, that modify the behavior of the system in response to new environmental conditions, requirements or legal regulations. Usually, the adaptation is performed by first removing old components, leaving the system temporarily unspecified-incomplete-, and then by plugging the new ones.This work aims to extend classical verification algorithms to consider incomplete and evolving specifications. We want to ensure that after any change, only the part of the system that is affected by the change, is re-analyzed, avoiding to re-verify everything from scratch.

show abstract

Section: Related Workmentioning

confidence: 99%

Verifying incomplete and evolving specifications

Menghi

2014

Companion Proceedings of the 36th International Conference on Software Engineering

View full text Add to dashboard Cite

show abstract

“…The recent work in [17] is dedicated to the verification of a dynamic substitutability problem: can a component replace another component during an execution? The verification approach is based on recent model-checking techniques.…”

Section: Related Workmentioning

confidence: 99%

“…The verification approach is based on recent model-checking techniques. Notice that action costs are not taken into account in [17]. In that setting (i.e.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Component simulation-based substitutivity managing QoS and composition issues

Héam¹,

Kouchnarenko²,

Voinot³

2010

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c tSeveral scientific bottlenecks have been identified in existing component-based approaches. Among them, we focus on the identification of a relevant abstraction for the component expression and verification of properties like substitutivity: when is it possible to formally accept or reject the substitution of a component in a composition? This paper suggests integer weighted automata to tackle this problem when considering a new factor -Quality of Service (QoS). Four notions of simulation-based substitutivity managing QoS aspects are proposed, and related complexity issues on integer weighted automata are investigated. Furthermore, the paper defines composition operators: sequential, strictsequential and parallel compositions, bringing path costs into the analysis. New results on the compatibility of proposed substitutivity notions w.r.t. sequential and parallel composition operators are established.

show abstract

“…In [10] a veriÀcation technique for evolving and distributed component based systems is presented, which relies on compositional veriÀcation together with predicate abstraction. However, the base algorithm is model checking and thus not suitable for the veriÀcation of inÀnite state systems and structural changes.…”

Section: Related Workmentioning

confidence: 99%