Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Rot, J.C."'
Publikováno v:
Sokolova, A. (ed.), MFPS 2021: Proceedings 37th Conference on Mathematical Foundations of Programming Semantics: Hybrid: Salzburg, Austria and Online, 30th August-2nd September, 2021, pp. 242-259
Sokolova, A. (ed.), MFPS 2021: Proceedings 37th Conference on Mathematical Foundations of Programming Semantics: Hybrid: Salzburg, Austria and Online, 30th August-2nd September, 2021, 242-259. [S.l.] : EPTCS
STARTPAGE=242;ENDPAGE=259;ISSN=2075-2180;TITLE=Sokolova, A. (ed.), MFPS 2021: Proceedings 37th Conference on Mathematical Foundations of Programming Semantics: Hybrid: Salzburg, Austria and Online, 30th August-2nd September, 2021
Sokolova, A. (ed.), MFPS 2021: Proceedings 37th Conference on Mathematical Foundations of Programming Semantics: Hybrid: Salzburg, Austria and Online, 30th August-2nd September, 2021, 242-259. [S.l.] : EPTCS
STARTPAGE=242;ENDPAGE=259;ISSN=2075-2180;TITLE=Sokolova, A. (ed.), MFPS 2021: Proceedings 37th Conference on Mathematical Foundations of Programming Semantics: Hybrid: Salzburg, Austria and Online, 30th August-2nd September, 2021
Contains fulltext : 250761.pdf (Publisher’s version ) (Open Access) MFPS 2021
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e53828654c39f9ddb0f66ad7ae90e43c
https://repository.ubn.ru.nl/handle/2066/250761
https://repository.ubn.ru.nl/handle/2066/250761
Publikováno v:
8th Conference on Algebra and Coalgebra in Computer Science, CALCO 2019, June 3-6, 2019, London, United Kingdom
Roggenbach, M. (ed.), CALCO 2019: 8th Conference on Algebra and Coalgebra in Computer Science, pp. 6:1-6:22
Roggenbach, M. (ed.), CALCO 2019: 8th Conference on Algebra and Coalgebra in Computer Science, 6:1-6:22. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
STARTPAGE=6:1;ENDPAGE=6:22;ISSN=1868-8969;TITLE=Roggenbach, M. (ed.), CALCO 2019: 8th Conference on Algebra and Coalgebra in Computer Science
Roggenbach, M. (ed.), CALCO 2019: 8th Conference on Algebra and Coalgebra in Computer Science, pp. 6:1-6:22
Roggenbach, M. (ed.), CALCO 2019: 8th Conference on Algebra and Coalgebra in Computer Science, 6:1-6:22. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
STARTPAGE=6:1;ENDPAGE=6:22;ISSN=1868-8969;TITLE=Roggenbach, M. (ed.), CALCO 2019: 8th Conference on Algebra and Coalgebra in Computer Science
We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm for these
Publikováno v:
Aceto, L. (ed.), CONCUR 2015 : 26th International Conference on Concurrency Theory, 240-253. Dagstuhl : Schloss Dagstuhl
STARTPAGE=240;ENDPAGE=253;ISSN=1868-8969;TITLE=Aceto, L. (ed.), CONCUR 2015 : 26th International Conference on Concurrency Theory
Aceto, L. (ed.), CONCUR 2015 : 26th International Conference on Concurrency Theory, pp. 240-253
26th International Conference on Concurrency Theory (CONCUR)
26th International Conference on Concurrency Theory (CONCUR), Sep 2015, Madrid, Spain. ⟨10.4230/LIPIcs.CONCUR.2015.240⟩
STARTPAGE=240;ENDPAGE=253;ISSN=1868-8969;TITLE=Aceto, L. (ed.), CONCUR 2015 : 26th International Conference on Concurrency Theory
Aceto, L. (ed.), CONCUR 2015 : 26th International Conference on Concurrency Theory, pp. 240-253
26th International Conference on Concurrency Theory (CONCUR)
26th International Conference on Concurrency Theory (CONCUR), Sep 2015, Madrid, Spain. ⟨10.4230/LIPIcs.CONCUR.2015.240⟩
International audience; Up-to techniques are useful tools for optimising proofs of behavioural equivalence of processes.Bisimulations up-to context can be safely used in any language specified by GSOS rules. Weshowed this result in a previous paper b
Publikováno v:
Esparza, J.; Murawski, A.S. (ed.), Foundations of Software Science and Computation Structures: 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, 106-123. Berlin, Heidelberg : Springer Berlin Heidelberg
STARTPAGE=106;ENDPAGE=123;ISSN=0302-9743;TITLE=Esparza, J.; Murawski, A.S. (ed.), Foundations of Software Science and Computation Structures: 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings
Esparza, J.; Murawski, A.S. (ed.), Foundations of Software Science and Computation Structures: 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, pp. 106-123
STARTPAGE=106;ENDPAGE=123;ISSN=0302-9743;TITLE=Esparza, J.; Murawski, A.S. (ed.), Foundations of Software Science and Computation Structures: 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings
Esparza, J.; Murawski, A.S. (ed.), Foundations of Software Science and Computation Structures: 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, pp. 106-123
Contains fulltext : 173176.pdf (Publisher’s version ) (Open Access)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1f4f704173df51da603762afcf084b41
http://hdl.handle.net/2066/173176
http://hdl.handle.net/2066/173176
Publikováno v:
Ahrendt, W. (ed.), Deductive Software Verification-The KeY Book-From Theory to Practice, 609-618. Cham : Springer
STARTPAGE=609;ENDPAGE=618;ISSN=0302-9743;TITLE=Ahrendt, W. (ed.), Deductive Software Verification-The KeY Book-From Theory to Practice
Ahrendt, W. (ed.), Deductive Software Verification-The KeY Book-From Theory to Practice, pp. 609-618
STARTPAGE=609;ENDPAGE=618;ISSN=0302-9743;TITLE=Ahrendt, W. (ed.), Deductive Software Verification-The KeY Book-From Theory to Practice
Ahrendt, W. (ed.), Deductive Software Verification-The KeY Book-From Theory to Practice, pp. 609-618
Item does not contain fulltext
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::95ef20860534a481b71b6957abaf2edc
http://hdl.handle.net/2066/163150
http://hdl.handle.net/2066/163150
Autor:
Rot, J.C.
Publikováno v:
IPA Dissertation Series
Coinduction, the dual of induction, is a fundamental principle for defining infinite objects and proving properties about them. The broad applicability and rapidly increasing interest in coinductive techniques is based on the theory of coalgebras, wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3f72e3741e5617d010e0eab31048b0f9
https://hdl.handle.net/1887/35814
https://hdl.handle.net/1887/35814
Publikováno v:
Milius, S.; Heckel, R. (ed.), Algebra and Coalgebra in Computer Science : 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings, 95-109. Berlin : Springer
STARTPAGE=95;ENDPAGE=109;ISSN=0302-9743;TITLE=Milius, S.; Heckel, R. (ed.), Algebra and Coalgebra in Computer Science : 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings
Logical Methods in Computer Science, 11, 2(1)-2(22)
Milius, S.; Heckel, R. (ed.), Algebra and Coalgebra in Computer Science : 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings, pp. 95-109
Logical Methods in Computer Science, 11(3)
Logical Methods in Computer Science, 11(3:2), 1-23
Logical Methods in Computer Science, 11, 3, pp. 2(1)-2(22)
Logical Methods in Computer Science, 11(3)2015
STARTPAGE=95;ENDPAGE=109;ISSN=0302-9743;TITLE=Milius, S.; Heckel, R. (ed.), Algebra and Coalgebra in Computer Science : 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings
Logical Methods in Computer Science, 11, 2(1)-2(22)
Milius, S.; Heckel, R. (ed.), Algebra and Coalgebra in Computer Science : 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings, pp. 95-109
Logical Methods in Computer Science, 11(3)
Logical Methods in Computer Science, 11(3:2), 1-23
Logical Methods in Computer Science, 11, 3, pp. 2(1)-2(22)
Logical Methods in Computer Science, 11(3)2015
Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::952db7b6d172b7fb4d14f537684b82dc
http://arxiv.org/abs/1503.02447
http://arxiv.org/abs/1503.02447
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
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
http://hdl.handle.net/2066/132704
Autor:
Rot, J.C., Bonsangue, M., Rutten, J., Boas, P. Emde, Groen, F.A., Italiano, G., Nawrocki, J., Sack, H.
Publikováno v:
Lecture Notes in Computer Science ; 7741, 369-381. Berlin : Springer
STARTPAGE=369;ENDPAGE=381;TITLE=Lecture Notes in Computer Science ; 7741
Boas, P. Emde; Groen, F.A.; Italiano, G. (ed.), SOFSEM 2013: Theory and Practice of Computer Science, pp. 369-381
Lecture Notes in Computer Science ISBN: 9783642358425
SOFSEM
STARTPAGE=369;ENDPAGE=381;TITLE=Lecture Notes in Computer Science ; 7741
Boas, P. Emde; Groen, F.A.; Italiano, G. (ed.), SOFSEM 2013: Theory and Practice of Computer Science, pp. 369-381
Lecture Notes in Computer Science ISBN: 9783642358425
SOFSEM
Bisimulation-up-to enhances the bisimulation proof method for process equivalence. We present its generalization from labelled transition systems to arbitrary coalgebras, and show that for a large class of systems, enhancements such as bisimulation u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1548b14a73f7445fbad2f22afbb0c195
http://hdl.handle.net/2066/111303
http://hdl.handle.net/2066/111303