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

H. J. Boom

dblp:12/4756 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1988
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 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
Program verification · 62% Programming languages and type systems · 38%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
language semantics		 0.011982
A Weaker Precondition for Loops · ACM Trans. Program. Lang. Syst. 1982
Program verification › predicate transformers
weakest precondition		 0.011982
A Weaker Precondition for Loops · ACM Trans. Program. Lang. Syst. 1982
Program verification
deductive verification		 0.011982
A Weaker Precondition for Loops · ACM Trans. Program. Lang. Syst. 1982
Program verification › invariant verification › invariant-based verification
loop invariants		 0.011982
A Weaker Precondition for Loops · ACM Trans. Program. Lang. Syst. 1982

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

predicate transformer semantics · 0.0
YearPublicationVenuePosition
1988 Lazy Variable-Renumbering Makes Substitution Cheap
H. J. Boom
 Inf. Process. Lett.1
1982 A Weaker Precondition for Loops
abstract
article Free Access Share on A Weaker Precondition for Loops Author: H. J. Boom Computer Science Department, Concordia University, 1455 de Maisonneuve Boulevard West, Montreal, P.Q., Canada H3G 1M8 Computer Science Department, Concordia University, 1455 de Maisonneuve Boulevard West, Montreal, P.Q., Canada H3G 1M8View Profile Authors Info & Claims ACM Transactions on Programming Languages and SystemsVolume 4Issue 4Oct. 1982 pp 668–677https://doi.org/10.1145/69622.357189Published:01 October 1982Publication History 26citation454DownloadsMetricsTotal Citations26Total Downloads454Last 12 Months33Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
H. J. Boom
 ACM Trans. Program. Lang. Syst.1
1980 A Critical Comparison of Several Programming Language Implementations
abstract
Abstract The implementations of Algol 60, FORTRAN, Pascal and Algol 68 provided on the CDC Cyber 73 of the Stichting Academisch Rekencentrum Amsterdam are compared on both qualitative and quantitative aspects. This paper concentrates on those aspects which are likely to be of interest to language designers and implementers, and to users of other computer systems.
H. J. Boom, Edwin D. de Jong
 Softw. Pract. Exp.1