Abstract
This paper describes an extension of Paulson’s inductive protocol verification approach for liveness reasoning. The extension requires no change of the system model underlying the original inductive approach. Therefore, all the advantages, which makes Paulson’s approach successful for safety reasoning are kept, while liveness reasoning becomes possible. To simplify liveness reasoning, a new fairness notion, named Parametric Fairness is used instead of the standard ones. A probabilistic model is established to support this new fairness notion. Experiments with small examples as well as real world communication protocols confirm the practicality of the extension. All the work has been formalized with Isabelle/HOL using Isar.
This research was funded by 863 Program(2007AA01Z409) and NNSFC(60373068) of China.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6(1-2), 85–128 (1998)
Paulson, L.C.: Inductive analysis of the Internet protocol TLS. ACM Transactions on Computer and System Security 2(3), 332–351 (1999)
Manna, Z., Pnueli, A.: Completing the temporal picture. Theor. Comput. Sci. 83(1), 91–130 (1991)
Pnueli, A., Zuck, L.D.: Probabilistic verification. Information and Computation 103(1), 1–29 (1993)
Baier, C., Kwiatkowska, M.: On the verification of qualitative properties of probabilistic processes under fairness constraints. Information Processing Letters 66(2), 71–79 (1998)
Jaeger, M.: Fairness, computable fairness and randomness. In: Proc. 2nd International Workshop on Probabilistic Methods in Verification (1999)
Yang, H., Zhang, X., Wang, Y.: Liveness proof of an elevator control system. In: The ‘Emerging Trend’ of TPHOLs, Oxford University Computing Lab. PRG-RR-05-02, pp. 190–204 (2005)
Yang, H., Zhang, X., Wang, Y.: A correctness proof of the srp protocol. In: 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, Rhodes Island, Greece, April 25-29 (2006)
Yang, H., Zhang, X., Wang, Y.: A correctness proof of the dsr protocol. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds.) MSN 2006. LNCS, vol. 4325, pp. 72–83. Springer, Heidelberg (2006)
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL — A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)
Wenzel, M.: Isar - a generic interpretative approach to readable formal proof documents. In: Nipkow, T., Paulson, L.C., Wenzel, M.T. (eds.) Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pp. 278–290. ACM Press, New York (1983)
Zhang, X., Yang, H., Wang, Y.: Liveness reasoning for inductive protocol verification. In: The ‘Emerging Trend’ of TPHOLs, Oxford University Computing Lab. PRG-RR-05-02, pp. 221–235 (2005)
Hurd, J.: Formal Verification of Probabilistic Algorithms. Ph.D thesis, University of Cambridge (2002)
Richter, S.: Formlizing integration theory with an application to probabilistic algorithms. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol. 3223, pp. 271–286. Springer, Heidelberg (2004)
Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: ACM (ed.) Proceedings of the 15th annual ACM Symposium on Theory of Computing, Boston, Massachusetts, April 25–27, pp. 278–290. ACM Press, New York (1983)
Wang, J., Zhang, X., Zhang, Y., Yang, H.: A probabilistic model for parametric fairness in isabelle/hol. Technical Report 364/07, Department of Computer Science, University of Kaiserslautern (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, J., Yang, H., Zhang, X. (2009). Liveness Reasoning with Isabelle/HOL. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2009. Lecture Notes in Computer Science, vol 5674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03359-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-03359-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03358-2
Online ISBN: 978-3-642-03359-9
eBook Packages: Computer ScienceComputer Science (R0)