Liveness Reasoning with Isabelle/HOL

Authors:
Jinshuang Wang;Huabing Yang;Xingyuan Zhang
Affiliations:
PLA University of Science and Technology, Nanjing, China 210007 and State Key Lab for Novel Software Technology, Nanjing University, Nanjing, China 210093;PLA University of Science and Technology, Nanjing, China 210007;PLA University of Science and Technology, Nanjing, China 210007
Venue:
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Year:
2009

Citing 9
Cited 0

Completing the temporal picture

Selected papers of the 16th international colloquium on Automata, languages, and programming
Probabilistic verification

Information and Computation
On the verification of qualitative properties of probabilistic processes under fairness constraints

Information Processing Letters
Inductive analysis of the Internet protocol TLS

ACM Transactions on Information and System Security (TISSEC)
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
On the extremely fair treatment of probabilistic algorithms

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
A correctness proof of the SRP protocal

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

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.