Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Aubert, Clément"'
To refine formal methods for concurrent systems, there are several ways of enriching classical operational semantics of process calculi. One can enable the auditing and undoing of past synchronisations thanks to communication keys, thus easing the st
Externí odkaz:
http://arxiv.org/abs/2410.14699
Publikováno v:
EPTCS 383, 2023
This volume contains the proceedings of ICE'23, the 16th Interaction and Concurrency Experience, which was held at the NOVA University in Lisbon, Portugal, as a satellite event of DisCoTec'22. The ICE workshop series features a distinguishing review
Externí odkaz:
http://arxiv.org/abs/2308.08920
Publikováno v:
EPTCS 368, 2022, pp. 3-22
This paper shows how we can make use of an asynchronous transition system, whose transitions are labelled with events and which is equipped with a notion of independence of events, to define non-interleaving semantics for the applied $\pi$-calculus.
Externí odkaz:
http://arxiv.org/abs/2209.05231
Publikováno v:
EPTCS 365, 2022
This volume contains the proceedings of ICE'22, the 15th Interaction and Concurrency Experience, which was held as an hybrid event in Lucca, Italy, and as a satellite event of DisCoTec'22. The ICE workshop series features a distinguishing review and
Externí odkaz:
http://arxiv.org/abs/2208.04086
This work explores an unexpected application of Implicit Computational Complexity (ICC) to parallelize loops in imperative programs. Thanks to a lightweight dependency analysis, our algorithm allows splitting a loop into multiple loops that can be ru
Externí odkaz:
http://arxiv.org/abs/2206.08760
This abstract aims at presenting an ongoing effort to apply a novel typing mechanism stemming from Implicit Computational Complexity (ICC), that tracks dependencies between variables in three different ways, at different stages of maturation.The firs
Externí odkaz:
http://arxiv.org/abs/2203.05221
Implicit Computational Complexity (ICC) drives better understanding of complexity classes, but it also guides the development of resources-aware languages and static source code analyzers. Among the methods developed, the mwp-flow analysis certifies
Externí odkaz:
http://arxiv.org/abs/2203.03943
Autor:
Aubert, Clément
Reversible computation is key in developing new, energy-efficient paradigms, but also in providing forward-only concepts with broader definitions and finer frames of study.Among other fields, the algebraic specification and representation of networks
Externí odkaz:
http://arxiv.org/abs/2110.12697
Complexity analysis offers assurance of program's runtime behavior, but large classes of programs remain unanalyzable by existing automated techniques.The mwp-flow analysis sidesteps many difficulties shared by existing approaches, and offers interes
Externí odkaz:
http://arxiv.org/abs/2107.00097
We improve and refine a method for certifying that the values' sizes computed by an imperative program will be bounded by polynomials in the program's inputs' sizes. Our work ''tames'' the non-determinism of the original analysis, and offers an innov
Externí odkaz:
http://arxiv.org/abs/2107.00086