On the Complexity of Flowchart and Loop Program Schemes and Programming Languages

Abstract

Uniform NP-hard and PSPACE-hard lower bounds are presented for problems for various classes of flowchart and loop program schemes and programming languages These lower bounds hold for the isomorphism, strong equivalence, containment, weak equivalence, totality, divergence, and executabthty problems. These lower bounds hold for any reasonably nontrivial flowchart and loop programming language. © 1982, ACM. All rights reserved.