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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fabio Niephaus

dblp:177/3831 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-3297-9730ORCID · corroborated

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

Software engineering, systems software and programming languages · 4 · 1 first-author · 2 since 2021

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
Software maintenance and evolution · 33% Program analysis · 33% Program verification · 33%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Program verification › model checking › state space exploration
reachability analysis
0.812024
Finding Cuts in Static Analysis Graphs to Debloat Software · ISSTA 2024
Software maintenance and evolution › software reengineering
software debloating
0.812024
Finding Cuts in Static Analysis Graphs to Debloat Software · ISSTA 2024
Program analysis
static analysis
0.812024
Finding Cuts in Static Analysis Graphs to Debloat Software · ISSTA 2024
Graph algorithms and graph theory
graph cut
0.212024
Finding Cuts in Static Analysis Graphs to Debloat Software · ISSTA 2024
Graph algorithms and graph theory › graph cut
hypergraph cut
0.212024
Finding Cuts in Static Analysis Graphs to Debloat Software · ISSTA 2024

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

static analysis · 1.5graph cut algorithm · 1.5directed hypergraph · 1.5
YearPublicationVenuePosition
2024 Finding Cuts in Static Analysis Graphs to Debloat Software
abstract
As software projects grow increasingly more complex, debloating gains traction. While static analyses yield a coarse over-approximation of reachable code, approaches based on dynamic execution traces risk program correctness. By allowing the developer to reconsider only a few methods and still achieve a significant reduction in code size, cut-based debloating can minimize the risk. In this paper, we propose the idea of finding small cuts in the rule graphs produced by static analysis. After introducing an analysis with suitable semantics, we discuss how to encode its rules into a directed hypergraph. We then present an algorithm for efficiently finding the most effective single cut in the graph. The execution time of the proposed operations allows for the deployment in interactive tools. Finally, we show that our graph model is able to expose methods worthwhile to reconsider.
Christoph Blumschein, Fabio Niephaus, Codrut Stancu, Christian Wimmer, Jens Lincke, Robert Hirschfeld
ISSTA2
2022 Execution vs. Parse-Based Language Servers: Tradeoffs and Opportunities for Language-Agnostic Tooling for Dynamic Languages
abstract
With the wide adoption of the language server protocol, the desire to have IDE-style tooling even for niche and research languages has exploded. The Truffle language framework facilitates this desire by offering an almost zero-effort approach to language implementers to providing IDE features. However, this existing approach needs to execute the code being worked on to capture much of the information needed for an IDE, ideally with full unit-test coverage.
Stefan Marr, Humphrey Burchell, Fabio Niephaus
DLS3
2019 Language-independent development environment support for dynamic runtimes
abstract
There are many factors for the success of a new programming language implementation. Existing language implementation frameworks such as Truffle or RPython have focused on run-time performance and security, or on providing a comprehensive set of libraries.
Daniel Stolpe, Tim Felgentreff, Christian Humer, Fabio Niephaus, Robert Hirschfeld
DLS4
2019 GraalSqueak: toward a smalltalk-based tooling platform for polyglot programming
abstract
Polyglot programming provides software developers with a broader choice in terms of software libraries and frameworks available for building applications. Previous research and engineering activities have focused on language interoperability and the design and implementation of fast polyglot runtimes. To make polyglot programming more approachable for developers, novel software development tools are needed that help them build polyglot applications. We believe a suitable prototyping platform helps to more quickly evaluate new ideas for such tools. In this paper we present GraalSqueak, a Squeak/Smalltalk virtual machine implementation for the GraalVM. We report our experience implementing GraalSqueak, evaluate the performance of the language and the programming environment, and discuss how the system can be used as a tooling platform for polyglot programming.
Fabio Niephaus, Tim Felgentreff, Robert Hirschfeld
MPLR1