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

Viktor K. Sabelfeld

dblp:55/155 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2004
—ORCID · none

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

Theory of computation · 5 · 5 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1 · 1 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
formal synthesis
0.012004
Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis · DAC 2004
Electronic design automation › hardware verification and test
formal verification
0.012004
Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis · DAC 2004
Electronic design automation
high-level synthesis
0.012004
Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis · DAC 2004
Electronic design automation › high-level synthesis
scheduling
0.012004
Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis · DAC 2004
Electronic design automation › hardware verification and test › formal verification
theorem proving
0.012004
Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis · DAC 2004

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

control flow oriented representation · 0.0behavior-preserving transformations · 0.0
YearPublicationVenuePosition
2004 Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis
abstract
Formal synthesis ensures the correctness of hardware synthesis by automatically deriving the circuit implementation by behavior preserving transformations within a theorem prover. In this paper, we present a new approach to formal synthesis that is able to handle control flow intensive descriptions. In particular, we consider here the scheduling phase, which is a central task in high-level synthesis. We describe a methodology employing a new control flow oriented representation which allows the fully automatic scheduling of control flow intensive descriptions in formal synthesis. To obtain scheduled circuits of high quality, the scheduling is guided by conventional scheduling algorithms.
Kai Kapp, Viktor K. Sabelfeld
DAC2
2000 The tree equivalence of linear recursion schemes
Viktor K. Sabelfeld
Theor. Comput. Sci.1
1997 Simple Semantic Analysis Problems for Functional Programs
abstract
No abstract available.
Viktor K. Sabelfeld, Andrei Sabelfeld
ICFP1
1990 An Algorithm Deciding Functional Equivalence in a New Class of Program Schemes
Viktor K. Sabelfeld
Theor. Comput. Sci.1
1981 Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable
Viktor K. Sabelfeld
Inf. Process. Lett.1
1980 The Logic-Termal Equivalence is Polynomial-Time Decidable
Viktor K. Sabelfeld
Inf. Process. Lett.1
1978 Äquivalente Transformationen für Flußdiagramme
Viktor K. Sabelfeld
Acta Informatica1