Stephanie Dietzel

dblp:75/9656 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Software engineering, systems software and programming languages · 2

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 · 77% Program analysis · 23%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › type checking
pluggable type checking
0.112011
Building and using pluggable type-checkers · ICSE 2011
Programming languages and type systems
type checking
0.112011
Building and using pluggable type-checkers · ICSE 2011
Program analysis › error detection
compile-time error detection
0.012011
Building and using pluggable type-checkers · ICSE 2011
Program analysis
static analysis
0.012011
Building and using pluggable type-checkers · ICSE 2011

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

type system refinement · 0.1
YearPublicationVenuePosition
2012 Verification games: making verification fun
abstract
Program verification is the only way to be certain that a given piece of software is free of (certain types of) errors --- errors that could otherwise disrupt operations in the field. To date, formal verification has been done by specially-trained engineers. Labor costs have heretofore made formal verification too costly to apply beyond small, critical software components.
Werner Dietl, Stephanie Dietzel, Michael D. Ernst, Nathaniel Mote, Brian Walker, Seth Cooper, Timothy Pavlik, Zoran Popovic
FTfJP@ECOOP2
2011 Building and using pluggable type-checkers
abstract
This paper describes practical experience building and using pluggable type-checkers. A pluggable type-checker refines (strengthens) the built-in type system of a programming language. This permits programmers to detect and prevent, at compile time, defects that would otherwise have been manifested as run-time errors. The prevented defects may be generally applicable to all programs, such as null pointer dereferences. Or, an application-specific pluggable type system may be designed for a single application.
Werner Dietl, Stephanie Dietzel, Michael D. Ernst, Kivanç Muslu, Todd W. Schiller
ICSE2