Gunnar Stålmarck

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
Designing Safe, Reliable Systems using Scade.
Proceedings of the International Symposium on Leveraging Applications of Formal Methods, 2004

2002
Formal verification methods: getting around the brick wall.
Proceedings of the 39th Design Automation Conference, 2002

2000
A Tutorial on Stålmarck's Proof Procedure for Propositional Logic.
Formal Methods Syst. Des., 2000

Checking Safety Properties Using Induction and a SAT-Solver.
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.
Proceedings of the Formal Methods in Computer-Aided Design, 1998

1996
Short Resolution Proofs for a Sequence of Tricky Formulas.
Acta Informatica, 1996

1991
Normalization Theorems for Full First Order Classical Natural Deduction.
J. Symb. Log., 1991

1989
A Note on the Computational Complexity of the Pure Classical Implication Calculus.
Inf. Process. Lett., 1989


  Loading...