Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Möller, Bernhard (Prof. Dr.)"'
Preferences allow more flexible and personalised queries in database systems. Evaluation of such a query means to select the maximal elements from the respective database w.r.t. to the preference, which is a partial strict-order. We present a point-f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::097117ad24da3bf390074117879241ae
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/2382
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/2382
Separation logic (SL) is an extension of Hoare logic by operations and formulas to reason more flexibly about heap portions or, more concretely, about linked object/record structures. In the present paper we give an algebraic extension of SL at the d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::f6f61c0a9f5fdac5afc180276529c583
https://opus.bibliothek.uni-augsburg.de/opus4/files/2370/TR2013_07.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/2370/TR2013_07.pdf
In 2011, simple and concise axioms for feature compositions, interactions and products have been proposed by Batory et al. They were mainly inspired by Kästner’s Colored IDE (CIDE) as well as by experience in feature oriented programming over the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::7dc3bb44ae37e01b938b644ae2d91502
https://opus.bibliothek.uni-augsburg.de/opus4/files/2115/TR_2012_06.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/2115/TR_2012_06.pdf
A common approach to dealing with software requirements volatility is to define product families instead of single products. In earlier papers we have developed an algebra of such families that, roughly, consists in a more abstract view of and-or tre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::a0be9be8c6933f85cc9789dfbcaa3e17
https://opus.bibliothek.uni-augsburg.de/opus4/files/1578/TR_2010_13.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/1578/TR_2010_13.pdf
In computer science fixpoints play a crucial role. Most often least and greatest fixpoints are sufficient. However there are situations where other ones are needed. In this paper we study, on an algebraic base, a special fixpoint of the function f(x)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::967d5a78a8346cae90114d213c26d539
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/1449
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/1449
We present an algebraic approach to separation logic. In particular, we give algebraic characterisations for all constructs of separation logic like assertions and commands. The algebraic view does not only yield new insights on separation logic but
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::870e7bee344ff8c2ed08be71684ab8c5
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/1300
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/1300
Hybrid systems are heterogeneous systems characterised by the interaction of discrete and continuous dynamics. We present a trajectory-based algebraic model for describing hybrid systems; the trajectories used are closely related to streams. The alge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::f9daf080ac8808386c8a251aa071b711
https://opus.bibliothek.uni-augsburg.de/opus4/files/901/TR_2007_08.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/901/TR_2007_08.pdf
This volume contains the tutorial materials and the contributed extended abstracts of the PhD Programme at the 10th International Conference on Relational Methods in Computer Science (RelMiCS10) and the 5th International Conference on Applications of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::4e206fcf402be383801f1987169ab170
https://opus.bibliothek.uni-augsburg.de/opus4/files/908/TR_2008_04.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/908/TR_2008_04.pdf
We generalise the designs of Unifying Theories of Programming (UTP) by defining them as matrices over semirings with ideals. This clarifies the algebraic structure of designs and considerably simplifies reasoning about them, e.g., forming a Kleene an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::4ac5c549e900a99dfd5b1d343fcc8e7c
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/445
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/445
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noetherity, Löb's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings, which are addi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::a4e1f68755c5cce7b21eb030bbd74744
https://opus.bibliothek.uni-augsburg.de/opus4/files/420/tr-2006-23_des_moe_str.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/420/tr-2006-23_des_moe_str.pdf