Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Peter Höfner"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 255, Iss Proc. EXPRESS/SOS 2017, Pp 18-34 (2017)
In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar process algebras lack the expressive power to accurately capture mutual exclusion protocols without enriching the language with fairness assumptions. Adding a fairn
Externí odkaz:
https://doaj.org/article/493e819474ce4368bb44caac0b3edc06
Autor:
Rob van Glabbeek, Peter Höfner
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 244, Iss Proc. MARS 2017, Pp 14-52 (2017)
We present a formal model for a fragmentation and a reassembly protocol running on top of the standardised CAN bus, which is widely used in automotive and aerospace applications. Although the CAN bus comes with an in-built mechanism for prioritisatio
Externí odkaz:
https://doaj.org/article/b6ae90a72a0842a7ba109a522b6b88dc
Publikováno v:
Acta Informatica. 57:305-311
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62cf64eadec873c78ea18f82da8a0646
https://doi.org/10.1007/s00236-020-00382-7
https://doi.org/10.1007/s00236-020-00382-7
Publikováno v:
FOSD@GPCE
A feature interaction algebra (FIA) is an abstract model of features, feature interactions, and their compositions. A structured document algebra (SDA) defines modules with variation points and how such modules compose. We present both FIA and SDA in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5014fba525aa61ea4ed57ede2a7a7077
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/91213
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/91213
Autor:
Peter Höfner, Rob van Glabbeek
Publikováno v:
ACM Computing Surveys. 52:1-38
Fairness assumptions are a valuable tool when reasoning about systems. In this article, we classify several fairness properties found in the literature and argue that most of them are too restrictive for many applications. As an alternative, we intro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95f3645b1655ee3480ec82880135bd6b
https://doi.org/10.1145/3329125
https://doi.org/10.1145/3329125
Autor:
Richard Bird, Jeremy Gibbons, Ralf Hinze, Peter Höfner, Johan Jeuring, Lambert Meertens, Bernhard Möller, Carroll Morgan, Tom Schrijvers, Wouter Swierstra, Nicolas Wu
Publikováno v:
Advancing Research in Information and Communication Technology
Advancing Research in Information and Communication Technology, AICT-600, pp.59-98, 2021, ⟨10.1007/978-3-030-81701-5_3⟩
IFIP Advances in Information and Communication Technology ISBN: 9783030817008
Advancing Research in Information and Communication Technology, AICT-600, pp.59-98, 2021, ⟨10.1007/978-3-030-81701-5_3⟩
IFIP Advances in Information and Communication Technology ISBN: 9783030817008
TC 2: Software: Theory and Practice; International audience; Algorithmics is the study and practice of taking a high-level description of a program’s purpose and, from it, producing an executable program of acceptable efficiency. Each step in that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3956660967d810a18e7fa6c99ee9c78c
https://hal.inria.fr/hal-03325977
https://hal.inria.fr/hal-03325977
Publikováno v:
Relational and Algebraic Methods in Computer Science ISBN: 9783030887001
RAMiCS
RAMiCS
We study convolution and residual operations within convolution quantales of maps from partial abelian semigroups and effect algebras into value quantales, thus generalising separating conjunction and implication of separation logic to quantitative s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28fd208f2c63b59f9cc584e7b0afa9da
https://doi.org/10.1007/978-3-030-88701-8_3
https://doi.org/10.1007/978-3-030-88701-8_3
Publikováno v:
LICS
We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix a minimal session calculus and systematically take into account all known fairness assumpti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::162be2d6747abda4e532b516d2ce78a8
Publikováno v:
MARS@ETAPS
Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a651ad9f27dcee221c33c07f2863585e
http://arxiv.org/abs/2004.13285
http://arxiv.org/abs/2004.13285
Publikováno v:
MARS@ETAPS
We present three formal models of the OSPF routing protocol. The first two are formalised in the timed process algebra T-AWN, which is not only tailored to routing protocols, but also specifies protocols in pseudo-code that is easily readable. The di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b1ddb625221ec232c1d25d73d306b59