default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDViktor K. Sabelfeld
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[c12]Kai Kapp, Viktor K. Sabelfeld:
Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis. DAC 2004: 61-66- [c11]Kai Kapp, Viktor K. Sabelfeld:
Scheduling of Control Flow Intensive Behavioral Descriptions in Formal Synthesis. MBMV 2004: 204-213 - 2003
- [c10]Viktor K. Sabelfeld, Kai Kapp:
Numeric Types in Formal Synthesis. Ershov Memorial Conference 2003: 79-90 - [c9]Viktor K. Sabelfeld, Kai Kapp:
Arithmetic in Formal Synthesis. MBMV 2003: 112-120 - [c8]Kai Kapp, Viktor K. Sabelfeld:
Dead Code Elimination in Formal Synthesis. MBMV 2003: 121-130 - 2001
- [c7]Viktor K. Sabelfeld, Christian Blumenröhr, Kai Kapp:
Semantics and Transformations in Formal Synthesis at System Level. Ershov Memorial Conference 2001: 149-156 - 2000
- [j6]Viktor K. Sabelfeld:
The tree equivalence of linear recursion schemes. Theor. Comput. Sci. 238(1-2): 1-29 (2000)
1990 – 1999
- 1999
- [j5]Detlef Schmid, Klaus Schneider
, Michaela Huhn, George Logothetis, Viktor K. Sabelfeld:
Formale Verifikation eingebetteter Systeme. Informationstechnik Tech. Inform. 41(2): 12-16 (1999) - [c6]Christian Blumenröhr, Viktor K. Sabelfeld:
Formal Synthesis at the Algorithmic Level. CHARME 1999: 187-201 - [c5]Klaus Schneider, Viktor K. Sabelfeld:
Introducing Mutual Exclusion in Esterel. Ershov Memorial Conference 1999: 445-459 - 1997
- [c4]Viktor K. Sabelfeld, Andrei Sabelfeld:
Simple Semantic Analysis Problems for Functional Programs. ICFP 1997: 319 - 1996
- [c3]Viktor K. Sabelfeld:
The Tree Equivalence Problem for Linear Recursion Schemes. Ershov Memorial Conference 1996: 350-361 - 1993
- [c2]Viktor K. Sabelfeld:
Analysis of Some Semantic Properties for Programs of the Applicative Language AL. Formal Methods in Programming and Their Applications 1993: 181-189 - 1990
- [j4]Viktor K. Sabelfeld:
An Algorithm Deciding Functional Equivalence in a New Class of Program Schemes. Theor. Comput. Sci. 71(2): 265-279 (1990)
1980 – 1989
- 1981
- [j3]Viktor K. Sabelfeld:
Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable. Inf. Process. Lett. 13(4/5): 147-153 (1981) - 1980
- [j2]Viktor K. Sabelfeld:
The Logic-Termal Equivalence is Polynomial-Time Decidable. Inf. Process. Lett. 10(2): 57-62 (1980)
1970 – 1979
- 1978
- [j1]Viktor K. Sabelfeld:
Äquivalente Transformationen für Flußdiagramme. Acta Informatica 10: 127-155 (1978) - 1975
- [c1]Viktor K. Sabelfeld:
Procedure implementation in a multi-language translator. Methods of Algorithmic Language Implementation 1975: 80-89
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
