Browse by Person

Article

Demri, S. and Jurdziński, M. and Lachish, Oded and Lazić, R. (2013) The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences 79 (1), pp. 23-38. ISSN 0022-0000.

Book Section

Ströder, T. and Giesl, J. and Brockschmidt, M. and Frohn, F. and Fuhs, Carsten and Hensel, J. and Schneider-Kamp, P. (2014) Proving termination and memory safety for programs with Pointer Arithmetic. In: Demri, S. and Kapur, D. and Weidenbach, C. (eds.) Automated Reasoning. Lecture Notes In Computer Science 8562 8562. New York, U.S.: Springer, pp. 208-223. ISBN 9783319085869.

Giesl, J. and Brockschmidt, M. and Emmes, F. and Frohn, F. and Fuhs, Carsten and Otto, C. and Plücker, M. and Schneider-Kamp, P. and Ströder, T. and Swiderski, S. and Thiemann, R. (2014) Proving termination of programs automatically with AProVE. In: Demri, S. and Kapur, D. and Weidenbach, C. (eds.) Automated Reasoning. Lecture Notes In Computer Science 8562. Berlin, Germany: Springer, pp. 184-191. ISBN 9783319085869.

Demri, S. and Jurdziński, M. and Lachish, Oded and Lazić, R. (2009) The covering and boundedness problems for branching vector addition systems. In: Kannan, R. and Kumar, K.N. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics 4. Dagstuhl, Germany: Schloss Dagstuhl, pp. 181-192. ISBN 9783939897132.

Lutz, C. and Wolter, F. and Zakharyaschev, Michael (2008) Temporal description logics: a survey. In: Demri, S. and Jensen, D.S. (eds.) 2008 15th International Symposium on Temporal Representation and Reasoning. Piscataway, U.S.: IEEE Computer Society, pp. 3-14. ISBN 9780769531816.