Augur

2008

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
Paolo Baldan, Andrea Corradini, and Barbara König. A framework for the verification of infinite-state graph transformation systems. Information and Computation, 206:869–907, 2008.
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

2007

Barbara König and Vitali Kozioura. Incremental construction of coverability graphs. Information Processing Letters, 103(5):203–209, 2007.
Info

2006

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
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.
PDF (282 kB)
Info
Conference version

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.
GZipped PostScript (172 kB)
PDF (256 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

Barbara König. Analysis and verification of systems with dynamically evolving structures. Habilitation thesis, Universität Stuttgart, December 2004.
GZipped PostScript (998 kB)
PDF (1 MB)
Info
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
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.
GZipped PostScript (324 kB)
PDF (532 kB)
Info
See inf4.informatik.uni-stuttgart.de ...

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.
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

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
© University of Duisburg-Essen, Theoretical Computer Science group