Publikationen

2008

• Algebraic View Reconciliation
  P. Höfner, R. Khedri, B. Möller
  in A. Cerone and S. Gruner (eds.): SEFM 08, IEEE.
  (to appear)
• Automated Verification of Refinement Laws
  P. Höfner, G. Struth, G. Sutcliffe
  in S. Ranise, U. Hustad (eds.): Special issue of the Annals of Mathematics and Artificial Intelligence on first-order theorem proving
  (to appear), 2008
• An Algebra of Hybrid Systems
  P. Höfner, B. Möller
  Journal of Logic and Algebraic Prpgramming
  (to appear), 2008
• On Automating the Calculus of Relations
  P. Höfner, G.Struth
  in A. Armando, P. Baumgartner, G. Dowek (eds.): Automated Reasoning.
  Lecture Notes in Computer Science 5195. Springer 2008, pp. 50-66
• 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.
  
• Non-Termination in Idempotent Semirings
  P. Höfner, G.Struth
  in R. Berghammer, B. Möller, G. Struth (eds.): Relations and Kleene algebra in Computer Science.
  Lecture Notes in Computer Science 4988. Springer 2008, pp. 206-220
• Algebraic Reasoning for Hybrid Systems -Two Case Studies -
  P. Höfner
  in R. Berghammer, B. Möller, G. Struth (eds.): Relations and Kleene algebra in computer science.
  Lecture Notes in Computer Science 4988. Springer 2008, pp. 191-205
• First-Order Theorem Prover Evaluation w.r.t. Relation- and Kleene Algebra
  H.-H. Dang, P. Höfner
  in R. Berghammer, B. Möller, Struth, G. (eds.): Relations and Kleene algebra in computer science. PhD Programme
  Technical Report 2008-04, Institute of Computer Science, University of Augsburg, 2008, pp. 48-52
• Towards an Algebraic Composition of Semantic Web Services
  P. Höfner, F. Lautenbacher
  in R. Berghammer, B. Möller, Struth, G. (eds.): Relations and Kleene algebra in computer science. PhD Programme
  Technical Report 2008-04, Institute of Computer Science, University of Augsburg, 2008, pp. 68-73
• 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 Structure of Web Services
  P. Höfner, F. Lautenbacher
  in D. Ballis, S. Escobar, M. Marchiori (eds.):
  3rd Int'l Workshop on Automated Specification and Verification of Web Systems (WWV 2007), ENTCS
  volume 200(3), pp. 171-187, 2008.
• 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

• Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic
  P. Höfner
  in J. van de Pol, J. Romijn, G. Smith(eds.): Proceedings of the Doctoral Symposium affiliated with the Fifth Integrated Formal Methods Conference (IFM 2005),ENTCS
  volume 191, pp. 49-72, 2007.
• Kleene Getting Lazy
  B. Möller
  Science of Computer Programming 65, 195-214
• Can Refinement be automated?
  P. Höfner, G. Struth
  in E. Boiten, J. Derrick and G. Smith (eds.): International Refinement Workshop - Refine 2007, ENTCS.
  pp. 53-73, 2007.
  Elsevier.
• Automated Reasoning in Kleene Algebra
  P. Höfner, G. Struth
  in F. Pfenning (ed.): CADE 2007, LNAI 4603.
  pp. 279-294, 2007.
  Springer.

2006

• On Two Dually Nondeterministic Refinement Algebras
  K. Solin
  in R. Schmidt (eds.): Relations and Kleene Algebra in Computer Science (RelMiCS/AKA 06), LNCS 4136
  pp. 373-387, 2006.
  Springer.
• 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.
• f-generated Kleene Algebra
  P. Höfner
  in R. Schmidt, G. Struth (eds.): Relations and Kleene Algebra in Computer Science - PhD Programme (RelMiCS/AKA 06)
  Research Report CS-06-09, Department of Computer Science, University of Sheffield
  pp. 55-59, 2006.
• Some Notes on Duality in Refinement Algebra
  K. Solin
  in R. Schmidt, G. Struth (eds.): Relations and Kleene Algebra in Computer Science - PhD Programme (RelMiCS/AKA 06)
  Research Report CS-06-09, Department of Computer Science, University of Sheffield
  pp. 84-88, 2006.
• 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.
• Refinement Algebra with Operators for Enabledness and Termination
  K. Solin, J von Wright
  in: T. Uustalu (Ed.), Mathematics of Program Construction 8th International Conference (MPC 2006), LNCS 4014.
  pp. 397-415, 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.
• 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
• 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
• Abstract Abstract Reduction
  G. Struth
  in B. Möller (ed.) Journal of Logic and Algebraic Programming 66
  Special issue "Relation Algebra and Kleene Algebra", pp. 239-270
• 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

• Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic
  P. Höfner
  In J. Romijn, G. Smith, J. van de Pol (eds.): IFM 2005 Doctoral Symposium on Integrated Formal Methods (IFM 2005).
  CS-Report 05-29, pp. 6-13, 2005.
• An Algebraic Semantics for Duration Calculus
  P. Höfner
  17th European Summer School in Logic, Language and Information (ESSLLI),
  Proceedings of the 10th ESSLLI Student Session
  pp. 99-111, 2005. Heriot-Watt University Edinburgh, Scotland, 8-19 August, 2005
• Least Reflexive Points of Relations
  J. Desharnais, B. Möller
  Higher-order and Symbolic Computation 18, 51-77 (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.
  

2004

• Termination in Modal Kleene Algebra
  J. Desharnais, B. Möller, G. Struth
  In J.-J. Lévy, E. Mayr, J. Mitchell (eds.): Exploring new frontiers of theoretical informatics.
  pp. 653-666, 2004.
  Kluwer, IFIP International Federation for Information Processing Series 155
• 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.
• 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.
• Pointer Kleene algebra
  T. Ehm
  In R. Berghammer, B. Möller, G. Struth (eds.): Relational and Kleene-Algebraic Methods in Computer Science, LNCS 3051.
  pp. 99-111, 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.
• 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.

2003

• Pointer Kleene algebra
  T. Ehm
  7th Seminar Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra.
  pp. 135-143, 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.
• 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.
• A Calculus for Set-Based Program Development
  G. Struth
  5th International Conference on Formal Engineering Methods.
  In J. S. Dong, J. Woodcock (eds): Formal Methods and Software Engineering, LNCS 2885.
  pp. 541-559, 2003.
  Springer-Verlag.

2002

• Mathematics of Program Construction
  E.A. Boiten, B. Möller (eds.)
  LNCS 2386.
  2002.
• Deriving Focused Lattice Calculi
  G. Struth
  13th International Conference on Rewriting Techniques and Applications (RTA 2002).
  pp. 83-97, Kopenhagen, Denmark, 2002.
  In S. Tison (ed.): Rewriting Techniques and Applications, 13th International Conference, Lecture Notes in Computer Science 2378.
  Springer-Verlag.

2001

• Transformational construction of correct pointer algorithms
  T. Ehm
  Andrei Ershov Fourth International Conference on Perspectives of Systems Informatics.
  pp. 116-130, Novosibirsk, Russia, Juli 2001.
  In D. Bjorner, M. Broy, A.V. Zamulin (eds.): Lecture Notes in Computer Science 2244.
  Springer-Verlag.
• Calculating Church-Rosser Proofs in Kleene Algebra
  G. Struth
  6th International Conference of Relational methods in Computer Science (RelMICS 2001).
  pp. 276-290, Oisterwijk, Netherlands, 2002.
  In H.C.M. de Swart (ed.): Relational Methods in Computer Science, Lecture Notes in Computer Science 2561.
  Springer-Verlag.
• 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

• Informatik-Werkzeuge zur multimedialen Unterstützung der Lehre
  T. Ehm
  In Connect 1/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.
• 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.
• 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.

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
• Shorter paths to graph algorithms
  B. Möller, M. Russling
  In Science of Computer Programming 22.
  pp. 157-180, 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.
• 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.

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

• Programming with (finite) mappings
  P. Pepper, B. Möller
  In M. Broy (ed.): Informatik und Mathematik.
  pp. 381-405, 1991.
  Springer-Verlag.
• 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.
• Constructing programs from specifications
  B. Möller (ed.)
  Proc. IFIP TC2 Conference, 1991.
• Formal derivation of pointer algorithms
  B. Möller
  In M. Broy (ed.): Informatik und Mathematik.
  pp. 419-440, 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.

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.