Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Viktor K. Sabelfeld"'
Publikováno v:
itit. 41:12-16
Autor:
Viktor K. Sabelfeld
Publikováno v:
Formal Methods in Programming and Their Applications ISBN: 354057316X
Formal Methods in Programming and Their Applications
Formal Methods in Programming and Their Applications
This paper describes an approximation semantics \(\left[\kern-0.15em\left[ p\right]\kern-0.15em\right]\)for programs p of the applicative language AL [Br 92, De 92]. We show that the approximation semantics of each program term can be effectively com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce4f46ee37acef6d48bcd269dfe456f5
https://doi.org/10.1007/bfb0039708
https://doi.org/10.1007/bfb0039708
Autor:
Kai Kapp, Viktor K. Sabelfeld
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540208136
Ershov Memorial Conference
Ershov Memorial Conference
The Formal Synthesis methodology can be considered as the application of the transformational approach to circuit synthesis by logical transformations performed in a theorem prover. Additionally to the implementation of the circuit, the proof that th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a0e0a0df29b95c50a53c35de6e95ddb
https://doi.org/10.1007/978-3-540-39866-0_10
https://doi.org/10.1007/978-3-540-39866-0_10
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540430759
Ershov Memorial Conference
Ershov Memorial Conference
In formal synthesis methodology, circuit implementations are derived from specifications by means of elementary logical transformation steps, which are performed within a theorem prover.In this approach, additionally to the circuit implementation, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0438fb81fe60e94294678582c6de4de9
https://doi.org/10.1007/3-540-45575-2_16
https://doi.org/10.1007/3-540-45575-2_16
Autor:
Viktor K. Sabelfeld, Klaus Schneider
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540671022
Ershov Memorial Conference
Ershov Memorial Conference
We show how the synchronous programming language Esterel can be extended by a new statement to implement mutual exclusive code sections. We also show how the thereby extended Esterel language can be translated back to standard Esterel and we prove th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9feb7aee4293af8210e5076488c3ffe0
https://doi.org/10.1007/3-540-46562-6_40
https://doi.org/10.1007/3-540-46562-6_40
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540665595
CHARME
CHARME
In our terminology,t he term "formal synthesis" stands for a synthesis process where the implementation is derived from the specification by applying elementary mathematical rules within a theorem prover. As a result the implementation is guaranteed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf155050c8cdcd844220a42ee6de138a
https://doi.org/10.1007/3-540-48153-2_15
https://doi.org/10.1007/3-540-48153-2_15
Autor:
Viktor K. Sabelfeld, Andrei Sabelfeld
Publikováno v:
Proceedings of the second ACM SIGPLAN international conference on Functional programming - ICFP '97.
Autor:
Viktor K. Sabelfeld
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540620648
Ershov Memorial Conference
Ershov Memorial Conference
In the paper, a complete system of transformation rules preserving the tree equivalence and a polynomial-time algorithm deciding the tree equivalence of linear polyadic recursion schemes are proposed.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::982432636d9d060ba94622525956fb93
https://doi.org/10.1007/3-540-62064-8_29
https://doi.org/10.1007/3-540-62064-8_29
Autor:
Viktor K. Sabelfeld
Publikováno v:
Information Processing Letters. 10:57-62
Autor:
Viktor K. Sabelfeld
Publikováno v:
Information Processing Letters. 13:147-153