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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Graziella Zalateu

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

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

Software engineering, systems software and programming languages · 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
Empirical software engineering · 77% Programming languages and type systems · 23%

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

TopicWeightPapersLastEvidence papers
Empirical software engineering
software metrics		 0.011989
Validating Halstead's Theory for Pascal Programs · IEEE Trans. Software Eng. 1989
Programming languages and type systems › programming paradigms › imperative languages
pascal		 0.011989
Validating Halstead's Theory for Pascal Programs · IEEE Trans. Software Eng. 1989

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

empirical validation · 0.0
YearPublicationVenuePosition
1989 Validating Halstead's Theory for Pascal Programs
abstract
M.H. Halstead's theory (1977) has been validated for different languages, but Pascal programs seem to fit only partially with the theory. D.B. Johnston and A.M. Lister (1981) first recognized the lack of operators due to the structure of this language and proposed a modification of Halstead's formula. The article confirms their results but suggests a correction to their formula, which is particularly necessary for large programs. Experimental results, obtained by examining about 550 Pascal programs, represent the widest test to date of Halstead theory with regard to Pascal programs.>
Leonardo Felician, Graziella Zalateu
 IEEE Trans. Software Eng.2