Parsing SPL programs into transition systems . STeP verifies reactive systems that are given as fair transition systems , or in the Simple Programming Language of Manna and Pnueli's books. This demo shows how SPL programs are parsed into fair transition systems. Simplifying first-order temporal formulas . Verification conditions can be simplified by STeP to yield smaller, logically equivalent conditions, which are more readable and usable by machines and humans alike.
Simplification is carried out with respect to decision procedures and background properties.
Checking the validity of first-order formulas. 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.