Viktor K. Sabelfeld

According to our database1, Viktor K. Sabelfeld
  • authored at least 18 papers between 1975 and 2004.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2004
Scheduling of Control Flow Intensive Behavioral Descriptions in Formal Synthesis.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 2004

Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis.
Proceedings of the 41th Design Automation Conference, 2004

2003
Arithmetic in Formal Synthesis.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 2003

Dead Code Elimination in Formal Synthesis.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 2003

Numeric Types in Formal Synthesis.
Proceedings of the Perspectives of Systems Informatics, 2003

2001
Semantics and Transformations in Formal Synthesis at System Level.
Proceedings of the Perspectives of System Informatics, 2001

2000
The tree equivalence of linear recursion schemes.
Theor. Comput. Sci., 2000

1999
Formale Verifikation eingebetteter Systeme.
it+ti - Informationstechnik und Technische Informatik, 1999

Introducing Mutual Exclusion in Esterel.
Proceedings of the Perspectives of System Informatics, 1999

Formal Synthesis at the Algorithmic Level.
Proceedings of the Correct Hardware Design and Verification Methods, 1999

1997
Simple Semantic Analysis Problems for Functional Programs.
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997

1996
The Tree Equivalence Problem for Linear Recursion Schemes.
Proceedings of the Perspectives of System Informatics, 1996

1993
Analysis of Some Semantic Properties for Programs of the Applicative Language AL.
Proceedings of the Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28, 1993

1990
An Algorithm Deciding Functional Equivalence in a New Class of Program Schemes.
Theor. Comput. Sci., 1990

1981
Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable.
Inf. Process. Lett., 1981

1980
The Logic-Termal Equivalence is Polynomial-Time Decidable.
Inf. Process. Lett., 1980

1978
Äquivalente Transformationen für Flußdiagramme.
Acta Inf., 1978

1975
Procedure implementation in a multi-language translator.
Proceedings of the Methods of Algorithmic Language Implementation [Symposium, 1975


  Loading...