Homepage of Peter Höfner

Peter Höfner is an Associate Professor at the Research School of Computer Science at the Australian National University, Canberra, Australia and a conjoint researcher at Data 61, CSIRO. Additionally, he holds a position as Conjoint Associate Professor at the School of Computer Science and Engineering at The University of New South, Sydney, Australia.
This web page contains information regarding his research interests, teaching and publications.";

Research Interests


For previous classes taught, see here.


Peter Hoefner 2011
since 2020: Associate Professor, Australian National University, Australia
2020–2021: Visiting Scientist, Data61, CSIRO (erstwhile NICTA), Australia
2018–2020: Conjoint Associate Professor, University of New South Wales, Australia
2010–2020: (Senior/Principal) Research Scientist, Data61, CSIRO (erstwhile NICTA), Australia
2011–2017: Conjoint (Senior) Lecturer, University of New South Wales, Australia
2009–2010: Postdoc in Computer Science, University of Augsburg, Germany
2004–2009: PhD in Computer Science, University of Augsburg, Germany


Recent Publications

  1. C. Bannister, P. Höfner, G. Struth: Effect Algebras, Girard Quantales and Complementation in Separation Logic. In U. Fahrenberg, M. Gehrke, L. Santocanale, M. Winter (eds.), elational and Algebraic Methods in Computer Science (RAMiCS 2021). Lecture Notes in Computer Science 13027, pp. 37-53, Springer, 2021.
    doi: 10.1007/978-3-030-88701-8_3
    abstract | pdf | bibtex
  2. R.J. van Glabbeek, P. Höfner, W. Wang: Enabling Preserving Bisimulation Equivalence. In Concurrency Theory (CONCUR 2021). LIPIcs 203, pp. 33:1-33:20, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2021.
    arXiv: CoRR abs/2108.00142 | doi: 10.4230/LIPIcs.CONCUR.2021.33
    abstract | pdf | bibtex
  3. R.J. van Glabbeek, P. Höfner, R. Horne: Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom. In Logic in Computer Science (LICS 2021). pp. 1-13, IEEE, 2021.
    arXiv: CoRR abs/2104.14226 | doi: 10.1109/LICS52264.2021.9470531
    abstract | pdf | bibtex
  4. R. Berghammer, H. Hitoshi, W. Guttmann, P. Höfner: Relational Characterisations of Paths. In Journal of Logic and Algebraic Methods in Programming 117, Elsevier, 2020.
    arXiv: CoRR abs/1801.04026 | doi: 10.1016/j.jlamp.2020.100590
    abstract | pdf | bibtex
  5. J. Drury, P. Höfner, W. Wang: Formal Models of the OSPF Routing Protocol. In A. Fehnker, H. Garaval (eds.), Models for Formal Analysis of Real Systems (MARS 2020). Electronic Proceedings in Theoretical Computer Science 316, pp. 72-120, Open Publishing Association, 2020.
    doi: 10.4204/EPTCS.316.4
    abstract | pdf | bibtex
Last update: Jan. 05, 2022