BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Germany
1 × Italy
2 × United Kingdom
Collaborated with:
B.König M.Hülsbusch C.Blume H.Zantema S.Küpper D.Nolte D.Engelke M.Friedrich
Talks about:
graph (9) languag (5) recogniz (4) transform (3) toward (3) termin (3) system (3) automata (2) invari (2) prove (2)

Person: H. J. Sander Bruggink

DBLP DBLP: Bruggink:H=_J=_Sander

Contributed to:

ICGT 20152015
ICGT 20142014
RTA-TLCA 20142014
GT-VMT 20132013
GT-VMT 20122012
ICGT 20122012
GT-VMT 20112011
GT-VMT 20102010
ICGT 20082008
GT-VC 20072008

Wrote 11 papers:

ICGT-2015-Bruggink0NZ #graph #graph transformation #proving #termination #using
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (HJSB, BK, DN, HZ), pp. 52–68.
ICGT-2014-Bruggink #graph transformation #mining #process #towards
Towards Process Mining with Graph Transformation Systems (HJSB), pp. 253–268.
RTA-TLCA-2014-ZantemaKB #termination
Termination of Cycle Rewriting (HZ, BK, HJSB), pp. 476–490.
GT-VMT-2013-KupperKB #category theory
Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories (SK, BK, HJSB).
GT-VMT-2012-BrugginkHK #automaton #graph #towards
Towards Alternating Automata for Graph Languages (HJSB, MH, BK).
ICGT-2012-BlumeBEK #automaton #graph #implementation #invariant #performance
Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking (CB, HJSB, DE, BK), pp. 264–278.
Treewidth, Pathwidth and Cospan Decompositions (CB, HJSB, MF, BK).
GT-VMT-2011-BrugginkH #decidability #graph
Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages (HJSB, MH).
GT-VMT-2010-BlumeBK #graph #invariant
Recognizable Graph Languages for Checking Invariants (CB, HJSB, BK).
ICGT-2008-BrugginkK #graph #on the
On the Recognizability of Arrow and Graph Languages (HJSB, BK), pp. 336–350.
GT-VC-2007-Bruggink08 #graph transformation #proving #termination #towards
Towards a Systematic Method for Proving Termination of Graph Transformation Systems (HJSB), pp. 23–38.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.