Abstract
From self-driving cars to AlphaGo, artificial intelligence (AI) is progressing rapidly. Artificial intelligence makes our lives more convenient, but it also may bring us dangers. Just like Russia’s president Vladimir Putin said: “Artificial intelligence is the future, not only for Russia, but for all humankind. It comes with enormous opportunities, but also threats that are difficult to predict. Whoever becomes the leader in this sphere will become the ruler of the world.” So we should have a very convincing argument for its safety before applying an advanced intelligent system. How can we realize that argument is rigorously correct? Dijkstra said: “The only effective way to raise the confidence level of a program significantly is to give a convincing proof of its correctness” [8]. The answer is a mathematical proof. This is the reason why we need formal methods in AI. Formal methods are used to describe and analyze systems with a set of symbols and operations; depend on some mathematical methods and theories, such as algebra, logical, graph theory, or automata; and enhance the quality and safety of systems, so we call it formal.
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
Similar content being viewed by others
References
V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley Longman Publishing Co., Inc., Boston, 1974)
R. Alur, T. Henzinger, Reactive modules. Form. Methods Syst. Des. 15, 7–48 (1999)
D. Broman, E. Lee, S. Tripakis, M. Törngren, Viewpoints, formalisms, languages, and tools for cyber-physical systems, in 6th International Workshop on Multi-paradigm Modeling (MPM’12) (2012)
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, L.J. Hwang, Symbolic model checking: 1020 states and beyond. Inf. Comput. 98(2), 142–170 (1992)
R.E. Bryant, Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C-35(8), 677–691 (1986)
A. Cimatti, E.M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, A. Tacchella, NuSMV 2: an open source tool for symbolic model checking, in CAV, ed. by E. Brinksma, K.G. Larsen. LNCS, vol. 2404 (Springer, 2002), pp. 359–364
E.M. Clarke, E.A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, in Logic of Programs: Workshop, Yorktown Heights, NY, May 1981. LNCS, vol. 131 (Springer, 1981)
E.W. Dijkstra, The humble programmer. Commun. ACM 15(10), 859–866 (1972)
E.M. Clarke Jr., Orna Grumberg, Lucent Technologies, Model Checking (MIT Press, Cambridge, MA, 1999)
E.A. Emerson, E.M. Clarke, Characterizing correctness properties of parallel programs using fixpoints, in Automata, Languages and Programming. LNCS, vol. 85 (Springer, 1980), pp. 169–181
E.A. Emerson, J.Y. Halpern, “Sometimes” and “Not Never” revisited: on branching time versus linear time. J. ACM 33, 151–178 (1986)
E.A. Emerson, C.-L. Lei, Efficient model checking in fragments of the propositional mu-calculus, in LlCS86 (1986), pp. 267–278
W. Fokkink, Introduction to Process Algebra (Springer, Heidelberg, 2000)
N. Francez, Fairness (Springer, 1986)
M.R. Garey, D.S. Jolmson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, San Francisco, 1979)
C. Hoare, Communicating Sequential Processes (Prentice Hall, New York, 1985)
J. Hopcroft, R. Motwani, J. Ullman, Introduction to Automata Theory, Languages, and Computation, 3rd edn. (Addison-Wesley, Reading, 2006)
G.E. Hughes, M.J. Creswell, Introduction to Modal Logic (Methuen and Co. Ltd., London, 1968/1977)
Z. Manna, A. Pnueli, Temporal Verifications of Reactive Systems-Safety (US, Springer, New York, 1995)
K.L. McMillan, Symbolic Model Checking (Kluwer Academic Publishers, Norwell, 1993)
W. Reisig, Petri Nets: An Introduction (Springer, Heidelberg, 1985)
https://es.fbk.eu/tools/nuxmv/downloads/nuxmv-user-manual.pdf
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Xu, M., Wang, L. (2021). Formal Verification, Testing, and Inspection for Intelligent Services. In: Gao, H., Yin, Y. (eds) Intelligent Mobile Service Computing. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-50184-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-50184-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-50183-9
Online ISBN: 978-3-030-50184-6
eBook Packages: EngineeringEngineering (R0)