Norihisa Suzuki

According to our database1, Norihisa Suzuki authored at least 20 papers between 1975 and 1992.

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

Awards

ACM Fellow

ACM Fellow 1995, "For contributions to object-oriented technologies by type inference for Smalltalk, microprocessor, fast interpreter, and a database, to multiprocessing by snoop cache, and to program verification.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1992
Massively Parallel Architectures and Symbolic Computation (panel).
Proceedings of the Parallel Symbolic Computing: Languages, 1992

1989
TOP-1 Multiprocessor Workstation.
Proceedings of the Parallel Lisp: Languages and Systems, 1989

Design and Evaluation of Multiprocessor Workstations.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1985
Concurrent Prolog as an Efficient VLSI Design Language.
Computer, 1985

1984
Experience with Specification and Verification of Hardware Using PROLOG.
Proceedings of the VLSI Engineering: Beyond Software Engineering, 1984

Creating Efficient Systems for Object-Oriented Languages.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

Sword32: A Bytecode Emulating Micorprocessor for Object-Oriented Languages.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1984

1983
Data Abstraction in Prolog/KR.
New Gener. Comput., 1983

1982
Analysis of Pointer "Rotation".
Commun. ACM, 1982

1981
The Total Correctness of Parallel Programs.
SIAM J. Comput., 1981

Inferring Types in Smalltalk.
Proceedings of the Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, 1981

1980
Verification Decidability of Presburger Array Programs.
J. ACM, 1980

1979
Verification of Array, Record, and Pointer Operations in Pascal.
ACM Trans. Program. Lang. Syst., 1979

1978
Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
Proof of Termination within a Weak Logic of Programs.
Acta Informatica, 1977

Implementation of an Array Bound Checker.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

Nondeterminism and the Correctness of Parallel Programs.
Proceedings of the Formal Description of Programming Concepts: Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, 1977

1976
Automatic verification of programs with complex data structure.
PhD thesis, 1976

Automatic Verification of Programs with Complex Data Structures
Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York, ISBN: 0-8240-4425-8, 1976

1975
Verifying programs by algebraic and logical reduction.
Proceedings of the International Conference on Reliable Software 1975, 1975


  Loading...