activity
20112026
most citedGraph Subsumption in Abstract State Space Exploration

5 citations · 19 across the 12 of their papers we have counts for

collaborators
Showing cs.LOShow all

7 papers · 1 filter

cs.LO2026

Structural Morphisms for Nested Conditions - Full Version

Arend Rensink, Andrea Corradini

Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this…

cs.LO2025

Counterexample-Guided Abstraction Refinement for Generalized Graph Transformation Systems (Full Version)

Barbara König, Arend Rensink, Lara Stoltenow +1

This paper addresses the following verification task: Given a graph transformation system and a class of initial graphs, can we guarantee (non-)reachability of a given other class…

cs.LO2024

On Categories of Nested Conditions

Arend Rensink, Andrea Corradini

Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this…

cs.LO2019★ 2 cited

Rewriting Abstract Structures: Materialization Explained Categorically

Andrea Corradini, Tobias Heindel, Barbara König +2

The paper develops an abstract (over-approximating) semantics for double-pushout rewriting of graphs and graph-like objects. The focus is on the so-called materialization of left-h…

cs.LO2014★ 2 cited

Graph- versus Vector-Based Analysis of a Consensus Protocol

Giorgio Delzanno, Arend Rensink, Riccardo Traverso

The Paxos distributed consensus algorithm is a challenging case-study for standard, vector-based model checking techniques. Due to asynchronous communication, exhaustive analysis m…

cs.LO2013★ 4 cited

Class Diagram Restructuring with GROOVE

Wietse Smid, Arend Rensink

This paper describes the GROOVE solution to the "Class Diagram Restructuring" case study of the Tool Transformation Contest 2013. We show that the visual rule formalism enables the…