Dirk Nowotka, PhD

		Software Reliability and Security Group (SZS)
		Institute for Formal Methods in Computer Science (FMI)
		Universität Stuttgart
		Address	Institut für Formale Methoden der Informatik
			Universität Stuttgart
			Universitätsstr. 38
			D-70569 Stuttgart
			GERMANY
		Room	1.156, Computer Science Building (location)
		Phone	+49 (0)711-7816-480
		Fax	+49 (0)711-7816-462
		Email	dirk DOT nowotka AT informatik DOT uni-stuttgart DOT de

Research statement:
The motto of my research is: Computer science is mathematics at work. Accordingly, the core of my research interests is in the field of theoretical computer science; in particular, Combinatorics on Words (periodicity and borderedness of words, word equations). Moreover, I am interested in contributing foundational insights to two of today's most prominent problem areas in information technology: the problem of efficiently extracting information out of large data sets (mostly in the context of today's web businesses) and the problem of producing reliable software. This leads to contributions in the field of Data Mining (nearest neighbour problems, click volume estimation) and Formal Verification (model checking, automated theorem proving), respectively.

Latest publications:

• Bordered Conjugates of Words over Large Alphabets, E-JC, 15(1):N41, 2008. (with T. Harju)
• Maximal Intersection Queries in Randomized Input Models, ToCS, to appear. (with B. Hoffmann, M. Lifshits, and Y. Lifshits)
• On the Relation between Periodicity and Unbordered Factors of Finite Words, DLT 2008, LNCS 5257, 2008. (with Š. Holub)

• Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture, JACM, 54(4):20, 2007. (with T. Harju)
• Border Correlation of Binary Words, JCT-A, 108(2):331-341, 2004. (with T. Harju)
• Weinbaum Factorizations of Primitive Words, Izv. VUZ. Mat., to appear. (with T. Harju and V. Diekert)
• On the Independence of Equations in Three Variables, TCS, 307(1):139-172, 2003. (with T. Harju)
• Maximal Intersection Queries in Randomized Input Models, ToCS, to appear. (with B. Hoffmann, M. Lifshits, and Y. Lifshits)
• sequences A091838 and A099766 in the On-Line Encyclopedia of Integer Sequences

Conferences:

• PC member CIAA 2009, Sydney, Australia
  (International Conference on Implementation and Application of Automata)
• OC member and workshops organizer DLT 2009, Stuttgart, Germany
  (International Conference on Developments in Language Theory)

Projects:

• How to gain more trust in model based software development?
  an industrial project together with Daimler from June through October 2008
• PPP Finland funded by the DAAD (German Academic Exchange Service)
  exchange programme Stuttgart-Turku from June 2008 - May 2010
  (project leader)
• TEGnology Bulletin together with the Fraunhofer TEG (a division of the Fraunhofer Gesellschaft)
  a project for a service for the early detection of emerging technologies relevant for companies
  (representing the Universität Stuttgart)

Academic CV.

Teaching:

• Networks and Processes (Winter 2008/2009)
• Einführung in die Softwaretechnik II (Summer 2008)
• Networks and Processes (Winter 2007/2008)
• Einführung in die Softwaretechnik II (Summer 2007)
• Modellierung und Analyse von Echtzeitsystemen (Winter 2006/2007)
• Hauptseminar: Inside Google (Winter 2006/2007)
• Automatische Analyse und Verifikation von Programmen (Summer 2006)
• Hauptseminar: Spiele in der Informatik (Summer 2006)
• Modellierung und Analyse von Echtzeitsystemen (Winter 2005/2006)
• Theoretische Informatik III (Summer 2005)
• Logik (Winter 2004/2005)

Some source code and documentation from projects in Automated Theorem Proving that I used to work on.

• Holly a proof system for object code verification
• Computer Arithmetic Toolkit (CAT) for the Isabelle/HOL system
• Abstract Theory package for the HOL98 system
• MinLem for reasoning in partial-order structures