default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorihisa Suzuki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1992
[c12]Takayasu Ito, Rishiyur S. Nikhil, Julian A. Padget
, Norihisa Suzuki, Taiichi Yuasa:
Massively Parallel Architectures and Symbolic Computation (panel). Parallel Symbolic Computing 1992: 408-416
1980 – 1989
- 1989
- [c11]Norihisa Suzuki:
Design and Evaluation of Multiprocessor Workstations. IFIP Congress 1989: 231 - [c10]Norihisa Suzuki:
TOP-1 Multiprocessor Workstation. Workshop on Parallel Lisp 1989: 353-363 - 1985
- [j7]Norihisa Suzuki:
Concurrent Prolog as an Efficient VLSI Design Language. Computer 18(2): 33-40 (1985) - 1984
- [c9]Norihisa Suzuki, Koichi Kubota, Takashi Aoki:
Sword32: A Bytecode Emulating Micorprocessor for Object-Oriented Languages. FGCS 1984: 389-397 - [c8]Norihisa Suzuki, Minoru Terada:
Creating Efficient Systems for Object-Oriented Languages. POPL 1984: 290-296 - [c7]Norihisa Suzuki:
Experience with Specification and Verification of Hardware Using PROLOG. VLSI Engineering 1984: 161-173 - 1983
- [j6]Hideyuki Nakashima, Norihisa Suzuki:
Data Abstraction in Prolog/KR. New Gener. Comput. 1(1): 49-62 (1983) - 1982
- [j5]Norihisa Suzuki:
Analysis of Pointer "Rotation". Commun. ACM 25(5): 330-335 (1982) - 1981
- [j4]Lawrence Flon, Norihisa Suzuki:
The Total Correctness of Parallel Programs. SIAM J. Comput. 10(2): 227-246 (1981) - [c6]Norihisa Suzuki:
Inferring Types in Smalltalk. POPL 1981: 187-199 - 1980
- [j3]Norihisa Suzuki, David Jefferson:
Verification Decidability of Presburger Array Programs. J. ACM 27(1): 191-205 (1980) - [c5]Norihisa Suzuki:
Analysis of Pointer Rotation. POPL 1980: 1-11
1970 – 1979
- 1979
- [j2]David C. Luckham, Norihisa Suzuki:
Verification of Array, Record, and Pointer Operations in Pascal. ACM Trans. Program. Lang. Syst. 1(2): 226-244 (1979) - 1978
- [c4]Lawrence Flon, Norihisa Suzuki:
Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs. FOCS 1978: 184-192 - 1977
- [j1]David C. Luckham, Norihisa Suzuki:
Proof of Termination within a Weak Logic of Programs. Acta Informatica 8: 21-36 (1977) - [c3]Lawrence Flon, Norihisa Suzuki:
Nondeterminism and the Correctness of Parallel Programs. Formal Description of Programming Concepts 1977: 589-608 - [c2]Norihisa Suzuki, Kiyoshi Ishihata:
Implementation of an Array Bound Checker. POPL 1977: 132-143 - 1976
- [b2]Norihisa Suzuki:
Automatic Verification of Programs with Complex Data Structures. Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York 1976, ISBN 0-8240-4425-8 - [b1]Norihisa Suzuki:
Automatic verification of programs with complex data structure. Stanford University, USA, 1976 - 1975
- [c1]Norihisa Suzuki:
Verifying programs by algebraic and logical reduction. Reliable Software 1975: 473-481
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
