#### Filter Results:

- Full text PDF available (137)

#### Publication Year

1992

2018

- This year (9)
- Last 5 years (28)
- Last 10 years (70)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Method

#### Organism

Learn More

- Arend Rensink
- AGTIVE
- 2003

The tool described here is the first part of a tool set called GROOVE (GRaphbased Object-Oriented VErification) for software model checking of objectoriented systems. The special feature of GROOVE,… (More)

- Arend Rensink
- 2003

We sketch a setup in which transition systems are generated from graph grammars and subsequently checked for properties expressed in a temporal logic on graphs. We envisage this as part of an… (More)

- Machiel van der Bijl, Arend Rensink, Jan Tretmans
- FATES
- 2003

Compositional testing concerns the testing of systems that consist of communicating components which can also be tested in isolation. Examples are component based testing and interoperability… (More)

- Mehmet Aksit, Arend Rensink, Tom Staijen
- AOSD
- 2009

Aspects that in isolation behave correctly, may interact when being combined. When interaction changes an aspect's behaviour or disables an aspect, we call this interference. One particular type of… (More)

- Amir Hossein Ghamarian, Maarten de Mol, Arend Rensink, Eduardo Zambon, Maria Zimakova
- International Journal on Software Tools for…
- 2011

In this paper we present case studies that describe how the graph transformation tool groove has been used to model problems from a wide variety of domains. These case studies highlight the wide… (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… (More)

- Arend Rensink
- ICGT
- 2004

We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds to the negation of a… (More)

- Arend Rensink
- Inf. Comput.
- 1997

Traditionally, in process calculi, relations over open terms, i.e., terms with free process variables, are defined as extensions of closed-term relations: two open terms are related if and only if… (More)

- Ed Brinksma, Arend Rensink, Walter Vogler
- CONCUR
- 1995

<lb>In this paper we present a solution to the long-standing problem of characterising the coars-<lb>est liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process… (More)

- Arend Rensink, Ákos Schmidt, Dániel Varró
- ICGT
- 2004

Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model checking to systems… (More)