Gunnar Stålmarck

According to our database, Gunnar Stålmarck authored at least 8 papers between 1989 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2004

Designing Safe, Reliable Systems Using Scade.

Parosh Aziz Abdulla, Johann Deneux, Gunnar Stålmarck, Herman Ågren, Ove Åkerlund

Proceedings of the Leveraging Applications of Formal Methods, 2004

2002

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, Gunnar Stålmarck, Curt Widdoes

Proceedings of the 39th Design Automation Conference, 2002

2000

A Tutorial on Stålmarck's Proof Procedure for Propositional Logic.

Mary Sheeran, Gunnar Stålmarck

Formal Methods Syst. Des., 2000

Checking Safety Properties Using Induction and a SAT-Solver.

Mary Sheeran, Satnam Singh, Gunnar Stålmarck

Proceedings of the Formal Methods in Computer-Aided Design, Third International Conference, 2000

1998

A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic.

Mary Sheeran, Gunnar Stålmarck

Proceedings of the Formal Methods in Computer-Aided Design, 1998

1996

Short Resolution Proofs for a Sequence of Tricky Formulas.

Gunnar Stålmarck

Acta Informatica, 1996

1991

Normalization Theorems for Full First Order Classical Natural Deduction.

Gunnar Stålmarck

J. Symb. Log., 1991

1989

A Note on the Computational Complexity of the Pure Classical Implication Calculus.

Gunnar Stålmarck

Inf. Process. Lett., 1989