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

B. Maher

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

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

Software engineering, systems software and programming languages · 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
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
program transformation
0.011983
Automatic Program Improvement: Variable Usage Transformations · ACM Trans. Program. Lang. Syst. 1983

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

syntactic transformation · 0.0correspondence matrix · 0.0
YearPublicationVenuePosition
1983 Automatic Program Improvement: Variable Usage Transformations
abstract
The design objective of the Leeds Transformation System is to transform existing programs, written in a variety of languages, into "tidier" programs.The total system was conceived of as having three phases: syntactic transformations, variable usage transformations, and synthesizing features.Because programmers vary greatly in what they consider to be a more acceptable form, we have aimed to make the system as data driven as possible.(That also enables us to deal with a variety of programming languages.)The paper reviews the first two phases, reports the second in some detail, and illustrates the use of the system on an ALGOL 60 program.Redundant assignments, redundant variables, and loop-invariant statements are discovered by means of a novel approach which represents variable usage within a program as a correspondence matrix.Potential enhancements of the system are also discussed.
B. Maher, Derek H. Sleeman
ACM Trans. Program. Lang. Syst.1