Demo Data from VLDB 2026 / reviewers in the wild / expert
Bruce Wieand
dblp:49/4128
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 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 |
Software maintenance and evolution · 77% Program verification · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software maintenance and evolution › software documentation › documentation analysis
comments analysis |
0.0 | 1 | 1994 | QDA-A Method for Systematic Informal Program Analysis · IEEE Trans. Software Eng. 1994 |
Program verification › automated verification
lightweight verification |
0.0 | 1 | 1994 | QDA-A Method for Systematic Informal Program Analysis · IEEE Trans. Software Eng. 1994 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | QDA-A Method for Systematic Informal Program AnalysisabstractFormal verification of program properties may be infeasible or impractical, and informal analysis may be sufficient. Informal analysis involves the informal acceptance, by inspection, of the validity of program properties or steps in an analysis. Informal analysis may also involve abstraction. Abstraction can be used to eliminate details and concentrate on more general properties. Abstraction will result in informal analysis if it includes the use of undefined properties. A systematic, informal method for analysis called QDA (Quick Defect Analysis) is described. QDA is a comments analysis process based on facts and hypotheses. Facts are used to create an abstract program model, and hypotheses are selected, nonobvious program properties which are identified as needing verification. Hypotheses are proved from the facts that define an abstraction. QDA is hypothesis-driven in the sense that only those parts of an abstraction that are needed to prove hypotheses are created. The QDA approach was applied to a previously well tested operational flight program (OFP). The QDA method and the results of the OFP experiment are presented. The problems of incomplete or unsound informal analysis are analyzed, the relationship of QDA to other analysis methods is discussed, and suggested improvements to the QDA method are described.> William E. Howden, Bruce Wieand |
IEEE Trans. Software Eng. | 2 |
| 1991 | Verification of complex systems using incremental operational specifications
William E. Howden, David Nesbitt, Cheron Vail, Bruce Wieand |
Inf. Sci. | 4 |