A Tutorial on Stålmarck's Proof Procedure for Propositional Logic
Authors:
- 1 January 2000
- journal article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 16 (1) , 23-58
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Case Study: Formal Verification of a Computerized Railway InterlockingFormal Aspects of Computing, 1998
- Formal Methods in Computer-Aided Design1998
- The industrial success of verification tools based on stålmarck's method1997
- Hiding propositional constants in BDDsFormal Methods in System Design, 1996
- Stålmarck’s algorithm as a HOL derived rule1996
- Formal Methods in Computer-Aided Design1996
- Programming and verifying real-time systems by means of the synchronous data-flow language LUSTREIEEE Transactions on Software Engineering, 1992
- A note on the computational complexity of the pure classical implication calculusInformation Processing Letters, 1989
- Proof Theory1977
- Untersuchungen ber das logische Schlie en. IMathematische Zeitschrift, 1935