Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Uwe Wolter"'
Autor:
Uwe Wolter
Publikováno v:
Mathematics, Vol 10, Iss 7, p 1085 (2022)
Based on a formalization of open formulas as statements in context, the paper presents a freshly new and abstract view of logics and specification formalisms. Generalizing concepts like sets of generators in Group Theory, underlying graph of a sketch
Externí odkaz:
https://doaj.org/article/004b84e7ff584eb6943fefce0c6f9d13
Autor:
Harald König, Uwe Wolter
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 2 (2018)
Fibred semantics is the foundation of the model-instance pattern of software engineering. Software models can often be formalized as objects of presheaf topoi, i.e, categories of objects that can be represented as algebras as well as coalgebras, e.g.
Externí odkaz:
https://doaj.org/article/52e4244275c0492c9e99390274998c36
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 93, Iss Proc. ACCAT 2012, Pp 61-81 (2012)
Categories in which cocones satisfy certain exactness conditions w.r.t. pullbacks are subject to current research activities in theoretical computer science. Usually, exactness is expressed in terms of properties of the pullback functor associated wi
Externí odkaz:
https://doaj.org/article/6f13622edb3748bb853dc632c8248817
Autor:
Uwe Wolter, Tam T. Truong
We revise the definition of graph operations in [WDK2018] and adapt correspondingly the construction of graph term algebras. As a first contribution to a prospective research field Universal Graph Algebra, we generalize some basic concepts and result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a21b27e5e5dd8439a47ade6ab484164
https://doi.org/10.20944/preprints202305.1187.v1
https://doi.org/10.20944/preprints202305.1187.v1
Autor:
Radoslav K. Zamanov, Kiril A. Stoyanov, Dragomir Marchev, Nikolay A. Tomov, Uwe Wolter, Michael F. Bode, Yanko M. Nikolov, Stefan Y. Stefanov, Alexander Kurtenkov, Georgi Y. Latev
We present new spectroscopic observations of the Be/black hole binary MWC 656 obtained during the period 2015 - 2021. We measure the equivalent width of H$\alpha$ (EW$_\alpha$), H$\beta$ ($EW_\beta$), and the distance between the peaks of H$\alpha$ (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56bf4509304f0b30c64cf8e8c43d58e9
http://arxiv.org/abs/2206.06013
http://arxiv.org/abs/2206.06013
Autor:
Harald König, Uwe Wolter
Publikováno v:
Theoretical Aspects of Software Engineering ISBN: 9783031103629
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::126386e27d801e229ecd1ea7bf4d78e5
https://doi.org/10.1007/978-3-031-10363-6_21
https://doi.org/10.1007/978-3-031-10363-6_21
Publikováno v:
Journal of Logical and Algebraic Methods in Programming
Multilevel Modelling (MLM) approaches make it possible for designers and modellers to work with an unlimited number of abstraction levels to specify their domain-specific modelling languages (DSMLs). To fully exploit MLM techniques, we need powerful
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ec11236ef97b729ceea7b11aa308638
https://hdl.handle.net/11250/3058751
https://hdl.handle.net/11250/3058751
Autor:
Harald Konig, Uwe Wolter
Multilevel Modelling approaches allow for an arbitrary number of abstraction levels in typing chains. In this paper, a transformation of a multi-level typing chain into a single all-covering representing model is proposed. This comprehensive model is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::410963d3bebc121cc9edc13f277c8cf9
https://hdl.handle.net/11250/2989326
https://hdl.handle.net/11250/2989326
Publikováno v:
Graph Transformation ISBN: 9783030513719
ICGT
ICGT
Multilevel modeling extends traditional modeling techniques with a potentially unlimited number of abstraction levels. Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are carried out by m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f205e532875fd9cb2c659cbc18e665b
https://doi.org/10.1007/978-3-030-51372-6_10
https://doi.org/10.1007/978-3-030-51372-6_10
Publikováno v:
Electronical Notes in Theoretical Computer Science
LSFA
LSFA
Indexed and fibred categorical concepts are widely used in computer science as models of logical systems and type theories. Here we focus on Hoare logic and show that a comprehensive categorical analysis of its axiomatic semantics needs the languages
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42b634855cb8b76f545633aedd62d427
https://hdl.handle.net/11250/2761610
https://hdl.handle.net/11250/2761610