Abstracting Communication to Reason about Distributed Algorithms. - Michel Charpentier; Mamoun Filali; Philippe Mauran; Gérard Padiou; Philippe Quéinnec (WDAG, 1996)

A UNITY Mapping Operator for Distributed Programs. - Michel Charpentier (FME, 1997)

Tailoring UNITY to Distributed Program Design. - Michel Charpentier; Mamoun Filali; Philippe Mauran; Gérard Padiou; Philippe Quéinnec (IPPS/SPDP Workshops, 1998)

Specification and Verification of the ATMR Protocol Using Unity. Part 1: Modeling and Specification of the Protocol. - Michel Charpentier; Gérard Padiou (Parallel Process. Lett., 1998)

Specification and Verification of the ATMR Protocol Using Unity. Part 2: Correctness Proof. - Michel Charpentier; Gérard Padiou (Parallel Process. Lett., 1998)

Towards a Compositional Approach to the Design and Verification of Distributed Systems. - Michel Charpentier; K. Mani Chandy (World Congress on Formal Methods, 1999)

Examples of Program Composition Illustrating the Use of Universal Properties. - Michel Charpentier; K. Mani Chandy (IPPS/SPDP Workshops, 1999)

Modelling and Verifying Migration: A case study. - Michel Charpentier; Mamoun Filali; Philippe Mauran; Gérard Padiou; Philippe Quéinnec (OPODIS, 1999)

The Observation: An Abstract Communication Mechanism. - Michel Charpentier; Mamoun Filali; Philippe Mauran; Gérard Padiou; Philippe Quéinnec (Parallel Process. Lett., 1999)

Reasoning about Composition Using Property Transformers and Their Conjugates. - Michel Charpentier; K. Mani Chandy (IFIP TCS, 2000)

Theorems about Composition. - Michel Charpentier; K. Mani Chandy (MPC, 2000)

An Approach to Composition Motivated by wp. - Michel Charpentier (FASE, 2002)

Workshop Introduction. - Michel Charpentier; Beverly A. Sanders (IPDPS, 2002)

An Experiment in Program Composition and Proof. - K. Mani Chandy; Michel Charpentier (Formal Methods Syst. Des., 2002)

Specification transformers: a predicate transformer approach to composition. - Michel Charpentier; K. Mani Chandy (Acta Informatica, 2004)

Cooperative Mobile Agents to Gather Global Information. - Michel Charpentier; Gérard Padiou; Philippe Quéinnec (NCA, 2005)

Composing invariants. - Michel Charpentier (Sci. Comput. Program., 2006)

Towards a theory of events. - K. Mani Chandy; Michel Charpentier; Agostino Capponi (DEBS, 2007)

Self-Similar Algorithms for Dynamic Distributed Systems. - K. Mani Chandy; Michel Charpentier (ICDCS, 2007)

A Mechanism to Structure Mission-Aware Interaction in Mobile Sensor Networks. - Michel Charpentier; Radim Bartos; Swapnil Bhatia (ICDCN, 2009)

When opportunity proceeds from autonomy: A tour-based architecture for disconnected mobile sensors. - Michel Charpentier; Radim Bartos; Swapnil Bhatia (WOWMOM, 2009)

Local Algorithms for Robust Mission Realization in Large-Scale Disconnected Networks. - Michel Charpentier; Radim Bartos; Ying Li 007 (NCA, 2012)

Performance analysis of local algorithms in large-scale disconnected networks. - Ying Li 007; Radim Bartos; Michel Charpentier (CCNC, 2015)

When Black-box Testing is Not Enough - on Designing Auto-graded Programming Assignments. - Karen H. Jin; Michel Charpentier (SIGCSE, 2020)

Automatic programming assignment assessment beyond black-box testing. - Karen H. Jin; Michel Charpentier (J. Comput. Sci. Coll., 2020)

How Many Languages Does It Take to Be a Programming Languages Course? - Michel Charpentier; Karen H. Jin (J. Comput. Sci. Coll., 2023)