Abstract
This chapter presents a method for approximating the non-standard semantics capturing message-passing properties defined in Chap. 2. The approximation is based on limiting the number of distinguishable copies a process can produce of new names and input parameters. This then leads to the generation of a finite semantic domain and an abstract interpretation function that is used to give an abstract semantics for a process. The chapter concludes with two examples of simple systems that demonstrate how the analysis can be applied to better understand the behaviour of systems: the example of a simple file transfer protocol system and the example of a simple distance-bounding protocol.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
D. Dolev, A. Yao, in Proceedings of the \(22{\rm nd}\) Annual Symposium on Foundations of Computer Science (1981), pp. 350–357
C. Bodei, P. Dagano, Theoret. Comput. Sci. 283(2), 271 (2002)
G.P. Hancke, M.G. Kuhn, in Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks (ACM Press, Athens, Greece, 2005), pp. 67–73
I. Cervesato, in Proceedings of the \(16{\rm th}\) Annual Symposium on Logic in Computer Science, ed. by J. Halpern (IEEE Computer Society Press, Boston, MA, U.S.A., 2001), pp. 246–265
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Aziz, B. (2022). Formal Analysis by Abstract Interpretation. In: Formal Analysis by Abstract Interpretation. SpringerBriefs in Applied Sciences and Technology. Springer, Cham. https://doi.org/10.1007/978-3-030-91153-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-91153-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91152-2
Online ISBN: 978-3-030-91153-9
eBook Packages: Computer ScienceComputer Science (R0)