Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Petrisan, D.L."'
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:
Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic, pp. 374-389
Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic, 374-389. Dagstuhl : Schloss Dagstuhl
STARTPAGE=374;ENDPAGE=389;ISSN=1868-8969;TITLE=Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic
Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic, 374-389. Dagstuhl : Schloss Dagstuhl
STARTPAGE=374;ENDPAGE=389;ISSN=1868-8969;TITLE=Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic
We examine the key syntactic and semantic aspects of a nominal framework allowing scopes of name bindings to be arbitrarily interleaved. Name binding (e.g. delta x.M) is handled by explicit name-creation and name-destruction brackets (e.g. ) which ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6a482f0bbc08f88ce983b9b8c5958f8
https://hdl.handle.net/2066/143746
https://hdl.handle.net/2066/143746
Publikováno v:
Moss, L. (ed.), CALCO 2015 : 6th Conference on Algebra and Coalgebra in Computer Science, pp. 205-220
Moss, L. (ed.), CALCO 2015 : 6th Conference on Algebra and Coalgebra in Computer Science, 205-220. Dagstuhl : Schloss Dagstuhl
STARTPAGE=205;ENDPAGE=220;ISSN=1868-8969;TITLE=Moss, L. (ed.), CALCO 2015 : 6th Conference on Algebra and Coalgebra in Computer Science
Moss, L. (ed.), CALCO 2015 : 6th Conference on Algebra and Coalgebra in Computer Science, 205-220. Dagstuhl : Schloss Dagstuhl
STARTPAGE=205;ENDPAGE=220;ISSN=1868-8969;TITLE=Moss, L. (ed.), CALCO 2015 : 6th Conference on Algebra and Coalgebra in Computer Science
The question addressed in this paper is how to correctly approximate infinite data given by systems of simultaneous corecursive definitions. We devise a categorical framework for reasoning about regular datatypes, that is, datatypes closed under prod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37eb93bbbcedc39e1ee68e79d9eb91b8
https://hdl.handle.net/2066/147298
https://hdl.handle.net/2066/147298
Publikováno v:
Technical Report ; 1813/39108. Cornell : Computing and Information Science
Technical Report ; 1813/39108
Technical Report ; 1813/39108
Contains fulltext : 141320.pdf (Author’s version preprint ) (Open Access) 1 p.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2cb2a183d88c2b9be9fdb28d7aa12858
https://hdl.handle.net/2066/141320
https://hdl.handle.net/2066/141320
Autor:
Kozen, D., Mamouras, K., Petrisan, D.L., Silva, A., Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B.
Publikováno v:
Halldórsson, M.M.; Iwama, K.; Kobayashi, N. (ed.), Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, pp. 286-298
Lecture Notes in Computer Science ; 9135, 286-298. Berlin : Springer
STARTPAGE=286;ENDPAGE=298;TITLE=Lecture Notes in Computer Science ; 9135
Automata, Languages, and Programming ISBN: 9783662476659
ICALP (2)
Lecture Notes in Computer Science ; 9135, 286-298. Berlin : Springer
STARTPAGE=286;ENDPAGE=298;TITLE=Lecture Notes in Computer Science ; 9135
Automata, Languages, and Programming ISBN: 9783662476659
ICALP (2)
We develop the coalgebraic theory of nominal Kleene algebra, including an alternative language-theoretic semantics, a nominal extension of the Brzozowski derivative, and a bisimulation-based decision procedure for the equational theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::914d892eb4eabd880853438919f35f73
https://hdl.handle.net/2066/143757
https://hdl.handle.net/2066/143757