Abstract
The Stanford Temporal Prover, STeP, is a tool for the computer-aided formal verification of reactive systems, including real-time and hybrid systems, based on their temporal specification. STeP integrates methods for deductive and algorithmic verification, including model checking, theorem proving, automatic invariant generation, abstraction and modular reasoning. We describe the most recent version of STeP, Version 2.0.
This research was supported in part by the National Science Foundation under grants CCR-95-27927 and CCR-98-04100, the Defense Advanced Research Projects Agency under NASA grant NAG2-892, ARO under grants DAAH04-95-1-0317, DAAH04-961-0122 and DAAG55-98-1-0471, ARO under MURI grant DAAH04-96-1-0341, and by Army contract DABT63-96-C-0096 (DARPA).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.R. Abrial, E. Boerger, and H. Langmaack, editors. Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, vol. 1165 of LNCS. Springer-Verlag, 1996.
N.S. Bjørner, A. Browne, E.S. Chang, M. Colón, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Prover, User’s Manual. Technical Report STAN-CS-TR-95–1562, Computer Science Department, Stanford University, November 1995.
N.S. Bjørner, A. Browne, E.S. Chang, M. Colón, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In R. Alur and T.A. Henzinger, editors, Proc. 8th Intl. Conference on Computer Aided Verification, vol. 1102 of LNCS, pages 415–418. Springer-Verlag, July 1996.
N.S. Bjorner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):4987, February 1997. Preliminary version appeared in 1st Intl. Conf. on Principles and Practice of Constraint Programming, vol. 976 of LNCS, pp. 589623, Springer-Verlag, 1995.
N.S. Ajmer. Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University, November 1998.
N.S. Bjørner, U. Lerner, and Z. Manna Deductive verification of parameterized fault-tolerant systems: A case study. In Intl. Conf. on Temporal Logic. Kluwer, 1997. To appear.
A. Browne, Z. Manna, and H.B. Sipma. Generalized temporal verification diagrams. In 15th Conference on the Foundations of Software Technology and Theoretical Computer Science, vol. 1026 of LNCS, pages 484–498. Springer-Verlag, 1995.
N.S. Bjørner, Z. Manna, H.B. Sipma, and T.E. Uribe. Deductive verification of real-time systems using STeP. Technical report, Computer Science Department, Stanford University, October 1998. Preliminary version appeared in 4th Intl. AMAST Workshop on Real-Time Systems, vol. 1231 of LNCS, pages 22–43. Springer-Verlag, May 1997.
N.S. Bjørner and M.C. Pichora. Deciding fixed and non-fixed size bitvectors. In 4th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), vol. 1384 of LNCS, pages 376–392. Springer-Verlag, 1998.
N.S. Bjørner, M.E. Stickel, and T.E. Uribe. A practical integration of first-order reasoning and decision procedures. In Proc. of the 14th Intl. Conference on Automated Deduction,vol. 1249 of LNCS,pages 101–115. Springer-Verlag, July 1997.
D. Cantone, A. Ferro, and E. Omodeo. Computable Set Theory. Oxford Sceince Publications, 1989.
D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak’s decision procedure for combinations of theories. In Proc. of the 13th Intl. Conference on Automated Deduction, vol. 1104 of LNCS,pages 463–477. Springer-Verlag, 1996.
M.A. Colón and T.E. Uribe. Generating finite-state abstractions of reactive systems using decision procedures. In A.J. Hu and M.Y. Vardi, editors, Proc. 10th Intl. Conference on Computer Aided Verification, vol. 1427 of LNCS, pages 293–304. Springer-Verlag, July 1998.
D. Cantone and C.G. Zarba. A new fast tableau-based decision procedure for an unquantified fragment of set theory. In Int. Workshop on First-Order Theorem Proving (FTP’98), 1998. 188
B. Finkbeiner, Z. Manna, and H.B. Sipma. Deductive verification of modular systems. In W.P. de Roever, H. Langmaack, and A. Pnueli, editors, Compositionality: The Significant Difference, COMPOS’97, vol. 1536 of LNCS, pages 239–275. Springer-Verlag, 1998.
N. Halbwachs and Y.E. Proy. POLyhedra desK cAlculator (POLKA). VERIMAG, Montbonnot, France, September 1995.
Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E.S. Chang, M. Colón, L. de Alfaro, H. Devarajan, H.B. Sipma, and T.E. Uribe. STeP: The Stanford temporal prover. Technical Report STAN-CS-TR-94–1518, Computer Science Department, Stanford University, July 1994.
Z. Manna, A. Browne, H.B. Sipma, and T.E. Uribe. Visual abstractions for temporal verification. In AMAST’98, LNCS. Springer-Verlag, 1998. To appear.
Z. Manna, M.A. Colón, B. Finkbeiner, H.B. Sipma, and T.E. Uribe. Abstraction and modular verification of infinite-state reactive systems. In M. Broy, editor, Requirements Targeting Software and Systems Engineering (RTSE),LNCS. Springer-Verlag, 1998. To appear.
K.L. McMillan. Symbolic Model Checking. Kluwer Academic Pub., 1993.
Z. Manna and A. Pnueli. Temporal verification diagrams. In M. Hagiya and J.C. Mitchell, editors, Proc. International Symposium on Theoretical Aspects of Computer Software,vol. 789 of LNCS, pages 726–765. Springer-Verlag, 1994.
Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
Z. Manna and A. Pnueli. Clocked transition systems. Technical Report STAN-CS-TR-96–1566, Computer Science Department, Stanford University, April 1996.
Z. Manna and H.B. Sipma. Deductive verification of hybrid systems using STeP. In T. Henzinger and S. Sastry, editors, Hybrid Systems: Computation and Control, vol. 1386 of LNCS, pages 305–318. Springer-Verlag, 1998.
R.E. Shostak. Deciding combinations of theories. J. ACM, 31(1):1–12, January 1984.
H.B. Sipma, T.E. Uribe, and Z. Manna. Deductive model checking. To appear in Formal Methods in System Design, 1998. Preliminary version appeared in Proc. 8th Intl. Conference on Computer Aided Verification,vol. 1102 of LNCS, Springer-Verlag, pp. 208–219, 1996.
T.E. Uribe. Abstraction-based Deductive-Algorithmic Verification of Reactive Systems. PhD thesis, Computer Science Department, Stanford University, December 1998.
V. Weispfenning. Quantifier elimination for real algebra—the quadratic case and beyond. In Applied Algebra and Error-Correcting Codes (AAECC) 8, pages 85–101, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Wien
About this paper
Cite this paper
Manna, Z. et al. (1999). An Update on STeP: Deductive-Algorithmic Verification of Reactive Systems. In: Berghammer, R., Lakhnech, Y. (eds) Tool Support for System Specification, Development and Verification. Advances in Computing Science. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6355-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6355-9_13
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83282-0
Online ISBN: 978-3-7091-6355-9
eBook Packages: Springer Book Archive