Publications

Below is a complete listing of all publications of Peter Höfner.

Important Copyright Notice: This material is presented to ensure timely distribution of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders, such as publishers (Springer, Elsevier...). All persons copying this information are expected to adhere to the terms and constraints invoked by each copyright holder. In most cases, these works may not be reposted without explicit permission of the copyright holder.


Books

  1. P. Höfner: Algebraic Calculi for Hybrid Systems. Books on Demand, 2009. (Phd Thesis) isbn: 9783839125106
    details | bibtex
Go Up

Book Chapter

  1. P. Höfner: Using Process Algebra to Design Better Protocols. In The Role and Importance of Mathematics in Innovation, Mathematics for Industry 25:87-101, Springer, 2016.
    doi: 10.1007/978-981-10-0962-4_8
    abstract | pdf | bibtex
Go Up

Articles in Journals

  1. 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
  2. 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 | doi: 10.1145/3329125
    abstract | pdf | bibtex
  3. R. Berghammer, N. Danilenko, P. Höfner, I. Stucke: Cardinality of Relations with Applications. In Discrete Mathematics 339(12):3089-3115, Elsevier, 2016.
    doi: 10.1016/j.disc.2016.06.019
    abstract | pdf | bibtex
  4. T. Bourke, R.J. van Glabbeek, P. Höfner: Mechanizing a Process Algebra for Network Protocols. In Journal of Automated Reasoning 56(3):309-341, Springer, 2016.
    doi: 10.1007/s10817-015-9358-9
    abstract | pdf | bibtex
  5. R.J. van Glabbeek, P. Höfner, M. Portmann, W.L. Tan: Modelling and Verifying the AODV Routing Protocol. In Distributed Computing 29(4):279-315, Springer, 2016.
    arXiv: CoRR abs/1512.08867 | doi: 10.1007/s00446-015-0262-7
    abstract | pdf | bibtex
  6. P. Höfner, B. Möller: Extended Feature Algebra. In Journal of Logic and Algebraic Methods in Programming 85(5):952-971, Part 2, Elsevier, 2016.
    doi: 10.1016/j.jlamp.2015.12.002
    abstract | pdf | bibtex
  7. R. Berghammer, P. Höfner, I. Stucke: Cardinality of Relations and Relational Approximation Algorithms. In Journal of Logic and Algebraic Methods in Programming 85(2):269-286, Elsevier, 2016.
    doi: 10.1016/j.jlamp.2015.12.001
    abstract | pdf | bibtex
  8. R.J. van Glabbeek, P. Höfner: CCS: It's not Fair!—Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions. In Acta Informatica 52(2-3):175-205, Springer, 2015.
    arXiv: CoRR abs/1505.05964 | doi: 10.1007/s00236-015-0221-6
    abstract | pdf | bibtex
  9. D. Batory, P. Höfner, D. Köppl, B. Möller, A. Zelend: Structured Document Algebra in Action. In Software, Services and Systems - Essays Dedicated to Martin Wirsing on the Occasion of His Emeritation 8950:291-311, Springer, 2015.
    doi: 10.1007/978-3-319-15545-6_19
    abstract | pdf | bibtex
  10. P. Höfner, A. McIver: Hopscotch—Reaching the Target Hop by Hop. In Journal of Logic and Algebraic Methods in Programming 83(2):212-224, Elsevier, 2014.
    doi: 10.1016/j.jlap.2014.02.009
    abstract | pdf | bibtex
  11. P. Höfner, B. Möller: Dijkstra, Floyd and Warshall meet Kleene. In Formal Aspects of Computing 24(4-6):459-476, Springer, 2012.
    doi: 10.1007/s00165-012-0245-4
    abstract | pdf | bibtex
  12. P. Höfner, R.J. van Glabbeek, I.J. Hayes: Morgan: a suitable case for treatment (Preface). In Formal Aspects of Computing 24(4-6):417-422, Springer, 2012. (Festschrift in Honour of Carroll Morgan)
    doi: 10.1007/s00165-012-0257-0
    abstract | pdf | bibtex
  13. P. Höfner, B. Möller: Fixing Zeno Gaps. In Theoretical Computer Science 412(28):3303-3322, Elsevier, 2011.
    doi: j.tcs.2011.03.018
    abstract | pdf | bibtex
  14. P. Höfner, R. Khedri, B. Möller: Supplementing Product Families with Behaviour. In International Journal of Software and Informatics 5(1-2):245-266, Part II, Institute of Software, Chinese Academy of Sciences, 2011.
    abstract | pdf | bibtex
  15. H.H. Dang, P. Höfner, B. Möller: Algebraic Separation Logic. In Journal of Logic and Algebraic Programming 80(6):221-247, Elsevier, 2011.
    doi: 10.1016/j.jlap.2011.04.003
    abstract | pdf | bibtex
  16. P. Höfner, R. Khedri, B. Möller: An Algebra of Product Families. In Software & Systems Modeling 10(2):161-182, 2011.
    doi: 10.1007/s10270-009-0127-2
    abstract | pdf | bibtex
  17. P. Höfner, G. Struth: Algebraic Notions of Nontermination: Omega and Divergence in Idempotent Semirings. In Journal of Logic and Algebraic Programming 79(8):794-811, Springer, 2010.
    doi: 10.1016/j.jlap.2010.07.016
    abstract | pdf | bibtex
  18. P. Höfner, G. Struth, G. Sutcliffe: Automated Verification of Refinement Laws. In Annals of Mathematics and Artificial Intelligence 55(1-2):35-62, Springer, 2009.
    doi: 10.1007/s10472-009-9151-8
    abstract | pdf | bibtex
  19. P. Höfner, B. Möller: An Algebra of Hybrid Systems. In Journal of Logic and Algebraic Programming 78(2):74-97, Springer, 2009.
    doi: 10.1016/j.jlap.2008.08.005
    abstract | pdf | bibtex
  20. P. Höfner, B. Möller: Algebraic Neighbourhood Logic. In Journal of Logic and Algebraic Programming 76(1):35-59, Springer, 2008.
    doi: 10.1016/j.jlap.2007.10.004
    abstract | pdf | bibtex
  21. P. Höfner, G. Struth: Can Refinement be Automated?. In Electronic Notes in Theoretical Computer Science 201:197-222, Elsevier, 2008.
    doi: 10.1016/j.entcs.2008.02.021
    abstract | pdf | bibtex
  22. P. Höfner, F. Lautenbacher: Algebraic Structure of Web Services. In Electronic Notes in Theoretical Computer Science 200(3):171-187, Elsevier, 2008.
    doi: 10.1016/j.entcs.2008.04.099
    abstract | pdf | bibtex
  23. P. Höfner: Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic. In Electronic Notes in Theoretical Computer Science 191:49-72, Elsevier, 2007.
    doi: 10.1016/j.entcs.2006.09.040
    abstract | pdf | bibtex
Go Up

Papers in Conference and Workshop Proceedings

  1. 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
  2. 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 316, pp. 40-71, Open Publishing Association, 2020.
    doi: 10.4204/EPTCS.316.3
    abstract | pdf | bibtex
  3. 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 2019). Lecture Notes in Computer Science 11423, pp. 668-693, Springer, 2019.
    arXiv: CoRR abs/1907.13329 | doi: 10.1007/978-3-030-17184-1_24
    abstract | pdf | bibtex
  4. 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 2018). Lecture Notes in Computer Science 11194, pp. 263-279, Springer, 2018.
    doi: 10.1007/978-3-030-02149-8_16
    abstract | pdf | bibtex
  5. R.J. van Glabbeek, P. Höfner, D. van der Wal: Analysing AWN-specifications using mCRL2 (extended abstract). In C.A. Furia, K. Winter (eds.), Integrated Formal Methods (iFM 2018). Lecture Notes in Computer Science 11023, pp. 398-418, Springer, 2018.
    doi: 10.1007/978-3-319-98938-9_23
    abstract | pdf | bibtex
  6. C. Bannister, P. Höfner, G. Klein: Backwards and Forwards with Separation Logic. In J. Avigad, A. Mahboubi (eds.), Interactive Theorem Proving (ITP 2018). Lecture Notes in Computer Science 10895, pp. 68-87, Springer, 2018.
    doi: 10.1007/978-3-319-94821-8_5
    abstract | pdf | bibtex
  7. V. Dyseryn, R.J. van Glabbeek, P. Höfner: Analysing Mutual Exclusion using Process Algebra with Signals. In K. Peters, T. Tini (eds.), Expressiveness in Concurrency and Structural Operational Semantics (EXPRESS/SOS 2017). Electronic Proceedings in Theoretical Computer Science 255, pp. 18-34, Open Publishing Association, 2017.
    doi: 10.4204/EPTCS.255.2
    abstract | pdf | bibtex
  8. R.J. van Glabbeek, P. Höfner: Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack. In Models for Formal Analysis of Real Systems (MARS 2017). Electronic Proceedings in Theoretical Computer Science 244, pp. 14-52, Open Publishing Association, 2017.
    doi: 10.4204/EPTCS.244.2
    abstract | pdf | bibtex
  9. E. Bres, R.J. van Glabbeek, P. Höfner: A Timed Process Algebra for Wireless Networks with an Application in Routing (Extended Abstract). In Programming Languages and Systems (ESOP 2016). Lecture Notes in Computer Science 9632, pp. 95-122, Springer, 2016.
    doi: 10.1007/978-3-662-49498-1_5
    abstract | pdf | bibtex
  10. P. Höfner: Using Process Algebra to Design Better Protocol (extended abstract); invited. In Forum "Math-for-Industry" 2015 - The Role and Importance of Mathematics in Innovation (FMI 2015). MI Lecture Notes 65, Kyushu University, 2015.
    pdf | bibtex
  11. R. Berghammer, P. Höfner, I. Stucke: Tool-Based Verification of a Relational Vertex Coloring Program. In W. Kahl, J.N. Oliveira, M. Winter (eds.), Relational and Algebraic Methods in Computer Science (RAMiCS 2015). Lecture Notes in Computer Science 9348, pp. 275-292, Springer, 2015.
    doi: 10.1007/978-3-319-24704-5_17
    abstract | pdf | bibtex
  12. M. Kamali, P. Höfner, M. Kamali, L. Petre: Formal Analysis of Proactive, Distributed Routing. In R. Calinescu, B. Rumpe (eds.), Software Engineering and Formal Methods (SEFM 2015). Lecture Notes in Computer Science 9276, pp. 175-189, Springer, 2015.
    doi: 10.1007/978-3-319-22969-0_13
    abstract | pdf | bibtex
  13. T. Bourke, R.J. van Glabbeek, P. Höfner: A Mechanized Proof of Loop Freedom of the (Untimed) {AODV} Routing Protocol. In F. Cassez, J.-F. Raskin (eds.), Automated Technology for Verification and Analysis (ATVA 2014). Lecture Notes in Computer Science 8837, pp. 47-63, Springer, 2014.
    arXiv: CoRR abs/1505.05646 | doi: 10.1007/978-3-319-11936-6_5
    abstract | pdf | bibtex
  14. T. Bourke, R.J. van Glabbeek, P. Höfner: Showing Invariance Compositionally for a Process Algebra of Network Protocols. In G. Klein, R. Gamboa (eds.), Interactive Theorem Proving (ITP 2014). Lecture Notes in Computer Science 8558, pp. 144-159, Springer, 2014.
    arXiv: CoRR abs/1407.3519 | doi: 10.1007/978-3-319-08970-6_10
    abstract | pdf | bibtex
  15. R. Berghammer, P. Höfner, I. Stucke: Automated Verification of Relational While-Programs. In P. Höfner, P. Jipsen, W. Kahl, M.E. Müller (eds.), Relational and Algebraic Methods in Computer Science (RAMiCS 2014). Lecture Notes in Computer Science 8428, pp. 173-190, Springer, 2014.
    doi: 10.1007/978-3-319-06251-8_11
    abstract | pdf | bibtex
  16. D. Batory, P. Höfner, B. Möller, A. Zelend: Features, Modularity, and Variation Points. In Workshop on Feature-Oriented Software Development (FOSD 2013). pp. 9-16, ACM, 2013.
    doi: 10.1145/2528265.2528269
    abstract | pdf | bibtex
  17. R.J. van Glabbeek, P. Höfner, M. Portmann, W.L. Tan: Sequence Numbers Do Not Guarantee Loop Freedom —AODV Can Yield Routing Loops—. In Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2013). pp. 91-100, ACM, 2013.
    arXiv: CoRR abs/1512.08891 | doi: 10.1145/2507924.2507943
    abstract | pdf | bibtex
  18. A. Fehnker, P. Höfner, M. Kamali, V. Mehta: Topology-based Mobility Models for Wireless Networks. In L. Alvisi, D. Giannakopoulou (eds.), Quantitative Evaluation of Systems (QEST 2013). Lecture Notes in Computer Science 8054, pp. 368-383, Springer, 2013.
    doi: 10.1007/978-3-642-40196-1_32
    abstract | pdf | bibtex
  19. P. Höfner, M. Kamali: Quantitative Analysis of AODV and its Variants on Dynamic Topologies using Statistical Model Checking. In V. Braberman, L. Fribourg (eds.), Formal Modelling and Analysis of Timed Systems (FORMATS 2013). Lecture Notes in Computer Science 8053, pp. 121-136, Springer, 2013.
    doi: 10.1007/978-3-642-40229-6_9
    abstract | pdf | bibtex
  20. P. Höfner, A. McIver: Statistical Model Checking of Wireless Mesh Routing Protocols. In G. Brat, N. Rungta, A. Venet (eds.), NASA Formal Methods Symposium (NFM 2013). Lecture Notes in Computer Science 7871, pp. 322-336, Springer, 2013.
    doi: 10.1007/978-3-642-38088-4_22
    abstract | pdf | bibtex
  21. S. Edenhofer, P. Höfner: Towards a Rigorous Analysis of AODVv2 (DYMO). In N. Foster, A. Gurney (eds.), Rigorous Protocol Engineering (WRiPE 2012). IEEE, 2012.
    doi: 10.1109/ICNP.2012.6459942
    abstract | pdf | bibtex
  22. P. Höfner, R.J. van Glabbeek, W.L. Tan, M. Portmann, A. McIver, A. Fehnker: A Rigorous Analysis of AODV and its Variants. In Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2012). pp. 203-212, ACM, 2012. (nominated for best paper award)
    arXiv: CoRR abs/1512.08873 | doi: 10.1145/2387238.2387274
    abstract | pdf | bibtex
  23. P. Höfner, B. Möller, A. Zelend: Foundations of Coloring Algebra with Consequences for Feature-oriented Programming. In W. Kahl, T. Griffin (eds.), Relational and Algebraic Methods in Computer Science (RAMiCS 2012). Lecture Notes in Computer Science 7560, pp. 33-49, Springer, 2012.
    doi: 10.1007/978-3-642-33314-9_3
    abstract | pdf | bibtex
  24. A. Fehnker, R.J. van Glabbeek, P. Höfner, A. McIver, M. Portmann, W.L. Tan: A Process Algebra for Wireless Mesh Networks. In H. Seidl (ed.), Programming Languages and Systems (ESOP'12) (ESOP 2012). Lecture Notes in Computer Science 7211, pp. 295-315, Springer, 2012.
    doi: 10.1007/978-3-642-28869-2_15
    abstract | pdf | bibtex
  25. A. Fehnker, R.J. van Glabbeek, P. Höfner, A. McIver, M. Portmann, W.L. Tan: Automated Analysis of AODV using UPPAAL. In C. Flanagan, B. König (eds.), Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2012). Lecture Notes in Computer Science 7214, pp. 173-187, Springer, 2012.
    arXiv: CoRR abs/1512.07352 | doi: 10.1007/978-3-642-28756-5_13
    abstract | pdf | bibtex
  26. D. Batory, P. Höfner, J. Kim: Feature Interactions, Products, and Composition. In Generative Programming and Component Engineering (GPCE 2011). pp. 13-22, ACM, 2011.
    doi: 10.1145/2047862.2047867
    abstract | pdf | bibtex
  27. A. Fehnker, R.J. van Glabbeek, P. Höfner, A. McIver, M. Portmann, W.L. Tan: Modelling and Analysis of AODV in UPPAAL. In Rigorous Protocol Engineering (WRiPE'11) (WRiPE 2011). 2011.
    abstract | pdf | bibtex
  28. P. Höfner, A. McIver: Towards an Algebra of Routing Tables. In H. de Swart (ed.), Relational and Algebraic Methods in Computer Science (RAMiCS 2011). Lecture Notes in Computer Science 6663, pp. 212-229, Springer, 2011.
    doi: 10.1007/978-3-642-21070-9_17
    abstract | pdf | bibtex
  29. H.H. Dang, P. Höfner: Variable Side Conditions and Greatest Relations in Algebraic Separation Logic. In H. de Swart (ed.), Relational and Algebraic Methods in Computer Science (RAMiCS 2011). Lecture Notes in Computer Science 6663, pp. 125-140, Springer, 2011.
    doi: 10.1007/978-3-642-21070-9_11
    abstract | pdf | bibtex
  30. H.H. Dang, P. Höfner: Automated Higher-order Reasoning about Quantales. In B. Konev, R.A. Schmidt, S. Schulz (eds.), Workshop on Practical Aspects of Automated Reasoning (PAAR'10) (PAAR 2010"pages: "40-51). EasyChair Proceedings in Computing 9, EasyChair, 2010.
    abstract | pdf | bibtex
  31. P. Höfner, B. Möller: An Extension of Feature Algebra [Extended Abstract]. In S. Apel, W.R. Cook, K. Czarnecki, C. Kästner, N. Loughran, O. Nierstrasz (eds.), Workshop on Feature-Oriented Software Development (FOSD'09). pp. 75-80, ACM, 2009.
    doi: 10.1145/1629716.1629731
    abstract | pdf | bibtex
  32. H.H. Dang, P. Höfner, B. Möller: Towards Algebraic Separation Logic. In R. Berghammer, A.M Jaoua, B. Möller (eds.), Relations and Kleene Algebra in Computer Science (RelmiCS/AKA'09). Lecture Notes in Computer Science 5827, pp. 59-72, Springer, 2009.
    doi: 10.1007/978-3-642-04639-1_5
    abstract | pdf | bibtex
  33. P. Höfner, R. Khedri, B. Möller: Algebraic View Reconciliation. In A. Cerone, S. Gruner (eds.), Software Engineering and Formal Methods (SEFM'08). pp. 85-94, IEEE, 2008.
    doi: 10.1109/SEFM.2008.36
    abstract | pdf | bibtex
  34. P. Höfner, G. Struth: On Automating the Calculus of Relations. In A. Armando, P. Baumgartner, G. Dowek (eds.), Automated Reasoning. Lecture Notes in Artificial Intelligence 5195, pp. 50-66, Springer, 2008.
    doi: 10.1007/978-3-540-71070-7_5
    abstract | pdf | bibtex
  35. P. Höfner: Automated Reasoning for Hybrid Systems — Two Case Studies —. In R. Berghammer, B. Möller, G. Struth (eds.), Relations and Kleene Algebra in Computer Science (RelMiCS/AKA'08). Lecture Notes in Computer Science 4988, pp. 191-205, Springer, 2008.
    doi: 10.1007/978-3-540-78913-0_15
    abstract | pdf | bibtex
  36. P. Höfner, G. Struth: Non-termination in Idempotent Semirings. In R. Berghammer, B. Möller, G. Struth (eds.), Relations and Kleene Algebra in Computer Science (RelMiCS/AKA'08). Lecture Notes in Computer Science 4988, pp. 206-220, Springer, 2008.
    doi: 10.1007/978-3-540-78913-0_16
    abstract | pdf | bibtex
  37. P. Höfner, G. Struth: Automated Reasoning in Kleene Algebra. In F. Pfenning (ed.), Automated Deduction (CADE21). Lecture Notes in Artificial Intelligence 4603, pp. 279-294, Springer, 2007.
    doi: 10.1007/978-3-540-73595-3_19
    abstract | pdf | bibtex
  38. P. Höfner, B. Möller: Lazy Semiring Neighbours and Some Applications. In R.A. Schmidt (ed.), Relations and Kleene Algebra in Computer Science (RelMiCS/AKA'06). Lecture Notes in Computer Science 4136, pp. 207-221, Springer, 2006.
    doi: 10.1007/11828563_14
    abstract | pdf | bibtex
  39. P. Höfner, B. Möller, K. Solin: Omega Algebra, Demonic Refinement Algebra and Commands. In R.A. Schmidt (ed.), Relations and Kleene Algebra in Computer Science (RelMiCS/AKA'06). Lecture Notes in Computer Science 4136, pp. 222-234, Springer, 2006.
    doi: 10.1007/11828563_15
    abstract | pdf | bibtex
  40. P. Höfner, R. Khedri, B. Möller: Feature Algebra. In J. Misra, T. Nipkow, E. Sekerinski (eds.), Formal Methods (FM'06). Lecture Notes in Computer Science 4085, pp. 300-315, Springer, 2006.
    doi: 10.1007/11813040_21
    abstract | pdf | bibtex
  41. B. Möller, P. Höfner, G. Struth: Quantales and Temporal Logics. In M. Johnson, V. Vene (eds.), Algebraic Methodology and Software Technology (AMAST'06). Lecture Notes in Computer Science 4019, pp. 263-277, Springer, 2006.
    doi: 10.1007/11784180_21
    abstract | pdf | bibtex
  42. P. Höfner, B. Möller: Towards an Algebra of Hybrid Systems. In W. MacCaull, M. Winter, I. Düntsch (eds.), Relational Methods in Computer Science (RelMiCS8/AKA3). Lecture Notes in Computer Science 3929, pp. 121-133, Springer, 2006.
    doi: 10.1007/11734673_10
    abstract | pdf | bibtex
  43. A. Huhn, P. Höfner, W. Kießling: Towards Evaluating the Impact of Ontologies on the Quality of a Digital Library Alerting System. In M. Winter, A. Rauber, S. Christodoulakis, A Min Tjoa (eds.), Research and Advanced Technology for Digital Libraries (ECDL'05). Lecture Notes in Computer Science 3652, pp. 498-499, Springer, 2005.
    doi: 10.1007/11551362_53
    abstract | pdf | bibtex
Go Up

Editorials

  1. Acta Informatica: Festschrift for Rob van Glabbeek. Acta Informatica 57(3-5). Springer, 2020.
  2. Special Issue on Relational and Algebraic Methods in Computer Science. P. Höfner, D. Pous, G. Struth (eds.), Journal of Logical and Algebraic Methods in Programming. Elsevier, 2019.
  3. Relational and Algebraic Methods in Computer Science. P. Höfner, D. Pous, G. Struth (eds.), Lecture Notes in Computer Science 10226. Springer, 2017. doi: 10.1007/978-3-319-57418-9
  4. 2nd Workshop on Models for Formal Analysis of Real Systems. H. Hermanns, P. Höfner (eds.), Electronic Proceedings in Theoretical Computer Science 244. Open Publishing Association, 2017. doi: 10.4204/EPTCS.244
  5. Special Issue on Relational and Algebraic Methods in Computer Science (RAMiCS 2014). P. Höfner, P. Jipsen, W. Kahl, M.E. Müller (eds.), Journal of Logical and Algebraic Methods in Programming 85(2). Elsevier, 2016.
  6. 1st Workshop on Models for Formal Analysis of Real Systems. R.J. van Glabbeek, J.F. Groote, P. Höfner (eds.), Electronic Proceedings in Theoretical Computer Science 196. Open Publishing Association, 2015.
  7. 13th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2012). W. Kahl, T. Griffin, P. Höfner (eds.), Journal of Logical and Algebraic Methods in Programming 84(3). Elsevier, 2015.
  8. Relational and Algebraic Methods in Computer Science. P. Höfner, P. Jipsen, W. Kahl, M.E. Müller (eds.), Lecture Notes in Computer Science 8428. Springer, 2014. doi: 10.1007/978-3-319-06251-8
  9. Festschrift in honour of Carroll Morgan. P. Höfner, R.J. van Glabbeek, I.J. Hayes (eds.), Formal Aspects of Computing 24(4-6). Springer, 201.
  10. ATx'12/WInG'12: Joint Proceedings of the Workshops on Automated Theory eXploration and on Invariant Generation. J. Fleuriot, P. Höfner, A. McIver, A. Smaill (eds.), EasyChair Proceedings: EPiC Series 17, 2012.
  11. Proceedings of Workshop on Automated Theory Engineering (ATE 2011). P. Höfner, A. McIver, G. Struth (eds.), CEUR Proceedings Vol-760. 2011.
Go Up

Archive of Formal Proofs

  1. V.B.F. Gomes, W. Guttmann, P. Höfner, G. Struth, T. Weber: Kleene Algebras with Domain. In Archive of Formal Proofs, 2016. link: www.isa-afp.org/entries/KAD.shtml
    abstract | bibtex
  2. T. Bourke, P. Höfner: Loop Freedom of the (Untimed) AODV Routing Protocol. In Archive of Formal Proofs, 2014. link: www.isa-afp.org/entries/AODV.shtml
    abstract | bibtex
Go Up

Technical Reports (incomplete)

  1. P. Höfner, B. Möller: A New Correctness Proof for Prim's Algorithm. Technical Report 2019-02, Institute of Computer Science, University of Augsburg. 2019. direct link.
    abstract | pdf | bibtex
  2. E. Bres, R.J. van Glabbeek, P. Höfner: A Timed Process Algebra for Wireless Networks with an Application in Routing. Technical Report 9145, NICTA. 2016. url: www.nicta.com.au/pub?doc=9145.
    arXiv: CoRR abs/1606.03663
    abstract | pdf | bibtex
  3. R.J. van Glabbeek, P. Höfner: Progress, Fairness and Justness in Process Algebra. Technical Report 8501, NICTA. 2015. url: www.nicta.com.au/pub?doc=8501.
    arXiv: CoRR abs/1501.03268
    abstract | pdf | bibtex
  4. D. Batory, P. Höfner, B. Möller, A. Zelend: Features, Modularity, and Variation Points. Technical Report TR-2147, University of Texas at Austin. 2013. direct link.
    abstract | pdf | bibtex
  5. A. Fehnker, R.J. van Glabbeek, P. Höfner, M. Portmann, A. McIver, W.L. Tan: A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV. Technical Report 5513, NICTA. 2013. url: www.nicta.com.au/pub?doc=5513.
    arXiv: CoRR abs/1312.7645
    abstract | pdf | bibtex
  6. P. Höfner, B. Möller, A. Zelend: Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming. Technical Report 2012-06, Institute of Computer Science, University of Augsburg. 2012. direct link.
    abstract | pdf | bibtex
  7. P. Höfner, S. Mentl, B. Möller, W. Scholz: Requirements in Feature Algebra. Technical Report 2010-12, Institute of Computer Science, University of Augsburg. 2010. direct link.
    abstract | bibtex
  8. P. Höfner, R. Khedri, B. Möller: Supplementing Product Families with Behaviour. Technical Report 2010-13, Institute of Computer Science, University of Augsburg. 2010. direct link.
    abstract | pdf | bibtex
  9. P. Höfner, B. Möller: Fixing Zeno Gaps. Technical Report 2010-11, Institute of Computer Science, University of Augsburg. 2010. direct link.
    abstract | pdf | bibtex
  10. P. Höfner, M.E. Müller, S. Zeissler: ATPPortal: A User-friendly Webbased Interface for Automated Theorem Provers and for Automatically Generated Proofs. Technical Report 2010-10, Institute of Computer Science, University of Augsburg. 2010. direct link.
    abstract | pdf | bibtex
  11. P. Höfner, B. Möller: An Extension of Feature Algebra. Technical Report 2010-09, Institute of Computer Science, University of Augsburg. 2010. direct link.
    abstract | pdf | bibtex
  12. H.H. Dang, P. Höfner, B. Möller: Algebraic Separation Logic. Technical Report 2010-06, Institute of Computer Science, University of Augsburg. 2010. direct link.
    abstract | pdf | bibtex
  13. H.H. Dang, P. Höfner: Automated Higher-Order Reasoning in Quantales. Technical Report 2010-03, Institute of Computer Science, University of Augsburg. 2010. direct link.
    abstract | pdf | bibtex
  14. H.H. Dang, P. Höfner, B. Möller: Towards Algebraic Separation Logic. Technical Report 2009-12, Institute of Computer Science, University of Augsburg. 2009. direct link.
    abstract | pdf | bibtex
  15. P. Höfner, G. Struth: On Automating the Calculus of Relations. Technical Report CS-08-05, Department of Computer Science, University of Sheffield. 2008.
    abstract | pdf | bibtex
  16. P. Höfner, R. Khedri, B. Möller: Algebraic View Reconciliation. Technical Report 2007-13, Institute of Computer Science, University of Augsburg. 2007. direct link.
    abstract | bibtex
  17. P. Höfner, F. Lautenbacher: Algebraic Structure of Web Services. Technical Report 2007-12, Institute of Computer Science, University of Augsburg. 2007. direct link.
    abstract | pdf | bibtex
  18. P. Höfner, B. Möller: An Algebra of Hybrid Systems. Technical Report 2007-08, Institute of Computer Science, University of Augsburg. 2007. direct link.
    abstract | pdf | bibtex
  19. P. Höfner, G. Struth: Can Refinement be Automated?. Technical Report CS-07-08, Department of Computer Science, University of Sheffield. 2007. direct link.
    abstract | pdf | bibtex
  20. P. Höfner, G. Struth: Automated Reasoning in Kleene Algebra. Technical Report CS-07-04, Department of Computer Science, University of Sheffield. 2007.
    abstract | pdf | bibtex
  21. P. Höfner, G. Struth: Algebraic Notions of Non-Termination. Technical Report CS-06-12, Department of Computer Science, University of Sheffield. 2006. direct link.
    abstract | pdf | bibtex
  22. P. Höfner, B. Möller, K. Solin: Omega Algebra, Demonic Refinement Algebra and Commands. Technical Report 2006-11, Institute of Computer Science, University of Augsburg. 2006. direct link.
    abstract | pdf | bibtex
  23. P. Höfner, B. Möller: Lazy Semiring Neighbours and some Applications. Technical Report 2006-09, Institute of Computer Science, University of Augsburg. 2006. direct link.
    abstract | pdf | bibtex
  24. B. Möller, P. Höfner, G. Struth: Quantales and Temporal Logics. Technical Report 2006-06, Institute of Computer Science, University of Augsburg. 2006. direct link.
    abstract | pdf | bibtex
  25. P. Höfner, R. Khedri, B. Möller: Feature Algebra. Technical Report 2006-04, Institute of Computer Science, University of Augsburg. 2006. direct link.
    abstract | pdf | bibtex
  26. P. Höfner: Semiring Neighbours. Technical Report 2005-19, Institute of Computer Science, University of Augsburg. 2005. direct link.
    abstract | pdf | bibtex
  27. A. Huhn, P. Höfner, W. Kießling: Towards Evaluating the Impact of Ontologies on the Quality of a Digital Library Alerting System. Technical Report 2005-07, Institute of Computer Science, University of Augsburg. 2005. direct link.
    abstract | pdf | bibtex
  28. P. Höfner: From Sequential Algebra to Kleene Algebra: Interval Modalities and Duration Calculus. Technical Report 2005-05, Institute of Computer Science, University of Augsburg. 2005. direct link.
    abstract | pdf | bibtex
Go Up

Miscellaneous (Abstracts, Theses, Prefaces, ...)

  1. P. Höfner: Kleene Modules for Routing Procedures (Abstract). In Workshop on Lattices and Relations. 2012.
    abstract | pdf | bibtex
  2. P. Höfner: Towards a Representation Theorem for Coloring Algebra (Abstract). In Workshop on Lattices and Relations. 2012.
    abstract | pdf | bibtex
  3. H.H. Dang, P. Höfner: First-Order Theorem Prover Evaluation w.r.t. Relation- and Kleene Algebra. In R. Berghammer, B. Möller, G. Struth (eds.), Relations and Kleene algebra in Computer Science — PhD Programme. Technical Report 2008-04, Institute of Computer Science, University of Augsburg, 48-52, 2008.
    abstract | pdf | bibtex
  4. F. Lautenbacher, P. Höfner: Towards an Algebraic Composition of Semantic Web Services. In R. Berghammer, B. Möller, G. Struth (eds.), Relations and Kleene algebra in Computer Science — PhD Programme. Technical Report 2008-04, Institute of Computer Science, University of Augsburg, 68-72, 2008.
    abstract | pdf | bibtex
  5. P. Höfner: Proof Automation in Kleene Algebra. In W. Dosch, C. Grelck, A. Stümpel (eds.), 14. Kolloquium Programmiersprachen und Grundlagen der Programmierung (KPS'07). Technical Report A-07-07, Schriftenreihe A, Institutes for Computer Science and Mathematics, University of Lübeck, 87-92, 2007.
    abstract | pdf | bibtex
  6. P. Höfner: f-Generated Kleene Algebra. In R.A. Schmidt, G. Struth (eds.), Relations and Kleene algebra in Computer Science — PhD Programme. Technical Report CS-06-09, University of Sheffield, 55-59, 2006.
    abstract | pdf | bibtex
  7. P. Höfner: Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic. In J. Romijn, G. Smith, J. van de Pol (eds.), IFM2005—Doctoral Symposium on Integrated Formal Methods. Computer Science Reports 05-29, TU/e technische universiteit eindhoven, 6-13, 2005.
    abstract | pdf | bibtex
  8. P. Höfner: An Algebraic Semantics for Duration Calculus. In J. Gervain (ed.), Tenth ESSLLI Student Session. 99-110, 2005.
    abstract | pdf | bibtex
  9. P. Höfner: Von sequentieller Algebra zu Kleene-Algebra: Intervalloperatoren and Zeitdauer-Kalkül. Master's Thesis (Diplomarbeit), Universität Augsburg, 2003.
    abstract | pdf | bibtex
Go Up
Last update: Aug. 31, 2020