The ‘Cash-Point’ Service: A Verification Case Study Using STeP

Anca Browne, Bernd Finkbeiner, Zohar Manna, Henny B. Sipma · Formal Aspects of Computing · 2000

Abstract. STeP, the Stanford Temporal Prover, supports the computer-aided formal verification of concurrent and reactive systems based on temporal specifications [MBB99]. Automated model checking is combined with computer-aided deductive methods to allow for the verification of a broad class of systems, including parameterised ( N -component) circuit designs, parameterised ( N -process) programs, and programs with infinite data domains.

Read the paper · More papers on PaperTik