#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2005

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Harmen Kastenberg, Arend Rensink
- SPIN
- 2006

Much research has been done in the field of model-checking complex systems (either hardware or software). Approaches that use explicit state modelling mostly use bit vectors to represent the states of such systems. Unfortunately, that kind of representation does not extend smoothly to systems in which the states contain values from a domain other than… (More)

- Harmen Kastenberg, Anneke Kleppe, Arend Rensink
- FMOODS
- 2006

In this paper we describe an application of the theory of graph transformations to the practise of language design. In particular, we have defined the static and dynamic semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs (the static semantics) and modelling their effect by graph… (More)

<lb>xiii

- Harmen Kastenberg
- Electr. Notes Theor. Comput. Sci.
- 2006

Graphs are a very expressive formalism for system modeling, especially when attributes are allowed. Our research is mainly focused on the use of graphs for system verification. Up to now, there are two main different approaches of modeling (typed) attributed graphs and specifying their transformation. Here we report preliminary results of our investigation… (More)

- Ruben Smelik, Arend Rensink, Harmen Kastenberg
- Visual Languages and Human-Centric Computing (VL…
- 2006

In this paper we propose a visual language CFSL for specifying control flow semantics of programming languages. We also present a translation from CFSL to graph production systems (GPS) for flow graph construction; that is, any CFSL specification, say for a language L, gives rise to a GPS that constructs from any L-program (represented as an abstract syntax… (More)

- Harmen Kastenberg, Arend Rensink
- CONCUR
- 2008

We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This means that the algorithm is suited for a setting in which resources, such as processes or objects, are dynamically created and destroyed, without an a priori bound. The algorithm… (More)

In this paper we describe the application of the theory of graph transformations to the practise of language design. We have defined the semantics of a small but realistic objectoriented language (called TAAL) by mapping the language constructs to graphs and their operational semantics to graph transformation rules. In the process we establish a mapping… (More)

- Iovka Boneva, Frank Hermann, Harmen Kastenberg, Arend Rensink
- ECEASST
- 2007

Application of graph transformations for software verification and model transformation is an emergent field of research. In particular, graph transformation approaches provide a natural way of modelling object oriented systems and semantics of object-oriented languages. There exist a number of tools for graph transformations that are often specialised in a… (More)

- Frank Hermann, Harmen Kastenberg, Tony Modica
- ECEASST
- 2006

Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars written in one approach to a behaviourally equivalent graph grammar in another approach. In this paper we translate graph grammars developed with the GROOVE tool to AGG graph grammars by first… (More)

We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked sub-graph, in which the sub-graph represents the data domain, rather than as a tuple of graph and algebra. This is a general construction which can be shown to preserve adhesiveness of categories; it has the… (More)