Proof Repositories for Compositional Verification of Evolving Software Systems

Bubel, Richard; Damiani, Ferruccio; Hähnle, Reiner; Johnsen, Einar Broch; Owe, Olaf; Schaefer, Ina; Yu, Ingrid Chieh

doi:10.1007/978-3-319-46508-1_8

Cited by 14 publications

(17 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, they investigated how variability hiding (i.e., the interface relation between feature models) can help contract checking upon SPL evolution, like it does for type checking. In future work we would like to enrich SPLSs with method contracts (thus promoting them to behavioral interfaces) in order to support compositional verification of delta-oriented DPLs by building on recently proposed proof systems and techniques for the verification of delta-oriented SPLs [44,45,46,47,48].…”

Section: Discussionmentioning

confidence: 99%

A formal model for Multi Software Product Lines

Damiani

Lienhardt

Paolini

2019

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

A Software Product Line (SPL) is a family of similar programs generated from a common artifact base. A Multi SPL (MPL) is a set of interdependent SPLs that are typically managed and developed in a decentralized fashion. Delta-Oriented Programming (DOP) is a flexible and modular approach to implement SPLs. This paper presents new concepts that extend DOP to support the implementation of MPLs. These extensions aim to accommodate compositional analyses. They are presented by means of a core calculus for delta-oriented MPLs of Java programs. Suitability for MPL compositional analyses is demonstrated by compositional reuse of existing SPL analysis techniques.

show abstract

Section: Discussionmentioning

confidence: 99%

A formal model for Multi Software Product Lines

Damiani

Lienhardt

Paolini

2019

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…In future work, we aim to extend the calculus to model multi-threaded applications. Recently, proof systems for the verification of delta-oriented SPLs (Hähnle and Schaefer [2012], Damiani et al [2012a], Bubel et al [2016]) and model-based testing frameworks for delta-oriented SPLs (Lochau et al [2012], Damiani et al [2013]) have been proposed. In future work, we plan to extend these approaches to dynamic delta-oriented SPLs.…”

Section: Discussionmentioning

confidence: 99%

A core calculus for dynamic delta-oriented programming

et al. 2017

Self Cite

View full text Add to dashboard Cite

Delta-oriented programming (DOP) is a flexible approach to the implementation of software product lines (SPLs). Delta-oriented SPLs consist of a code base (a set of delta modules encapsulating changes to object-oriented programs) and a product line declaration (providing the connection of the delta modules with the product features). In this paper, we present a core calculus that extends DOP with the capability to switch the implemented product configuration at runtime. A dynamic delta-oriented SPL is a delta-oriented SPL with a dynamic reconfiguration graph that specifies how to switch between different feature configurations. Dynamic DOP supports also (unanticipated) software evolution such that at runtime, the product line declaration, the code base and the dynamic reconfiguration graph can be changed in any (unanticipated) way that preserves the currently running product, which is essential when evolution affects existing features. The type system of our dynamic DOP core calculus ensures that the dynamic reconfigurations lead to type safe products and do not cause runtime type errors.

show abstract

“…In addition we must verify the PerfectBank pre/post conditions, which follow by the corresponding BANK pre/post conditions (2,3,4). In particular, the postcondition return = sum(h/PerfectBank) follows by (2) and I B .…”

Section: Verification Of the Bank Examplementioning

confidence: 99%

A Framework for Flexible Program Evolution and Verification of Distributed Systems

Owe

Fazeldehkordi

Lin

2020

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

Program evolution may reveal bad design decisions, misunderstandings, erroneous code, or erroneous specifications, because problems made early in the design of a system may not be discovered until much later in the life-time of the system. Non-trivial changes of old code may be necessary. Flexibility in making such changes is essential, especially in a distributed setting where the system components are updated independently. In this setting re-verification is challenging. We consider flexibility with respect to what changes can be made as well as what can be efficiently reverified.In this paper we propose a flexible framework for modeling and evolution of distributed systems. It supports unrestricted modifications in such systems, both in code and specifications, and with support of verification and re-verification. We consider on the setting of concurrent and object-oriented distributed programs, and introduce a core high-level modeling language supporting active objects. We allow multiple inheritance because it gives added flexibility during evolution, allowing a wider class of software changes. To avoid undesired effects of multiple inheritance, we apply a healthy binding strategy. We prove that the framework supports Modification Independence and Hierarchy Independence, which requires healthy binding. We demonstrate that our framework can deal with verification of software changes that are not possible in comparable frameworks.

show abstract

Proof Repositories for Compositional Verification of Evolving Software Systems

Cited by 14 publications

References 31 publications

A formal model for Multi Software Product Lines

A formal model for Multi Software Product Lines

A core calculus for dynamic delta-oriented programming

A Framework for Flexible Program Evolution and Verification of Distributed Systems

Contact Info

Product

Resources

About