Formale Sprachen

Dr. Karl-Heinz Pennemann

Anschrift: Dr. Karl-Heinz Pennemann
Universität Oldenburg
Fakultät II
Department für Informatik
26111 Oldenburg
Foto
Raum: A2 2-209
Telefon: (04 41) 798-2978
Fax: (04 41) 798-2965
Sprechstunde: nach Vereinbarung
E-Mail: K.H.Pennemann

 


zum Seitenanfang

Curriculum Vitae

09/2009 Disputation der Dissertation "Development of Correct Graph Transformation Systems" (summa cum laude)
07/2009 - 12/2005 Doktorand und Stipendiat im DFG-Graduiertenkolleg "TrustSoft" (Trustworthy Software Systems)
08/2005 - 10/2004 Wissenschaftlicher Mitarbeiter mit Lehrauftrag; Arbeitsgruppe Formale Sprachen, Universität Oldenburg
09/2004 Universitätsabschluss Diplom Informatiker (Dipl.-Inform.), mit Auszeichnung
09/2004 - 10/1997 Studium der Informatik, Department für Informatik, Carl von Ossietzky Universität Oldenburg
06/1997 Abitur, Fachgymnasium Wirtschaft, Papenburg
10/1977 Geboren in Papenburg, Deutschland


zum Seitenanfang

Forschung

In meiner Dissertation untersuche ich Methoden zur Verifikation von graph-basierten Programmspezifikationen.

Überblick

Meine Forschungsinteressen beinhalten Automatisches Schließen (Theorembeweisen); Semantiken, Spezifikation und Verifikation von Programmen; Reaktive Systeme; Systematische Entwicklung und automatisierte Synthese korrekter Programme; und automatische und maschinen-gestützte Verifikationswerkzeuge.


zum Seitenanfang

Projekte


zum Seitenanfang

Forschungsbesuche

  • Mai 2006: Besuch der Arbeitsgruppe Formale Methoden und Werkzeuge, Universität Twente, Niederlande auf Einladung von Prof. Dr. Arend Rensink.

zum Seitenanfang

Vorträge

  • Januar 2007: Vortrag auf dem Graphtransformationstag der Universität Bremen. Gastgeber Prof. Dr. Hans Jörg Kreowski. Titel "Weakest Preconditions for High-Level Programs".
  • November 2006: Vortrag auf dem International Research Training Groups Workshop 2006, Schloss Dagstuhl, Wadern. Gastgeber Prof. Dr. Willi Hasselbring. Titel "Development of Correct Graph Transformation Systems".
  • Mai 2006: Vortrag im Seminar der Arbeitsgruppe Formale Methoden und Werkzeuge, Universität Twente, Niederlande. Gastgeber Prof. Dr. Arend Rensink. Titel "Weakest Preconditions for High-Level Programs".
  • Präsentationen auf internationalen Konferenzen und Workshops, u.a. in Natal, Brasilien (2006); Lissabon, Portugal (2007) und Leicester, GB (2008).

zum Seitenanfang

Publikationen

[Pen09]
Karl-Heinz Pennemann. Development of Correct Graph Transformation Systems. PhD thesis, Department für Informatik, Universität Oldenburg, Oldenburg, 2009. Electronic Dissertation.
[ bib | .pdf ]

[HP09]
Annegret Habel and Karl-Heinz Pennemann. Correctness of high-level transformation systems relative to nested conditions. Mathematical Structures in Computer Science, 19:1-52, 2009. MSCS-Link.
[ bib | .pdf ]

[Pen08c]
Karl-Heinz Pennemann. Resolution-like theorem proving for high-level conditions. In Graph Transformations (ICGT'08), volume 5214 of Lecture Notes in Computer Science, pages 289-304. Springer-Verlag, 2008. SpringerLink.
[ bib | .pdf ]

[Pen08b]
Karl-Heinz Pennemann. Development of correct graph transformation systems - Preliminary abstract. In Graph Transformations (ICGT'08 Doctoral Symposium), volume 5214 of Lecture Notes in Computer Science, pages 508-510. Springer-Verlag, 2008. SpringerLink.
[ bib | .pdf ]

[AP08]
Karl Azab and Karl-Heinz Pennemann. Type checking C++ template instantiation by graph programs. In Proc. Int. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'08), volume 10, pages 249-262. Electronic Communications of the EASST, 2008. ECEASST-Link.
[ bib | .pdf ]

[AP07]
Karl Azab and Karl-Heinz Pennemann. Type checking C++ template instantiation by graph programs. Berichte aus dem Department für Informatik 04/07, 24 pages, Universität Oldenburg, 2007.
[ bib | .pdf ]

[Pen08a]
Karl-Heinz Pennemann. An algorithm for approximating the satisfiability problem of high-level conditions. In Proc. Graph Transformation for Verification and Concurrency (GT-VC'07), volume 213 of Electronic Notes in Theoretical Computer Science, pages 75-94. Elsevier, 2008.
[ bib | .pdf ]

[AHPZ07]
Karl Azab, Annegret Habel, Karl-Heinz Pennemann, and Christian Zuckschwerdt. ENFORCe: A system for ensuring formal correctness of high-level programs. In Proc. 3rd International Workshop on Graph Based Tools (GraBaTs'06), volume 1, pages 82-93. Electronic Communications of the EASST, 2007. ECEASST-Link.
[ bib | .pdf ]

[HPR06b]
Annegret Habel, Karl-Heinz Pennemann, and Arend Rensink. Weakest preconditions for high-level programs (long version). Berichte aus dem Department für Informatik 8/06, 35 pages, Universität Oldenburg, 2006.
[ bib | .pdf ]

[HPR06a]
Annegret Habel, Karl-Heinz Pennemann, and Arend Rensink. Weakest preconditions for high-level programs. In Graph Transformations (ICGT'06), volume 4178 of Lecture Notes in Computer Science, pages 445-460. Springer-Verlag, 2006. SpringerLink.
[ bib | .pdf ]

[HP06]
Annegret Habel and Karl-Heinz Pennemann. Satisfiability of high-level conditions. In Graph Transformations (ICGT'06), volume 4178 of Lecture Notes in Computer Science, pages 430-444. Springer-Verlag, 2006. SpringerLink.
[ bib | .pdf ]

[EEHP06]
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, and Karl-Heinz Pennemann. Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae, 74(1):135-166, 2006.
[ bib | .ps.gz ]

[HP05]
Annegret Habel and Karl-Heinz Pennemann. Nested constraints and application conditions for high-level structures. In Hans-Jörg Kreowski, Ugo Montanari, Fernando Orejas, Grzegorz Rozenberg, and Gabriele Taentzer, editors, Formal Methods in Software and System Modeling, volume 3393 of Lecture Notes in Computer Science, pages 294-308. Springer-Verlag, 2005. SpringerLink.
[ bib | .ps.gz ]

[EEHP04]
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, and Karl-Heinz Pennemann. Constraints and application conditions: From graphs to high-level structures. In Graph Transformation (ICGT'04), volume 3256 of Lecture Notes in Computer Science, pages 287-303. Springer-Verlag, 2004. SpringerLink.
[ bib | .ps.gz ]

[Pen04]
Karl-Heinz Pennemann. Generalized constraints and application conditions for graph transformation systems. Master's thesis, Dept. of Computing Science, University of Oldenburg, Oldenburg, 2004.
[ bib | .pdf ]

[EMQP04]
Marco Eissen, Radoslaw Mazur, Heinz-Georg Quebbemann, and Karl-Heinz Pennemann. Atom economy and yield of synthesis sequences. Helvetica Chimica Acta, 87:524-535, 2004.
[ bib | http ]


zum Seitenanfang

Abschlussarbeiten

[Pen09]
Karl-Heinz Pennemann. Development of Correct Graph Transformation Systems. PhD thesis, Department of Computing Science, University of Oldenburg, Oldenburg, 2009. Electronic Dissertation.
[ bib | .pdf ]

[Pen04]
Karl-Heinz Pennemann. Generalized constraints and application conditions for graph transformation systems. Master's thesis, Dept. of Computing Science, University of Oldenburg, Oldenburg, 2004.
[ bib ]