@inproceedings{250bd6109bb3450fb2ff36e34c8ca5d0,
title = "Liveness with invisible ranking",
abstract = "The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based on a small model property that implies it is sufficient to prove some properties on small instantiations of the system, and on a heuristic that generates candidate invariants. Liveness properties usually require well founded ranking, and do not fall within the scope of the small model theorem. In this paper we develop novel proof rules for liveness properties, all of whose proof obligations are of the correct form to be handled by the small model theorem.We then develop abstraction and generalization techniques that allow for fully automatic verification of liveness properties of parameterized systems. We demonstrate the application of the method on several examples.",
author = "Yi Fang and Nir Piterman and Amir Pnueli and Lenore Zuck",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2004.; 5th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2004 ; Conference date: 11-01-2004 Through 13-01-2004",
year = "2004",
doi = "10.1007/978-3-540-24622-0_19",
language = "English (US)",
isbn = "9783540208037",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "223--238",
editor = "Bernhard Steffen and Giorgio Levi",
booktitle = "Verification, Model Checking, and Abstract Interpretation - 5th International Conference, VMCAI 2004, Proceedings",
}