K Inductive Invariant Checking For Graph Transformation Systems


K Inductive Invariant Checking For Graph Transformation Systems
DOWNLOAD eBooks

Download K Inductive Invariant Checking For Graph Transformation Systems PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get K Inductive Invariant Checking For Graph Transformation Systems book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page





K Inductive Invariant Checking For Graph Transformation Systems


K Inductive Invariant Checking For Graph Transformation Systems
DOWNLOAD eBooks

Author : Dyck, Johannes
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2017-09-15

K Inductive Invariant Checking For Graph Transformation Systems written by Dyck, Johannes and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2017-09-15 with categories.


While offering significant expressive power, graph transformation systems often come with rather limited capabilities for automated analysis, particularly if systems with many possible initial graphs and large or infinite state spaces are concerned. One approach that tries to overcome these limitations is inductive invariant checking. However, the verification of inductive invariants often requires extensive knowledge about the system in question and faces the approach-inherent challenges of locality and lack of context. To address that, this report discusses k-inductive invariant checking for graph transformation systems as a generalization of inductive invariants. The additional context acquired by taking multiple (k) steps into account is the key difference to inductive invariant checking and is often enough to establish the desired invariants without requiring the iterative development of additional properties. To analyze possibly infinite systems in a finite fashion, we introduce a symbolic encoding for transformation traces using a restricted form of nested application conditions. As its central contribution, this report then presents a formal approach and algorithm to verify graph constraints as k-inductive invariants. We prove the approach's correctness and demonstrate its applicability by means of several examples evaluated with a prototypical implementation of our algorithm.



Verification Of Graph Transformation Systems With K Inductive Invariants


Verification Of Graph Transformation Systems With K Inductive Invariants
DOWNLOAD eBooks

Author : Johannes Dyck
language : en
Publisher:
Release Date : 2019*

Verification Of Graph Transformation Systems With K Inductive Invariants written by Johannes Dyck and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2019* with categories.


With rising complexity of today's software and hardware systems and the hypothesized increase in autonomous, intelligent, and self-* systems, developing correct systems remains an important challenge. Testing, although an important part of the development and maintainance process, cannot usually establish the definite correctness of a software or hardware system - especially when systems have arbitrarily large or infinite state spaces or an infinite number of initial states. This is where formal verification comes in: given a representation of the system in question in a formal framework, verification approaches and tools can be used to establish the system's adherence to its similarly formalized specification, and to complement testing. One such formal framework is the field of graphs and graph transformation systems. Both are powerful formalisms with well-established foundations and ongoing research that can be used to describe complex hardware or software systems with varying degrees of abstraction. Since their inception in the ...



Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction


Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction
DOWNLOAD eBooks

Author : Sven Schneider
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2022-11-17

Invariant Analysis For Multi Agent Graph Transformation Systems Using K Induction written by Sven Schneider and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-11-17 with Computers categories.


The analysis of behavioral models such as Graph Transformation Systems (GTSs) is of central importance in model-driven engineering. However, GTSs often result in intractably large or even infinite state spaces and may be equipped with multiple or even infinitely many start graphs. To mitigate these problems, static analysis techniques based on finite symbolic representations of sets of states or paths thereof have been devised. We focus on the technique of k-induction for establishing invariants specified using graph conditions. To this end, k-induction generates symbolic paths backwards from a symbolic state representing a violation of a candidate invariant to gather information on how that violation could have been reached possibly obtaining contradictions to assumed invariants. However, GTSs where multiple agents regularly perform actions independently from each other cannot be analyzed using this technique as of now as the independence among backward steps may prevent the gathering of relevant knowledge altogether. In this paper, we extend k-induction to GTSs with multiple agents thereby supporting a wide range of additional GTSs. As a running example, we consider an unbounded number of shuttles driving on a large-scale track topology, which adjust their velocity to speed limits to avoid derailing. As central contribution, we develop pruning techniques based on causality and independence among backward steps and verify that k-induction remains sound under this adaptation as well as terminates in cases where it did not terminate before.



Inductive Invariant Checking With Partial Negative Application Conditions


Inductive Invariant Checking With Partial Negative Application Conditions
DOWNLOAD eBooks

Author : Dyck, Johannes
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2016-04-13

Inductive Invariant Checking With Partial Negative Application Conditions written by Dyck, Johannes and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2016-04-13 with Computers categories.


Graph transformation systems are a powerful formal model to capture model transformations or systems with infinite state space, among others. However, this expressive power comes at the cost of rather limited automated analysis capabilities. The general case of unbounded many initial graphs or infinite state spaces is only supported by approaches with rather limited scalability or expressiveness. In this report we improve an existing approach for the automated verification of inductive invariants for graph transformation systems. By employing partial negative application conditions to represent and check many alternative conditions in a more compact manner, we can check examples with rules and constraints of substantially higher complexity. We also substantially extend the expressive power by supporting more complex negative application conditions and provide higher accuracy by employing advanced implication checks. The improvements are evaluated and compared with another applicable tool by considering three case studies.



Graph Transformation


Graph Transformation
DOWNLOAD eBooks

Author : Juan de Lara
language : en
Publisher: Springer
Release Date : 2017-07-03

Graph Transformation written by Juan de Lara and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2017-07-03 with Computers categories.


This book constitutes the refereed proceedings of the 10th International Conference on Graph Transformation, ICGT 2017, held as part of STAF 2017, in Marburg, Germany, in July 2017. The 14 papers presented were carefully reviewed and selected from 23 submissions. The papers cover a wide range of topics including theoretical approaches to graph transformation and their verification, model-driven engineering, chemical reactions as well as various applications. They are organized in the following topical sections: foundations; graph language and parsing; analysis and verification; and model transformation and tools.



Graph Transformation


Graph Transformation
DOWNLOAD eBooks

Author : Nicolas Behr
language : en
Publisher: Springer Nature
Release Date : 2022-06-30

Graph Transformation written by Nicolas Behr and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-06-30 with Computers categories.


This book constitutes the refereed proceedings of the 15th International Conference on Graph Transformation, ICGT 2022, which took place Nantes, France in July 2022. The 10 full papers and 1 tool paper presented in this book were carefully reviewed and selected from 19 submissions. The conference focuses on describing new unpublished contributions in the theory and applications of graph transformation as well as tool presentation papers that demonstrate main new features and functionalities of graph-based tools.



Automatic Verification Of Behavior Preservation At The Transformation Level For Relational Model Transformation


Automatic Verification Of Behavior Preservation At The Transformation Level For Relational Model Transformation
DOWNLOAD eBooks

Author : Dyck, Johannes
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2017-04-26

Automatic Verification Of Behavior Preservation At The Transformation Level For Relational Model Transformation written by Dyck, Johannes and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2017-04-26 with Computers categories.


The correctness of model transformations is a crucial element for model-driven engineering of high quality software. In particular, behavior preservation is the most important correctness property avoiding the introduction of semantic errors during the model-driven engineering process. Behavior preservation verification techniques either show that specific properties are preserved, or more generally and complex, they show some kind of behavioral equivalence or refinement between source and target model of the transformation. Both kinds of behavior preservation verification goals have been presented with automatic tool support for the instance level, i.e. for a given source and target model specified by the model transformation. However, up until now there is no automatic verification approach available at the transformation level, i.e. for all source and target models specified by the model transformation. In this report, we extend our results presented in [27] and outline a new sophisticated approach for the automatic verification of behavior preservation captured by bisimulation resp. simulation for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invariant checking for graph transformation and that the resulting checking problem can be addressed by our own invariant checker even for a complex example where a sequence chart is transformed into communicating automata. We further discuss today's limitations of invariant checking for graph transformation and motivate further lines of future work in this direction.



Fundamental Approaches To Software Engineering


Fundamental Approaches To Software Engineering
DOWNLOAD eBooks

Author : Reiner Hähnle
language : en
Publisher: Springer
Release Date : 2019-04-03

Fundamental Approaches To Software Engineering written by Reiner Hähnle and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2019-04-03 with Computers categories.


This book is Open Access under a CC BY licence. This book constitutes the proceedings of the 22nd International Conference on Fundamental Approaches to Software Engineering, FASE 2019, which took place in Prague, Czech Republic in April 2019, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019.The 24 papers presented in this volume were carefully reviewed and selected from 94 submissions. The papers are organized in topical sections named: software verification; model-driven development and model transformation; software evolution and requirements engineering; specification, design, and implementation of particular classes of systems; and software testing.



Proceedings Of The 7th Ph D Retreat Of The Hpi Research School On Service Oriented Systems Engineering


Proceedings Of The 7th Ph D Retreat Of The Hpi Research School On Service Oriented Systems Engineering
DOWNLOAD eBooks

Author : Meinel, Christoph
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2014-10-09

Proceedings Of The 7th Ph D Retreat Of The Hpi Research School On Service Oriented Systems Engineering written by Meinel, Christoph and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2014-10-09 with categories.


Design and Implementation of service-oriented architectures imposes a huge number of research questions from the fields of software engineering, system analysis and modeling, adaptability, and application integration. Component orientation and web services are two approaches for design and realization of complex web-based system. Both approaches allow for dynamic application adaptation as well as integration of enterprise application. Commonly used technologies, such as J2EE and .NET, form de facto standards for the realization of complex distributed systems. Evolution of component systems has lead to web services and service-based architectures. This has been manifested in a multitude of industry standards and initiatives such as XML, WSDL UDDI, SOAP, etc. All these achievements lead to a new and promising paradigm in IT systems engineering which proposes to design complex software solutions as collaboration of contractually defined software services. Service-Oriented Systems Engineering represents a symbiosis of best practices in object-orientation, component-based development, distributed computing, and business process management. It provides integration of business and IT concerns. The annual Ph.D. Retreat of the Research School provides each member the opportunity to present his/her current state of their research and to give an outline of a prospective Ph.D. thesis. Due to the interdisciplinary structure of the Research Scholl, this technical report covers a wide range of research topics. These include but are not limited to: Self-Adaptive Service-Oriented Systems, Operating System Support for Service-Oriented Systems, Architecture and Modeling of Service-Oriented Systems, Adaptive Process Management, Services Composition and Workflow Planning, Security Engineering of Service-Based IT Systems, Quantitative Analysis and Optimization of Service-Oriented Systems, Service-Oriented Systems in 3D Computer Graphics sowie Service-Oriented Geoinformatics.



Metric Temporal Graph Logic Over Typed Attributed Graphs


Metric Temporal Graph Logic Over Typed Attributed Graphs
DOWNLOAD eBooks

Author : Giese, Holger
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2019

Metric Temporal Graph Logic Over Typed Attributed Graphs written by Giese, Holger and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2019 with Computers categories.


Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases—managing the storage and manipulation of graph data—updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair. We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas deltabased (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update.