Výsledky vyhledávání

A Static Higher-Order Dependency Pair Framework

Autor: Fuhs, C., Kop, C.L.M., Caires, L.

Publikováno v: Caires, L. (ed.), Programming Languages and Systems: 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings, pp. 752-782
Caires, L. (ed.), Programming Languages and Systems: 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings, 752-782. Cham : Springer International Publishing
STARTPAGE=752;ENDPAGE=782;ISSN=0302-9743;TITLE=Caires, L. (ed.), Programming Languages and Systems: 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings

Contains fulltext : 204578.pdf (Publisher’s version ) (Open Access) Programming Languages and Systems: 28th European Symposium on Programming, ESOP 2019

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6b54d0cf81f562f80356a385e90c9fdf
https://hdl.handle.net/2066/204578

Zobrazit plný text záznamu

Akademický článek

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

Akademický článek

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

Making random choices invisible to the scheduler

Autor: Chatzikokolakis, K., Palamidessi, C., Caires, L., Vasconcelos, V.T.

Publikováno v: Information and Computation, 208(6), 694-715. Elsevier
Information and Computation
Information and Computation, 2010, 208 (6), pp.694-715. ⟨10.1016/j.ic.2009.06.006⟩
CONCUR 2007 – Concurrency Theory ISBN: 9783540744061
CONCUR
CONCUR'07
CONCUR'07, Sep 2007, Lisboa, Portugal. ⟨10.1007/978-3-540-74407-8_4⟩
CONCUR 2007-Concurrency Theory (18th International Conference, Lisbon, Portugal, September 3-8, 2007. Proceedings), 42-58
STARTPAGE=42;ENDPAGE=58;TITLE=CONCUR 2007-Concurrency Theory (18th International Conference, Lisbon, Portugal, September 3-8, 2007. Proceedings)

International audience; When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to resolve the nondeterminism. It has been observed that for c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::930166191fb59ab53f6addbb72fefe9d

Zobrazit plný text záznamu

Boneh-Franklin Identity Based Encryption Revisited

Autor: Galindo Chacon, D., Caires, L.

Publikováno v: Caires, L. (ed.), ICALP 2005, 791-802. Berlin etc. : Springer
STARTPAGE=791;ENDPAGE=802;TITLE=Caires, L. (ed.), ICALP 2005
Caires, L. (ed.), ICALP 2005, pp. 791-802

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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c2b8e999a5853807fe1a3d814d282551
http://hdl.handle.net/2066/33216

Zobrazit plný text záznamu

SENSORIA - D3.3A - An Overview of Techniques for Behavioural Properties

Autor: Caires L., Zawbocki A., Corradini A., Mazzanti F., Loreti M., Nielson H. R.

Publikováno v: Project report, SENSORIA, Deliverable D3.3.a, 2006

The main goal of WP3 is to coordinate the partners efforts towards the development of qualitative analysis methods for global services. In particular, this deliverable reports on the research activity carried on during the first 12 months by the SENS

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e08171fbc5acdd047be45a53feeae292
http://www.cnr.it/prodotto/i/160939

Zobrazit plný text záznamu

Orthogonal Extensions in Structural Operational Semantics

Autor: Mousavi, M.R., Reniers, M.A., Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M.

Publikováno v: Automata, Languages and Programming ISBN: 9783540275800
ICALP
Automata, Languages and Programming (Proceedings 32rd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005), 1214-1225
STARTPAGE=1214;ENDPAGE=1225;TITLE=Automata, Languages and Programming (Proceedings 32rd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005)

In this paper, we give novel and more liberal notions of operational and equational conservativity for language extensions. We motivate these notions by showing their practical application in existing formalisms. Based on our notions, we formulate an

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed5cbf471f3cad239c7c5a3fa155b83f
https://doi.org/10.1007/11523468_98

Zobrazit plný text záznamu

From primal-dual to cost shares and back : a stronger LP relaxation for the Steiner forest problem

Autor: Könemann, J., Leonardi, S., Schäfer, G., Zwam, van, S.H.M., Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M.

Publikováno v: Automata, Languages and Programming (Proceedings 32rd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005), 930-942
STARTPAGE=930;ENDPAGE=942;TITLE=Automata, Languages and Programming (Proceedings 32rd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005)
Automata, Languages and Programming ISBN: 9783540275800
ICALP

We consider a game-theoretical variant of the Steiner forest problem, in which each of k users i strives to connect his terminal pair (si, ti) of vertices in an undirected, edge-weighted graph G. In [1] a natural primal-dual algorithm was shown which

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be24830238a2a49288bac24a475fbcbe
https://research.tue.nl/nl/publications/e95701a5-09d1-4ddc-9b1e-36cc3b37d507

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání