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.

Martijn van Berkum

dblp:13/186 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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 · 91% Programming languages and type systems · 9%

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

TopicWeightPapersLastEvidence papers
Program verification › code-level verification
object-oriented verification
0.011998
Reasoning about Java Classes (Preliminary Report) · OOPSLA 1998
Program verification
proof assistants
0.011998
Reasoning about Java Classes (Preliminary Report) · OOPSLA 1998
Program verification
theorem proving
0.011998
Reasoning about Java Classes (Preliminary Report) · OOPSLA 1998
Programming languages and type systems › object-oriented programming
java
0.011998
Reasoning about Java Classes (Preliminary Report) · OOPSLA 1998

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

theorem proving · 0.0higher-order logic · 0.0
YearPublicationVenuePosition
2004 A Combined Runtime Environment and Web-Based Development Environment for Web Application Engineering
Martijn van Berkum, Sjaak Brinkkemper, Arthur Meyer
CAiSE1
1998 Reasoning about Java Classes (Preliminary Report)
abstract
We present the first results of a project called LOOP, on formal methods for the object-oriented language Java. It aims at verification of program properties, with support of modern tools. We use our own front-end tool (which is still partly under construction) for translating Java classes into higher order logic, and a back-end theorem prover (namely PVS, developed at SRI) for reasoning. In several examples we demonstrate how non-trivial properties of Java programs and classes can be proven following this two-step approach.
Bart Jacobs 0001, Joachim van den Berg, Marieke Huisman, Martijn van Berkum
OOPSLA4