EDBT 2026 Demo / reviewers in the wild / expert
August Schwerdfeger
dblp:82/424
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 5 · 2 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 |
Programming languages and type systems · 100% | |
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems
language design |
0.1 | 1 | 2009 | Verifiable composition of deterministic grammars · PLDI 2009 |
Programming languages and type systems › language design
language extension |
0.1 | 1 | 2009 | Verifiable composition of deterministic grammars · PLDI 2009 |
Automata and formal languages › formal grammars
deterministic grammar |
0.0 | 1 | 2009 | Verifiable composition of deterministic grammars · PLDI 2009 |
Methods — techniques the papers use, named apart from their topics
parser generation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Frankencode: Creating Diverse Programs Using Code ClonesabstractIn this paper, we present an approach to detecting novel cyber attacks though a form of program diversification, similar to the use of n-version programming for fault tolerant systems. Building on extensive previous and ongoing work by others on the use of code clones in a wide variety of areas, our Functionally Equivalent Variants using Information Synchronization (FEVIS) system automatically generates program variants to berun in parallel, seeking to detect attacks through divergence in behavior. Unlike approaches to diversification that only change program memory layout and behavior, FEVIS can detect attacks exploiting vulnerabilities in execution timing, string processing, and other logic errors. We are in the early stages of research and development for this approach, but have made sufficient progress to provide a proof of concept and some lessons learned. In this paper we describe FEVIS and its application to diversifying an open-source webserver, with results on several different example classes of attack which FEVIS will detect. Hayley Borck, Mark S. Boddy, Ian J. De Silva, Steven A. Harp, Ken Hoyme, Steven Johnston, August Schwerdfeger, Mary Southern |
SANER | 7 |
| 2009 | Verifiable composition of deterministic grammarsabstractThere is an increasing interest in extensible languages, August Schwerdfeger, Eric Van Wyk |
PLDI | 1 |
| 2009 | Verifiable Parse Table Composition for Deterministic Parsing
August Schwerdfeger, Eric Van Wyk |
SLE | 1 |
| 2007 | Attribute Grammar-Based Language Extensions for Java
Eric Van Wyk, Lijesh Krishnan, Derek Bodin, August Schwerdfeger |
ECOOP | 4 |
| 2007 | Context-aware scanning for parsing extensible languagesabstractThis paper introduces new parsing and context-aware scanning algorithms in which the scanner uses contextual information to disambiguate lexical syntax. The parser uses a slightly modified LR-style algorithm that passes to the scanner the set of valid symbols that the scanner may return at that point in parsing. This set is those terminals whose entries in the parse table for the current parse state are shift, reduce, or accept, but not error. The scanner then only returns tokens in this set. An analysis is given that can statically verify that the scanner will never return more than one token for a single input. Context-aware scanning is especially useful when parsing and scanning extensible languages in which domain specific languages can be embedded. It has been used in extensible versions of Java 1.4 and ANSI C. We illustrate this approach with a declarative specification of a subset of Java and extensions that embed SQL queries and Boolean expression tables into Java. Eric Van Wyk, August Schwerdfeger |
GPCE | 2 |