BHBo-Yuan Huang

Bo-Yuan Huang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Bo-Yuan Huang has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    HarnessForge: Automated Extraction of Verification Tasks from Industry-Scale Software Projects

    by Dirk Beyer, Po-Chun Chien, Bo-Yuan Huang, Nian-Ze Lee, Thomas Lemberger

  • Open Access

    Application-level Validation of Accelerator Designs Using a Formal Software/Hardware Interface

    by Bo-Yuan Huang, Steven Lyubomirsky, Yi Li, Mike He, Gus Henry Smith, Thierry Tambe, Akash Gaonkar, Vishal Canumalla, Andrew Cheung, Gu-Yeon Wei, et al.

    Ideally, accelerator development should be as easy as software development. Several recent design languages/tools are working toward this goal, but actually testing early designs on real applications end-to-end remains prohibitively difficult due to the costs of building specialized compiler and simulator support. We propose a new first-in-class, mostly automated methodology termed “3LA” to enable end-to-end testing of prototype accelerator designs on unmodified source applications. A key contribution of 3LA is the use of a formal software/hardware interface that specifies an accelerator’s operations and their semantics. Specifically, we leverage the Instruction-level Abstraction (ILA) formal specification for accelerators that has been successfully used thus far for accelerator implementation verification. We show how the ILA for accelerators serves as a software/hardware interface, similar to the Instruction Set Architecture for processors, that can be used for automated development of compilers and instruction-level simulators. Another key contribution of this work is to show how ILA-based accelerator semantics enables extending recent work on equality saturation to auto-generate basic compiler support for prototype accelerators in a technique we term “flexible matching.” By combining flexible matching with simulators auto-generated from ILA specifications, our approach enables end-to-end evaluation with modest engineering effort. We detail several case studies of 3LA, which uncovered an unknown flaw in a recently published accelerator and facilitated its fix.


  • Open Access

    Application-Level Validation of Accelerator Designs Using a Formal Software/Hardware Interface

    by Bo-Yuan Huang, Steven Lyubomirsky, Yi Li, Mike He, Gus Henry Smith, Thierry Tambe, Akash Gaonkar, Vishal Canumalla, Andrew Cheung, Gu-Yeon Wei, et al.

    Ideally, accelerator development should be as easy as software development. Several recent design languages/tools are working toward this goal, but actually testing early designs on real applications end-to-end remains prohibitively difficult due to the costs of building specialized compiler and simulator support. We propose a new first-in-class, mostly automated methodology termed "3LA" to enable end-to-end testing of prototype accelerator designs on unmodified source applications. A key contribution of 3LA is the use of a formal software/hardware interface that specifies an accelerator's operations and their semantics. Specifically, we leverage the Instruction-Level Abstraction (ILA) formal specification for accelerators that has been successfully used thus far for accelerator implementation verification. We show how the ILA for accelerators serves as a software/hardware interface, similar to the Instruction Set Architecture (ISA) for processors, that can be used for automated development of compilers and instruction-level simulators. Another key contribution of this work is to show how ILA-based accelerator semantics enables extending recent work on equality saturation to auto-generate basic compiler support for prototype accelerators in a technique we term "flexible matching." By combining flexible matching with simulators auto-generated from ILA specifications, our approach enables end-to-end evaluation with modest engineering effort. We detail several case studies of 3LA, which uncovered an unknown flaw in a recently published accelerator and facilitated its fix.

  • INVITED: Generalizing the ISA to the ILA: A Software/Hardware Interface for Accelerator-rich Platforms

    by Bo-Yuan Huang, Hongce Zhang, Aarti Gupta, Sharad Malik

    This paper presents the Instruction-Level Abstraction (ILA) as a formal software/hardware interface for accelerator-rich platforms. The ILA provides a common framework for formal functional specification of processors and accelerator behavior, verifying their implementations, and reasoning about software-hardware interactions of programs with accelerators. The ILA-MCM specification extends the ILA to enable reasoning about interactions of accelerators with other compute engines through shared memory. The 3LA compilation flow for accelerators uses the ILA model to bridge the gap between fine-grain compiler intrinsics and coarse-grain accelerator operations.


  • Open Access

    Intelligent REST API data fuzzing

    by Patrice Godefroid, Bo-Yuan Huang, Marina Polishchuk

    The cloud runs on REST APIs. In this paper, we study how to intelligently generate data payloads embedded in REST API requests in order to find data-processing bugs in cloud services. We discuss how to leverage REST API specifications, which, by definition, contain data schemas for API request bodies. We then propose and evaluate a range of data fuzzing techniques, including structural schema fuzzing rules, various rule combinations, search heuristics, extracting data values from examples included in REST API specifications, and learning data values on-the-fly from previous service responses. After evaluating these techniques, we identify the top-performing combination and use this algorithm to fuzz several Microsoft Azure cloud services. During our experiments, we found 100s of “Internal Server Error” service crashes, which we triaged into 17 unique bugs and reported to Azure developers. All these bugs are reproducible, confirmed, and fixed or in the process of being fixed.


  • Template-Based Parameterized Synthesis of Uniform Instruction-Level Abstractions for SoC Verification

    by Pramod Subramanyan, Bo-Yuan Huang, Yakir Vizel, Aarti Gupta, Sharad Malik

    Modern system-on-chip (SoC) designs comprise programmable cores, application-specific accelerators, and I/O devices. Accelerators are controlled by software/firmware and functionality is implemented by this combination of programmable cores, firmware, and accelerators. Verification of such SoCs is challenging, especially for system-level properties maintained by a combination of firmware and hardware. Attempting to formally verify the full SoC design with both firmware and hardware is not scalable, while separate verification can miss bugs. A general technique for scalable system-level verification is to construct an abstraction of SoC hardware and verify firmware/software using it. There are two challenges in applying this technique in practice. Constructing the abstraction to capture required details and interactions is error-prone and time-consuming. The second is ensuring abstraction correctness so that properties proven with it are valid. This paper introduces a methodology for SoC design and verification based on the synthesis of instruction-level abstractions (ILAs). The ILA is an abstraction of SoC hardware which models updates to firmware-visible state at the granularity of instructions. For hardware accelerators, the ILA is analogous to the instruction-set architecture definition for programmable processors and enables scalable verification of firmware interacting with hardware accelerators. To alleviate the disadvantages of manual construction of abstractions, we introduce two algorithms for synthesis of ILAs from partial description called templates. We then show how the ILA can be verified to be correct. We evaluate the methodology using a small SoC design consisting of the 8051 microcontroller and two cryptographic accelerators. The methodology uncovered 15 bugs.


  • Protocol Design and Game Theoretic Solutions for Device-to-Device Radio Resource Allocation

    by Shih-Tang Su, Bo-Yuan Huang, Chih-Yu Wang, Che-Wei Yeh, Hung-Yu Wei

    Device-to-device (D2D) communication has been proposed to improve the resource efficiency and lighten the heavy load of the base station (BS) in Long-Term Evolution (LTE)-Advanced systems. In a D2D-enabled LTE-A system, the resource efficiency is primarily determined by D2D/cellular mode selection and resource allocation. However, the D2D channel quality, which is the key factor for the BS to allocate resources, cannot be learned directly by the BS, owing to the peculiarity of D2D communication. Rational user equipment (UE) will take advantage of the peculiarity to report their experienced D2D quality untruthfully for their selfish interests and, consequently, degrade system efficiency. This so-called unknown channel quality (UCQ) problem imposes a fatal impact on the resource efficiency and will limit the practicality of D2D communication. To overcome the UCQ problem, we propose to use game theory to analyze the peculiarity of D2D communication. In this paper, two practical D2D resource allocating protocols were investigated, and the system efficiencies were analyzed to show the potential performance degradation when the UCQ problem is not addressed. To circumvent the performance degradation caused by the UCQ problem, a contract-based mechanism and the corresponding algorithms were proposed to eliminate the UE's incentive of reporting untruthfully. Numerical and simulation results validated the feasibility and the effectiveness of our approach.


  • Asynchronous QDI circuit synthesis from signal transition protocols

    by BoYuan Huang, YiHsiang Lai, JieHong R. Jiang

    Asynchronous circuits are promising in resolving the emerging issue of process variation and high synchronization power consumption. Among various asynchronous delay models, quasi-delay insensitive (QDI) model is the most robust and yet practical one due to its relaxed timing assumption. However, automatic synthesis of QDI circuits from signal transition graph (STG) protocol specification has not yet been proposed, despite the fact that algorithms synthesizing circuits under other delay models do exist. In this paper we propose the first algorithm synthesizing protocols specified in STGs into QDI circuits by analyzing STG structures without utilizing state graph assignment techniques. Furthermore, an optimization technique is proposed to simplify QDI circuits. In our synthesis algorithm, the state explosion issue is avoided, and restrictions on STGs are relaxed. Case studies on Advanced Microcontroller Bus Architecture (AMBA) and other protocols indicate the feasibility of our method.


  • Resource allocation in D2D communication - A game theoretic approach

    by Bo-Yuan Huang, Shih-Tang Su, Chih-Yu Wang, Che-Wei Yeh, Hung-Yu Wei

    D2D communication has been proposed as a transmission approach to improve the resource efficiency and lighten the heavy load of the base station(BS) in LTE-Advanced system. In D2D communication, resource efficiency is seriously influenced by the resource allocation scheme. Additionally, the selfish behaviors of user equipment(UE), such as Unknown Channel Quality(UCQ) Problem potentially harm the system efficiency. For instance, we observed that UEs may report their experienced D2D quality untruthfully in order to gain unfair advantages in resource allocation. The so-called UCQ issue imposes a negative impact on the resource utilization efficiency. In this paper, we propose to use Game Theory to analyze this issue. First, we studied the resource allocating scheme concerning the benefit of the BS, and then analyze the system efficiency and the equilibrium. Second, we discussed the UCQ problem in D2D communication. We proposed a contract-based mechanism to resolve the UCQ problem by eliminating the incentive of UEs to report untruthfully with designed service contracts. The simulation results represents the feasibility and the effectiveness of our approach.