Author:
Zucchelli Daniele,Nicolini Enrica
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference40 articles.
1. Abadi, M.: The power of temporal proofs. Theor. Comp. Sci. 65(1), 35–83 (1989)
2. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of the 11th IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 313–321. IEEE Computer Society, New Brunswick, NJ, USA (1996)
3. Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Van Maaren, H., Biere, A., Heule, M., Walsh, T. (eds.) The Handbook of Satisfiability, vol. II, chap. 26, pp. 887–925. IOS Press, Amsterdam, The Netherlands (2009)
4. Lecture Notes in Computer Science;MP Bonacina,2006
5. Lecture Notes in Computer Science;A Bouajjani,2000