Peter Höfner is an Associate Professor at the Australian National University (ANU), Canberra, Australia. Before joining ANU, he was principal research scientist at Data61, CSIRO, Australia's leading data innovation group, and also conjoint Associate Professor at the University of New South Wales (UNSW) Australia.
His research focuses on applications of formal methods in computer science, including protocol verification, software engineering and hybrid system analysis. Currently the main focus of his research lies on algebraic calculi for these topics.
Peter (co-)authored over 60 refereed papers in international journals and conferences. He is chairman of the IFIP Working Group 2.1 (Algorithmic Languages and Calculi) and elected member of the IFIP Working Group 2.3 (Programming Methodolgy). He serves at the editorial board of the Journal of Logic and Algebraic Methods in Computer Science (JLAMP). For his PhD thesis, titled Algebraic Calculi for Hybrid Systems, he received an award for young researchers of the Universität Bayern e.V.
Currently I am not teaching any class. For previous classes taught, see here.
I am program convenor for Bachelor of Advanced Computing (Research and Development) (Honours).
My research focuses on applications of formal methods in comouter science, including protocol verification, software engineering and hybrid system analysis. Particular focus is given to large-scale case studies; by performing and analysing these case studies, I push formal methods to their current limits and, by doing so, reveal shortcomings and limitations in state-off-the-art technology. The limitations often lead to new scientific research in the foundations of formal methods. A specific focus of my research lies in the theory of concurrent computation, which often builds on algebraic calculi.
- Formal Models and Calculi for Software Systems
- specification and verification of protocols (routing and communication)
- program verification (in particular concurrent systems)
- trustworthy systems
- trustworthy systems
- Mathematical Structures in Computing
- process algebras
- program algebras
- proof automation and mechanisation (applying off-the-shelf theorem provers
- 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, Open Publishing Association, 2020. (to appear)
- R. Barry, R.J. van Glabbeek, P. Höfner: Formalising the Optimised Link State Routing Protocol. In A. Fehnker, H. Garaval (eds.), Models for Formal Analysis of Real Systems (MARS 2020). Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2020. (to appear)
- R.J. van Glabbeek, P. Höfner: Progress, Justness and Fairness. In ACM Computing Surveys 52(4):69:1-69:38, ACM, 2019.
arXiv: CoRR abs/1810.07414
- R.J. van Glabbeek, P. Höfner, M. Markl: A Process Algebra for Link Layer Protocols. In L. Caires (ed.), Programming Languages and Systems (ESOP'19). Lecture Notes in Computer Science 11423, pp. 668-693, Springer, 2019.
arXiv: CoRR abs/1907.13329
- C. Bannister, P. Höfner: False Failure: Creating Failure Models for Separation Logic. In J. Desharnais, W. Guttmann, S. Joosten (eds.), Relational and Algebraic Methods in Computer Science (RAMiCS '18). Lecture Notes in Computer Science 11194, pp. 263-279, Springer, 2018.