Guy Frankel

dblp:343/1862 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0001-5809-3455ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 3 since 2021Theory of computation · 2 · 2 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Massively Parallel Mining of Specifications for Hardware Designs
abstract
Abstract Formal hardware verification ensures that a design satisfies its specifications, but writing these specifications requires substantial manual effort. Specification mining automates this process, and existing work has their own merits. The classic approaches rely on pre-defined templates, which have limited expressiveness and lack formal correctness guarantees. However, recent years have seen the emergence of using formal program synthesis for specification mining, which provides general and correct specifications but struggles to scale to complex designs. In this work, we present MAPminer, a parallel framework for synthesis-based hardware specification mining. MAPminer exploits its novel algorithm based on the Maximal Universal Subset and partitions the synthesis problem into efficient sub-problems. These sub-problems are automatically scheduled across multiple threads for parallel synthesis. Experimental results show that MAPminer produces more effective assertions, improving verification coverage while reducing assertion size.
Leiqi Ye, Guy Frankel, Jianyi Cheng, Elizabeth Polgreen
CAV (1)2
2025 Unlocking Hardware Verification with Oracle Guided Synthesis
Leiqi Ye, Yixuan Li 0003, Guy Frankel, Jianyi Cheng, Elizabeth Polgreen
FMCAD3
2025 Debugging into Existence with Program Synthesis
abstract
When modifying an existing codebase to handle new functionality, programmers will often debug the program until the insertion point for the new code. This method, termed Debugging into Existence, helps programmers familiarize themselves with the surrounding code and runtime state. Despite its realworld usage, it is limited by the inability to test potential code past the first time the location is called, since added functionality would change the future state making it irrelevant. Prior work has pioneered Live Execution over partial programs, with extensions using the provided values for synthesis by Programming by Example. In this work, we present DeSynt, a debugger extension that integrates live execution and program synthesis to extend the Debugging into Existence interaction model. DeSynt grants programmers meaningful runtime information across many executions, by allowing them to manipulate program state according to the desired functionality. Based on the state provided by the programmer, DeSynt then synthesizes programs that capture this functionality. We evaluated DeSynt in a between-subjects study on 10 users, and found that in tasks that do not involve complex fault localization, deSynt reduces time to completion and concentrates programmer effort into fewer code locations. In addition, we found that users that used DeSynt spent more of their task time debugging, indicating DeSynt supports Debugging into Existence for those that already use it.
Guy Frankel, Shay Segal, Hila Peleg
VL/HCC1
2023 Challenges in Modeling and Unmodeling Emergence, Rule Composition, and Networked Interactions in Complex Reactive Systems
Assaf Marron, Irun R. Cohen, Guy Frankel, David Harel, Smadar Szekely
MODELSWARD3