Zobrazeno 1 - 5
of 5
pro vyhledávání: '"van der Wall, Sören"'
Autor:
van der Wall, Sören, Meyer, Roland
We address the problem of preserving non-interference across compiler transformations under speculative semantics. We develop a proof method that ensures the preservation uniformly across all source programs. The basis of our proof method is a new fo
Externí odkaz:
http://arxiv.org/abs/2407.15080
We propose urgency programs, a new programming model with support for alternation, imperfect information, and recursion. The novelty are urgency annotations that decorate the (angelic and demonic) choice operators and control the order in which alter
Externí odkaz:
http://arxiv.org/abs/2305.02967
Autor:
Becker, Mike, Meyer, Roland, Runge, Tobias, Schaefer, Ina, van der Wall, Sören, Wolff, Sebastian
Intensive testing using model-based approaches is the standard way of demonstrating the correctness of automotive software. Unfortunately, state-of-the-art techniques leave a crucial and labor intensive task to the test engineer: identifying bugs in
Externí odkaz:
http://arxiv.org/abs/2208.14290
We propose a new programming model with support for alternation, imperfect information, and recursion. We model imperfect information with the novel programming construct of urgency annotations that decorate the (angelic and~demonic) choice operators
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b9eeda035b9422da309f95d9bd2522d
Autor:
Meyer, Roland, van der Wall, Sören
We study the influence of parameters like the number of contexts, phases, and stacks on the complexity of solving parity games over concurrent recursive programs. Our first result shows that k-context games are b-EXPTIME-complete, where b = max{k-2,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c4e91df2ddd7bc5ccf02fb8037bcf50