1. Ball, T., Podelski, A., and Rajamani, S.K., Boolean and Cartesian abstraction for model checking C programs, Microsoft Research, 2000, MSR-TR-2000-115. http://researchmicrosoftcom/apps/pubs/defaultaspx?idi821.
2. Ben-Ari, M., Halpern, J.Y., and Pnueli, A., Deterministic propositional dynamic logic: Finite models, complexity, and completeness, J. Comput. Syst.Sci., 1982, vol. 25, no. 3, pp. 402–417.
3. Bradfield, J., and Stirling, C., Modal mu-calculi, in The Handbook of Modal Logic, Blackburn, P., van Benthem, J., and Wolter, F., Eds., Elsevier, 2006, pp. 721–756.
4. Bruse, F., Friedmann, O., and Lange, M., Guarded transformation for the modal mu-calculus. http://arxiv. org/abs/1305.0648).
5. Buchi Weak Second Order Arithmetic and Finite Automata: The Collected Works of J. Richard Buchi, New York: Springer, 1990, pp. 398–424.