2006 |
|
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. |
|
|
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. |
|
|
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. |
|
|
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), 2006. ENTCS. to appear. |
|
|
Paolo Baldan, Stefan Haar, and Barbara König. Distributed unfolding of Petri nets. Technical Report CS-2006-1, Dipartimento di Informatica, Università Ca' Foscari di Venezia, 2006. |
|
|
Barbara König and Vitali Kozioura. Counterexample-guided abstraction refinement for the analysis of graph transformation systems. Technical Report 01/2006, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, 2006. |
|
2005 |
|
Barbara König and Vitali Kozioura. Augur—a tool for the analysis of graph transformation systems. EATCS Bulletin, 87:125–137, November 2005. Appeared in The Formal Specification Column. |
|
|
Barbara König. Analysing input/output-capabilities of mobile processes with a generic type system. Journal of Logic and Algebraic Programming, 63(1):35–58, 2005. |
|
|
Barbara König, Ugo Montanari, and Philippa Gardner, editors. Abstracts Collection – Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, Dagstuhl Seminar Proceedings 04241, 2005. |
|
|
Paolo Baldan, Barbara König, and Arend Rensink. Graph grammar verification through abstraction. In Abstracts Collection – Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, Dagstuhl Seminar Proceedings 04241, 2005. |
|
|
Barbara König. A general framework for types in graph rewriting. Acta Informatica, 42(4-5):349–388, 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. |
|
|
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). |
|
|
Reiko Heckel, Barbara König, and Arend Rensink, editors. Proc. of GT-VC '05 (Graph Transformation for Verification and Concurrency), number 05–34 in CTIT Technical Reports. Centre for Telematics and Information Technology, University of Twente, 2005. |
|
2004 |
|
Barbara König. Analysis and verification of systems with dynamically evolving structures. Habilitation thesis, Universität Stuttgart, December 2004. |
|
|
Markus Holzer and Barbara König. Regular languages, sizes of syntactic monoids, graph colouring, state complexity results, and how these topics are related to each other. EATCS Bulletin, 83:139–155, June 2004. Appeared in The Formal Language Theory Column. |
|
|
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. |
|
|
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. |
|
|
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size. Theoretical Computer Science, 327:319–347, 2004. |
|
|
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. |
|
|
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. |
|
|
Fernando Luís Dotti, Barbara König, Osmar Marchi dos Santos, and Leila Ribeiro. A case study: Verifying a mutual exclusion protocol with process creation using graph transformation systems. Technical Report 08/2004, Universität Stuttgart, 2004. |
|
|
Herrman Gruber, Markus Holzer, Astrid Kiehn, and Barbara König. On timed automata with discrete time—structural and language theoretical characterization. In 14. Theorietag der GI-Fachgruppe 0.1.5 ``Automaten und Formale Sprachen''. Universität Potsdam, 2004. |
|
2003 |
|
Wilfried Brauer, Markus Holzer, Barbara König, and Stefan Schwoon. The theory of finite-state adventures. EATCS Bulletin, 79:230–237, February 2003. |
|
|
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. |
|
|
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. |
|
|
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. |
|
bibdb) |
© University of Stuttgart |
legal notice