论文信息 - STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems

STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems

The Stanford Temporal Prover, STeP, combines deductive methods with algorithmic techniques to verify linear-time temporal logic specifications of reactive and real-time systems. STeP uses verification rules, verification diagrams, automatically generated invariants, model checking, and a collection of decision procedures to verify finite- and infinite-state systems.

[1] Nancy A. Lynch,et al. The generalized railroad crossing: a case study in formal verification of real-time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.

[2] Zohar Manna,et al. Automatic Generation of Invariants and Intermediate Assertions , 1997, Theor. Comput. Sci..

[3] Edward Y. Chang,et al. STeP: The Stanford Temporal Prover , 1995, TAPSOFT.

[4] Zohar Manna,et al. Clocked Transition Systems , 1996 .

[5] Z. Manna,et al. Temporal Veri cation Diagrams ? , 1994 .

[6] Henny B. Sipma,et al. Generalized Temporal Verification Diagrams , 1995, FSTTCS.

[7] Zohar Manna,et al. Temporal Verification Diagrams , 1994, TACS.

[8] Zohar Manna,et al. Temporal Verification of Reactive Systems , 1995, Springer New York.