| 2009 | ||
|---|---|---|
| 69 | Richard F. Paige, Alan Hartman, Arend Rensink: Model Driven Architecture - Foundations and Applications, 5th European Conference, ECMDA-FA 2009, Enschede, The Netherlands, June 23-26, 2009. Proceedings Springer 2009 | |
| 68 | Mehmet Aksit, Arend Rensink, Tom Staijen: A graph-transformation-based simulation approach for analysing aspect interference on shared join points. AOSD 2009: 39-50 | |
| 67 | Arend Rensink, Eduardo Zambon: A Type Graph Model for Java Programs. FMOODS/FORTE 2009: 237-242 | |
| 66 | Tom Staijen, Arend Rensink: Graph-based specification and simulation of featherweight Java with around advice. FOAL 2009: 25-30 | |
| 2008 | ||
| 65 | Harmen Kastenberg, Arend Rensink: Dynamic Partial Order Reduction Using Probe Sets. CONCUR 2008: 233-247 | |
| 64 | Arend Rensink: Explicit State Model Checking for Graph Grammars. Concurrency, Graphs and Models 2008: 114-132 | |
| 63 | Gregor Engels, Anneke Kleppe, Arend Rensink, Maria Semenyak, Christian Soltenborn, Heike Wehrheim: From UML Activities to TAAL - Towards Behaviour-Preserving Model Transformations. ECMDA-FA 2008: 94-109 | |
| 62 | Jörg Bauer, Iovka Boneva, Marcos E. Kurbán, Arend Rensink: A Modal-Logic Based Graph Abstraction. ICGT 2008: 321-335 | |
| 61 | Arend Rensink, Pieter Van Gorp: Graph-Based Tools: The Contest. ICGT 2008: 463-466 | |
| 60 | Arend Rensink, Anneke Kleppe: On a Graph-Based Semantics for UML Class and Object Diagrams. ECEASST 10: (2008) | |
| 59 | Arend Rensink, Ronald Nederpel: Graph Transformation Semantics for a QVT Language. Electr. Notes Theor. Comput. Sci. 211: 51-62 (2008) | |
| 58 | Barbara König, Arend Rensink, Reiko Heckel: Preface. Electr. Notes Theor. Comput. Sci. 213(1): 1-2 (2008) | |
| 2007 | ||
| 57 | Arend Rensink, Gabriele Taentzer: AGTIVE 2007 Graph Transformation Tool Contest. AGTIVE 2007: 487-492 | |
| 56 | Arend Rensink, Alexander Dotor, Claudia Ermel, Stefan Jurack, Ole Kniemeyer, Juan de Lara, Sonja Maier, Tom Staijen, Albert Zündorf: Ludo: A Case Study for Graph Transformation Tools. AGTIVE 2007: 493-513 | |
| 55 | Iovka Boneva, Frank Hermann, Harmen Kastenberg, Arend Rensink: Simulating Multigraph Transformations Using Simple Graphs. ECEASST 6: (2007) | |
| 54 | Arend Rensink, Reiko Heckel, Barbara König: Preface. Electr. Notes Theor. Comput. Sci. 175(4): 1-2 (2007) | |
| 53 | Arend Rensink, Walter Vogler: Fair testing. Inf. Comput. 205(2): 125-198 (2007) | |
| 2006 | ||
| 52 | Arend Rensink, Jos Warmer: Model Driven Architecture - Foundations and Applications, Second European Conference, ECMDA-FA 2006, Bilbao, Spain, July 10-13, 2006, Proceedings Springer 2006 | |
| 51 | Arend Rensink: Model Checking Quantified Computation Tree Logic. CONCUR 2006: 110-125 | |
| 50 | Harmen Kastenberg, Anneke Kleppe, Arend Rensink: Defining Object-Oriented Execution Semantics Using Graph Transformations. FMOODS 2006: 186-201 | |
| 49 | Arend Rensink: Nested Quantification in Graph Transformation Rules. ICGT 2006: 1-13 | |
| 48 | Annegret Habel, Karl-Heinz Pennemann, Arend Rensink: Weakest Preconditions for High-Level Programs. ICGT 2006: 445-460 | |
| 47 | Harmen Kastenberg, Arend Rensink: Model Checking Dynamic States in GROOVE. SPIN 2006: 299-305 | |
| 46 | Ruben Smelik, Arend Rensink, Harmen Kastenberg: Specification and Construction of Control Flow Semantics. VL/HCC 2006: 65-72 | |
| 45 | Arend Rensink: Isomorphism Checking in GROOVE. ECEASST 1: (2006) | |
| 44 | Arend Rensink, Reiko Heckel, Barbara König: Preface. Electr. Notes Theor. Comput. Sci. 154(2): 1-5 (2006) | |
| 43 | Arend Rensink, Dino Distefano: Abstract Graph Transformation. Electr. Notes Theor. Comput. Sci. 157(1): 39-59 (2006) | |
| 2005 | ||
| 42 | Uwe Aßmann, Mehmet Aksit, Arend Rensink: Model Driven Architecture, European MDA Workshops: Foundations and Applications, MDAFA 2003 and MDAFA 2004, Twente, The Netherlands, June 26-27, 2003 and Linköping, Sweden, June 10-11, 2004, Revised Selected Papers Springer 2005 | |
| 41 | Val Jones, Arend Rensink, Ed Brinksma: Modelling mobile health systems: an application of augmented MDA for the extended healthcare enterprise.. EDOC 2005: 58-69 | |
| 40 | Gabriele Taentzer, Arend Rensink: Ensuring Structural Constraints in Graph-Based Models with Type Inheritance. FASE 2005: 64-79 | |
| 39 | Dino Distefano, Joost-Pieter Katoen, Arend Rensink: Safety and Liveness in Concurrent Pointer Programs. FMCO 2005: 280-312 | |
| 38 | Machiel van der Bijl, Arend Rensink, Jan Tretmans: Action Refinement in Conformance Testing. TestCom 2005: 81-96 | |
| 2004 | ||
| 37 | Arend Rensink: Canonical Graph Shapes. ESOP 2004: 401-415 | |
| 36 | Dino Distefano, Joost-Pieter Katoen, Arend Rensink: Who is Pointing When to Whom? FSTTCS 2004: 250-262 | |
| 35 | Paolo Baldan, Barbara König, Arend Rensink: Summary 2: Graph Grammar Verification through Abstraction. Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems 2004 | |
| 34 | Arend Rensink, Ákos Schmidt, Dániel Varró: Model Checking Graph Transformations: A Comparison of Two Approaches. ICGT 2004: 226-241 | |
| 33 | Arend Rensink: Representing First-Order Logic Using Graphs. ICGT 2004: 319-335 | |
| 32 | Arend Rensink: Subjects, Models, Languages, Transformations. Language Engineering for Model-Driven Software Development 2004 | |
| 2003 | ||
| 31 | Arend Rensink: The GROOVE Simulator: A Tool for State Space Generation. AGTIVE 2003: 479-485 | |
| 30 | Arend Rensink: AGTIVE'03: Summary from the Outside In. AGTIVE 2003: 486-488 | |
| 29 | Machiel van der Bijl, Arend Rensink, Jan Tretmans: Compositional Testing with ioco. FATES 2003: 86-100 | |
| 2002 | ||
| 28 | Bart Jacobs, Arend Rensink: Formal Methods for Open Object-Based Distributed Systems V, IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS 2002), March 20-22, 2002, Enschede, The Netherlands Kluwer 2002 | |
| 27 | Dino Distefano, Arend Rensink, Joost-Pieter Katoen: Model Checking Birth and Death. IFIP TCS 2002: 435-447 | |
| 2001 | ||
| 26 | Arend Rensink, Heike Wehrheim: Process algebra with action dependencies. Acta Inf. 38(3): 155-234 (2001) | |
| 25 | Arend Rensink, Roberto Gorrieri: Vertical Implementation. Inf. Comput. 170(1): 95-133 (2001) | |
| 2000 | ||
| 24 | Arend Rensink: Action Contraction. CONCUR 2000: 290-304 | |
| 23 | Dino Distefano, Joost-Pieter Katoen, Arend Rensink: On a Temporal Logic for Object-Based Systems. FMOODS 2000: 285-304 | |
| 22 | Arend Rensink: Bisimilarity of Open Terms. Inf. Comput. 156(1-2): 345-385 (2000) | |
| 1998 | ||
| 21 | Thomas Firley, Thomas Gehrke, Arend Rensink: Spezifikation eines RPC-Speichers mit der Sprache ProFun. FBT 1998: 136-147 | |
| 20 | Thomas Gehrke, Michaela Huhn, Peter Niebert, Arend Rensink, Heike Wehrheim: A Process Algebra Semantics for MSC Including Conditions. FBT 1998: 185-196 | |
| 19 | Thomas Gehrke, Michaela Huhn, Arend Rensink, Heike Wehrheim: An Algebraic Semantics for Message Sequence Chart Documents. FORTE 1998: 3-18 | |
| 1997 | ||
| 18 | Arend Rensink, Roberto Gorrieri: Action refinement for Vertical Implementation. FBT 1997: 69-78 | |
| 17 | Arend Rensink, Heike Wehrheim: Dependency-Based Action Refinement. MFCS 1997: 468-477 | |
| 16 | Arend Rensink, Roberto Gorrieri: Action Refinement as an Implementation Relations. TAPSOFT 1997: 772-786 | |
| 15 | Arend Rensink: Bisimilarity of open terms. Electr. Notes Theor. Comput. Sci. 7: (1997) | |
| 14 | Thomas Gehrke, Arend Rensink: Process creation and full sequential composition in a name-passing calculus. Electr. Notes Theor. Comput. Sci. 7: (1997) | |
| 1996 | ||
| 13 | Arend Rensink: Denotational, Causal, and Operational Determinism in Event Structures. CAAP 1996: 272-286 | |
| 12 | Ed Brinksma, Arend Rensink, Walter Vogler: Applications of Fair Testing. FORTE 1996: 145-160 | |
| 11 | Ursula Goltz, Roberto Gorrieri, Arend Rensink: Comparing Syntactic and Semantic Sction Refinement. Inf. Comput. 125(2): 118-143 (1996) | |
| 10 | Arend Rensink: Algebra and Theory of Order-Deterministic Pomsets. Notre Dame Journal of Formal Logic 37(2): 283-320 (1996) | |
| 1995 | ||
| 9 | Arend Rensink: A Complete Theory of Deterministic Event Structures. CONCUR 1995: 160-174 | |
| 8 | Ed Brinksma, Arend Rensink, Walter Vogler: Fair Testing. CONCUR 1995: 313-327 | |
| 1994 | ||
| 7 | Arend Rensink, Heike Wehrheim: Weak Sequential Composition in Process Algebras. CONCUR 1994: 226-241 | |
| 6 | Arend Rensink: Methodological Aspects of Action Refinement. PROCOMET 1994: 227-246 | |
| 5 | Ursula Goltz, Roberto Gorrieri, Arend Rensink: On Syntactic and Semantic Action Refinement. TACS 1994: 385-404 | |
| 4 | Ursula Goltz, Arend Rensink: Finite Petri Nets as Models for Recursive Causal Behaviour. Theor. Comput. Sci. 124(1): 169-179 (1994) | |
| 1993 | ||
| 3 | Arend Rensink: Order isomorphism odes not preserve global event independence. Bulletin of the EATCS 49: 228-235 (1993) | |
| 2 | Arend Rensink: Order isomorphism odes not preserve global event independence. Bulletin of the EATCS 51: 228-235 (1993) | |
| 1992 | ||
| 1 | Arend Rensink: Posets for Configurations! CONCUR 1992: 269-285 | |