Professur für Programmiermethodik und Multimediale Informationssysteme

  1. Universität
  2. Fakultäten
  3. Fakultät für Angewandte Informatik
  4. Institut für Informatik
  5. Lehrstühle und Professuren der Informatik
  6. Programmiermethodik und Multimediale Informationssysteme
  7. Veröffentlichungen
  8. Technische Berichte

Technische Berichte

2019

 

  • Basics of Modal Semirings and of Kleene/Omega Algebras

    B. Möller, J. Desharnais
    Technical Report 2019-03, Institute of Computer Science, University of Augsburg, June 2019

 

  • A New Correctness Proof for Prim's Algorithm

    P. Höfner, B. Möller
    Technical Report 2019-02, Institute of Computer Science, University of Augsburg, June 2019

 

 

2017

 

  • Tracelets and Specifications

    T. Hoare, B Möller, M. Müller
    Technical Report 2017-01, Institute of Computer Science, University of Augsburg, January 2017

 

 

2016

 

  • Non-Associative Kleene Algebra and Temporal Logics

    J. Desharnais, B Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 2016

 

 

2015

 

  • Monoid Modules and Structured Document Algebra

    A. Zelend
    Proceedings of the Student Track of the 15th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2015) Braga, Portugal, September 2015.

 

 

2013

 

  • Features, Modularity, and Variation Points

    D. Batory, P. Höfner, B. Möller, A. Zelend
    Technical Report, University of Texas at Austin, October 2013

 

  • An Algebra of Database Preferences

    B. Möller, P. Roocks
    Technical Report, Institute of Computer Science, University of Augsburg, June 2013
    2013-08

 

  • Extended Transitive Separation Logic

    H.-H. Dang, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, June 2013
    2013-07

 

 

2012

 

  • Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming

    P. Höfner, B.Möller, A. Zelend
    Technical Report, Institute of Computer Science, University of Augsburg, August 2012
    2012-06

 

 

2011

 

  • Formal Product Families for Abstract Machines

    A. Zelend
    Technical Report, Institute of Computer Science, University of Augsburg, March 2011
    2011-06

 

 

2010

 

  • Supplementing Product Families with Behaviour

    P. Höfner, R. Khedri and B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, October 2010
    2010-13

 

  • Requirements in Feature Algebra

    P. Höfner, S. Mentl, B. Möller, and W. Scholz
    Technical Report, Institute of Computer Science, University of Augsburg, October 2010
    2010-12

 

  • Fixing Zeno Gaps

    P. Höfner and B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, October 2010
    2010-11

 

  • ATPPortal: A User-friendly Webbased Interface for Automated Theorem Provers and for Automatically Generated Proofs

    P. Höfner, M.E. Müller, S. Zeissler
    Technical Report, Institute of Computer Science, University of Augsburg, October 2010
    2010-10

 

  • An Extension of Feature Algebra

    P. Höfner and B.Möller
    Technical Report, Institute of Computer Science, University of Augsburg, October 2010
    2010-09

 

  • Algebraic Separation Logic

    H.-H. Dang, P. Höfner, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, July 2010
    2010-06

 

  • An Algebra for Abstract Interfaces

    P. Höfner, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, April 2010
    2010-02

 

  • Automated Higher-order Reasoning in Quantales

    H.-H. Dang, P. Höfner
    Technical Report, Institute of Computer Science, University of Augsburg, April 2010
    2010-03

 

 

2009

 

  • Towards Algebraic Separation Logic

    H.-H. Dang, P. Höfner, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, June 2009
    2009-12

 

  • Foundations of Concurrent Kleene Algebra

    C.A.R. Hoare, B. Möller, G. Struth and I. Wehrman
    Technical Report, Institute of Computer Science, University of Augsburg, April 2009
    2009-05

 

  • Concurrent Kleene Algebra

    C.A.R. Hoare, B. Möller, G. Struth and I. Wehrman
    Technical Report, Institute of Computer Science, University of Augsburg, April 2009
    2009-04

 

  • Algebraic Aspects of Separation Logic

    H.-H. Dang
    Technical Report, Institute of Computer Science, University of Augsburg, May 2009
    2009-01

 

 

2008

 

  • Relations and Kleene Algebra in Computer Science

    PHD Programme at RelMiCS10 / AK5
    R. Berghammer, B. Möller, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, April 2008
    2008-04

 

  • On Automating the Calculus of Relations

    P. Höfner G. Struth
    Technical Report, Department of Computer Science, University of Sheffield, March 2008
    CS-08-05

 

  • Network Flows, Semirings and Fuzzy Relations

    R. Glück
    Technical Report, Institute of Computer Science, University of Augsburg, Januaryr 2008
    2008-01

 

 

2007

 

  • Algebraic View Reconciliation

    P. Höfner, R. Khedri, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 2007
    2007-13

 

  • Algebraic Structure of Web Services

    P. Höfner, F. Lautenbacher
    Technical Report, Institute of Computer Science, University of Augsburg, February 2008
    2007-12

 

  • Proof Automation in Kleene Algebra

    P. Höfner
    in W. Dosch, C. Grelck, A. Stümpel (eds.): 14. Kolloquium Programmiersprachen unf Grundlagen der Programmierung, Technical Report, Institutes for Computer Science and Mathematics, University of Lübeck, pp. 87-92, September 2007
    A-07-07, Schriftenreihe A

 

  • Netzwerkflüsse und Fuzzyrelationen

    R. Glück
    in W. Dosch, C. Grelck, A. Stümpel (eds.): 14. Kolloquium Programmiersprachen unf Grundlagen der Programmierung, Technical Report, Institutes for Computer Science and Mathematics, University of Lübeck, pp. 59-64, September 2007
    A-07-07, Schriftenreihe A

 

  • An Algebra of Hybrid Systems

    P. Höfner, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, September 2007
    2007-08

 

  • An Algebra for Feature-Oriented Software Development

    S. Apel, C. Lengauer, D. Batory, B, Möller, C. Kästner
    Technical Report, Department of Informatics and Mathematics, University of Passau, 

    MIP-0706

 

  • Can Refinement be Automated?

    P. Höfner G. Struth
    Technical Report, Department of Computer Science, University of Sheffield, June 2007
    CS-07-08

 

  • Knowledge and Games in Modal Semirings

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, February 2007
    2007-03

 

  • Automated Reasoning in Kleene Algebra

    P. Höfner G. Struth
    Technical Report, Department of Computer Science, University of Sheffield, Februrary 2007
    CS-07-04

 

 

2006

 

  • Normal Design Algebra

    W. Guttmann, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 2006
    2006-28

 

  • Algebraic Notions of Non-Termination

    P. Höfner G. Struth
    Technical Report, Department of Computer Science, University of Sheffield, December 2006
    CS-06-12

 

  • Algebraic Notions of Termination

    J. Desharnais, B. Möller, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, October 2006
    2006-23

 

  • Dynamic Epistemic Semirings

    K. Solin
    Technical Report, Institute of Computer Science, University of Augsburg, June 2006
    2006-17

 

  • Omega Algebra, Demonic Refinement Algebra and Commands

    P. Höfner, B. Möller, K. Solin
    Technical Report, Institute of Computer Science, University of Augsburg, March 2006
    2006-11

 

  • The Linear Algebra of UTP (Revised Version)

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, April 2006
    2006-10

 

  • Lazy Semiring Neighbours and some Applications

    P. Höfner, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, June 2006
    2006-09

 

  • Non-Smooth and Zeno Trajectories for Hybrid System Algebra

    P. Höfner, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, March 2006
    2006-07

 

  • Quantales and Temporal Logics

    B. Möller, P. Höfner, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, June 2006
    2006-06

 

  • On Two Dually Nondeterministic Refinement Algebras

    K. Solin
    Technical Report, Institute of Computer Science, University of Augsburg, February 2006
    2006-05

 

  • Feature Algebra

    P. Höfner, R. Khedri, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, June 2006
    2006-04

 

 

2005

 

  • Residuals and Detachments

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 2005
    2005-20

 

  • Semiring Neighbours

    P. Höfner
    Technical Report, Institute of Computer Science, University of Augsburg, November 2005
    2005-19

 

  • Modal Design Algebra

    W. Guttmann, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, October 2005
    2005-15

 

  • The Linear Algebra of UTP

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, September 2005
    2005-14

 

  • Complete Tests do not Guarantee Domain

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, March 2005
    2005-06

 

  • From Sequential Algebra to Kleene Algebra: Interval Modalities and Duration Calculus

    P. Höfner
    Technical Report, Institute of Computer Science, University of Augsburg, March 2005
    2005-05

 

 

2004

 

  • Separability in Domain Semirings

    D. Kozen, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 2004
    2004-16

 

  • WP is WLP

    B. Möller, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, October 2004
    2004-14

 

  • Kleene under a Modal Demonic Star

    J. Desharnais, B. Möller, F. Tchier
    Technical Report, Institute of Computer Science, University of Augsburg, May 2004
    2004-11

 

  • Termination in Modal Kleene Algebra

    J. Desharnais, B. Möller, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, January 2004
    2004-04

 

 

2003

 

  • An Algebraic Study of Commutation and Termination

    G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, December 2003
    2003-18

 

  • Lazy Kleene Algebra

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 2003
    2003-17

 

  • A Calculus for Set-Based Program Development Part II: Proof Search

    G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, October 2003
    2003-16

 

  • A Calculus for Set-Based Program Development Part I: Mathematical foundations.

    G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, September 2003
    2003-15

 

  • Kleene Algebras and Pointer Structures

    T. Ehm
    Technical Report, Institute of Computer Science, University of Augsburg, July 2003
    2003-13

 

  • Deriving Tableau-Based Solutions to Lattice Word Problems

    G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, August 2003
    2003-12

 

  • Greedy-Like Algorithms in Kleene Algebra

    B. Möller, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, August 2003
    2003-11

 

  • Kleene Modules

    T. Ehm, B. Möller, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, August 2003
    2003-10

 

  • Case studies for the derivation of pointer algorithms

    T. Ehm
    Technical Report, Institute of Computer Science, University of Augsburg, June 2003
    2003-09

 

  • Modal Kleene Algebra and Partial Correctness

    B. Möller, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, May 2003
    2003-08

 

  • Kleene Algebra with Domain

    J. Desharnais, B. Möller, G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, May 2003
    2003-07

 

 

2002

 

  • Least Reflexive Points of Relations

    J. Desharnais, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, June 2002
    2002-13

 

  • Declarative Graph Algorithms via Knuth-Bendix Completion

    G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, May 2002
    2002-10

 

  • Termination of Ground Non-Symmetric Knuth-Bendix Completion

    G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, May 2002
    2002-09

 

  • Deriving Focused Lattice Calculi

    G. Struth
    Technical Report, Institute of Computer Science, University of Augsburg, May 2002
    2002-08

 

 

2001

 

  • Characterizing Determinacy in Kleene Algebras (Revised version)

    J. Desharnais, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, April 2001
    2001-03

 

 

2000

 

  • Properties of overwriting for Updates in Typed Kleene Algebras

    T. Ehm
    Technical Report, Institute of Computer Science, University of Augsburg, December 2000
    2000-07

 

  • Characterizing Determinacy in Kleene Algebras

    J. Desharnais, B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, May 2000
    2000-05

 

  • Safer Ways to Pointer Manipulation

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, May 2000
    2000-04

 

  • Kleene Under a Demonic Star

    J. Desharnais, B. Möller, F. Tchier
    Technical Report, Institute of Computer Science, University of Augsburg, February 2000
    2000-03

 

 

1999

 

  • Typed Kleene Algebras

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 1999
    1999-08

 

 

1998

 

  • An Algebraic Approach to Systolic Circuits

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, January 1998
    1998-01

 

 

1997

 

  • Ideal Stream Algebra

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 1997
    1997-10

 

  • Deductive Hardware Design: A Functional Approach

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 1997
    1997-09

 

  • Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach

    T. Brunn, B. Möller, M. Russling
    Technical Report, Institute of Computer Science, University of Augsburg, December 1997
    1997-08

 

  • Linked Lists Calculated

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, December 1997
    1997-07

 

  • Modal and Temporal Operators on Partial Orders

    B. Möller
    Technical Report, Institute of Computer Science, University of Augsburg, November 1997
    1997-02

 

 

1995

  • Refining Ideal Behaviours

    B. Möller
    Institut für Mathematik der Universität Augsburg.
    Report Nr. 345, 1995

 

 

1993

  • Derivation of Graph and Pointer Algorithms

    B. Möller
    Institut für Mathematik der Universität Augsburg.
    Report Nr. 280, 1993

 

  • Towards Pointer Algebra

    B. Möller
    Institut für Mathematik der Universität Augsburg.
    Report Nr. 279, 1993

 

 

1992

  • Shorter Paths to Graph Algorithms

    B. Möller, M. Russling
    Institut für Mathematik der Universität Augsburg.
    Report Nr. 272, 1992

Suche