About

Hans-Dieter A. Hiep is a Ph.D. student at Leiden University, Leiden Institute of Advanced Computer Science (LIACS), and Centrum Wiskunde & Informatica (CWI), Computer Security group, specializing in Formal Methods. In 2018, he finished a Master program in Computer Science joint-degree at the Vrije Universiteit and Universiteit van Amsterdam (VU/UvA), cum laude, specializing in Foundations of Computing and Concurrency (FCC). In 2016, he finished a Bachelor program in Computer Science, cum laude, also at the Vrije Universiteit.

His main interests are: formal methods, higher-order logic and type theory, program correctness, interactive and automated theorem proving, mathematical logic, and distributed and concurrent algorithms. Other interests are: formal languages and automata, programming languages, Java and Java virtual machines, cluster and grid computing, operating systems, interactive systems, computer networking, and Web technologies.

Image by Omnidata.

Curriculum Vitae

Hans-Dieter Anton Hiep
(Born: 21 March 1991, Hoorn, North-Holland, the Netherlands)

Teaching activities

  • (Lecturer) Concepts of Programming Languages, Leiden University, 2021, 2022 (see on-line lectures)
  • (Lecturer) Program Correctness, Leiden University, 2020, 2021, 2022, 2023 (see on-line lectures)
  • (Student project supervision) Interactive Theorem Prover Project 2, LUdev, Leiden University, 2022
  • (Student project supervision) Interactive Theorem Prover Project, LUdev, Leiden University, 2021
  • (Student project supervision) Distributed Algorithms Visualization Tool, Individual Systems Project, Vrije Universiteit Amsterdam, 2020
  • (Teaching assistant) Program Correctness, Leiden University, 2019
  • (Student assistant) Concurrency & multithreading, Vrije Universiteit Amsterdam, 2017, 2018
  • (Student assistant) Equational programming, Vrije Universiteit Amsterdam, 2017
  • (Student assistant) Logic & sets, Vrije Universiteit Amsterdam, 2013
  • (Student assistant) Logic & modelling, Vrije Universiteit Amsterdam, 2013

Thesis supervision

Master students

  • (Collaborator) Olaf Maathuis, Verifying OpenJDK's LinkedList using KeY, Open Universiteit (OU), Heerlen, 2020

Bachelor students

  • (Daily supervisor) Daniel Roos, Visualisation of Distributed Algorithms Executions: Improving the DaViz Tool, Vrije Universiteit (VU), Amsterdam, 2022

Internships

  • (Daily supervisor) Lazlo de Wijs, Betrokkenheid in een flipped classroom: het vergroten van betrokkenheid bij het kijken van asynchrone online hoorcolleges, Hogeschool van Amsterdam (HvA), Amsterdam, 2022

See list of student works.

Research projects

  • (Principal Investigator) Verified Reowolf, funded by NGI ASSURE
  • (Principal Investigator) Reowolf II, funded by NGI POINTER
  • (Principal Investigator) Reowolf, funded by NGI ZERO

Publications

  1. Footprint Logic for Object-Oriented Components, Frank de Boer, Stijn de Gouw, Hans-Dieter Hiep, Jinting Bian (FACS2022) (green open access)
  2. Verifying OpenJDK’s LinkedList using KeY (extended paper), Hans-Dieter Hiep, Olaf Maathuis, Jinting Bian, Frank de Boer, Stijn de Gouw (STTT) (gold open access)
  3. Reowolf: Executable, Compositional, Synchronous Protocol Specifications, Christopher Esterhuyse, Benjamin Lion, Hans-Dieter Hiep, Farhad Arbab (preprint)
  4. Integrating ADTs in KeY and Their Application to History-Based Reasoning, Jinting Bian, Hans-Dieter Hiep, Frank de Boer, Stijn de Gouw (FM2021) (green open access)
  5. Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic, Frank de Boer, Hans-Dieter Hiep (TOPLAS) (gold open access)
  6. A Tutorial on Verifying LinkedList Using KeY, Hans-Dieter Hiep, Jinting Bian, Frank de Boer, Stijn de Gouw (chapter in Deductive Software Verification: Future Perspectives) (green open access)
  7. History-Based Specification and Verification of Java Collections in KeY, Hans-Dieter Hiep, Jinting Bian, Frank de Boer, Stijn de Gouw (iFM2020) (green open access)
  8. Reowolf: Synchronous Multi-party Communication over the Internet, Christopher Esterhuyse; Hans-Dieter Hiep (FACS2019) (green open access)
  9. Verifying OpenJDK’s LinkedList using KeY, Hans-Dieter Hiep, Olaf Maathuis, Jinting Bian, Frank de Boer, Stijn de Gouw (TACAS2020) (gold open access)
  10. Reowolf 1.0: Project Documentation, Christopher Esterhuyse, Hans-Dieter Hiep, Technical Report (open access)
  11. Axiomatic Characterization of Trace Reachability for Concurrent Objects, Frank de Boer, Hans-Dieter Hiep (iFM2019) (green open access)

See also this ORCiD page for a list of publications.

Talks / conferences / workshops

2023

2022

2021

  • Reasoning about call-by-value recursive procedures in Hoare logic, Amsterdam Coordination Group (ACG), Amsterdam
  • Reasoning about ADTs in KeY, The KeYnote Series, virtual
  • History-based Specification and Verification of Java Collections in KeY (extended talk), University of Twente, Formal Methods and Tools Group, virtual

2020

2019

2018

2017

Professional committees / activities

Professional memberships

Employment / professional experience

November 2020 — present
Teaching Ph.D. student, Leiden University (Leiden), Leiden Institute of Advanced Computer Science (LIACS), Theory group

November 2018 — October 2020
Ph.D. student, Centrum Wiskunde & Informatica (Amsterdam), Computer Security group

November 2017 — October 2018
Internship, Centrum Wiskunde & Informatica (Amsterdam), Formal Methods group

2017
Internship, Stichting BEMA, Amsterdam
IT consultant, Custommate B.V., Werkendam

2016—2017
Programmer, Inktweb B.V., Alkmaar

2016
IT consultant, Total Medical Solutions B.V., Dordrecht

2015—2018
IT recruiter, Gong Reflections B.V., Amsterdam
Collaborator, HyperReuts, Amstelveen

2014
Programmer, Social Shop B.V., Amsterdam

2013—2015
Co-founder, AEXIZ, Hilversum

2013
Collaborator, WEEVR, Amsterdam

2012
Programmer, Social Shop B.V., Amsterdam

2010
Programmer, Cillix B.V., Leiden

2009—2010
Co-founder, JPH Media, Hoorn

2008—2009
Programmer, Admicom, Hoorn

Education

November 2018 — present
Doctor of Philosophy (PhD) degree in Computer Science, Leiden University, Factulty of Science, Leiden Institute of Advanced Computer Science (LIACS)
On-going

September 2016 — October 2018
Joint UvA-VU Master of Science (MSc) degree in Computer Science, University of Amsterdam (UvA) and Vrije Universiteit Amsterdam (VU), Faculty of Science, Department of Computer Science
Track: Foundations of Computing and Concurrency
Thesis: A Reo Semantics for Reasoning about Speculative Execution
Thesis supervisors: dr. Jasmin Blanchette, prof.dr. Farhad Arbab
Graduated: cum laude

September 2012 — August 2016
Bachelor of Science (BSc) degree in Computer Science, Vrije Universiteit Amsterdam (VU), Faculty of Science, Department of Computer Science
Minor: Deep Programming
Thesis: Alternative Connectives for Classical Propositional Logic
Thesis supervisors: dr. Femke van Raamsdonk, dr. Clemens Grabmayer
Graduated: cum laude

September 2011 — August 2012
Bachelor Econometrics and Operations Research, University of Amsterdam (UvA), Faculty of Economics and Business, Amsterdam School of Economics
Not graduated

September 2010 — August 2011
Double bachelor Computer Science & Mathematics, Leiden University, Factulty of Science, Leiden Institute for Advanced Computer Science (LIACS)
Not graduated

2003—2010
Voorbereidend wetenschappelijk onderwijs, Rooms-Katholieke Scholengemeenschap Tabor, Werenfridus, Hoorn

Extracurricular

2018—2022 Secretary of the Board, VU-koor, Amsterdam
2017 Advice committee, VU-koor, Amsterdam