Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

J. T. Deutsch

dblp:74/6013 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Debugging and program repair
error localization
0.011990
'Defensive programming' in the rapid development of a parallel scientific program · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
High-performance computing
scientific computing systems
0.011990
'Defensive programming' in the rapid development of a parallel scientific program · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990

Methods — techniques the papers use, named apart from their topics

tracing · 0.0invariance assertions · 0.0checksums · 0.0checksum · 0.0
YearPublicationVenuePosition
1990 'Defensive programming' in the rapid development of a parallel scientific program
abstract
A set of programming techniques which can reduce the time required to develop scientific programs is presented. Subroutines are designed to allow every execution path to be tested independently. Checksums are used to compress arrays and groups of variables without losing meaningful debugging information. Invariance assertions on checksums are used to detect incorrect behavior of a program at a place near the source of the error. Traces of checksums of groups of variables are used to monitor the time evolution of intermediate results. By comparing the checksums produced in tracing the program and the checksums produced in tracing a reference copy of the program, errors can be rapidly localized when a program is modified, ported, put in parallel, or optimized for a particular machine.>
D. Y. Cheng, J. T. Deutsch, Robert W. Dutton
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2