Completeness and Incompleteness of Synchronous Kleene Algebra

Autor: Wagemaker, J., Bonsangue, M., Kappé, T., Rot, J., Silva, A., Hutton, G.

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030336356
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Mathematics of Program Construction
Hutton, G. (ed.), Mathematics of Program Construction: 13th International Conference, MPC 2019, Porto, Portugal, October 7–9, 2019. Proceedings, 385-413. Cham : Springer International Publishing
STARTPAGE=385;ENDPAGE=413;ISSN=0302-9743;TITLE=Hutton, G. (ed.), Mathematics of Program Construction: 13th International Conference, MPC 2019, Porto, Portugal, October 7–9, 2019. Proceedings
Mathematics of Program Construction-13th International Conference, MPC 2019, Porto, Portugal, October 7–9, 2019, Proceedings
Hutton, G. (ed.), Mathematics of Program Construction: 13th International Conference, MPC 2019, Porto, Portugal, October 7–9, 2019. Proceedings, pp. 385-413

Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lock-step. We provide a countermodel witnessing that the axioms of SKA a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::199495cc5e76799bb37abbd089907f2a
https://doi.org/10.1007/978-3-030-33636-3_14

Moessner’s Theorem: An Exercise in Coinductive Reasoning in Coq

Autor: Krebbers, R., Parlant, L., Silva, A., Ábrahám, E., Bonsangue, M., Johnsen, B.E.

Publikováno v: Ábrahám, E.; Bonsangue, M.; Johnsen, B.E. (ed.), Theory and Practice of Formal Methods: Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday, pp. 309-324
Ábrahám, E.; Bonsangue, M.; Johnsen, B.E. (ed.), Theory and Practice of Formal Methods: Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday, 309-324. Cham : Springer International Publishing
STARTPAGE=309;ENDPAGE=324;ISSN=0302-9743;TITLE=Ábrahám, E.; Bonsangue, M.; Johnsen, B.E. (ed.), Theory and Practice of Formal Methods: Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday

Contains fulltext : 159576.pdf (Author’s version preprint ) (Open Access)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4d88fcf35ee1dba3cf1efe8554293247
https://hdl.handle.net/2066/159576

Formal Frameworks for Verifying Normative Multi-agent Systems

Autor: Knobbout, M., Dastani, M.M., Meyer, J.J.C., Ábrahám, E., Bonsangue, M., Johnsen, E.B.

In this paper we concern ourselves with normative multi-agent systems, which are multi-agent systems governed by a set of norms. In these systems, the internals and architecture of the participating agents may be unknown to us, which disables us to m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______101::ed6b43b252cbab42ba5e5318e1249170
https://dspace.library.uu.nl/handle/1874/343758

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

A Coalgebraic Foundation for Coinductive Union Types

Autor: Bonsangue, M., Rot, J.C., Ancona, D., Boer, F. de, Rutten, J., Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E.

Publikováno v: Lecture Notes in Computer Science ; 8573, 62-73. Berlin : Springer
STARTPAGE=62;ENDPAGE=73;TITLE=Lecture Notes in Computer Science ; 8573
Automata, Languages, and Programming ISBN: 9783662439500
ICALP (2)
Esparza, J.; Fraigniaud, P.; Husfeldt, T. (ed.), Automata, Languages, and Programming, pp. 62-73

This paper introduces a coalgebraic foundation for coinductive types, interpreted as sets of values and extended with set theoretic union. We give a sound and complete characterization of semantic subtyping in terms of inclusion of maximal traces. Fu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5de3ffed4bb63b50402c89165313d24b
http://hdl.handle.net/2066/132704