Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Riener, Heinz"'
Correctness and robustness are essential for logic synthesis applications, but they are often only tested with a limited set of benchmarks. Moreover, when the application fails on a large benchmark, the debugging process may be tedious and time-consu
Externí odkaz:
http://arxiv.org/abs/2207.13487
The adiabatic quantum-flux parametron (AQFP) is a promising energy-efficient superconducting technology. Before technology mapping, additional buffer and splitter cells need to be inserted into AQFP circuits to fulfill two special constraints: (1) In
Externí odkaz:
http://arxiv.org/abs/2109.00291
We define the problem of learning a transducer ${S}$ from a target language $U$ containing possibly conflicting transducers, using membership queries and conjecture queries. The requirement is that the language of ${S}$ be a subset of $U$. We argue t
Externí odkaz:
http://arxiv.org/abs/2011.07630
This paper proposes a new logic optimization paradigm based on circuit simulation, which reduces the need for Boolean computations such as SAT-solving or constructing BDDs. The paper develops a Boolean resubstitution framework to demonstrate the effe
Externí odkaz:
http://arxiv.org/abs/2007.02579
Autor:
Bloem, Roderick, Fey, Goerschwin, Greif, Fabian, Koenighofer, Robert, Pill, Ingo, Riener, Heinz, Roeck, Franz
Constructing good test cases is difficult and time-consuming, especially if the system under test is still under development and its exact behavior is not yet fixed. We propose a new approach to compute test strategies for reactive systems from a giv
Externí odkaz:
http://arxiv.org/abs/1809.01607
We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function. The approach c
Externí odkaz:
http://arxiv.org/abs/1807.11103
Autor:
Soeken, Mathias, Riener, Heinz, Haaswijk, Winston, Testa, Eleonora, Schmitt, Bruno, Meuli, Giulia, Mozafari, Fereshte, Lee, Siang-Yun, Calvino, Alessandro Tempia, Marakkalage, Dewmini Sudara, De Micheli, Giovanni
We present a collection of modular open source C++ libraries for the development of logic synthesis applications. These libraries can be used to develop applications for the design of classical and emerging technologies, as well as for the implementa
Externí odkaz:
http://arxiv.org/abs/1805.05121
Autor:
Soeken, Mathias, Meuli, Giulia, Schmitt, Bruno, Mozafari, Fereshte, Riener, Heinz, De Micheli, Giovanni
Publikováno v:
Philosophical Transactions: Mathematical, Physical and Engineering Sciences, 2020 Feb 01. 378(2164), 1-16.
Externí odkaz:
https://www.jstor.org/stable/26874496
Publikováno v:
EPTCS 178, 2015, pp. 22-32
We propose a path-based approach to program repair for imperative programs. Our repair framework takes as input a faulty program, a logic specification that is refuted, and a hint where the fault may be located. An iterative abstraction refinement lo
Externí odkaz:
http://arxiv.org/abs/1503.04914
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.