Incremental verification of inductive invariants for the run-time evolution of self-adaptive software-intensive systems

Becker, Basil; Giese, Holger

doi:10.1109/asew.2008.4686291

Cited by 5 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [8] the Invariant Checking technique has been extended to also cope with the veriÀcation of timed graph transformation systems. In a further publication [6] we have shown in which way Invariant Checking could be extended to work also incrementally. We were able to show the technique's potential ability to be used for run-time veriÀcation tasks.…”

Section: Results Achieved So Farmentioning

confidence: 99%

See 1 more Smart Citation

Towards safety guarantees for service-oriented systems

Becker

2009

2009 31st International Conference on Software Engineering - Companion Volume

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Results Achieved So Farmentioning

confidence: 99%

“…For systems, which employ structural as well as behavioral changes there are already veriÀcation techniques available and have been presented at international conferences and workshops (cf. [5,8,6]). …”

Section: Resultsmentioning

confidence: 99%

Towards safety guarantees for service-oriented systems

Becker

2009

2009 31st International Conference on Software Engineering - Companion Volume

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, this does not only ensure that a valid rule set results in a unique and semantically correct outcome, it also permits to decide whether a TGG can be applied in both directions. It also links a practical implementation with a suitable formal semantics such that based on this sound foundation and former work [9,2,18] we can now study the verification of model transformations exploiting the identified criteria. The provided bridge only closes the gap between the formal semantics of TGGs and the implementation at the level of abstraction related to the standard graph transformation system semantics.…”

Section: Discussionmentioning

confidence: 99%

Toward Bridging the Gap between Formal Semantics and Implementation of Triple Graph Grammars

Giese

Hildebrandt

Lambers

2010

2010 Workshop on Model-Driven Engineering, Verification, and Validation

Self Cite

View full text Add to dashboard Cite

Bibliografische Information der Deutschen NationalbibliothekDie Deutsche Nationalbibliothek verzeichnet diese Publikation in der Deutschen Nationalbibliografie; detaillierte bibliografische Daten sind im Internet über http://dnb.d-nb.de abrufbar. Abstract. The correctness of model transformations is a crucial element for the model-driven engineering of high quality software. A prerequisite to verify model transformations at the level of the model transformation specification is that an unambiguous formal semantics exists and that the employed implementation of the model transformation language adheres to this semantics. However, for existing relational model transformation approaches it is usually not really clear under which constraints particular implementations are really conform to the formal semantics. In this paper, we will bridge this gap for the formal semantics of triple graph grammars (TGG) and an existing efficient implementation. Whereas the formal semantics assumes backtracking and ignores non-determinism, practical implementations do not support backtracking, require rule sets that ensure determinism, and include further optimizations. Therefore, we capture how the considered TGG implementation realizes the transformation by means of operational rules, define required criteria and show conformance to the formal semantics if these criteria are fulfilled. We further outline how static analysis can be employed to guarantee these criteria. Universitätsverlag

show abstract

“…These results have also led to studies for self-adaptive software in general and first general results for modeling and verifying them [107]. Furthermore, also an incremental invariant checker [82] has been developed which allows to reduce the effort for performing checks when the behavior has changed at runtime.…”

Section: Model Checkingmentioning

confidence: 99%

“…We will only review here the basic idea [49] and refer the interested reader to [81] for an extension for timed models. For the collaboration building and its structural dynamism, a fully automatic checker for inductive invariants of graph transformation systems [49] presented in Section 4.2 and an extension supporting timed graph transformation systems [81] and an incremental checker [82] have been developed.…”

Section: Invariant Checkingmentioning

confidence: 99%

Graph Transformations for MDE, Adaptation, and Models at Runtime

Giese

Lambers

Becker

et al. 2012

Formal Methods for Model-Driven Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. Software evolution and the resulting need to continuously adapt the software is one of the main challenges for software engineering. The model-driven development movement therefore aims at improving the longevity of software by keeping the development artifacts more consistent and better changeable by employing models and to a certain degree automated model operations. Another trend are systems that tackle the challenge at runtime by being able to adapt their structure and behavior to be more flexible and operate in more dynamic environments (e.g., context-aware software, autonomic computing, self-adaptive software). Finally, models at runtime, where the benefits of model-driven development are employed at runtime to support adaptation capabilities, today lead towards a unification of both ideas. In this paper, we present graph transformations and show that they can be employed to engineer solutions for all three outlined cases. Furthermore, we will even be able to demonstrate that graph transformation based technology has the potential to also unify all three cases in a single scenario where models at runtime and runtime adaptation is linked with classical MDE. Therefore, we at first provide an introduction in graph transformations, then present the related techniques of Story Pattern and Triple Graph Grammars, and demonstrate how with the help of both techniques model transformations, adaptation behavior and runtime model framework work. In addition, we show that due to the formal underpinning analysis becomes possible and report about a number of successful examples.

show abstract

Incremental verification of inductive invariants for the run-time evolution of self-adaptive software-intensive systems

Cited by 5 publications

References 21 publications

Towards safety guarantees for service-oriented systems

Towards safety guarantees for service-oriented systems

Toward Bridging the Gap between Formal Semantics and Implementation of Triple Graph Grammars

Graph Transformations for MDE, Adaptation, and Models at Runtime

Contact Info

Product

Resources

About