Demo Data from SIGIR 2026 / reviewers in the wild / expert
Charles B. Weinstock
dblp:57/1628
· DBLP profile ↗
5ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3 · 1 first-authorSystems, architecture and hardware · 2Security and privacy · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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 |
Requirements engineering and software design · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Processor architecture and microarchitecture · 77% Parallel and multicore computing · 23% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Requirements engineering and software design
assurance case |
0.2 | 1 | 2013 | Eliminative induction: a basis for arguing system confidence · ICSE 2013 |
Parallel and multicore computing
parallel programming models |
0.0 | 1 | 1988 | Programming at the Processor-Memory-Switch Level · ICSE 1988 |
Methods — techniques the papers use, named apart from their topics
eliminative induction · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Eliminative induction: a basis for arguing system confidenceabstractAssurance cases provide a structured method of explaining why a system has some desired property, e.g., that the system is safe. But there is no agreed approach for explaining what degree of confidence one should have in the conclusions of such a case. In this paper, we use the principle of eliminative induction to provide a justified basis for assessing how much confidence one should have in an assurance case argument. John B. Goodenough 0002, Charles B. Weinstock, Ari Z. Klein |
ICSE | 2 |
| 2007 | Assurance Cases for Security: The Metrics ChallengeabstractFor critical systems it is important to know whether the system is trustworthy and to be able to communicate, review and debate the level of trust achieved. In the safety domain, explicit Safety Cases are increasingly required by law, regulations and standards. Yet the need to understand risks is not just a safety issue and the type of argumentation used for safety cases is not specific to safety alone. Prior workshops, beginning with one held at DSN 2004, have identified a number of technical, policy and research challenges. The focus of this workshop is on one of these challenges: metrics for assurance cases for security. Robin E. Bloomfield, Marcelo Masera, Ann Miller, O. Sami Saydjari, Charles B. Weinstock |
DSN | 5 |
| 1990 | Application-Level ProgrammingabstractThe use of a declarative language, called Dura, designed to support application-level programming is illustrated by distributed avionics system. The authors show how the language is used to describe the application, its components and structure; how the run-time executive provides support for fault-tolerance by reconfiguration of the application; and how an interactive interface to the executive supports debugging and monitoring of the application.> Mario Barbacci, Dennis L. Doubleday, Charles B. Weinstock |
ICDCS | 3 |
| 1988 | Programming at the Processor-Memory-Switch Level
Mario Barbacci, Charles B. Weinstock, Jeannette M. Wing |
ICSE | 2 |
| 1978 | Reconfiguration stategies for the SIFT fault-tolerant computerabstractWe describe methods for achieving an acceptable level of fault-tolerance in a multiprocessor designed for the execution of critical flight tasks on commercial aircraft. The SIFT (Software Implemented Fault-tolerant) system differs from other reliable computer architectures in the manner of utilization of redundant resources. The SIFT system is designed to cope with hardware faults by detecting discrepancies in the results computed by separately executed versions of critical programs. When such a discrepancy occurs we identify the processor/memory unit, bus unit, or processor/bus interface that has failed. A reconfiguration of task execution among the available resources is carried out to avoid the use of hardware units that have been identified as faulty or unreliable. We explain how the identification of faulty units can be effected, how the system may be reconfigured to avoid use of faulty units, and show that these reconfiguration policies are "safe" with respect to faults that do not occur in separated units during the short interval required to carry out the reconfiguration of tasks. Charles B. Weinstock, Milton W. Green |
COMPSAC | 1 |