Model Checking Dynamic States in GROOVE

Kastenberg, Harmen; Rensink, Arend

doi:10.1007/11691617_19

Cited by 86 publications

(50 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words: if a rule matches a state, we know that the preconditions of that rule hold within the state, which means that we have knowledge about the state itself. As we will see in section 5, the model checker provided by GROOVE [16] works exactly this way: it verifies CTL formulas where the atomic propositions are applications of the graph transformation rules used to calculate the transition system under investigation.…”

Section: Sound Uml Activitiesmentioning

confidence: 99%

Analysis of UML Activities Using Dynamic Meta Modeling

Engels

Soltenborn

Wehrheim

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Dynamic Meta Modeling (DMM) is a universal approach to defining semantics for languages syntactically grounded on meta models. DMM has been designed with the aim of getting highly understandable yet precise semantic models which in particular allow for a formal analysis. In this paper, we exemplify this by showing how DMM can be used to give a semantics to and define an associated analysis technique for UML Activities.

show abstract

Section: Sound Uml Activitiesmentioning

confidence: 99%

Analysis of UML Activities Using Dynamic Meta Modeling

Engels

Soltenborn

Wehrheim

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In [Ren04b,KR06], the transformation-based tool Groove is presented. It conducts a state space exploration of edge-labeled graph transformation rules with negative application conditions and verifies properties in Ctl over first-order graph logic, enriched with transitive closure.…”

Section: Related Conceptsmentioning

confidence: 99%

Development of Correct Graph Transformation Systems

Pennemann

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Graph transformation has many application areas in computer science, such as software engineering or the design of concurrent and distributed systems. Being a visual modeling technique, graph transformation has the potential to play a decisive role in the development of increasingly larger and complex systems. However, the use of visual modeling techniques alone does not guarantee the correctness of a design. In context of rising standards for trustworthy systems, there is a growing need for the verification of graph transformation systems and programs. The research of appropriate methods for this purpose is the topic of this thesis.The primary goal is to obtain the capability to decide graphical program specifications. These specifications consists of a graphical precondition, a graph program, and a graphical postcondition. As usual, such a specification is said to be correct, if all those system states satisfy the postcondition that are reachable by applying the program on a start state satisfying the precondition. In the considered programs, the selection, deletion, addition and deselection of a graph's nodes and edges are the elementary constructs that can be composed to more complex programs by non-deterministic choice, sequential composition and iteration. The resulting programming language is computationally complete and is able to model transactions that deal with an unbounded number of nodes and edges. As language for the specification of state properties, graph conditions are investigated and used. We show that graph conditions provide an intuitive formalism for first-order structural properties and are suited to infer knowledge about the behavior of graph transformation systems and programs.According to Dijkstra, the correctness of program specifications can be shown by constructing a weakest precondition of the program relative to the postcondition and checking whether the specified precondition implies the weakest precondition. Hence the correctness problem of program specifications is reduced to an implication problem of conditions. In this thesis, it is shown how to construct weakest preconditions for graph programs and graph conditions. Following a dual approach, a sound and complete satisfiability iv Development of Correct Graph Transformation Systems algorithm for graph conditions is investigated and a fragment of conditions is identified, for which the algorithm decides. On the other hand, a resolutionbased calculus for graph conditions is presented and its soundness is proven. Implementations of the aforementioned deciders for conditions are compared with existing theorem provers and satisfiability solvers for first-order logic by verifying three case studies: a railroad control, an access control for computer systems, and, as an external example, a car platoon maneuver protocol.The research is done within the framework of the so-called weak adhesive high-level replacement categories. Therefore, the results will be applicable to different kinds of graph replacement systems and Petri n...

show abstract

“…In [113] we have provided a proof-of-concept that model checking techniques can effectively be applied to graph transformation systems that generate finite state spaces. To extend this to arbitrary graph transformation systems, we have implemented an LTL model checking algorithm that combines existing techniques and ideas from on-the-fly model checking and bounded model checking.…”

Section: A Model Checking Algorithm For Graph Transformation Systemsmentioning

confidence: 99%

“…In this work we distinguish three different basic approaches to model checking, namely sequential, on-the-fly, and bounded model checking. In [113] we have proposed a fairly straightforward approach to verify graph production systems. There, we focussed on graph productions that give rise to finite state spaces and applied the sequential model checking approach.…”

Section: Introductionmentioning

confidence: 99%

Graph-based software specification and verification

Kastenberg¹

Self Cite

View full text Add to dashboard Cite

Model Checking Dynamic States in GROOVE

Cited by 86 publications

References 8 publications

Analysis of UML Activities Using Dynamic Meta Modeling

Analysis of UML Activities Using Dynamic Meta Modeling

Development of Correct Graph Transformation Systems

Graph-based software specification and verification

Contact Info

Product

Resources

About