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

Felix Winterer

dblp:242/2413 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-8344-1615ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Theoretical computer science
1 paper
Automated reasoning and model checking · 100%
Artificial intelligence
1 paper

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

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking › model checking
hardware model checking
0.712023
Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Automated reasoning and model checking › model checking
property directed reachability
0.712023
Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023

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

complexity analysis · 1.3benchmark evaluation · 1.3
YearPublicationVenuePosition
2023 Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR
abstract
In this article, we revisit the topic of generalizing proof obligations (POs) in bit-level property directed reachability (PDR). We provide a comprehensive study which: 1) determines the complexity of the problem; 2) thoroughly analyzes limitations of existing methods; 3) introduces approaches to PO generalization that have never been used in the context of PDR; 4) compares the strengths of different methods from a theoretical point of view; and 5) intensively evaluates the methods on various benchmarks from the hardware model checking as well as from AI planning.
Tobias Seufert, Felix Winterer, Christoph Scholl 0001, Karsten Scheibler, Tobias Paxian, Bernd Becker 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2021 ICP and IC3
abstract
If embedded systems are used in safety-critical environments, they need to meet several standards. For example, in the automotive domain the ISO 26262 standard requires that the software running on such systems does not contain unreachable code. Software model checking is one effective approach to automatically detect such dead code. Being used in a commercial product, iSAT3 already performs very well in this context. In this paper we integrate IC3 into iSAT3 in order to improve its dead code detection capabilities even further.
Karsten Scheibler, Felix Winterer, Tobias Seufert, Tino Teige, Christoph Scholl 0001, Bernd Becker 0001
DATE2
2019 SMILE Goes Gaming: Gamification in a Classroom Response System for Academic Teaching
Leonie Feldbusch, Felix Winterer, Johannes Gramsch, Linus Feiten, Bernd Becker 0001
CSEDU (2)2