| 2024 | LICS | An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. | Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil |
| 2022 | CONCUR | Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. | Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil |
| 2020 | CONCUR | Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. | Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil |
| 2019 | MFCS | The Quantifier Alternation Hierarchy of Synchronous Relations. | Diego Figueira, Varun Ramanathan, Pascal Weil |
| 2014 | DLT | From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper). | Pascal Weil |
| 2012 | CSL | The FO2 alternation hierarchy is decidable. | Manfred Kufleitner, Pascal Weil |
| 2009 | MFCS | On FO2 Quantifier Alternation over Words. | Manfred Kufleitner, Pascal Weil |
| 2008 | STACS | Preface - 25th International Symposium on Theoretical Aspects of Computer Science. | Susanne Albers, Pascal Weil |
| 2008 | STACS | Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. | Susanne Albers, Pascal Weil |
| 2004 | MFCS | Algebraic Recognizability of Languages. | Pascal Weil |
| 1998 | STACS | Series-Parallel Posets: Algebra, Automata and Languages. | Kamal Lodaya, Pascal Weil |
| 1995 | ICALP | Polynomial Closure and Unambiguous Product. | Jean-Eric Pin, Pascal Weil |
| 1994 | ICALP | PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. | Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil |
| 1989 | MFCS | On Varieties of Languages Closed Under Products with Counter. | Pascal Weil |
| 1985 | STACS | Groups, Codes and Unambiguous Automata. | Pascal Weil |