Abstract State Machines: Designing Distributed Systems with State Machines and B. - Bill Stoddart; Steve Dunne; Andy Galloway; Richard Shore (B, 1998)

The Safe Machine: A New Specification Construct for B. - Steve Dunne (World Congress on Formal Methods, 1999)

The Refinement of Event Calculus Models. - Bill Stoddart; Steve Dunne (IFM, 1999)

Undefined Expressions and Logic in Z and B. - Bill Stoddart; Steve Dunne; Andy Galloway (Formal Methods Syst. Des., 1999)

Recasting Hoare and He's Unifying Theory of Programs in the Context of General Correctness. - Steve Dunne (IWFM, 2001)

Abstract Commands: a Uniform Notation for Specification and Implementation. - Steve Dunne (CATS, 2001)

A Theory of Generalised Substitutions. - Steve Dunne (ZB, 2002)

Junctive Compositions of specifications in total, general correctness. - Steve Dunne (Refine, 2002)

Introducing Backward Refinement into B. - Steve Dunne (ZB, 2003)

Understanding Object-Z Operations as Generalised Substitutions. - Steve Dunne (IFM, 2004)

Refinement Laws for Verifying Library Subroutine Adaptation. - Colin J. Fidge; Peter J. Robinson 001; Steve Dunne (Australian Software Engineering Conference, 2005)

Process Refinement in B. - Steve Dunne; Stacey Conroy (ZB, 2005)

A Prospective-Value Semantics for the GSL. - Frank Zeyda; Bill Stoddart; Steve Dunne (ZB, 2005)

Angelic nondeterminism in the unifying theories of programming. - Ana Cavalcanti 001; Jim Woodcock 001; Steve Dunne (Formal Aspects Comput., 2006)

Chorus Angelorum. - Steve Dunne (B, 2007)

Lifting General Correctness into Partial Correctness is ok. - Steve Dunne; Andy Galloway (IFM, 2007)

A Practical Single Refinement Method for B. - Steve Dunne; Stacey Conroy (ABZ, 2008)

Reasoning about Loops in Total and General Correctness. - Steve Dunne; Ian J. Hayes; Andy Galloway (UTP, 2008)

Of wlp and CSP. - Steve Dunne (REFINE@FMWeek, 2009)

Reactivising Classical B. - Steve Dunne; Frank Zeyda (ASM, 2010)

Preference and Non-deterministic Choice. - Bill Stoddart; Frank Zeyda; Steve Dunne (ICTAC, 2010)

Unifying Theories of Programming That Distinguish Nontermination and Abort. - Ian J. Hayes; Steve Dunne; Larissa Meinicke (MPC, 2010)

Termination without checkmark checkmark in CSP. - Steve Dunne (FM, 2011)

Conscriptions: A New Relational Model for Sequential Computations. - Steve Dunne (UTP, 2012)

Linking Unifying Theories of Program refinement. - Ian J. Hayes; Steve Dunne; Larissa Meinicke (Sci. Comput. Program., 2013)

Bunch theory, applications, axioms and models. - Bill Stoddart; Frank Zeyda; Steve Dunne (CoRR, 2019)

bGSL: An imperative language for specification and refinement of backtracking programs. - Steve Dunne; João F. Ferreira 001; Alexandra Mendes; Campbell Ritchie; Bill Stoddart; Frank Zeyda (J. Log. Algebraic Methods Program., 2023)

Bunch theory: Axioms, logic, applications and model. - Bill Stoddart; Steve Dunne; Chunyan Mu; Frank Zeyda (J. Log. Algebraic Methods Program., 2024)