Abstract
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.
Cite
CITATION STYLE
Bjørner, N., Browne, A., Chang, E., Colòn, M., Kapur, A., Manna, Z., … Uribe, T. E. (1996). STeP: Deductive-algorithmic verification of reactive and real-time systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1102, pp. 415–418). Springer Verlag. https://doi.org/10.1007/3-540-61474-5_92
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
