default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉtienne Lozes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Cinzia Di Giusto
, Laetitia Laversa, Étienne Lozes:
Guessing the Buffer Bound for k-Synchronizability. Int. J. Found. Comput. Sci. 34(8): 1051-1076 (2023)- [j16]Cinzia Di Giusto, Loïc Germerie Guizouarn, Étienne Lozes:
Multiparty half-duplex systems and synchronous communications. J. Log. Algebraic Methods Program. 131: 100843 (2023) - [j15]Alain Finkel, Étienne Lozes:
Synchronizability of Communicating Finite State Machines is not Decidable. Log. Methods Comput. Sci. 19(4) (2023) - [j14]Cinzia Di Giusto, Davide Ferré, Laetitia Laversa, Étienne Lozes:
A Partial Order View of Message-Passing Communication Models. Proc. ACM Program. Lang. 7(POPL): 1601-1627 (2023) - [c35]Cinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse:
Weakly Synchronous Systems with Three Machines Are Turing Powerful. RP 2023: 28-41 - [i10]Cinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse:
Weakly synchronous systems with three machines are Turing powerful. CoRR abs/2308.10578 (2023) - 2022
- [c34]Florian Bruse, Martin Lange, Étienne Lozes:
The Tail-Recursive Fragment of Timed Recursive CTL. TIME 2022: 5:1-5:16 - [i9]Cinzia Di Giusto, Davide Ferré, Laetitia Laversa, Étienne Lozes:
A non-sequential hierarchy of message-passing models. CoRR abs/2210.13062 (2022) - 2021
- [j13]Florian Bruse, Martin Lange, Étienne Lozes:
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic. Fundam. Informaticae 178(1-2): 1-30 (2021) - [j12]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
A Complete Axiomatisation for Quantifier-Free Separation Logic. Log. Methods Comput. Sci. 17(3) (2021) - [j11]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic. ACM Trans. Comput. Log. 22(2): 14:1-14:56 (2021) - [c33]Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh:
A Unifying Framework for Deciding Synchronizability. CONCUR 2021: 14:1-14:18 - [c32]Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
Guessing the Buffer Bound for k-Synchronizability. CIAA 2021: 102-114 - [c31]Cinzia Di Giusto, Loïc Germerie Guizouarn, Étienne Lozes:
Towards Generalised Half-Duplex Systems. ICE 2021: 22-37 - [i8]Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
Guessing the buffer bound for k-synchronizability. CoRR abs/2104.14408 (2021) - 2020
- [c30]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
Internal Calculi for Separation Logics. CSL 2020: 19:1-19:18 - [c29]Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
On the k-synchronizability of Systems. FoSSaCS 2020: 157-176 - [i7]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
A Complete Axiomatisation for Quantifier-Free Separation Logic. CoRR abs/2006.05156 (2020)
2010 – 2019
- 2019
- [i6]Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
On the k-synchronizability for mailbox systems. CoRR abs/1909.01627 (2019) - [i5]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
Internal Calculi for Separation Logics. CoRR abs/1910.05016 (2019) - 2018
- [j10]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Multi-buffer simulations: Decidability and complexity. Inf. Comput. 262: 280-310 (2018) - [c28]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Propositional Separation Logic. FoSSaCS 2018: 476-493 - [i4]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Propositional Separation Logic. CoRR abs/1810.05410 (2018) - 2017
- [c27]Stéphane Demri, Étienne Lozes, Denis Lugiez:
On Symbolic Heaps Modulo Permission Theories. FSTTCS 2017: 25:1-25:14 - [c26]Alain Finkel, Étienne Lozes:
Synchronizability of Communicating Finite State Machines is not Decidable. ICALP 2017: 122:1-122:14 - [c25]Naoki Kobayashi, Étienne Lozes, Florian Bruse:
On the relationship between higher-order recursion schemes and higher-order fixpoint logic. POPL 2017: 246-259 - [c24]Florian Bruse, Martin Lange, Étienne Lozes:
Space-Efficient Fragments of Higher-Order Fixpoint Logic. RP 2017: 26-41 - [i3]Alain Finkel, Étienne Lozes:
Synchronizability of Communicating Finite State Machines is not Decidable. CoRR abs/1702.07213 (2017) - 2016
- [c23]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Two-Buffer Simulation Games. Cassting/SynCoP 2016: 27-38 - [c22]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Multi-Buffer Simulations for Trace Language Inclusion. GandALF 2016: 213-227 - 2015
- [j9]Étienne Lozes, Jules Villard:
Shared contract-obedient channels. Sci. Comput. Program. 100: 28-60 (2015) - [c21]Martin Lange, Étienne Lozes:
Conjunctive Visibly-Pushdown Path Queries. FCT 2015: 327-338 - [c20]Étienne Lozes:
A Type-Directed Negation Elimination. FICS 2015: 132-142 - 2014
- [j8]Martin Lange, Étienne Lozes, Manuel Vargas Guzmán:
Model-checking process equivalences. Theor. Comput. Sci. 560: 326-347 (2014) - [c19]Martin Lange, Étienne Lozes:
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic. IFIP TCS 2014: 90-103 - [c18]Milka Hutagalung, Martin Lange, Étienne Lozes:
Buffered Simulation Games for Büchi Automata. AFL 2014: 286-300 - 2013
- [c17]Milka Hutagalung, Martin Lange, Étienne Lozes:
Revealing vs. Concealing: More Simulation Games for Büchi Inclusion. LATA 2013: 347-358 - 2012
- [j7]Rémi Brochenin, Stéphane Demri, Étienne Lozes:
On the almighty wand. Inf. Comput. 211: 106-137 (2012) - [c16]Étienne Lozes, Jules Villard:
Shared Contract-Obedient Endpoints. ICE 2012: 17-31 - [c15]Martin Lange, Étienne Lozes:
Model-Checking the Higher-Dimensional Modal mu-Calculus. FICS 2012: 39-46 - [c14]Martin Lange, Étienne Lozes, Manuel Vargas Guzmán:
Model-Checking Process Equivalences. GandALF 2012: 43-56 - 2011
- [c13]Florent Jacquemard, Étienne Lozes, Ralf Treinen, Jules Villard:
Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus. TOSCA 2011: 166-185 - [c12]Étienne Lozes, Jules Villard:
Reliable Contracts for Unreliable Half-Duplex Communications. WS-FM 2011: 2-16 - 2010
- [j6]Étienne Lozes, Jules Villard:
A spatial equational logic for the applied pi-calculus. Distributed Comput. 23(1): 61-83 (2010) - [c11]Jules Villard, Étienne Lozes, Cristiano Calcagno:
Tracking Heaps That Hop with Heap-Hop. TACAS 2010: 275-279
2000 – 2009
- 2009
- [j5]Rémi Brochenin, Stéphane Demri, Étienne Lozes:
Reasoning about sequences of memory states. Ann. Pure Appl. Log. 161(3): 305-323 (2009) - [c10]Jules Villard, Étienne Lozes, Cristiano Calcagno:
Proving Copyless Message Passing. APLAS 2009: 194-209 - [c9]Kshitij Bansal, Rémi Brochenin, Étienne Lozes:
Beyond Shapes: Lists with Ordered Data. FoSSaCS 2009: 425-439 - 2008
- [j4]Étienne Lozes, Daniel Hirschkoff, Davide Sangiorgi:
Separability in the Ambient Logic. Log. Methods Comput. Sci. 4(3) (2008) - [c8]Étienne Lozes, Jules Villard:
A Spatial Equational Logic for the Applied pi-Calculus. CONCUR 2008: 387-401 - [c7]Rémi Brochenin, Stéphane Demri, Étienne Lozes:
On the Almighty Wand. CSL 2008: 323-338 - [i2]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Separability in the Ambient Logic. CoRR abs/0806.3849 (2008) - 2007
- [c6]Alain Finkel, Étienne Lozes, Arnaud Sangnier:
Towards Model-Checking Programs with Lists. ILC 2007: 56-86 - [c5]Rémi Brochenin, Stéphane Demri, Étienne Lozes:
Reasoning About Sequences of Memory States. LFCS 2007: 100-114 - 2006
- [j3]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
On the Expressiveness of the Ambient Logic. Log. Methods Comput. Sci. 2(2) (2006) - [j2]Luís Caires, Étienne Lozes:
Elimination of quantifiers and undecidability in spatial logics for concurrency. Theor. Comput. Sci. 358(2-3): 293-314 (2006) - 2005
- [j1]Étienne Lozes:
Elimination of spatial connectives in static spatial logics. Theor. Comput. Sci. 330(3): 475-499 (2005) - [i1]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
On the Expressiveness of the Ambient Logic. CoRR abs/cs/0510010 (2005) - 2004
- [c4]Luís Caires, Étienne Lozes:
Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency. CONCUR 2004: 240-257 - 2003
- [c3]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Minimality Results for the Spatial Logics. FSTTCS 2003: 252-264 - [c2]Étienne Lozes:
Adjuncts elimination in the static ambient logic. EXPRESS 2003: 51-72 - 2002
- [c1]Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Separability, Expressiveness, and Decidability in the Ambient Logic. LICS 2002: 423-432
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
