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.

Marco Renedo

dblp:91/2460 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—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
Programming languages and type systems · 30% Software testing · 23% Program analysis · 23%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › object-oriented programming
object protocols
0.012000
Compiler and tool support for debugging object protocols · SIGSOFT FSE 2000
Software testing › protocol testing
protocol conformance checking
0.012000
Compiler and tool support for debugging object protocols · SIGSOFT FSE 2000
Debugging and program repair
runtime debugging
0.012000
Compiler and tool support for debugging object protocols · SIGSOFT FSE 2000
Program analysis
static analysis
0.012000
Compiler and tool support for debugging object protocols · SIGSOFT FSE 2000
Programming languages and type systems
type systems
0.012000
Compiler and tool support for debugging object protocols · SIGSOFT FSE 2000

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

static checking · 0.0runtime checking · 0.0predicate association · 0.0
YearPublicationVenuePosition
2000 Compiler and tool support for debugging object protocols
abstract
We describe an extension to the Java programming language that supports static conformance checking and dynamic debugging of object “protocols,” i.e., sequencing constraints on the order in which methods may be called. Our Java protocols have a statically checkable subset embedded in richer descriptions that can be checked at run time. The statically checkable subtype conformance relation is based on Nierstrasz' proposal for regular (finite-state) process types, and is also very close to the conformance relation for architectural connectors in the Wright architectural description language by Allen and Garlan. Richer sequencing properties, which cannot be expressed by regular types alone, can be specified and checked at run time by associating predicates with object states. We describe the language extensions and their rationale, and the design of tool support for static and dynamic checking and debugging.
Sergey Butkevich, Marco Renedo, Gerald Baumgartner, Michal Young
SIGSOFT FSE2