Étienne Lozes

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

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


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

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

Synchronizability of Communicating Finite State Machines is not Decidable.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

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

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 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

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

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

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

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

Model-Checking Process Equivalences
Proceedings of the Proceedings Third International Symposium on Games, 2012

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

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

A spatial equational logic for the applied pi-calculus.
Distributed Computing, 2010

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

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

Separability in the Ambient Logic.
Logical Methods in Computer Science, 2008

On the Almighty Wand.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

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

Reasoning About Sequences of Memory States.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

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

On the Expressiveness of the Ambient Logic.
Logical Methods in Computer Science, 2006

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

Adjuncts elimination in the static ambient logic.
Electr. Notes Theor. Comput. Sci., 2004

Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

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

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