| 2013 | CSL | Team building in dependence. | Julian C. Bradfield |
| 2013 | FASE | Enforcing QVT-R with mu-Calculus and Games. | Julian C. Bradfield, Perdita Stevens |
| 2012 | FASE | Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus. | Julian C. Bradfield, Perdita Stevens |
| 2009 | CONCUR | Model-Checking Games for Fixpoint Logics with Partial Order Models. | Julian Gutierrez, Julian C. Bradfield |
| 2005 | CSL | Transfinite Extension of the Mu-Calculus. | Julian C. Bradfield, Jacques Duparc, Sandra Quickert |
| 2005 | CSL | The Complexity of Independence-Friendly Fixpoint Logic. | Julian C. Bradfield, Stephan Kreutzer |
| 2003 | CSL | Parity of Imperfection of Fixing Independence. | Julian C. Bradfield |
| 2002 | CONCUR | Introduction to Modal and Temporal Mu-Calculi (Abstract). | Julian C. Bradfield |
| 2002 | FASE | Enriching OCL Using Observational Mu-Calculus. | Julian C. Bradfield, Juliana Kster Filipe, Perdita Stevens |
| 2000 | CSL | Independence: Logics and Concurrency. | Julian C. Bradfield |
| 1999 | CSL | Fixpoint Alternation and the Game Quantifier. | Julian C. Bradfield |
| 1998 | STACS | Simplifying the Modal Mu-Calculus Alternation Hierarchy. | Julian C. Bradfield |
| 1996 | CONCUR | The Modal mu-calculus Alternation Hierarchy is Strict. | Julian C. Bradfield |
| 1996 | ICALP | An Effective Tableau System for the Linear Time µ-Calculus. | Julian C. Bradfield, Javier Esparza, Angelika Mader |
| 1996 | STACS | On the Expressivity of the Modal Mu-Calculus. | Julian C. Bradfield |
| 1992 | CAV | A Proof Assistant for Symbolic Model-Checking. | Julian C. Bradfield |
| 1990 | CONCUR | Verifying Temporal Properties of Processes. | Julian C. Bradfield, Colin Stirling |