Survey: A survey of state vectors

Authors:
Ward Douglas Maurer
Affiliations:
Computer Science Department, George Washington University, Washington, DC 20052, USA
Venue:
Computer Science Review
Year:
2008

Citing 45
Cited 0

A Descriptive Language for Symbol Manipulation

Journal of the ACM (JACM)
Computability of Recursive Functions

Journal of the ACM (JACM)
On Ianov's Program Schemata

Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages

Journal of the ACM (JACM)
A Theory of Computer Instructions

Journal of the ACM (JACM)
Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations

Journal of the ACM (JACM)
Some Completeness Results in the Mathematical Theory of Computation

Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure

Journal of the ACM (JACM)
The Vienna Definition Language

ACM Computing Surveys (CSUR)
Fixpoint approach to the theory of computation

Communications of the ACM
A model for type checking: with an application to ALGOL 60

Communications of the ACM
Derived semantics for some programming language constructs

Communications of the ACM
Translator writing systems

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Correspondence between ALGOL 60 and Church's Lambda-notation: part I

Communications of the ACM
A formal semantics for computer languages and its application in a compiler-compiler

Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM
The next 700 programming languages

Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Report on the algorithmic language ALGOL 60

Communications of the ACM
On the nonexistence of a phrase structure grammar for ALGOL 60

Communications of the ACM
Definitional interpreters for higher-order programming languages

ACM '72 Proceedings of the ACM annual conference - Volume 2
Recursion induction applied to generalized flowcharts

ACM '69 Proceedings of the 1969 24th national conference
Implementation and applications of Scott's logic for computable functions

Proceedings of ACM conference on Proving assertions about programs
An algebraic description of programs with assertions, verification and simulation

Proceedings of ACM conference on Proving assertions about programs
Correctness of a compiler for a Lisp subset

Proceedings of ACM conference on Proving assertions about programs
Termination of algorithms

Termination of algorithms
Toward a man-machine system for proving program correctness

Toward a man-machine system for proving program correctness
A program verifier

A program verifier
Declarative semantic definition as illustrated by a definition of simula 67

Declarative semantic definition as illustrated by a definition of simula 67
Proving Programs to be Correct

IEEE Transactions on Computers
A basis for a mathematical theory of computation, preliminary report

IRE-AIEE-ACM '61 (Western) Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference
Termination of programs represented as interpreted graphs

AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
The formal description of programming languages

IBM Systems Journal
Axioms and theorems for a theory of arrays

IBM Journal of Research and Development
Regular expressions and the equivalence of programs

Journal of Computer and System Sciences
Some results concerning proofs of statements about programs

Journal of Computer and System Sciences
Time bounded random access machines

Journal of Computer and System Sciences
The correctness of programs

Journal of Computer and System Sciences
Equivalences on program schemes

Journal of Computer and System Sciences
On formalised computer programs

Journal of Computer and System Sciences
Program schemes, recursion schemes, and formal languages

Journal of Computer and System Sciences
Some definitional suggestions for automata theory

Journal of Computer and System Sciences
Bounded action machines: Toward an abstract theory of computer structure

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theory of Turing machines, which is basic to proving the various limitations of computers, is quite well known. The theory of finite state automata, the basic hardware models such as Moore machines, Mealy machines, and their generalizations, are similarly well known. Our purpose here is to survey basic work done between 1958 and 1975 on still another mathematical model for computer science, the state vector model. In this model there are many variables, each with its own current value, rather than a single state; this makes the model closer to what happens in a real computer.