Pieter Van Gorp - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged graph-rewriting

Graph transformation tool contest 2008Arend Rensink, Pieter Van Gorp. STTT, 12(3-4):171-181, 2010. [doi]

Transforming Process Models: Executable Rewrite Rules versus a Formalized Java ProgramPieter Van Gorp, Rik Eshuis. MoDELS 2010: 258-272 [doi]

BPMN 2.0 Execution Semantics Formalized as Graph Rewrite RulesRemco M. Dijkman, Pieter Van Gorp. bpmn 2011: 16-30 [doi]

Transformation Tool ContestPieter Van Gorp, Steffen Mazanek, Arend Rensink, editors, Malaga, 2010.

Transforming Process Models: executable rewrite rules versus a formalized Java programPieter Van Gorp, Eshuis. MoDELS 2010:

Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, ProceedingsRalf Treinen, editor, Volume 5595 of Lecture Notes in Computer Science, Springer, 2009. [doi]

Call for Papers: STTT Special Section on. Graph-Based Tool ComparisonPieter Van Gorp, Arend Rensink. nov 2008.

Graph-Based Tools: The ContestArend Rensink, Pieter Van Gorp. gg 2008: 463-466 [doi]

Graph-Based Tools: The ContestArend Rensink, Pieter Van Gorp. In Graph Transformations. 2008.

Graph Transformation Tools Contest on the Transformation of UML Models to CSPDániel Varró, Mark Asztalos, Denes Bisztray, Artur Boronat, Rubino Geiss, Martin Gogolla, Pieter Van Gorp, Ole Kniemeyer, Anantha Narayanan, Edgars Rencis, Erhard Weinell. In 3rd International Workshop and Symposium on Applications of Graph Transformation with Industrial Relevance (AGTiVE). 2008:

Students can get excited about Formal Methods: a model-driven course on Petri-Nets, Metamodels and Graph GrammarsPieter Van Gorp, Hans Schippers, Serge Demeyer, Dirk Janssens. In The 3rd Educators' Symposium of the 10th ACM/IEEE International Conference on Model Driven Engineering Languages and Systems, Symposium Proceedings. 2007:

Transformation of UML Models to CSP: A Case Study for Graph Transformation ToolsDániel Varró, Márk Asztalos, Dénes Bisztray, Artur Boronat, Duc-Hanh Dang, Rubino Geiß, Joel Greenyer, Pieter Van Gorp, Ole Kniemeyer, Anantha Narayanan, Edgars Rencis, Erhard Weinell. agtive 2008: 540-565 [doi]

Dynamic Multilevel Graph VisualizationTodd L. Veldhuizen. corr, abs/0712.1549, 2007. [doi]

Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised PapersMichael Kaufmann, Dorothea Wagner, editors, Volume 4372 of Lecture Notes in Computer Science, Springer, 2007.

Applying a Model Transformation Taxonomy to Graph Transformation TechnologyTom Mens, Pieter Van Gorp, Dániel Varró, Gabor Karsai. ENTCS, 152:143-159, 2006. [doi]

Reducibility of gene patterns in ciliates using the breakpoint graphRobert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg. TCS, 356(1-2):26-45, 2006. [doi]

Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. TCS, 362(1-3):86-99, 2006. [doi]

Feasible Trace Reconstruction for Rewriting ApproximationsYohan Boichut, Thomas Genet. RTA 2006: 123-135 [doi]

Using Graph Transformation for Practical Model Driven Software EngineeringLars Grunske, Leif Geiger, Albert Zündorf, Niels Van Eetvelde, Pieter Van Gorp, Dániel Varró. In Model-driven Software Development - Volume II of Research and Practice in Software Engineering. Springer-Verlag, 2005.

Multi-way spatial join selectivity for the ring join graphJun-Ki Min, Ho-Hyun Park, Chin-Wan Chung. INFSOF, 47(12):785-795, 2005. [doi]

Aspect graphs for three-dimensional object recognition machine vision systemsTatiana Tambouratzis, Michael J. Wright. ijis, 20(1):47-72, 2005. [doi]

Finding hidden independent sets in interval graphsTCS, 310(1-3):287-307, 2004. [doi]

Canonical Graph ShapesArend Rensink. ESOP 2004: 401-415 [doi]

Implementing Refactorings as Graph Rewrite Rules on a Platform Independent MetamodelPieter Van Gorp, Niels Van Eetvelde, Dirk Janssens. In Proceedings of the 1st International Fujaba Days. 2003:

Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, ProceedingsRobert Nieuwenhuis, editor, Volume 2706 of Lecture Notes in Computer Science, Springer, 2003.

Associative-Commutative Rewriting on Large TermsSteven Eker. RTA 2003: 14-29 [doi]

Lower Bounds for General Graph-Driven Read-Once Parity Branching ProgramsHenrik Brosenne, Matthias Homeister, Stephan Waack. mfcs 2003: 290-299 [doi]

Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching ProgramsMatthias Homeister. eccc, (068), 2003. [doi]

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDsHenrik Brosenne, Matthias Homeister, Stephan Waack. ita, 36(3):229-247, 2002. [doi]

Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. ifipTCS 2002: 83-94

Drawing Graphs on the TorusWilliam Kocay, Daniel Neilson, Ryan Szypowski. arscom, 59, 2001.

Graph-Driven Free Parity BDDs: Algorithms and Lower BoundsHenrik Brosenne, Matthias Homeister, Stephan Waack. mfcs 2001: 212-223 [doi]

Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Philipp Woelfel, Stephan Waack. eccc, 8(073), 2001. [doi]

Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, ProceedingsJoe Marks, editor, Volume 1984 of Lecture Notes in Computer Science, Springer, 2001.

Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, ProceedingsLeo Bachmair, editor, Volume 1833 of Lecture Notes in Computer Science, Springer, 2000.

Embedding Graphs into a Three Page Book with ::::O::::(::::m:::: log ::::n::::) Crossings of Edges over the SpineHikoe Enomoto, Miki Shimabara Miyauchi. siamdm, 12(3):337-341, 1999. [doi]

Neighborhood conditions for balanced independent sets in bipartite graphsDenise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz. DM, 181(1-3):31-36, 1998. [doi]

Within ARM s Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite SystemsWan Fokkink, Jasper Kamperman, Pum Walters. TOPLAS, 20(3):679-706, 1998. [doi]

on Global Dynamics of Optimal Graph ReductionJulia L. Lawall, Harry G. Mairson. ICFP 1997: 188-195

Graph Drawing, Symposium on Graph Drawing, GD 96, Berkeley, California, USA, September 18-20, ProceedingsStephen C. North, editor, Volume 1190 of Lecture Notes in Computer Science, Springer, 1997.

Graph Drawing, Symposium on Graph Drawing, GD 95, Passau, Germany, September 20-22, 1995, ProceedingsFranz-Josef Brandenburg, editor, Volume 1027 of Lecture Notes in Computer Science, Springer, 1996.

Counting H-free graphsHans Jürgen Prömel, Angelika Steger. DM, 154(1-3):311-315, 1996. [doi]

On m-centers in P::t::-free graphsOdile Favaron, Jean-Luc Fouquet. DM, 125(1-3):147-152, 1994. [doi]

Graph TypesNils Klarlund, Michael I. Schwartzbach. POPL 1993: 196-205

Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, ProceedingsClaude Kirchner, editor, Volume 690 of Lecture Notes in Computer Science, Springer, 1993.

Efficient Implementation of Narrowing and RewritingMichael Hanus. pdk 1991: 344-365

International Conference on Rewriting Techniques and ApplicationsRonald V. Book, editor, Volume 488 of Lecture Notes in Computer Science, Springer, Como, Italy, April 1991. [doi]

Graph Reduction, Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29 - October 1, 1986Joseph H. Fasel, Robert M. Keller, editors, Volume 279 of Lecture Notes in Computer Science, Springer, 1987.

When m vertices in a k-connected graph cannot be walked round along a simple cycleAlexander K. Kelmans, M. V. Lomonosov. DM, 38(2-3):317-322, 1982. [doi]

Applying a Model Transformation Taxonomy to Graph Transformation TechnologyTom Mens, Pieter Van Gorp, Daniel Varró, Gabor Karsai. In Proceedings of the International Workshop on Graph and Model Transformation (GraMoT 2005). :

runs on WebDSL