The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
Journal of the ACM (JACM)
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
Decidable problems for powerful programs
Journal of the ACM (JACM)
The Complexity of Finite Memory Programs with Recursion
Journal of the ACM (JACM)
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
Journal of the ACM (JACM)
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
Journal of the ACM (JACM)
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
Journal of the ACM (JACM)
Programming language constructs for which it is impossible to obtain good hoare-like axiom systems
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of simple programs over different sets of primitives
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program schemes, arrays, Lindström quantifiers and zero-one laws
Theoretical Computer Science
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs
ISC '01 Proceedings of the 4th International Conference on Information Security
A characterization of Hoare's logic for programs with Pascal-like procedures
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The essence of computation
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
Should computer programs be verified?
ACM SIGSOFT Software Engineering Notes
Games for complexity of second-order call-by-name programs
Theoretical Computer Science - Game theory meets theoretical computer science
Program Schemes with Deep Pushdown Storage
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Winning Regions of Pushdown Parity Games: A Saturation Method
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
C-SHORe: a collapsible approach to higher-order verification
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
An observationally complete program logic for imperative higher-order functions
Theoretical Computer Science
| Hi-index | 0.01 |
A simple programming language which corresponds in computational power to the class of generalized sequential machines with final states is defined. It is shown that a variety of questions of practical programming interest about the language are of nondeterministic linear space complexity. Extensions to the language are defined (adding arithmetic and array data structures) and their complexity properties are explored. It is concluded that questions about halting, equivalence, optimization, and so on are intractable even for very simple programming languages.