Publications

2013

• Modal Knowledge and Game Semirings
  B. Möller
  in Computer Journal 56 (1), pp. 53-69, 2013.

2012

• Transitive Separation Logic
  H.-H. Dang, B. Möller
  in T. G. Griffin and W. Kahl (eds.): Relational and Algebraic Methods in Computer Science (RAMiCS 13), LNCS 7560, pp. 1-16, 2012.
• Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming
  P. Höfner, B. Möller, A. Zelend
  in T. G. Griffin and W. Kahl (eds.): Relational and Algebraic Methods in Computer Science (RAMiCS 13), LNCS 7560, pp. 33-49, 2012.
• An Algebra of Layered Complex Preferences
  B. Möller, P. Roocks
  in T. G. Griffin and W. Kahl (eds.): Relational and Algebraic Methods in Computer Science (RAMiCS 13), LNCS 7560, pp. 294-309, 2012.
• Dijkstra, Floyd and Warshall meet Kleene
  P. Höfner, B. Möller
  in Formal Aspects of Computing, Volume 24, Issue 4-6, pp. 459-476, 2012.
• Reverse Exchange for Concurrency and Local Reasoning
  H.-H. Dang, B. Möller
  in J. Gibbons and P. Nogueira (eds.): Mathematics of Program Construction (MPC 2012), LNCS 7342, pp. 177-197, 2012.
• An Algebraic Calculus of Database Preferences
  B. Möller, P. Roocks, M. Endres
  in J. Gibbons and P. Nogueira (eds.): Mathematics of Program Construction (MPC 2012), LNCS 7342, pp. 241-262, 2012.

2011

• On Locality and the Exchange Law for Concurrent Processes
  C.A.R. Hoare, A. Hussain, B. Möller, P. O'Hearn, R.L. Petersen, G. Struth
  in Joost-Pieter Katoen, Barbara König (eds.): CONCUR 2011 - Concurrency Theory, LNCS 6901, 2011.
• Simplifying Pointer Kleene Algebra
  H.-H. Dang, B. Möller
  in 1st Workshop on Automated Theory Engineering (ATE 2011), 2011.
• Building Structured Theories
  B. Möller
  in H. de Swart (eds.): Relational and Algebraic Methods in Computer Science (RAMiCS 12), LNCS 6663, pp. 1-21, 2011.
• Supplementing Product Families with Behaviour
  P. Höfner, R. Khedri, B. Möller
  in International Journal of Software and Informatics, 2011.
• Fixing Zeno Gaps
  P. Höfner, B. Möller
  in Theoretical Computer Science 412, Issue 28, pp. 3303-3322, 2011.
• Concurrent Kleene Algebra and its Foundations
  C.A.R. Hoare, B. Möller, G. Struth, I. Wehrman
  in Journal of Logic and Algebraic Programming 80, pp. 266–296, 2011.
• Algebraic Separation Logic
  H.-H. Dang, P. Höfner, B. Möller
  in Journal of Logic and Algebraic Programming 80, pp. 221-247, 2011.

2010

• Model Refinement Using Bisimulation Quotients
  R. Glück, B. Möller, M. Sintzoff
  in M. Johnson, D. Pavlovic (eds.): Algebraic Methodology and Software Technology (AMAST 2010), LNCS 6486, pp. 76-91, 2010.
• Algebraic Notions of Termination
  J. Desharnais, B. Möller, G. Struth
  in Logical Methods in Computer Science 7(1), pp. 1-29, 2010.
• An algebraic foundation for automatic feature-based program synthesis
  S. Apel, C. Lengauer, B. Möller, C. Kästner
  in Science of Computer Programming 75(11), pp. 1022-1047, 2010.
• Relations and Kleene algebras in computer science
  R. Berghammer, B. Möller, G. Struth
  in Journal of Logic and Algebraic Programming 79(8), pp. 705-706, 2010.
• Normal Design Algebra
  W. Guttmann, B. Möller
  in Journal of Logic and Algebraic Programming 79(2), pp. 144-173, 2010.

2009

• Towards Algebraic Separation Logic
  H.-H. Dang, P. Höfner, B. Möller
  in R. Berghammer, A. M. Jaoua, B. Möller (eds.): Relations and Kleene Algebra in Computer Science, LNCS 5827.
  pp. 59-72, 2009.
  
• Foundations of Concurrent Kleene Algebra
  C.A.R. Hoare, B. Möller, G. Struth, I. Wehrman
  in R. Berghammer, A. M. Jaoua, B. Möller (eds.): Relations and Kleene Algebra in Computer Science, LNCS 5827.
  pp. 166-186, 2009.
  
• A Semiring Approach to Equivalences, Bisimulations and Control
  R. Glück, B. Möller, M. Sintzoff
  in R. Berghammer, A. M. Jaoua, B. Möller (eds.): Relations and Kleene Algebra in Computer Science, LNCS 5827.
  pp. 134-149, 2009.
• Relations and Kleene Algebra in Computer Science
  R. Berghammer, A. Jaoua, B. Möller (eds.)
  LNCS 5827. Springer, 2009.
• Extended Feature Algebra [Extended Abstract]
  P. Höfner, B. Möller
  in S. Apel et al. (eds.): Workshop on Feature-Oriented Software Development (FOSD),
  pp. 75-80, 2009.
  
• Concurrent Kleene Algebra
  C.A.R. Hoare, B. Möller, G. Struth, I. Wehrman
  in M. Bravetti, G. Zavatttaro (eds.): Concurrency Theory (CONCUR 2009), LNCS 5710.
  pp. 399-414, 2009.
  
• An Algebra of Product Families
  P. Höfner, R. Khedri, B. Möller
  in Software and Systems Modeling Volume 10, Issue 2 (2011), pp. 161 - 182.
• An Algebra of Hybrid Systems
  P. Höfner, B. Möller
  Journal of Logic and Algebraic Programming 78(2), pp. 74-97.
  2009

2008

• Algebraic View Reconciliation
  P. Höfner, R. Khedri, B. Möller
  in A. Cerone and S. Gruner (eds.): Sixth IEEE International Conference on Software Engineering and Formal Methods (SEFM 08), IEEE 2008, pp. 85-94
• An Algebra for Features and Feature Composition
  S. Apel, C. Lengauer, B. Möller, C. Kästner
  in J. Meseguer, G. Rosu (eds.): Algebraic Methodology and Software Technology (AMAST 08), LNCS 5140.
  pp. 36-50, 2008.
  
• Circulations, Fuzzy Relations and Semirings
  R. Glück, B. Möller
  in P. Audebaud and C. Pauline-Mohring (eds.): Mathematics of Program Construction, LNCS 5133.
  pp. 134-152, 2008.
  Springer.
• Relations and Kleene Algebra in Computer Science
  R. Berghammer, B. Möller, G. Struth (eds.)
  LNCS 4988.
  Springer.
• Knowledge and Games in Modal Semirings
  B. Möller
  in R. Berghammer, B. Möller, G. Struth (eds.): Relations and Kleene Algebra in Computer Science, LNCS 4988.
  pp. 320-336, 2008.
  
• Least reflexive points of relations
  J. Desharnais, B. Möller
  in O. Danvy, H. Mairson, F. Henglein, A. Pettorossi (eds.): Automatic program development - A tribute to Robert Paige. Springer 2008, 215-228
• Algebraic Neighbourhood Logic
  P. Höfner, B. Möller
  in R. Schmidt, G. Struth (eds.): Journal of Logic and Algebraic Programming 76 (Special Issue), pp.35-59
  2008

2007

• Kleene Getting Lazy
  B. Möller
  Science of Computer Programming 65, 195-214

2006

• Omega Algebra, Demonic Refinement Algebra and Commands
  P. Höfner, B. Möller, K. Solin
  in R. Schmidt (ed.): Relations and Kleene Algebra in Computer Science (RelMiCS/AKA 06), LNCS 4136.
  pp. 222-234, 2006.
  Springer.
• Lazy Semiring Neighbours and some Applications
  P. Höfner, B. Möller
  in R. Schmidt (ed.): Relations and Kleene Algebra in Computer Science (RelMiCS/AKA 06), LNCS 4136.
  pp. 207-221, 2006.
  Springer.
• Quantales and Temporal Logics
  B. Möller, P. Höfner, G. Struth
  in: M. Johnson and V. Vene (Eds.), Algebraic Methodology and Software Technology (AMAST 2006), LNCS 4019.
  pp. 263-277, 2006.
  Springer.
• The Linear Algebra of UTP
  B. Möller
  in: T. Uustalu (Ed.), Mathematics of Program Construction 8th International Conference (MPC 2006), LNCS 4014.
  pp. 338-358, 2006.
  Springer.
• Feature Algebra
  P. Höfner, R. Khedri, B. Möller
  in J. Misra, T. Nipkow, and E. Sekerinski (eds.): Formal methods (FM 2006), LNCS 4085.
  pp. 300-315, 2006.
  Springer.
• Modal Design Algebra
  W. Guttmann, B. Möller
  In S. Dunne, B. Stoddart (eds.): Unifying Theories of Programming (UTP 2006), LNCS 4010.
  pp. 236–256, 2006.
  Springer
• Kleene Algebra with Domain
  J. Desharnais, B. Möller, G. Struth
  ACM Transactions on Computational Logic
  Vol. 7, No. 4, October 2006, Pages 798–833.
• The Journal of Logic and Algebraic Programming - Special issue "Relation Algebra and Kleene Algebra"
  B. Möller (ed.)
  Journal of Logic and Algebraic Programming 66
• Kleene under a Modal Demonic Star
  J. Desharnais, B. Möller, F. Tchier
  in B. Möller (ed.) Journal of Logic and Algebraic Programming 66
  Special issue "Relation Algebra and Kleene Algebra", pp. 127-160
• Algebras of Modal Operators and Partial Correctness
  B. Möller, G. Struth
  Theoretical Computer Science 351, pp. 221-239
• wp is wlp
  B. Möller, G. Struth
  in W. MacCaull, M. Winter and I. Duentsch (eds.): Relational Methods in Computer Science, LNCS 3929.
  pp. 200-211, 2006.
  Springer.
• Towards an Algebra of Hybrid Systems
  P. Höfner, B. Möller
  in W. MacCaull, M. Winter and I. Duentsch (eds.): Relational Methods in Computer Science, LNCS 3929.
  pp. 121-133, 2006.
  Springer.

2005

• Towards an Algebra of Hybrid Systems
  P. Höfner, B. Möller
  8th International Conference on Relational Methods in Computer Science RelMiCS 8.
  St. Catherines, Ontario, Canada, Feb. 2005.
  
• wp is wlp
  B. Möller, G. Struth
  8th International Conference on Relational Methods in Computer Science RelMiCS 8.
  St. Catherines, Ontario, Canada, Feb. 2005.
  
• Least Reflexive Points of Relations
  J. Desharnais, B. Möller
  Higher-order and Symbolic Computation 18, 51-77 (2005)

2004

• Termination in Modal Kleene Algebra
  J. Desharnais, B. Möller, G. Struth
  In J.-J. Lévy, E. Mayr, J.C. Mitchell (eds.): Exploring new frontiers of theoretical informatics.
  IFIP International Federation for Information Processing Series 155,
  pp. 647-660, 2004.
• Modal Kleene Algebra and Partial Correctness
  B. Möller, G. Struth
  In C. Rattray, S. Maharaj, C. Shankland (eds.): Algebraic Methodology and Software Technology (AMAST 2004), LNCS 3116 (Best Paper Award).
  pp. 379-393, 2004.
  Springer-Verlag.
• Relational and Kleene-Algebraic Methods in Computer Science
  R. Berghammer, B. Möller, G. Struth (eds.)
  LNCS 3051.
  Springer.
• Mathematics of program construction
  E.A. Boiten, B. Möller (eds.)
  Science of Computer Programming 51:1-2, Special Issue
  Jan. 2004.
• Greedy-Like Algorithms in Kleene Algebra
  B. Möller, G. Struth
  In R. Berghammer, B. Möller, G. Struth (eds.): Relational and Kleene-Algebraic Methods in Computer Science, LNCS 3051.
  pp. 202-214, 2004.
  Springer.
• Kleene Modules
  T. Ehm, B. Möller, G. Struth
  In R. Berghammer, B. Möller, G. Struth (eds.): Relational and Kleene-Algebraic Methods in Computer Science, LNCS 3051.
  pp. 112-123, 2004.
  Springer.
• Lazy Kleene Algebra
  B. Möller
  In D. Kozen (ed.): Mathematics of program Construction (MPC 2004), LNCS 3125.
  pp. 252-273, 2004.
  Springer-Verlag.
• Modal Kleene algebra and applications - a survey
  J. Desharnais, B. Möller, G. Struth
  In Journal on Relational Methods in Computer Science 1.
  pp. 93-131, 2004.

2003

• Participants' Proc. 7th Seminar Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra
  R. Berghammer, B. Möller (eds.)
  7th Seminar Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra.
  Malente, Germany, Mai 2003.
• Greedy-like algorithms in Kleene algebra
  B. Möller, G. Struth
  7th Seminar Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra.
  pp. 173-180, Malente, Germany, Mai 2003.
  In R. Berghammer, B. Möller (eds.): Participants' Proc. 7th Seminar Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra.
  Final version.
• Kleene modules
  T. Ehm, B. Möller, G. Struth
  7th Seminar Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra.
  pp. 21-27, Malente, Germany, Mai 2003.
  In R. Berghammer, B. Möller (eds.): Participants' Proc. 7th Seminar Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra.
  Final Version.

2002

• Mathematics of Program Construction
  E.A. Boiten, B. Möller (eds.)
  LNCS 2386.
  2002.

2001

• Characterizing determinacy in Kleene algebra
  J. Desharnais, B. Möller
  In Special Issue on Relational Methods in Computer Science, Information Sciences - An International Journal 139.
  pp. 253-273, 2001.

2000

• Kleene under a demonic star
  J. Desharnais, B. Möller, F. Tchier
  In T. Rus (ed.): Algebraic Methodology and Software Technology (AMAST 2000), LNCS 1816.
  pp. 355-370, Sep. 2000.
  Springer.
• Characterizing functions in Kleene algebra
  J. Desharnais, B. Möller
  J. Desharnais (ed.): RelMiCS 2000, 5th International Seminar on Relational Methods in Computer Science.
  pp. 55-64, Université Laval, Québec, Canada, Jan. 2000.

1999

• Calculating with acyclic and cyclic lists
  B. Möller
  In Information Sciences - An International Journal. Special Issue on Relational Methods in Computer Science 119/3-4.
  pp. 135-154, 1999.

1998

• An Algebraic Approach to Systolic Circuits
  B. Möller
  In Proc. Workshop on Formal Techniques for Hardware and Hardware-like Systems
  Marstrand, 19 June, 1998. Chalmers University of Technology, Göteborg, 1998 (26 pp.)
• Are anamorphisms reasonable abstractions?
  B. Möller
  Workshop on Generic Programming. Chalmers University of Technology, Göteborg, Sweden.
  Juni 1998.
• Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
  T. Brunn, B. Möller, M. Russling
  In J. Jeuring (ed.): Mathematics of Program Construction, LNCS 1422.
  pp. 96-121, 1998.
  Springer-Verlag.
• Deductive Hardware Design: A Functional Approach
  B. Möller
  In B. Möller, J.V. Tucker (eds.): Prospects for hardware, LNCS 1546.
  pp. 420-468, 1998.
  Springer-Verlag.
• Ideal Stream Algebra
  B. Möller
  In B. Möller, J.V. Tucker (eds.): Prospects for hardware foundations, LNCS 1546.
  pp. 69-116, 1998.
  Springer-Verlag.
• Algebraic structures for program calculation
  B. Möller
  International Summer School Marktoberdorf, July 28 - August 9, 1998.
  In M. Broy, R. Steinbrüggen (eds.): Calculational system design, NATO Advanced Science Institutes Series. Subseries F: Computer and Systems Sciences.
  pp. 25-97, 1999.
  IOS Press.
• Prospects for hardware foundations
  B. Möller, J. V. Tucker (eds.)
  LNCS 2546, 1998.

1997

• Temporal Operators on Partial Orders
  B. Möller
  In U.Berger, K.-H. Niggl, B. Reus (eds.): Proc. 3rd Domain Workshop, Munich, 29--31 May 1997.
  Institut für Informatik, LMU Munich, Technical Report 9712, December 1997, pp. 49-58
• Calculating With Pointer Structures
  B. Möller
  IFIP TC2/WG2.1 Working Conference.
  In R. Bird, L. Meertens (eds.): Algorithmic languages and calculi Relational Methods in Computer Science 119/3-4.
  pp. 24-48, Le Bischenberg, France, Feb. 1997.
  Chapman & Hall.
• Calculating a functional module for binary search trees
  W. Dosch, B. Möller
  8th International Workshop.
  In W. Kluge (ed.): Implementation of Functional Languages, LNCS 1268.
  pp. 267-284, Bad Godesberg, Germany, 1997.
  Springer-Verlag.

1996

• Assertions and recursions
  B. Möller
  Second International Workshop.
  In G. Dowek, J. Heering, K. Meinke, B. Möller (eds.): Higher order algebra, logic and term rewriting.
  pp. 163-184, Paderborn, Germany, Dez. 1996.
  Springer-Verlag.
• Mathematics of program construction
  B. Möller (ed.)
  In Special Issue, Science of Computer Programming 26:1-3.
  1996.
• Higher order algebra, logic and term rewriting
  G. Dowek, J. Heering, K. Meinke, B. Möller (eds.)
  LNCS 1074, 1996.

1995

• Mathematics of program construction
  B. Möller (eds.)
  Third International Conference. Kloster Irsee, Germany.
  LNCS 847, 1995.

1994

• Ideal Streams
  B. Möller
  In F. Simon (ed.): Alternative Konzepte für Sprachen und Rechner.
  Christian-Albrechts-Universität Kiel, Bericht Nr. 9412, pp. 83-86
• Ideal streams
  B. Möller
  In E.- R. Olderog (ed.): Programming Concepts, Methods and Calculi. IFIP Transactions A-56.
  pp. 39-58, 1994.
  North Holland.
• Higher order algebra, logic and term rewriting
  Heering, K. Meinke, B. Möller, T. Nipkow (eds.)
  LNCS 816, 1994.
• Ordered and continuous models of higher-order specifications
  B. Möller
  In J. Heering, K. Meinke, B. Möller, T. Nipkow (eds.): Higher-Order algebra, logic and term rewriting, LNCS 816.
  pp. 223-255, 1994.
  Springer-Verlag.
• Shorter paths to graph algorithms
  B. Möller, M. Russling
  In Science of Computer Programming 22.
  pp. 157-180, 1994.

1993

• An Algebraic Approach to Streams
  B. Möller
  In R. Berghammer, G. Schmidt (eds.): Programmiersprachen und Grundlagen der Programmierung.
  Fakultät für Informatik, Universität der Bundeswehr München, Bericht Nr. 9309, pp. 1-14
• Shorter paths to graph algorithms
  B. Möller, M. Russling
  In R. S. Bird, C. C. Morgan, J. C. P. Woodcock (eds.): Mathematics of program construction, LNCS 669.
  pp. 250-268, 1993.
  Springer-Verlag.
• Towards pointer algebra
  B. Möller
  In Science of Computer Programming 21.
  pp. 57-90, 1993.
• Derivation of graph and pointer algorithms
  B. Möller
  In B. Möller, H.A. Partsch, S.A. Schuman (eds.): Formal program development, LNCS 755.
  pp. 123-160, 1993.
  Springer-Verlag.
• Formal program development
  B. Möller, H.A. Partsch, S.A. Schuman (eds.)
  LNCS 755, 1993.
• Algebraic calculation of graph and sorting algorithms
  B. Möller
  In D. Bjorner, M. Broy, I.V. Pottosin (eds.): Formal methods in Programming and their Applications, LNCS 735.
  pp. 394-413, 1993.
  Springer-Verlag.

1992

• Design and proof of multipliers by correctness-preserving transformation
  C. Delgado Kloos, W. Dosch, B. Möller
  IEEE International Conference on Computer Systems and Software Engineering (CompEuro 92).
  pp. 238-243, Los Alamitos, CA, USA, 1992.
  In P. Dewilde, J. Vandewalle (eds.): Proc. IEEE International Conference on Computer Systems and Software Engineering.
  IEEE Computer Society Press.
• Some applications of pointer algebra
  B. Möller
  In Broy, M. (ed.): Programming and mathematical method. NATO ASI Series, Series F: Computer and Systems Sciences, Vol. 88.
  pp. 123-155, 1992.
  Springer-Verlag.

1991

• Formal derivation of pointer algorithms
  B. Möller
  In M. Broy (ed.): Informatik und Mathematik.
  pp. 419-440, 1991.
  Springer-Verlag.
• Programming with (finite) mappings
  P. Pepper, B. Möller
  In M. Broy (ed.): Informatik und Mathematik.
  pp. 381-405, 1991.
  Springer-Verlag.
• Calculating a garbage collector
  U. Berger, W. Meixner, B. Möller
  In M. Broy, M. Wirsing (eds.): Methodik des Programmierens, Methods of programming, LNCS 544.
  pp. 137-192, 1991.
  Springer-Verlag.
• Constructing programs from specifications
  B. Möller (ed.)
  Proc. IFIP TC2 Conference, 1991.
• Relations as a program development language
  B. Möller
  IFIP TC2 Conference.
  In B. Möller (ed.): Constructing programs from specifications.
  pp. 373-397, Pacific Grove, USA, 1991.
  North Holland.

1990

• On the refinement of nondeterministic recursive routines by transformation
  R. Berghammer, H. Ehler, B. Möller
  In M. Broy, C.B. Jones (eds.): Programming concepts and methods.
  pp. 53-71, 1990.
  North-Holland.
• Systematic derivation of pointer algorithms
  B. Möller
  In A. Reuter (ed.): GI - 20. Jahrestagung II. Informatik-Fachberichte 258.
  pp. 537-547, 1990.
  Springer-Verlag.