Peter Höfner

Orcid: 0000-0002-2141-5868

Affiliations:
  • NICTA, Australia


According to our database1, Peter Höfner authored at least 84 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Shoggoth: A Formal Foundation for Strategic Rewriting.
Proc. ACM Program. Lang., January, 2024

Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures.
CoRR, 2024

2023
A Lean-Congruence Format for EP-Bisimilarity.
Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

2022
Advanced Models for the OSPF Routing Protocol.
Proceedings of the Proceedings Fifth Workshop on Models for Formal Analysis of Real Systems, 2022

2021
Algorithmics.
Proceedings of the Advancing Research in Information and Communication Technology, 2021

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Enabling Preserving Bisimulation Equivalence.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Effect Algebras, Girard Quantales and Complementation in Separation Logic.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2021

2020
Relational characterisations of paths.
J. Log. Algebraic Methods Program., 2020

Formal Models of the OSPF Routing Protocol.
Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems, 2020

Formalising the Optimised Link State Routing Protocol.
Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems, 2020

Relational Characterisations of Paths.
Arch. Formal Proofs, 2020

Preface.
Acta Informatica, 2020

2019
Relational and algebraic methods in computer science.
J. Log. Algebraic Methods Program., 2019

Progress, Justness, and Fairness.
ACM Comput. Surv., 2019

A Process Algebra for Link Layer Protocols.
Proceedings of the Programming Languages and Systems, 2019

2018
Backwards and Forwards with Separation Logic.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

Analysing AWN-Specifications Using mCRL2 (Extended Abstract).
Proceedings of the Integrated Formal Methods - 14th International Conference, 2018

False Failure: Creating Failure Models for Separation Logic.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2018

2017
Analysing Mutual Exclusion using Process Algebra with Signals.
Proceedings of the Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics, 2017

Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack.
Proceedings of the Proceedings 2nd Workshop on Models for Formal Analysis of Real Systems, 2017

2016
Extended Feature Algebra.
J. Log. Algebraic Methods Program., 2016

Relational and algebraic methods in computer science.
J. Log. Algebraic Methods Program., 2016

Cardinality of relations and relational approximation algorithms.
J. Log. Algebraic Methods Program., 2016

Mechanizing a Process Algebra for Network Protocols.
J. Autom. Reason., 2016

Cardinality of relations with applications.
Discret. Math., 2016

Modelling and verifying the AODV routing protocol.
Distributed Comput., 2016

A Timed Process Algebra for Wireless Networks.
CoRR, 2016

Kleene Algebras with Domain.
Arch. Formal Proofs, 2016

A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract).
Proceedings of the Programming Languages and Systems, 2016

2015
Relational and algebraic methods in computer science.
J. Log. Algebraic Methods Program., 2015

Progress, Fairness and Justness in Process Algebra.
CoRR, 2015

Modelling and Analysis of AODV in UPPAAL.
CoRR, 2015

CCS: It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions.
Acta Informatica, 2015

Formal Analysis of Proactive, Distributed Routing.
Proceedings of the Software Engineering and Formal Methods - 13th International Conference, 2015

Structured Document Algebra in Action.
Proceedings of the Software, 2015

Tool-Based Verification of a Relational Vertex Coloring Program.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2015

2014
Hopscotch - reaching the target hop by hop.
J. Log. Algebraic Methods Program., 2014

Loop freedom of the (untimed) AODV routing protocol.
Arch. Formal Proofs, 2014

Showing Invariance Compositionally for a Process Algebra for Network Protocols.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol.
Proceedings of the Automated Technology for Verification and Analysis, 2014

Automated Verification of Relational While-Programs.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2013
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV.
CoRR, 2013

Topology-Based Mobility Models for Wireless Networks.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Statistical Model Checking of Wireless Mesh Routing Protocols.
Proceedings of the NASA Formal Methods, 2013

Sequence numbers do not guarantee loop freedom: AODV can yield routing loops.
Proceedings of the 16th ACM International Conference on Modeling, 2013

Features, modularity, and variation points.
Proceedings of the 5th International Workshop on Feature-Oriented Software Development, 2013

Quantitative Analysis of AODV and Its Variants on Dynamic Topologies Using Statistical Model Checking.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

2012
Dijkstra, Floyd and Warshall meet Kleene.
Formal Aspects Comput., 2012

Preface.
Formal Aspects Comput., 2012

Automated Analysis of AODV Using UPPAAL.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

A rigorous analysis of AODV and its variants.
Proceedings of the 15th ACM International Conference on Modeling, 2012

Towards a rigorous analysis of AODVv2 (DYMO).
Proceedings of the 20th IEEE International Conference on Network Protocols, 2012

A Process Algebra for Wireless Mesh Networks.
Proceedings of the Programming Languages and Systems, 2012

Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2012

2011
Fixing Zeno gaps.
Theor. Comput. Sci., 2011

An algebra of product families.
Softw. Syst. Model., 2011

Algebraic separation logic.
J. Log. Algebraic Methods Program., 2011

Supplementing Product Families with Behaviour.
Int. J. Softw. Informatics, 2011

Feature interactions, products, and composition.
Proceedings of the Generative Programming And Component Engineering, 2011

Towards an Algebra of Routing Tables.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

Variable Side Conditions and Greatest Relations in Algebraic Separation Logic.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

2010
Algebraic notions of nontermination: Omega and divergence in idempotent semirings.
J. Log. Algebraic Methods Program., 2010

Automated Higher-order Reasoning about Quantales.
Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, 2010

2009
Algebraic calculi for hybrid systems.
PhD thesis, 2009

An algebra of hybrid systems.
J. Log. Algebraic Methods Program., 2009

Automated verification of refinement laws.
Ann. Math. Artif. Intell., 2009

An extension for feature algebra.
Proceedings of the First International Workshop on Feature-Oriented Software Development, 2009

Towards Algebraic Separation Logic.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2009

2008
Algebraic Neighbourhood Logic.
J. Log. Algebraic Methods Program., 2008

Algebraic View Reconciliation.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

On Automating the Calculus of Relations.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Non-termination in Idempotent Semirings.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

Automated Reasoning for Hybrid Systems - Two Case Studies -.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

2007
Can Refinement be Automated?
Proceedings of the BCS-FACS Refinement Workshop, 2007

Algebraic Structure of Web Services.
Proceedings of the 3rd International Workshop on Automated Specification and Verification of Web Systems, 2007

Automated Reasoning in Kleene Algebra.
Proceedings of the Automated Deduction, 2007

2006
Feature Algebra.
Proceedings of the FM 2006: Formal Methods, 2006

Quantales and Temporal Logics.
Proceedings of the Algebraic Methodology and Software Technology, 2006

Omega Algebra, Demonic Refinement Algebra and Commands.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

Lazy Semiring Neighbours and Some Applications.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

2005
Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic.
Proceedings of the Doctoral Symposium affiliated with the Fifth Integrated Formal Methods Conference, 2005

Towards Evaluating the Impact of Ontologies on the Quality of a Digital Library Alerting System.
Proceedings of the Research and Advanced Technology for Digital Libraries, 2005

Towards an Algebra of Hybrid Systems.
Proceedings of the Relational Methods in Computer Science, 2005


  Loading...