EDBT 2026 Demo / reviewers in the wild / expert
Jacob Neal Sarvela
dblp:39/3775
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 4
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
3 papers |
Requirements engineering and software design · 90% Programming languages and type systems · 10% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Requirements engineering and software design › design process
stepwise refinement |
0.1 | 2 | 2004 | Scaling Step-Wise Refinement · IEEE Trans. Software Eng. 2004 Scaling Step-Wise Refinement · ICSE 2003 |
Requirements engineering and software design › software product lines
feature-oriented software development |
0.0 | 1 | 2004 | Scaling Step-Wise Refinement · IEEE Trans. Software Eng. 2004 |
Requirements engineering and software design
separation of concerns |
0.0 | 1 | 2003 | Refinements and multi-dimensional separation of concerns · ESEC / SIGSOFT FSE 2003 |
Requirements engineering and software design
software product lines |
0.0 | 1 | 2003 | Scaling Step-Wise Refinement · ICSE 2003 |
Requirements engineering and software design
software architecture |
0.0 | 1 | 2004 | Scaling Step-Wise Refinement · IEEE Trans. Software Eng. 2004 |
Programming languages and type systems › specification language
algebraic specification |
0.0 | 1 | 2003 | Scaling Step-Wise Refinement · ICSE 2003 |
Programming languages and type systems › programming paradigms
feature-oriented programming |
0.0 | 1 | 2003 | Refinements and multi-dimensional separation of concerns · ESEC / SIGSOFT FSE 2003 |
Methods — techniques the papers use, named apart from their topics
stepwise refinement · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Lifting transformational models of product lines: a case study
Greg Freeman, Don S. Batory, R. Greg Lavender, Jacob Neal Sarvela |
Softw. Syst. Model. | 4 |
| 2004 | Scaling Step-Wise RefinementabstractStep-wise refinement is a powerful paradigm for developing a complex program from a simple program by adding features incrementally. We present the AHEAD (algebraic hierarchical equations for application design) model that shows how step-wise refinement scales to synthesize multiple programs and multiple noncode representations. AHEAD shows that software can have an elegant, hierarchical mathematical structure that is expressible as nested sets of equations. We review a tool set that supports AHEAD. As a demonstration of its viability, we have bootstrapped AHEAD tools from equational specifications, refining Java and nonJava artifacts automatically; a task that was accomplished only by ad hoc means previously. Don S. Batory, Jacob Neal Sarvela, Axel Rauschmayer |
IEEE Trans. Software Eng. | 2 |
| 2003 | Scaling Step-Wise RefinementabstractStep-wise refinement is a powerful paradigm for developing a complex program from a simple program by adding features incrementally. We present the AHEAD (Algebraic Hierarchical Equations for Application Design) model that shows how step-wise refinement scales to synthesize multiple programs and multiple non-code representations. AHEAD shows that software can have an elegant, hierarchical mathematical structure that is expressible as nested sets of equations. We review a tool set that supports AHEAD. As a demonstration of its viability, we have bootstrapped AHEAD tools solely from equational specifications, generating Java and non-Java artifacts automatically, a task that was accomplished only by ad hoc means previously. Don S. Batory, Jacob Neal Sarvela, Axel Rauschmayer |
ICSE | 2 |
| 2003 | Refinements and multi-dimensional separation of concernsabstractStep-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number of features that the program has. Critical to the scalability of SWR are multi-dimensional models that separate orthogonal feature sets. Let n be the dimensionality of a model and k be the number of features along a dimension. We show program specifications that could be O(kn) features long have short and easy-to-understand specifications of length O(kn) when multi-dimensional models are used. We present new examples of multidimensional models: a micro example of a product-line (whose programs are 30 lines of code) and isomorphic macro examples (whose programs exceed 30K lines of code). Our work provides strong evidence that SWR scales to synthesis of large systems. Don S. Batory, Jacob Neal Sarvela |
ESEC / SIGSOFT FSE | 3 |