Feasibility of Finite and Infinite Paths in Data Dependent Programs

Karlis Cerans. Feasibility of Finite and Infinite Paths in Data Dependent Programs. In Anil Nerode, Michael A. Taitslin, editors, Logical Foundations of Computer Science - Tver 92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings. Volume 620 of Lecture Notes in Computer Science, pages 69-80, Springer, 1992.

Abstract

Abstract is missing.