A Correctness Proof of a Distributed Minimum-Weight Spanning Tree Algorithm (extended abstract). - Frank A. Stomp; Willem P. de Roever (ICDCS, 1987)

Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract). - Frank A. Stomp; Willem P. de Roever (WDAG, 1989)

The upsilon-Calculus as an Assertion-Language for Fairness Arguments - Frank A. Stomp; Willem P. de Roever; Rob Gerth (Inf. Comput., 1989)

A derivation of a broadcasting protocol using sequentially phased reasoning. - Frank A. Stomp (PSTV, 1990)

A Fast Pattern Matching Algorithm Derived by Transformational and Assertional Reasoning. - Helmuth Partsch; Frank A. Stomp (Formal Aspects Comput., 1990)

Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version). - Frank A. Stomp (CONCUR, 1992)

Structured Design of Self-Stabilizing Programs. - Frank A. Stomp (ISTCS, 1993)

Extending the Limits of Sequentially Phased Reasoning. - Michael Siegel; Frank A. Stomp (FSTTCS, 1994)

A Principle for Sequential Reasoning about Distributed Algorithms. - Frank A. Stomp; Willem P. de Roever (Formal Aspects Comput., 1994)

Formalizing Inductive Proofs of Network Algorithms. - Ramesh Bharadwaj; Amy P. Felty; Frank A. Stomp (ASIAN, 1995)

Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development. - Job Zwiers; Ulrich Hannemann; Yassine Lakhnech; Willem P. de Roever; Frank A. Stomp (FME, 1996)

Constructing a Reliable Test&Set Bit (Abstract). - Frank A. Stomp; Gadi Taubenfeld (PODC, 1996)

Protocol Verification in Nuprl. - Amy P. Felty; Douglas J. Howe; Frank A. Stomp (CAV, 1998)

A proof theory of asynchronously communicating sequential processes. - Frank S. de Boer; Nissim Francez; M. van Hulst; Frank A. Stomp (PROCOMET, 1998)

Cache Coherency in SCI: Specification and a Sketch of Correctness. - Amy P. Felty; Frank A. Stomp (Formal Aspects Comput., 1999)

Constructing a Reliable Test&Set Bit. - Frank A. Stomp; Gadi Taubenfeld (IEEE Trans. Parallel Distributed Syst., 1999)

Mechanization of a Proof of String-Preprocessing in Boyer-Moore's Pattern Matching Algorithm. - Milos Besta; Frank A. Stomp (ICECCS, 2002)

Safety assurance via on-line monitoring. - Shlomi Dolev; Frank A. Stomp (Distributed Comput., 2003)

Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm. - Frank A. Stomp (Theor. Comput. Sci., 2003)

Verifying Parameterized Refinement. - Maty Sylla; Frank A. Stomp; Willem P. de Roever (ICECCS, 2005)

A Complete Mechanization of Correctness of a String-Preprocessing Algorithm. - Milos Besta; Frank A. Stomp (Formal Methods Syst. Des., 2005)

An Assertional Correctness Proof of a Self-Stabilizing - Exclusion Algorithm. - Milos Besta; Frank A. Stomp (ICECCS, 2006)