Jerzy Tiuryn

Suggest Changes
Learn More
Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations(More)
In this paper we study the complexity of the satisfiability problem for subtype inequalities in simple types. The naive algorithm which solves this problem runs in non-deterministic exponential time(More)