Pierre Genevès, Nils Gesbert, Nabil Layaïda, and Alan Schmitt. Efficiently Deciding μ-calculus with Converse over Finite Trees. ACM Transactions on Computational Logic, 16(2), 2015. [ bib | hal ]

Sergueï Lenglet, Alan Schmitt, and Jean-Bernard Stefani. Characterizing Contextual Equivalence in Calculi with Passivation. Information and Computation, 209(11):1390--1433, November 2011. Extended abstract presented at FOSSACS, 2009, and CONCUR, 2009. [ bib | full version ]

Ivan Lanese, Jorge A PĂ©rez, Davide Sangiorgi, and Alan Schmitt. On the Expressiveness and Decidability of Higher-Order Process Calculi. Information and Computation, 209(2):198--226, February 2011. Extended abstract presented at Logic in Computer Science (LICS), 2008. Coq formalization available at http://www.irisa.fr/celtique/aschmitt/research/hocore/. [ bib | full version ]

J. Nathan Foster, Michael B. Greenwald, Christian Kirkegaard, Benjamin C. Pierce, and Alan Schmitt. Exploiting Schemas in Data Synchronization. Journal of Computer and System Sciences, 73(4):669--689, June 2007. Extended abstract in Database Programming Languages (DBPL) 2005. [ bib | tech report | short version | full version | slides ]

J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, and Alan Schmitt. Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem. ACM Transactions on Programming Languages and Systems, 29(3):17, May 2007. Preliminary version presented at the Workshop on Programming Language Technologies for XML (PLAN-X), 2004; extended abstract presented at Principles of Programming Languages (POPL), 2005 (Most Influential POPL Paper Award, 2015). [ bib | electronic appendix | short version | full version | slides ]