Ward Douglas Maurer

Affiliations:
  • George Washington University, Washington, D.C., USA


According to our database1, Ward Douglas Maurer authored at least 35 papers between 1966 and 2013.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
A Programming Language without Keywords.
Comput. Inf. Sci., 2013

2010
Simple section interchange and properties of non-computable functions.
Sci. Comput. Program., 2010

2008
Partially defined computer instructions and guards.
Sci. Comput. Program., 2008

A survey of state vectors.
Comput. Sci. Rev., 2008

Removing backward go-to statements from Ada programs: possibilities and problems.
Proceedings of the 2008 Annual ACM SIGAda International Conference on Ada, 2008

2007
Generalized structured programs and loop trees.
Sci. Comput. Program., 2007

Using mathematics to improve ada compiled code, part 2: the proof.
Proceedings of the 2007 Annual ACM SIGAda International Conference on Ada, 2007

2006
The Rearranger - A New Assembler Utility.
Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering (ASE 2006), 2006

Using Mathematics to Improve Ada Compiled Code.
Proceedings of the Reliable Software Technologies, 2006

2002
The comparative programming languages course: a new chain of development.
Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002

1996
Attitudes toward the go-to statement (or, hydrogen considered harmful).
Comput. Educ., 1996

Relative Precision in the Inductive Assertion Method.
Proceedings of the Numerical Analysis and Its Applications, First International Workshop, 1996

1985
The parable of the two programmers, continued.
ACM SIGSOFT Softw. Eng. Notes, 1985

1983
An Improved Hash Code for Scatter Storage (Reprint).
Commun. ACM, 1983

1981
An alternate characterization of preorder, inorder, and postorder.
ACM SIGPLAN Notices, 1981

1980
Multiple micros for education.
Proceedings of the 11th SIGCSE Technical Symposium on Computer Science Education, 1980

1978
Another letter on the correctness of real programs.
ACM SIGSOFT Softw. Eng. Notes, 1978

Register type bits: a proposal for efficient instruction repertoire extension.
ACM SIGPLAN Notices, 1978

A very small information retrieval system.
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1977
The teaching of program correctness.
Proceedings of the 7th SIGCSE Technical Symposium on Computer Science Education, 1977

The modification index method of generating verification conditions.
Proceedings of the 15th annual Southeast regional conference, 1977

1976
Proving the correctness of a flight-director program for an airborne minicomputer.
Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment, 1976

1975
Hash Table Methods.
ACM Comput. Surv., 1975

1974
Some correctness principles for machine language programs and microprograms.
Proceedings of the Conference record of the 7th annual workshop on Microprogramming, 1974

1973
The validity of return address schemes.
Inf. Sci., 1973

Induction Principles for Context-Free Languages.
Proceedings of the Gesellschaft für Informatik e.V., 1973

1972
On the Definition of the Variables Used and Set by a Computation.
Math. Syst. Theory, 1972

1971
Ph. D prelim exams in computer systems.
ACM SIGCSE Bull., 1971

1970
Compilation of a subset of SNOBOL4.
ACM SIGPLAN Notices, 1970

1969
The compiled macro assembler.
Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1969 Spring Joint Computer Conference, 1969

1968
An Improved Hash Code for Scatter Storage.
Commun. ACM, 1968

Letters to the editor: Comments on "An Improved Hash Code for Scatter Storage".
Commun. ACM, 1968

1966
Realizing Complex Boolean Functions with Simple Groups
Inf. Control., April, 1966

A Theory of Computer Instructions.
J. ACM, 1966

Computer experiments in finite algebra.
Commun. ACM, 1966


  Loading...