Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Lugiez, Denis"'
Autor:
Martin, Stéphane, Lugiez, Denis
Collaborative edition is achieved by distinct sites that work independently on (a copy of) a shared document. Conflicts may arise during this process and must be solved by the collaborative editor. In pure Peer to Peer collaborative editing, no centr
Externí odkaz:
http://arxiv.org/abs/0911.0838
Autor:
Lugiez, Denis, Martin, Stéphane
Collaborative editing consists in editing a common document shared by several independent sites. This may give rise to conficts when two different users perform simultaneous uncompatible operations. Centralized systems solve this problem by using loc
Externí odkaz:
http://arxiv.org/abs/0901.4201
Autor:
Lugiez, Denis
Description de la factorisation sur Z[×] et de ses problèmes, et des différentes formes de remontées série ou parallèle, linéaire ou quadratique. On donne un algorithme nouveau basé sur la décomposition d'une fraction rationnelle
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00311763
http://tel.archives-ouvertes.fr/docs/00/31/17/63/PDF/Lugiez.Denis_1984_these.pdf
http://tel.archives-ouvertes.fr/docs/00/31/17/63/PDF/Lugiez.Denis_1984_these.pdf
Autor:
Demri, Stéphane, Lugiez, Denis
Publikováno v:
In Journal of Applied Logic 2010 8(3):233-252
Publikováno v:
In Information and Computation 2008 206(2):312-351
Publikováno v:
In Information and Computation 2007 205(4):581-623
Autor:
Lugiez, Denis, Schnoebelen, Philippe
Publikováno v:
In Information and Computation 2005 203(1):75-113
Autor:
Lugiez, Denis
Publikováno v:
In Theoretical Computer Science 2005 333(1):225-263
Publikováno v:
In Theoretical Computer Science 2003 290(1):695-740
Publikováno v:
37th IARCS Foundation on Software Technology and Theoretical Computer Science
37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩
37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩
International audience; We address the entailment problem for separation logic with symbolic heaps admitting list predicates and permissions for memory cells that are essential to express ownership of a heap region. In the permission-free case, the e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f753c5929d748b352fdce62ae44620f0