Abstract
Fully automated verification of software is certainly a very desirable goal: one would like to have a tool that accepts the inspected software, together with its specification, as input; the tool would check, without any human intervention, whether the given software satisfies its specification. However, from computability theory (see Section 2), we know that we cannot expect to build such a tool for a broad enough class of programs. Nevertheless, the theoretical restriction must not stop us from seeking a practical solution for checking the correctness of software.
She went on and on, a long way, but wherever the road divided there were sure to be two finger-posts pointing the same way, one marked ‘TO TWEEDLEDUM’s HOUSE’ and the other ‘TO THE HOUSE OF TWEEDLEDEE. ’
‘I do believe,’ said Alice at last, ‘that they live in the same house!’
Lewis Carroll, Through the Looking Glass
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Further Reading
E. M. Clarke, O. Grumberg, D. A. Peled, Model Checking, MIT Press 1999.
R. P. Kurshan, Computer Aided Verification of Coordinating Processes: the Automata-Theoretic Approach, Princeton University Press, 1995.
K. L. McMillan, Symbolic Model Checking, Kluwer Academic Press, 1993.
Ch. Meinel, Th. Theobald, Algorithms and Data Structures in VLSI Design, Springer-Verlag, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Lucent Technologies
About this chapter
Cite this chapter
Peled, D.A. (2001). Automatic Verification. In: Software Reliability Methods. Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3540-6_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3540-6_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2876-4
Online ISBN: 978-1-4757-3540-6
eBook Packages: Springer Book Archive