This procedure attempts to establish the validity of general first-order formulas, using decision procedures and background properties. If the procedure fails, we do not know if it is valid or not. STeP also provides a Gentzen-style interactive prover for the human analysis of verification conditions. Checking the validity of propositional linear-time temporal logic formulas. Modular reasoning and abstraction often require establishing the temporal validity of proof obligations.
Automatic tools are available for the propositional fragment of linear-time temporal logic.
Hybrid Systems in STeP. STeP is able to verify hybrid systems with constant derivatives, or derivatives specified by differential inclusions. Generation of verification conditions. Maybe even verification diagrams .