Conference and Workshop Papers

To appear

Barbara König, Dennis Nolte, Julia Padberg, and Arend Rensink. A tutorial on graph transformation. In Festschrift in Memory of Hartmut Ehrig. Springer, to appear.
Info

2017

Benjamin Cabrera, Laura Steinert, and Björn Ross. Grawitas: a grammar-based wikipedia talk page parser. In Proceedings of the Software Demonstrations of the 15th Conference of the European Chapter of the Association for Computational Linguistics, pages 21–24. Association for Computational Linguistics, 2017.
Info
See aclweb.org ...
Filippo Bonchi, Barbara König, and Sebastian Küpper. Up-to techniques for weighted systems. In Proc. of TACAS '17, Part I, pages 535–552. Springer, 2017. LNCS 10205.
Info
Extended version
Andrea Corradini, Barbara König, and Dennis Nolte. Specifying graph languages with type graphs. In Proc. of ICGT '17 (International Conference on Graph Transformation), pages 73–89. Springer, 2017. LNCS 10373.
Info
Extended version
Barbara König and Christina Mika. Bisimulation games on coalgebras. In CALCO Early Ideas '17, 2017.
Info
Harsh Beohar, Barbara König, Sebastian Küpper, and Alexandra Silva. Conditional transition system with upgrades. In Proc. of TASE '17 (Theoretical Aspects of Software Engineering), 2017. to appear.
Info
Benjamin Cabrera and Barbara König. Extracting the main path of historic events from Wikipedia. In Proc. of ENIC '17 (European Network Intelligence Conference), 2017. to appear.
Info
Harsh Beohar and Sebastian Küpper. On path-based coalgebras and weak notions of bisimulation. In Proc. of CALCO '17, 2017. to appear.
Info
Barbara König, Sebastian Küpper, and Christina Mika. Paws: A tool for the analysis of weighted systems. In Proc. of QAPL '17 (International Workshop on Quantitative Aspects of Programming Languages and Systems), 2017. to appear.
Info
B. König and C. Mika. Bisimulation games on coalgebras. In CALCO Early Ideas '17, 2017.
Info
B. König, C. Mika, and S. Küpper. Paws: A tool for the analysis of weighted systems. In Proc. of QAPL '17 (International Workshop on Quantitative Aspects of Programming Languages and Systems), volume 250 of EPTCS, 2017.
Info
See eptcs.web.cse.unsw.edu.au ...
Dennis Nolte. Analysis and abstraction of graph transformation systems via type graphs. In Proc. of ICGT '17 (International Conference on Graph Transformation), Proc. of the Doctoral Symposium. Springer, 2017.
PDF (182 kB)
Info
Conference version

2016

Benjamin Cabrera. Towards using subpattern distributions in social network analysis. In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), ASONAM '16, 2016.
Info
Björn Ross, Michael Rist, Guillermo Carbonell, Benjamin Cabrera, Nils Kurowsky, and Michael Wojatzki. Measuring the reliability of hate speech annotations: The case of the european refugee crisis. In Proceedings of KONVENS 2016, NLP4CMC workshop, 2016.
Info
Hans Zantema, Dennis Nolte, and Barbara König. Termination of term graph rewriting. In Proc. of WST '16 (Workshop on Termination), 2016.
Info

2015

Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Towards trace metrics via functor lifting. In Lawrence S. Moss and Paweł Sobociński, editors, 6th Conference on Algebra and Coalgebra in Computer Science (CALCO'15), volume 35 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35–49. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, oct 2015.
Info
See drops.dagstuhl.de ...
Harsh Beohar and Pieter Cuijpers. Open maps in concrete categories and branching bisimulation for prefix orders. In Mathematical Foundations of Programming Semantics, Nijmegen, May 2015. ENTCS. In press.
Info
Harsh Beohar and Mohammad Mousavi. A Pre-congruence Format for XY-simulations. In The 6th International Conference on Fundamentals of Software Engineering, LNCS, Tehran, Iran, March 2015. Springer Verlag.
Info
H.J. Sander Bruggink, Barbara König, Dennis Nolte, and Hans Zantema. Proving termination of graph transformation systems using weighted type graphs over semirings. In Proc. of ICGT '15 (International Conference on Graph Transformation), pages 52–68. Springer, 2015. LNCS 9151.
Info
Extended version
Jan Stückrath. Uncover: Using coverability analysis for verifying graph transformation systems. In Francesco Parisi-Presicce and Bernhard Westfechtel, editors, Proceedings of ICGT 2015, volume 9151 of LNCS, pages 266–274. Springer, 2015.
PDF (228 kB)
Info

2014

Harsh Beohar and Mohammad Mousavi. Spinal test suites for software product lines. In Proceedings of the 9th Workshop on Model Based Testing (MBT'2014), EPTCS, pages 44–55, 2014.
Info
Harsh Beohar and Mohammad Mousavi. Input-output conformance testing based on featured transition systems. In Proceedings of the 29th ACM Symposium of Applied Computing: Software Verification and Testing Track. ACM, 2014.
Info
See dl.acm.org ...
H.J. Sander Bruggink. Towards process mining with graph transformation systems. In Proceedings of ICGT 2014, 2014.
Info
H.J. Sander Bruggink, Barbara König, and Hans Zantema. Termination analysis for graph transformation systems. In Proceedings of IFIP-TCS 2014, 2014.
Info
Tech report version
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Behavioral Metrics via Functor Lifting. In Venkatesh Raman and S. P. Suresh, editors, 34th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014), volume 29 of Leibniz International Proceedings in Informatics (LIPIcs), pages 403–415. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014.
Info
See drops.dagstuhl.de ...
Henning Kerstan, Barbara König, and Bram Westerbaan. Lifting adjunctions to coalgebras to (Re)Discover automata constructions. In Marcello M. Bonsangue, editor, Coalgebraic Methods in Computer Science, volume 8446 of Lecture Notes in Computer Science, pages 168–188. Springer Berlin Heidelberg, 2014.
Info
See dx.doi.org ...
Hans Zantema, H.J. Sander Bruggink, and Barbara König. Termination of cycle rewriting. In Proc. of RTA-TLCA '14, pages 476–490. Springer, 2014. LNCS 8560.
Info
Barbara König and Jan Stückrath. A general framework for well-structured graph transformation systems. In Proc. of CONCUR '14, pages 467–481. Springer, 2014. LNCS/ARCoSS 8704.
Info
Extended version
Barbara König and Sebastian Küpper. Generic partition refinement algorithms for coalgebras and an instantiation to weighted automata. In Proc. of TCS '14, IFIP AICT, pages 311–325. Springer, 2014. LNCS 8705.
PDF (260 kB)
Info
Barbara König and Sebastian Küpper. Generic partition refinement algorithms for coalgebras and an instantiation to weighted automata. In Proc. of TCS '14, IFIP AICT, pages 311–325. Springer, 2014. LNCS 8705.
Info
Jan Stückrath and Benjamin Weyers. Lattice-extended coloured petri net rewriting for adaptable user interface models. In Proc. of GTVMT 2014, 2014.
PDF (282 kB)
Info
Tech report version
Giorgio Delzanno and Jan Stückrath. Parameterized verification of graph transformation systems with whole neighbourhood operations. In Joël Ouaknine, Igor Potapov, and James Worrell, editors, RP'14, volume 8762 of LNCS, pages 72–84. Springer, 2014.
PDF (345 kB)
Info
Extended version

2013

Harsh Beohar and Pieter Cuijpers. Avoiding diamonds in desynchronization. In Corina Păsăreanu and Gwen Salaün, editors, Formal Aspects of Component Software, volume 7684 of LNCS, pages 36–54. Springer Berlin Heidelberg, 2013.
Info
Journal version
H.J. Sander Bruggink, Barbara König, and Sebastian Küpper. Concatenation and other closure properties of recognizable languages in adhesive categories. In Proc. of GT-VMT '13 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 58 of Electronic Communications of the EASST, 2013.
Info
See journal.ub.tu-berlin.de ...
H.J. Sander Bruggink, Barbara König, and Sebastian Küpper. Concatenation and other closure properties of recognizable languages in adhesive categories. In Proc. of GT-VMT '13 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 58 of Electronic Communications of the EASST, 2013.
Info

2012

Henning Kerstan and Barbara König. Coalgebraic trace semantics for probabilistic transition systems based on measure theory. In Maciej Koutny and Irek Ulidowski, editors, CONCUR 2012 – Concurrency Theory, volume 7454 of Lecture Notes in Computer Science, pages 410–424. Springer Berlin Heidelberg, sep 2012.
Info
H.J. Sander Bruggink, Mathias Hülsbusch, and Barbara König. Towards alternating automata for graph languages. In Proceedings of GT-VMT 2012, Electronic Communications of the EASST, 2012.
PDF (256 kB)
Info
Jiri Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, and Alexandra Silva. A coalgebraic perspective on minimization and determinization. In Proc. of FOSSACS '12, pages 58–73. Springer, 2012. LNCS/ARCoSS 7213.
Info
See link.springer.com ...
Mathias Hülsbusch and Barbara König. Deriving bisimulation congruences for conditional reactive systems. In Proc. of FOSSACS '12, pages 361–375. Springer, 2012. LNCS/ARCoSS 7213.
Info
See link.springer.com ...
Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, and Jan Stückrath. On the decidability status of reachability and coverability in graph transformation systems. In Proc. of RTA '12, volume 15 of LIPIcs, pages 101–116. Schloss Dagstuhl – Leibniz Center for Informatics, 2012.
PDF (592 kB)
Info
See drops.dagstuhl.de ...
Tech report version
Christoph Blume, Sander Bruggink H., J., Dominik Engelke, and Barbara König. Efficient symbolic implementation of graph automata with applications to invariant checking. In Proc. of ICGT '12 (International Conference on Graph Transformation), pages 264–278. Springer, 2012. LNCS 7562.
Info
Barbara König and Jan Stückrath. Well-structured graph transformation systems with negative application conditions. In Proc. of ICGT '12 (International Conference on Graph Transformation), pages 89–95. Springer, 2012. LNCS 7562.
Info
Barbara König. Conditions in reactive systems and in graph rewriting. In Proc. of PNGT '12 (Workshop on Petri Nets, Graph Transformation and other Concurrency Formalisms), volume 51 of Electronic Communications of the EASST, 2012.
Info
See journal.ub.tu-berlin.de ...

2011

Damian Nadales, Bert van Beek, Harsh Beohar, Pieter Cuijpers, and Jasper Fonteijn. The hierarchical compositional interchange format. In Proceedings of the 9th international conference on Formal Methods for Components and Objects, FMCO'10, pages 316–335, Berlin, Heidelberg, 2011. Springer-Verlag.
Info
H.J. Sander Bruggink and Mathias Hülsbusch. Decidability and expressiveness of finitely representable recognizable graph languages. In Proceedigs of GT-VMT 2011, Electronic Communications of the EASST, 2011.
PDF (235 kB)
Info
Marvin Heumüller, Salil Joshi Barbara König, and Jan Stückrath>. Construction of pushout complements in the category of hypergraphs. In Proc. of GCM '10 (Workshop on Graph Computation Models), volume 39 of Electronic Communications of the EASST, 2011.
Info
See journal.ub.tu-berlin.de ...
Christoph Blume, H.J. Sander Bruggink, Martin Friedrich, and Barbara König. Treewidth, pathwidth and cospan decompositions. In Proc. of GT-VMT '11 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 41 of Electronic Communications of the EASST, 2011.
Info
See journal.ub.tu-berlin.de ...
H.J. Sander Bruggink, Raphaël Cauderlier, Barbara König, and Mathias Hülsbusch. Conditional reactive systems. In Proc. of FSTTCS '11, volume 13 of LIPIcs. Schloss Dagstuhl – Leibniz Center for Informatics, 2011.
Info
See drops.dagstuhl.de ...
Marvin Heumüller, Salil Joshi, Barbara König, and Jan Stückrath. Construction of pushout complements in the category of hypergraphs. In Selected Revised Papers from the Third International Workshop on Graph Computation Models (GCM 2010), volume 39 of Electronic Communications of the EASST, 2011.
PDF (280 kB)
Info
See journal.ub.tu-berlin.de ...

2010

Harsh Beohar and Pieter Cuijpers. A theory of desynchronisable closed loop systems. In Proceedings of 3rd Interaction and Concurrency Experience (ICE'10), volume 38 of EPTCS, pages 99–114, 2010.
Info
Harsh Beohar, Damian Nadales, Bert van Beek, and Pieter Cuijpers. Hierarchical states in the compositional interchange format. In Luca Aceto and Pawel Sobocinski, editors, Proceedings of the 7th Workshop on Structural Operational Semantics, volume 32 of EPTCS, pages 42–56, 2010.
Info
See arxiv.org ...
Christoph Blume, H.J. Sander Bruggink, and Barbara König. Recognizable graph languages for checking invariants. In Proc. of GT-VMT '10 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 29 of Electronic Communications of the EASST, 2010.
PDF (275 kB)
Info
Christoph Blume. Recognizable graph languages for the verification of dynamic systems. In Proc. of ICGT '10 (International Conference on Graph Transformation), Proc. of the Doctoral Symposium. Springer, 2010.
PDF (80 kB)
Info
Christoph Blume. Efficient implementation of automaton functors for the verification of graph transformation systems. In Proc. of ICGT '10 (International Conference on Graph Transformation), Proc. of the Doctoral Symposium. Electronic Communications of the EASST, 2010.
PDF (275 kB)
Info
H.J. Sander Bruggink and Barbara König. A logic on subobjects and recognizability. In Proceedings of IFIP-TCS '10, 2010.
Info
Frank Hermann, Andrea Corradini, Hartmut Ehrig, and Barbara König. Efficient analysis of permutation equivalence of graph derivations based on Petri nets. In Proc. of GT-VMT '10 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 29 of Electronic Communications of the EASST, 2010.
Info
See journal.ub.tu-berlin.de ...
H.J. Sander Bruggink and Barbara König. A logic on subobjects and recognizability. In Proc. of TCS '10, volume 323 of IFIP AICT, pages 197–212. Springer, 2010.
PDF (252 kB)
Info
See link.springer.com ...
Barbara König and Javier Esparza. Verification of graph transformation systems with context-free specifications. In Proc. of ICGT '10 (International Conference on Graph Transformation), pages 107–122. Springer, 2010. LNCS 6372.
PDF (255 kB)
Info
See link.springer.com ...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, and Stefan Schwoon. On the computation of McMillan's complete prefix for contextual nets and graph grammars. In Proc. of ICGT '10 (International Conference on Graph Transformation), pages 91–106. Springer, 2010. LNCS 6372.
PDF (239 kB)
Info
See link.springer.com ...
Frank Hermann, Mathias Hülsbusch, and Barbara König. Specification and verification of model transformations. In Proc. of GraMoT '10 (International Colloquium on Graph and Model Transformation on the Occasion of Hartmut Ehrig's 65th birthday), volume 30 of Electronic Communications of the EASST, 2010.
Info
See journal.ub.tu-berlin.de ...
Mathias Hülsbusch, Barbara König, Arend Rensink, Maria Semenyak, Christian Soltenborn, and Heike Wehrheim. Showing full semantics preservation in model transformation – a comparison of techniques. In Proc. of iFM '10 (Integrated Formal Methods), pages 183–198. Springer, 2010. LNCS 6396.
Info
See link.springer.com ...
Tech report version
Marvin Heumüller, Salil Joshi, Barbara König, and Jan Stückrath. Construction of pushout complements in the category of hypergraphs. In Proc. of GCM '10 (Workshop on Graph Computation Models), 2010.
PDF (597 kB)
Info
See gcm2010.imag.fr ...

2009

Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Paweł Sobociński. Unfolding grammars in adhesive categories. In Proc. of CALCO '09 (Algebra and Coalgebra in Computer Science), pages 350–366. Springer, 2009. LNCS 5728.
PDF (345 kB)
Info

2008

Paolo Baldan, Filippo Bonchi, Tobias Heindel, and Barbara König. Irreducible objects and lattice homomorphisms in adhesive categories. In Jochen Pfalzgraf, editor, Proc. of ACCAT '08 (Workshop on Applied and Computational Category Theory), March 2008.
PDF (112 kB)
Info
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. In Proc. of ICGT '08. Springer, 2008. LNCS.
PDF (245 kB)
Info
Tech report version
Barbara König and Vitali Kozioura. Augur 2—a new version of a tool for the analysis of graph transformation systems. In Proc. of GT-VMT '06 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 211 of ENTCS, pages 201–210. Elsevier, 2008.
PDF (291 kB)
Info
Guilherme Rangel, Barbara König, and Hartmut Ehrig. Deriving bisimulation congruences in the presence of negative application conditions. In Proc. of FOSSACS '08, pages 413–427. Springer, 2008. LNCS 4962.
PDF (304 kB)
Info
Tech report version
Salil Joshi and Barbara König. Applying the graph minor theorem to the verification of graph transformation systems. In Proc. of CAV '08, pages 214–226. Springer, 2008. LNCS 5123.
PDF (346 kB)
Info
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 336–350. Springer, 2008. LNCS 5214.
PDF (246 kB)
Info
Barbara König and Vitali Kozioura. Towards the verification of attributed graph transformation systems. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 305–320. Springer, 2008. LNCS 5214.
PDF (291 kB)
Info
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, and Barbara König. Open Petri nets: Non-deterministic processes and compositionality. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 257–273. Springer, 2008. LNCS 5214.
PDF (430 kB)
Info
Guilherme Rangel, Leen Lambers, Barbara König, Hartmut Ehrig, and Paolo Baldan. Behavior preservation in model refactoring using DPO transformations with borrowed contexts. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 242–256. Springer, 2008. LNCS 5214.
PDF (448 kB)
Info
Paolo Baldan, Thomas Chatain, Stefan Haar, and Barbara König. Unfolding-based diagnosis of systems with an evolving topology. In Proc. of CONCUR '08, pages 203–217. Springer, 2008. LNCS 5201.
Info
Tech report version
Paolo Baldan, Andrea Corradini, and Barbara König. Unfolding graph transformation systems: Theory and applications to verification. In Pierpaolo Degano, Rocco De Nicola, and José Meseguer, editors, Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, pages 16–36. Springer, 2008. LNCS 5065.
PDF (273 kB)
Info
Paolo Baldan and Barbara König. Workshop on Petri Nets and Graph Transformations. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 467–469. Springer, 2008. LNCS 5214.
Info

2007

H.J. Sander Bruggink. Towards a systematic method for proving termination of graph transformation systems. In Proceedings of GT-VC '07, 2007.
PDF (514 kB)
Info
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, and Barbara König. Inequational deduction as term graph rewriting. In Proc. of TERMGRAPH '02 (International Workshop on Term Graph Rewriting), volume 72.1 of ENTCS, pages 31–44. Elsevier, 2007.
GZipped PostScript (128 kB)
PDF (220 kB)
Info
Barbara König. Graph transformation systems, Petri nets and semilinear sets: Checking for the absence of forbidden paths in graphs. In Proc. of PNGT '06 (Workshop on Petri Nets and Graph Transformation), volume 2 of Electronic Communications of the EASST, 2007.
Info
See eceasst.cs.tu-berlin.de ...
Paolo Baldan, Andrea Corradini, Barbara König, and Alberto Lluch Lafuente. A temporal graph logic for verification of graph transformation systems. In Proc. of WADT '06 (Workshop on Algebraic Development Techniques), pages 1–20. Springer, 2007. LNCS 4409.
PDF (270 kB)
Info
Guilherme Rangel, Barbara König, and Hartmut Ehrig. Bisimulation verification for the DPO approach with borrowed contexts. In Proc. of GT-VMT '07 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 6 of Electronic Communications of the EASST, 2007.
Info
See eceasst.cs.tu-berlin.de ...
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel, and Barbara König. Bisimilarity and behaviour-preserving reconfigurations of open Petri nets. In Proc. of CALCO '07 (Algebra and Coalgebra in Computer Science), pages 126–142. Springer, 2007. LNCS 4624.
PDF (480 kB)
Info
Tech report version
Paolo Baldan, Andrea Corradini, Barbara König, and Stefan Schwoon. McMillan's complete prefix for contextual nets. In Proc. of UFO '07 (Workshop on unfolding and partial order techniques), 2007.
PDF (225 kB)
Info
Barbara König. Deriving bisimulation congruences with borrowed contexts (invited talk). In Proc. of CALCO '07 (Algebra and Coalgebra in Computer Science), pages 36–39. Springer, 2007. LNCS 4624.
PDF (97 kB)
Info
Journal version

2006

H.J. Sander Bruggink. A proof of finite family developments for higher-order rewriting using a prefix property. In Proceedings of RTA '06. Springer, 2006.
PDF (192 kB)
Info
Tech report version
Paolo Baldan, Stefan Haar, and Barbara König. Distributed unfolding of Petri nets. In Proc. of FOSSACS '06, pages 126–141. Springer, 2006. LNCS 3921.
PDF (240 kB)
Info
Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Paweł Sobociński. Processes for adhesive rewriting systems. In Proc. of FOSSACS '06, pages 202–216. Springer, 2006. LNCS 3921.
PDF (335 kB)
Info
Barbara König and Vitali Kozioura. Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In Proc. of TACAS '06, pages 197–211. Springer, 2006. LNCS 3920.
PDF (222 kB)
Info
Tech report version
Filippo Bonchi, Barbara König, and Ugo Montanari. Saturated semantics for reactive systems. In Proc. of LICS '06, pages 69–80. IEEE, 2006.
PDF (174 kB)
Info
Paolo Baldan, Hartmut Ehrig, and Barbara König. Composition and decomposition of DPO transformations with borrowed context. In Proc. of ICGT '06 (International Conference on Graph Transformation), pages 153–167. Springer, 2006. LNCS 4178.
PDF (207 kB)
Info
Tech report version
Andrea Corradini, Tobias Heindel, Frank Hermann, and Barbara König. Sesqui-pushout rewriting. In Proc. of ICGT '06 (International Conference on Graph Transformation), pages 30–45. Springer, 2006. LNCS 4178.
PDF (235 kB)
Info
Filippo Bonchi, Fabio Gadducci, and Barbara König. Process bisimulation via a graphical encoding. In Proc. of ICGT '06 (International Conference on Graph Transformation), pages 168–183. Springer, 2006. LNCS 4178.
PDF (248 kB)
Info
Tech report version

2005

Hermann Gruber, Markus Holzer, Astrid Kiehn, and Barbara König. On timed automata with discrete time—structural and language theoretical characterization. In Proc. of DLT '05 (Developments in Language Theory), pages 272–283. Springer, 2005. LNCS 3572.
GZipped PostScript (81 kB)
PDF (144 kB)
Info
Paolo Baldan, Andrea Corradini, Javier Esparza, Tobias Heindel, Barbara König, and Vitali Kozioura. Verifying red-black trees. In Proc. of COSMICAH '05, 2005. Proceedings available as report RR-05-04 (Queen Mary, University of London).
GZipped PostScript (101 kB)
PDF (175 kB)
Info

2004

Paolo Baldan, Andrea Corradini, Barbara König, and Bernhard König. Verifying a behavioural logic for graph transformation systems. In Proc. of COMETA '03, volume 104 of ENTCS, pages 5–24. Elsevier, 2004.
GZipped PostScript (183 kB)
PDF (301 kB)
Info
Hartmut Ehrig and Barbara König. Deriving bisimulation congruences in the DPO approach to graph rewriting. In Proc. of FOSSACS '04, pages 151–166. Springer, 2004. LNCS 2987.
GZipped PostScript (130 kB)
PDF (311 kB)
Info
Tech report version
Paolo Baldan, Andrea Corradini, and Barbara König. Verifying finite-state graph grammars: an unfolding-based approach. In Proc. of CONCUR '04, pages 83–98. Springer-Verlag, 2004. LNCS 3170.
GZipped PostScript (139 kB)
PDF (231 kB)
Info
Tech report version
Paolo Baldan, Barbara König, and Ingo Stürmer. Generating test cases for code generators by unfolding graph transformation systems. In Proc. of ICGT '04 (International Conference on Graph Transformation), pages 194–209. Springer-Verlag, 2004. LNCS 3256.
GZipped PostScript (233 kB)
PDF (225 kB)
Info

2003

H.J. Sander Bruggink. Residuals in higher-order rewriting. In Proceedings of RTA '03. Springer, 2003.
GZipped PostScript (83 kB)
PDF (247 kB)
Info
Tech report version
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size. In Proc. of DLT '02 (Developments in Language Theory), pages 258–269. Springer-Verlag, 2003. LNCS 2450.
GZipped PostScript (76 kB)
PDF (141 kB)
Info
Journal version
Paolo Baldan, Andrea Corradini, and Barbara König. Unfolding-based verification for graph transformation systems. In Proc. of UniGra '03: Uniform Approaches to Graphical Specification Techniques (Warsaw), 2003.
GZipped PostScript (72 kB)
PDF (110 kB)
Info
Paolo Baldan, Barbara König, and Bernhard König. A logic for analyzing abstractions of graph transformation systems. In Proc. of SAS '03 (International Static Analysis Symposium), pages 255–272. Springer-Verlag, 2003. LNCS 2694.
GZipped PostScript (157 kB)
PDF (264 kB)
Info
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size, continued. In Proc. of DLT '03 (Developments in Language Theory), pages 349–360. Springer-Verlag, 2003. LNCS 2710.
GZipped PostScript (131 kB)
PDF (150 kB)
Info
Journal version

2002

Paolo Baldan, Andrea Corradini, and Barbara König. Static analysis of distributed systems with mobility specified by graph grammars—a case study. In H. Ehrig, B. Krämer, and A. Ertas, editors, Proc. of IDPT '02 (Sixth International Conference on Integrated Design & Process Technology). Society for Design and Process Science, 2002.
GZipped PostScript (87 kB)
PDF (160 kB)
Info
Paolo Baldan and Barbara König. Approximating the behaviour of graph transformation systems. In Proc. of ICGT '02 (International Conference on Graph Transformation), pages 14–29. Springer-Verlag, 2002. LNCS 2505.
GZipped PostScript (115 kB)
PDF (208 kB)
Info

2001

Paolo Baldan, Andrea Corradini, and Barbara König. A static analysis technique for graph transformation systems. In Proc. of CONCUR '01, pages 381–395. Springer-Verlag, 2001. LNCS 2154.
GZipped PostScript (122 kB)
PDF (203 kB)
Info
Barbara König and Ugo Montanari. Observational equivalence for synchronized graph rewriting with mobility. In Proc. of TACS '01, pages 145–164. Springer-Verlag, 2001. LNCS 2215.
GZipped PostScript (129 kB)
PDF (228 kB)
Info

2000

Barbara König. Hypergraph construction and its application to the compositional modelling of concurrency. In Proc. of GRATRA 2000: Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation Systems, 2000.
GZipped PostScript (46 kB)
PDF (107 kB)
Info
Journal version, Tech report version
Barbara König. Analysing input/output-capabilities of mobile processes with a generic type system. In Proc. of ICALP '00, pages 403–414. Springer-Verlag, 2000. LNCS 1853.
GZipped PostScript (42 kB)
PDF (123 kB)
Info
Journal version, Tech report version
Barbara König. A graph rewriting semantics for the polyadic pi-calculus. In Proc. of GT-VMT '00 (Workshop on Graph Transformation and Visual Modeling Techniques), pages 451–458. Carleton Scientific, 2000.
GZipped PostScript (26 kB)
PDF (80 kB)
Info
Barbara König. A general framework for types in graph rewriting. In Proc. of FST TCS 2000, pages 373–384. Springer-Verlag, 2000. LNCS 1974.
GZipped PostScript (102 kB)
PDF (179 kB)
Info
Tech report version

1999

Barbara König. Generating type systems for process graphs. In Proc. of CONCUR '99, pages 352–367. Springer-Verlag, 1999. LNCS 1664.
GZipped PostScript (193 kB)
PDF (202 kB)
Info
© University of Duisburg-Essen, Theoretical Computer Science group