Étienne Lozes

Orcid: 0000-0001-8505-585X

According to our database1, Étienne Lozes authored at least 48 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Guessing the Buffer Bound for k-Synchronizability.
Int. J. Found. Comput. Sci., December, 2023

Multiparty half-duplex systems and synchronous communications.
J. Log. Algebraic Methods Program., February, 2023

A Partial Order View of Message-Passing Communication Models.
Proc. ACM Program. Lang., January, 2023

Synchronizability of Communicating Finite State Machines is not Decidable.
Log. Methods Comput. Sci., 2023

Weakly Synchronous Systems with Three Machines Are Turing Powerful.
Proceedings of the Reachability Problems - 17th International Conference, 2023

2022
A non-sequential hierarchy of message-passing models.
CoRR, 2022

The Tail-Recursive Fragment of Timed Recursive CTL.
Proceedings of the 29th International Symposium on Temporal Representation and Reasoning, 2022

2021
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic.
ACM Trans. Comput. Log., 2021

A Complete Axiomatisation for Quantifier-Free Separation Logic.
Log. Methods Comput. Sci., 2021

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic.
Fundam. Informaticae, 2021

Towards Generalised Half-Duplex Systems.
Proceedings of the Proceedings 14th Interaction and Concurrency Experience, 2021

A Unifying Framework for Deciding Synchronizability.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
On the k-synchronizability of Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Internal Calculi for Separation Logics.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
On the k-synchronizability for mailbox systems.
CoRR, 2019

2018
Multi-buffer simulations: Decidability and complexity.
Inf. Comput., 2018

The Effects of Adding Reachability Predicates in Propositional Separation Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
Space-Efficient Fragments of Higher-Order Fixpoint Logic.
Proceedings of the Reachability Problems - 11th International Workshop, 2017

On the relationship between higher-order recursion schemes and higher-order fixpoint logic.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

On Symbolic Heaps Modulo Permission Theories.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
Two-Buffer Simulation Games.
Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Multi-Buffer Simulations for Trace Language Inclusion.
Proceedings of the Seventh International Symposium on Games, 2016

2015
Shared contract-obedient channels.
Sci. Comput. Program., 2015

A Type-Directed Negation Elimination.
Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

Conjunctive Visibly-Pushdown Path Queries.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
Model-checking process equivalences.
Theor. Comput. Sci., 2014

Buffered Simulation Games for Büchi Automata.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic.
Proceedings of the Theoretical Computer Science, 2014

2013
Revealing vs. Concealing: More Simulation Games for Büchi Inclusion.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
On the almighty wand.
Inf. Comput., 2012

Shared Contract-Obedient Endpoints
Proceedings of the Proceedings Fifth Interaction and Concurrency Experience, 2012

Model-Checking the Higher-Dimensional Modal mu-Calculus
Proceedings of the Proceedings 8th Workshop on Fixed Points in Computer Science, 2012

2011
Reliable Contracts for Unreliable Half-Duplex Communications.
Proceedings of the Web Services and Formal Methods - 8th International Workshop, 2011

Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus.
Proceedings of the Theory of Security and Applications - Joint Workshop, 2011

2010
A spatial equational logic for the applied <i>pi</i>-calculus.
Distributed Comput., 2010

Tracking Heaps That Hop with Heap-Hop.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

2009
Reasoning about sequences of memory states.
Ann. Pure Appl. Log., 2009

Beyond Shapes: Lists with Ordered Data.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Proving Copyless Message Passing.
Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009

2008
Separability in the Ambient Logic.
Log. Methods Comput. Sci., 2008

A Spatial Equational Logic for the Applied pi-Calculus.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Towards Model-Checking Programs with Lists.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007

2006
Elimination of quantifiers and undecidability in spatial logics for concurrency.
Theor. Comput. Sci., 2006

On the Expressiveness of the Ambient Logic.
Log. Methods Comput. Sci., 2006

2005
Elimination of spatial connectives in static spatial logics.
Theor. Comput. Sci., 2005

2003
Adjuncts elimination in the static ambient logic.
Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Minimality Results for the Spatial Logics.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Separability, Expressiveness, and Decidability in the Ambient Logic.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002


  Loading...