Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Elena Giachino"'
Autor:
Frank S. de Boer, Elena Giachino, Stijn de Gouw, Reiner Hähnle, Einar Broch Johnsen, Cosimo Laneve, Ka I Pun, Gianluigi Zavattaro
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 302, Iss Proc. VORTEX 2018, Pp 1-15 (2019)
Service Level Agreements (SLA) are commonly used to specify the quality attributes between cloud service providers and the customers. A violation of SLAs can result in high penalties. To allow the analysis of SLA compliance before the services are de
Externí odkaz:
https://doaj.org/article/e44f7e5d117948708eb464eb2889f50e
Publikováno v:
PPDP
21st International Symposium on Principles and Practice of Programming Languages 2019
21st International Symposium on Principles and Practice of Programming Languages 2019, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3356340⟩
21st International Symposium on Principles and Practice of Programming Languages 2019
21st International Symposium on Principles and Practice of Programming Languages 2019, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3356340⟩
International audience
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2017, 256, pp.253-286. ⟨10.1016/j.ic.2017.06.002⟩
Principles and Practice of Declarative Programming, PPDP'12
Principles and Practice of Declarative Programming, PPDP'12, 2012, Unknown, pp.139--150
Information and Computation, 2017, 256, pp.253-286. ⟨10.1016/j.ic.2017.06.002⟩
PPDP
Information and Computation, Elsevier, 2017, 256, pp.253-286. ⟨10.1016/j.ic.2017.06.002⟩
Principles and Practice of Declarative Programming, PPDP'12
Principles and Practice of Declarative Programming, PPDP'12, 2012, Unknown, pp.139--150
Information and Computation, 2017, 256, pp.253-286. ⟨10.1016/j.ic.2017.06.002⟩
PPDP
International audience; Session types are a formalism to model structured communication-based programming. A session type describes communication by specifying the type and direction of data exchanged between two parties. When session types and sessi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84d59e39fd576b8b5c0b707ca4fe8624
https://hal.inria.fr/hal-01647086
https://hal.inria.fr/hal-01647086
Publikováno v:
Journal of Logical and Algebraic Methods in Programming
Journal of Logical and Algebraic Methods in Programming, 2017, 88, pp.99-120. ⟨10.1016/j.jlamp.2016.09.003⟩
Journal of Logical and Algebraic Methods in Programming, Elsevier, 2017, 88, pp.99-120. ⟨10.1016/j.jlamp.2016.09.003⟩
Journal of Logical and Algebraic Methods in Programming, 2017, 88, pp.99-120. ⟨10.1016/j.jlamp.2016.09.003⟩
Journal of Logical and Algebraic Methods in Programming, Elsevier, 2017, 88, pp.99-120. ⟨10.1016/j.jlamp.2016.09.003⟩
none 4 no Available online 20 September 2016 Rollback is a fundamental technique for ensuring reliability of systems, allowing one, in case of troubles, to recover a past system state. However, the definition of rollback in a concurrent/distributed s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f559420c648af008491775b010a0f5a
https://inria.hal.science/hal-01633260
https://inria.hal.science/hal-01633260
Autor:
Davide Ancona, Viviana Bono, Mario Bravetti, Joana Campos, Giuseppe Castagna, Pierre-Malo Deniélou, Simon J. Gay, Nils Gesbert, Elena Giachino, Raymond Hu, Einar Broch Johnsen, Francisco Martin, Viviana Mascardi, Fabrizi Montesi
A recent trend in programming language research is to use behavioral type theory to ensure various correctness properties of large-scale, communication-intensive systems. Behavioral types encompass concepts such as interfaces, communication protocols
Publikováno v:
CONCUR 2014-Concurrency Theory-25th International Conference
CONCUR 2014-Concurrency Theory-25th International Conference, Sep 2014, Rome, Italy. pp.63-77, ⟨10.1007/978-3-662-44584-6_6⟩
CONCUR 2014 – Concurrency Theory ISBN: 9783662445839
CONCUR
CONCUR 2014-Concurrency Theory-25th International Conference, Sep 2014, Rome, Italy. pp.63-77, ⟨10.1007/978-3-662-44584-6_6⟩
CONCUR 2014 – Concurrency Theory ISBN: 9783662445839
CONCUR
International audience; Deadlock detection in concurrent programs that create networks with arbitrary numbers of nodes is extremely complex and solutions either give im-precise answers or do not scale. To enable the analysis of such programs, (1) we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bb53c6c1435427e5c792b8dfa114ead
https://hal.inria.fr/hal-01091749/file/mfd.pdf
https://hal.inria.fr/hal-01091749/file/mfd.pdf
Publikováno v:
PPDP 2016 18th International Symposium on Principles and Practice of Declarative Programming
PPDP 2016 18th International Symposium on Principles and Practice of Declarative Programming, Sep 2016, Edinburgh, United Kingdom
PPDP
PPDP 2016 18th International Symposium on Principles and Practice of Declarative Programming, Sep 2016, Edinburgh, United Kingdom
PPDP
International audience; We study deadlock detection in an actor model with wait-by-necessity synchronizations, a lightweight technique that synchronizes invocations when the corresponding values are strictly needed. This approach relies on the use of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0049aa28fca1a77ba37fb013271cbeb8
https://hal.inria.fr/hal-01345315/file/gASP-FULL.pdf
https://hal.inria.fr/hal-01345315/file/gASP-FULL.pdf
Publikováno v:
Fundamental Approaches to Software Engineering ISBN: 9783642548031
FASE
FASE 2014
FASE 2014, Apr 2014, Grenoble, France. pp.370-384, ⟨10.1007/978-3-642-54804-8_26⟩
Web of Science
FASE
FASE 2014
FASE 2014, Apr 2014, Grenoble, France. pp.370-384, ⟨10.1007/978-3-642-54804-8_26⟩
Web of Science
International audience; Reversible debugging provides developers with a way to execute their applications both forward and backward, seeking the cause of an unexpected or undesired event. In a concurrent setting, reversing actions in the exact revers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b16638d6eca668624ec78df7f1e50bd5
https://doi.org/10.1007/978-3-642-54804-8_26
https://doi.org/10.1007/978-3-642-54804-8_26
Autor:
Elena Giachino, Cosimo Laneve
Publikováno v:
Formal Methods for Executable Software Models-14th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, {SFM} 2014
Formal Methods for Executable Software Models-14th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, 2014, Jun 2014, Bertinoro, Italy. pp.26-64, ⟨10.1007/978-3-319-07317-0_2⟩
Lecture Notes in Computer Science ISBN: 9783319073163
SFM
Formal Methods for Executable Software Models-14th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, {SFM} 2014, Jun 2014, Bertinoro, Italy. pp.26-64, ⟨10.1007/978-3-319-07317-0_2⟩
Formal Methods for Executable Software Models-14th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, 2014, Jun 2014, Bertinoro, Italy. pp.26-64, ⟨10.1007/978-3-319-07317-0_2⟩
Lecture Notes in Computer Science ISBN: 9783319073163
SFM
Formal Methods for Executable Software Models-14th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, {SFM} 2014, Jun 2014, Bertinoro, Italy. pp.26-64, ⟨10.1007/978-3-319-07317-0_2⟩
International audience; Deadlock detection in recursive programs that admit dy-namic resource creation is extremely complex and solutions either give imprecise answers or do not scale. We define an algorithm for detecting deadlocks of linear recursiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f9efe9a70a80b9f5e82698fd7270ad6
http://hdl.handle.net/11585/413998
http://hdl.handle.net/11585/413998
Publikováno v:
Journal of Logical and Algebraic Methods in Programming
Journal of Logical and Algebraic Methods in Programming, Elsevier, 2016, ⟨10.1016/j.jlamp.2016.03.002⟩
Journal of Logical and Algebraic Methods in Programming, 2016, ⟨10.1016/j.jlamp.2016.03.002⟩
Journal of Logical and Algebraic Methods in Programming, Elsevier, 2016, ⟨10.1016/j.jlamp.2016.03.002⟩
Journal of Logical and Algebraic Methods in Programming, 2016, ⟨10.1016/j.jlamp.2016.03.002⟩
International audience; In this paper we propose a new mechanism for Dynamic Rebinding, a particular kind of Dynamic Software Updating that focuses on modifying the workflow of a program. This mechanism is built upon the concurrency model of Concurre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36cbcc52d68cea103780649adf7c5256
https://hal.inria.fr/hal-01337333
https://hal.inria.fr/hal-01337333