A Note on the Computational Complexity of the Pure Classical Implication Calculus. - Gunnar Stålmarck (Inf. Process. Lett., 1989)

Normalization Theorems for Full First Order Classical Natural Deduction. - Gunnar Stålmarck (J. Symb. Log., 1991)

Short Resolution Proofs for a Sequence of Tricky Formulas. - Gunnar Stålmarck (Acta Informatica, 1996)

A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic. - Mary Sheeran; Gunnar Stålmarck (FMCAD, 1998)

Checking Safety Properties Using Induction and a SAT-Solver. - Mary Sheeran; Satnam Singh; Gunnar Stålmarck (FMCAD, 2000)

A Tutorial on Stålmarck's Proof Procedure for Propositional Logic. - Mary Sheeran; Gunnar Stålmarck (Formal Methods Syst. Des., 2000)

Formal verification methods: getting around the brick wall. - David L. Dill; Nate James; Shishpal Rawat; Gérard Berry; Limor Fix; Harry Foster; Rajeev K. Ranjan 001; Gunnar Stålmarck; Curt Widdoes (DAC, 2002)

Designing Safe, Reliable Systems using Scade. - Parosh Aziz Abdulla; Johann Deneux; Gunnar Stålmarck; Herman Ågren; Ove Åkerlund (ISoLA (Preliminary proceedings), 2004)