Vorträge

2005

  • B. Möller: WP is WLP. 8th Seminar Relational Methods in Computer Science and 3rd International Workshop on Applications of Kleene Algebra. St. Catharines, Canada, Feb. 2005.

 

 

2004

  • B. Möller: Algebra of Probabilistic Predicative Programming. 59th Meeting of IFIP WG 2.1 "Algorithmic Languages and Calculi". Nottingham, UK, Sep. 2004.
  • B. Möller: Lazy Kleene algebra. 7th International Conference on the Mathematics of Program Construction. Stirling, UK, Juli 2004.
  • B. Möller: Anwendungen modaler Kleene-Algebra. Kolloquium Programmiersprachen und Programmentwicklung. Freiburg, Germany, März 2004.
  • B. Möller: Modal Kleene Algebra and applications. 58th Meeting of IFIP WG 2.1 "Algorithmic Languages and Calculi". Rome, Italy, Jan. 2004.

 

 

2003

  • B. Möller: Modal Kleene Algebra and reactive systems. Microsoft, Redmond, USA, Okt. 2003.
  • B. Möller: Modal Kleene algebra and applications. Université Laval, Québec, Canada, Sep. 2003.
  • B. Möller: Modal Kleene algebra. DIMACS Workshop on Applications of Lattices and Ordered Sets to Computer Science. Juli 2003.
  • B. Möller: Greedy-like algorithms in Kleene algebra. 7th Seminar Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra. Malente, Germany, Mai 2003.
  • B. Möller: Ideal stream algebra. University of Kent at Canterbury, U. K., Jan. 2003.
  • B. Möller: Ideal streams. Colloquium. Christian-Albrechts-Universität Kiel, Germany, Jan. 2003.

 

 

2002

  • B. Möller: Algebraic semantics and algebraic system construction. University of Córdoba, Argentina, Sep. 2002.
  • B. Möller: A survey of efficiency-increasing transformation techniques. University of Buenos Aires, Argentina, Sep. 2002.
  • B. Möller: An algebraic treatment of greedy algorithms. University of Buenos Aires, Argentina, Sep. 2002.
  • B. Möller: Kleene-Algebra und Programmsemantik. Treffen des DFG-Forscherverbunds InopSys. TU München, Juni 2002.
  • B. Möller: Kleene-Algebra in Semantik und formaler Konstruktion von Programmen. Universität Kiel, Mai 2002.
  • B. Möller: Kleene algebra in system semantics and system construction,. Kestrel Institute, Palo Alto, USA, Mai 2002.

 

 

2001

  • B. Möller: Kleene algebra in formal program semantics and program construction. University of Córdoba, Argentina, Nov. 2001.
  • B. Möller: Greedy-like algorithms in Kleene algebra. University of Buenos Aires, Argentina, Nov. 2001.
  • B. Möller: Greedy-like algorithms in Kleene algebra. 56th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Hollum, Ameland, Netherlands, Sep. 2001.
  • B. Möller: Invited talk: Algebraic calculi for system calculation. 10th International Colloquium on Numerical Analysis and Computer Sciences with Applications. Plovdiv, Bulgaria, Aug. 2001.
  • B. Möller: Kleene-ing up semantics. Dagstuhl-Seminar 01081 Applications of Kleene Algebra. Dagstuhl, Germany, Feb. 2001.
  • B. Möller: Calculating with pointer structures. Dagstuhl-Seminar 01081 Applications of Kleene Algebra. Dagstuhl, Germany, Feb. 2001.
  • B. Möller: Undirected graph algebra. 55th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi,. Cochabamba, Bolivia, Jan. 2001.
  • B. Möller: Characterizing determinacy in Kleene algebra. 55th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Cochabamba, Bolivia, Jan. 2001.

 

 

2000

  • B. Möller: Algebraische Systementwicklung,. Kolloquiumsvortrag. Universität Graz, Austria, Mai 2000.
  • B. Möller: Kleene-ing up semantics. 54th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. London, U. K., April 2000.
  • B. Möller: Calculating with pointer structures. University of Córdoba, Argentina, Feb. 2000.
  • B. Möller: A survey of transformational programming. University of Córdoba, Argentina, Feb. 2000.

 

 

1999

  • B. Möller:Invited talk: Algebraic system calculation.WAIT '99 - Argentinian Workshop on Theoretical Computer Science.Buenos Aires, Argentina, Sep. 1999.
  • B. Möller:Algebraische Strukturen in der semantischen Beschreibung programmiersprachlicher Konzepte.Kolloquium.Universität Bonn, Juni 1999.
  • B. Möller:Algebraische Systementwicklung. Festvortrag anläßlich des 75. Geburtstags von Prof. Dr. Dr. h. c. mult. F. L. Bauer.TU München, Juni 1999.
  • B. Möller:Typed Kleene algebra and demonic semantics.53rd Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Potsdam, Germany, Juni 1999.
  • B. Möller:Systematische Konstruktion korrekter Systeme.Kolloquium. Universität Eichstätt, Juni 1999.
  • B. Möller: Calculating with pointer structures. Colloquium. Université Laval, Québec, Canada, Mai 1999.

 

 

1998

  • B. Möller: Deductive hardware design: an algebraic approach. Universidad Carlos III Madrid, Spain, Dez. 1998.
  • B. Möller: Modal and temporal operators on partial orders. 4th International Seminar on Relational Methods in Computer Science. Warschau, Poland, Sep. 1998.
  • B. Möller: An Algebraic Approach to Systolic Circuits. Workshop on Formal Techniques for Hardware and Hardware-Like Systems. Marstrand, Sweden, Juni 1998.
  • B. Möller: Are anamorphisms reasonable abstractions?. Workshop on Generic Programming. Marstrand, Sweden, Juni 1998.
  • B. Möller: Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach. 4th International Conference onthe Mathematics of Program Construction. Marstrand, Sweden, Juni 1998.
  • B. Möller: Ideal stream algebra. 48th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Oxford, U. K., Jan. 1998.

 

 

1997

  • B. Möller: Towards deductive hardware design. NADA Final Meeting. Lübeck, Germany, Sep. 1997.
  • B. Möller: Stream algebra. Final NADA Meeting. Lübeck, Germany, Sep. 1997.
  • B. Möller: Temporal operators on partial orders. 3rd International Workshop on Domains. Munich, Germany, Mai 1997.
  • B. Möller: Stream algebra. CHDL/VUFE/NADA/LCMQA. Toledo, Spain, April 1997.
  • B. Möller: Towards deductive hardware design. NADA Tutorial im Rahmen der CHDL/VUFE/NADA/LCMQA. Toledo, Spain, April 1997.
  • B. Möller: Calculating with pointer structures. IFIP TC2/WG 2.1 Working Conference on Algorithmic Languages and Calculi. Le Bischenberg, France, Feb. 1997.
  • B. Möller: Calculating with pointer structures. 3rd International Seminar on Relational Methods in Computer Science. Hammamet, Tunesia, Jan. 1997.

 

 

1996

 

  • B. Möller: Refining ideal behaviours. NADA Meeting. Amsterdam, Netherlands, Okt. 1996.
  • B. Möller: Deduktiver Entwurf von Graphenalgorithmen. Kolloquium. Universität Jena, April 1996.

 

 

1995

  • B. Möller: Deduktiver Entwurf paralleler Systeme. Universität Konstanz, Nov. 1995.
  • B. Möller: Assertions and recursions. 48th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Reisensburg, Germany, Okt. 1995.
  • B. Möller: Refining ideal behaviours. NADA Meeting on StreamConcepts. Schloß Elmau, Germany, Okt. 1995.
  • B. Möller: Assertions and recursions. HOA '95 - Second International Workshop on Higher-Order Logic, Algebra and Term Rewriting. Paderborn, Germany, Sep. 1995.
  • B. Möller: Refining ideal behaviours. Workshop on Logic, Domains and Programming Languages. Darmstadt, Germany, Mai 1995.
  • B. Möller: Deduktiver Entwurf von Soft- und Hardware. Universität Freiburg, April 1995.
  • B. Möller: Calculating an asynchronous bounded queue. Colloquium. University of Oxford, U. K., März 1995.
  • B. Möller: Calculating an asynchronous bounded queue. 1st Annual Meeting of Esprit Working Group 8533 NADA - New Hardware Design Methods. Bridgend, U. K., März 1995.
  • B. Möller: Calculating an asynchronous bounded queue. MAUT der Informatik-Institute München, Augsburg, Ulm, Tübingen. Tübingen, Germany, März 1995.
  • B. Möller: Calculating a bounded buffer. 47th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Hong Kong, USA, Jan. 1995.

 

 

1994

  • B. Möller: Experiments in hardware specification and deductive design. Second NADA meeting. Madrid, Spain, Okt. 1994.
  • B. Möller: Sichere Zeigermanipulation. Kolloquium. Universität Karlsruhe, Juni 1994.
  • B. Möller: Ideal streams. IFIP TC2/WG2.1-2.3 Working Conference PROCOMET '94 - Programming concepts, methods and calculi. San Miniato, Italy, Juni 1994.
  • B. Möller: Ideal streams. Workshop Deklarative Programmierung und Spezifikation. Bad Honnef, Germany, Mai 1994.
  • B. Möller: Where we are - where to go from here. Inaugural Meeting of Esprit Working Group 8533 NADA - New Hardware Design Methods. Munich, Germany, April 1994.
  • B. Möller: Ordered and continuous models of higher-order specifications. MAUT der Informatik-Institute München, Augsburg, Ulm, Tübingen. Augsburg, Germany, April 1994.
  • B. Möller: Ideal streams. 46th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Renkum, Netherlands, Jan. 1994.

 

 

1993

  • B. Möller: An algebraic approach to streams. MAUT der Informatik-Institute München, Augsburg, Ulm, Tübingen. Ulm, Germany, Okt. 1993.
  • B. Möller: Ideal streams. Colloquium. Universidad Politécnica de Madrid, Spain, Okt. 1993.
  • B. Möller: Ordered and continuous models of higher-order specifications. HOA '93 - First International Workshop on Higher Order Algebra, Logic and Term Rewriting. Amsterdam, Netherlands, Sep. 1993.
  • B. Möller: An algebraic approach to streams. Kolloquium Programmiersprachen und Grundlagen der Programmierung. Garmisch-Partenkirchen, Germany, Sep. 1993.
  • B. Möller: Anforderungen an die algebraische Programmentwicklung. Treffen MAUT der Informatik-Institute München, Augsburg, Ulm, Tübingen. Ulm, Juli 1993.
  • B. Möller: Invited talk - Algebraic calculation of graph and sorting algorithms. International Conference on Formal Methods in Programming and their Applications. Novosibirsk, Russia, Juni 1993.
  • B. Möller: Localisation and regular algebra. 45th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Winnipeg, USA, Mai 1993.
  • B. Möller: Sichere Zeigermanipulation. Kolloquium. Universität Ulm, Mai 1993.

 

 

1992

  • B. Möller: Pointer algebra. Colloquium. University College of Swansea, U. K., Dez. 1992.
  • B. Möller: Formal program development over formal languages. Colloquium. Universidad Politécnica de Madrid, Spain, Okt. 1992.
  • B. Möller: An algebraic approach to sorting. 44th Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Augsburg, Germany, Sep. 1992.
  • B. Möller: Shorter paths to graph algorithms. 2nd International Conference on Mathematics of Program Construction. Oxford International Conference on Mathematics of Program Construction, U. K., Juni 1992.
  • B. Möller: Zur formalen Entwicklung graphentheoretischer Algorithmen. Kolloquium. Universität der Bundeswehr München, Mai 1992.
  • B. Möller: Formale Programmentwicklung über formalen Sprachen. Universität Passau, Mai 1992.
  • B. Möller: Design and proof of multipliers by correctness-preserving transformation. IEEE International Conference on Computer Systems and Software Engineering CompEuro 92. Den Haag, Netherlands, Mai 1992.
  • B. Möller: Fixpunkttheorie und Graphenalgorithmen. Kolloquium. Universität Hildesheim, Feb. 1992.
  • B. Möller: Shorter paths to graph algorithms. Colloquium. University of Nijmegen, Netherlands, Feb. 1992.

 

 

1991

  • B. Möller: A relational framework for types and inheritance. Colloquium. University College of Swansea, USA, Okt. 1991.
  • B. Möller: A relational framework for types and polymorphism. Meeting of IFIP WG 2.2 Formal Description of Programming Concepts. Darmstadt, Germany, Juli 1991.
  • B. Möller: Relations as a program development language. IFIP TC2/WG 2.1 Working Conference on Constructing Programs from Specifications. Pacific Grove, USA, Mai 1991.
  • B. Möller: A relational programming style. 42nd Meeting of IFIP WG 2.1 Algorithmic Languages and Calculi. Louvain-la-Neuve WG 2.1 Algorithmic Languages and Calculi, France, Jan. 1991.

Suche