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

Jacob Loth

dblp:355/1393 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved

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

Software engineering, systems software and programming languages · 1 · 1 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
Requirements engineering and software design · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design › software product lines
feature models
0.812024
Efficient Slicing of Feature Models via Projected d-DNNF Compilation · ASE 2024
Requirements engineering and software design › software product lines › feature models
feature model slicing
0.812024
Efficient Slicing of Feature Models via Projected d-DNNF Compilation · ASE 2024
Requirements engineering and software design
model-driven engineering
0.812024
Efficient Slicing of Feature Models via Projected d-DNNF Compilation · ASE 2024
Automated reasoning and model checking › knowledge compilation
d-DNNF
0.812024
Efficient Slicing of Feature Models via Projected d-DNNF Compilation · ASE 2024
Automated reasoning and model checking
knowledge compilation
0.812024
Efficient Slicing of Feature Models via Projected d-DNNF Compilation · ASE 2024

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

projected d-DNNF compilation · 1.5SAT solving · 1.5#SAT solving · 1.5
YearPublicationVenuePosition
2024 Efficient Slicing of Feature Models via Projected d-DNNF Compilation
abstract
Configurable systems often contain components from different fields or disciplines that are relevant for distinct stakeholders. For instance, tests or analyses targeting interactions of the software of a cyber-physical system may be only applicable for software components. However, managing such components in isolation is not trivial due, for instance, interdependencies between features. Feature models are a common formalism to specify such dependencies. Feature-model slicing corresponds to creating a subset of the feature model (e.g., with only components relevant to a particular stakeholder) that still preserves transitive dependencies from discarded features. However, slicing is computationally expensive and subsequent analyses often depend on complex computations, such as SAT or #SAT. With knowledge compilation, the original feature model can be translated to a beneficial format (e.g., d-DNNF or BDD) with an initial effort that accelerates subsequent analyses. Consequentially, acquiring a sliced target format depends on two expensive subsequent algorithms. In this work, we merge both steps by proposing projected d-DNNF compilation; a novel way to slice feature models that coincidently performs knowledge compilation to d-DNNF. Our empirical evaluation on real-world feature models shows that our tool pd4 often reduces runtimes substantially compared to existing techniques and scales to more input instances.
Chico Sundermann, Jacob Loth, Thomas Thüm
ASE2