activity
20152021
most citedIrredundant Buffer and Splitter Insertion and Scheduling-Based Optimization for AQFP Circuits

6 citations · 6 across the 4 of their papers we have counts for

collaborators

6 papers

cs.LO20216 cited

Irredundant Buffer and Splitter Insertion and Scheduling-Based Optimization for AQFP Circuits

Siang-Yun Lee, Heinz Riener, Giovanni De Micheli

The adiabatic quantum-flux parametron (AQFP) is a promising energy-efficient superconducting technology. Before technology mapping, additional buffer and splitter cells need to be…

cs.FL2020

Safety Synthesis Sans Specification

Roderick Bloem, Hana Chockler, Masoud Ebrahimi +2

We define the problem of learning a transducer from a target language containing possibly conflicting transducers, using membership queries and conjecture queries. The re…

cs.LO2020

Simulation-Guided Boolean Resubstitution

Siang-Yun Lee, Heinz Riener, Alan Mishchenko +2

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 pap…

cs.SE2018

Synthesizing Adaptive Test Strategies from Temporal Logic Specifications

Roderick Bloem, Goerschwin Fey, Fabian Greif +4

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 n…

cs.LO2018

Exact Synthesis of ESOP Forms

Heinz Riener, Rüdiger Ehlers, Bruno Schmitt +1

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 fin…

cs.PL2015

Path-Based Program Repair

Heinz Riener, Rüdiger Ehlers, Görschwin Fey

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…