3 citations · 5 across the 12 of their papers we have counts for
12 papers
Vintage Code, Modern Judges: Meta-Validation in Low Data Regimes
Ora Nova Fandina, Gal Amram, Eitan Farchi +6
Application modernization in legacy languages such as COBOL, PL/I, and REXX faces an acute shortage of resources, both in expert availability and in high-quality human evaluation d…
Automata Models for Effective Bug Pattern Description
Tom Yaacov, Gera Weiss, Gal Amram +1
Debugging complex systems is a crucial yet time-consuming task. This paper presents the use of automata learning and testing techniques to obtain concise and informative bug descri…
LaajMeter: A Framework for LaaJ Evaluation
Samuel Ackerman, Gal Amram, Ora Nova Fandina +5
Large Language Models (LLMs) are increasingly used as evaluators in natural language processing tasks, a paradigm known as LLM-as-a-Judge (LaaJ). The analysis of a LaaJ software, c…
Black-Box Bug-Amplification for Multithreaded Software
Yeshayahu Weiss, Gal Amram, Achiya Elyasaf +3
Bugs, especially those in concurrent systems, are often hard to reproduce because they manifest only under rare conditions. Testers frequently encounter failures that occur only un…
Adapting Behaviors via Reactive Synthesis
Gal Amram, Suguman Bansal, Dror Fried +3
In the \emph{Adapter Design Pattern}, a programmer implements a \emph{Target} interface by constructing an \emph{Adapter} that accesses an existing \emph{Adaptee} code. In this wor…
A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence
Gal Amram, Amir Rubin, Gera Weiss
We propose a novel construction for the well-known prefer-max De Bruijn sequence, based on the cycle joining technique. We further show that the construction implies known results…
Energy mu-Calculus: Symbolic Fixed-Point Algorithms for omega-Regular Energy Games
Gal Amram, Shahar Maoz, Or Pistiner +1
-regular energy games, which are weighted two-player turn-based games with the quantitative objective to keep the energy levels non-negative, have been used in the context of ve…
An Efficient Generalized Shift-Rule for the Prefer-Max De Bruijn Sequence
Gal Amram, Amir Rubin
One of the fundamental ways to construct De Bruijn sequences is by using a shift-rule. A shift-rule receives a word as an argument and computes the symbol that appears after it in…
An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence
Gal Amram, Yair Ashlagi, Amir Rubin +3
A shift rule for the prefer-max De Bruijn sequence is formulated, for all sequence orders, and over any finite alphabet. An efficient algorithm for this shift rule is presented, wh…
The F-snapshot Problem
Gal Amram
Aguilera, Gafni and Lamport introduced the signaling problem in [5]. In this problem, two processes numbered 0 and 1 can call two procedures: update and Fscan. A parameter of the p…
Simple Executions of Snapshot Implementations
Gal Amram, Lior Mizrahi, Gera Weiss
The well known snapshot primitive in concurrent programming allows for n-asynchronous processes to write values to an array of single-writer registers and, for each process, to tak…
On the Mailbox Problem
Uri Abraham, Gal Amram
The Mailbox Problem was described and solved by Aguilera, Gafni, and Lamport in their 2010 DC paper with an algorithm that uses two flag registers that carry 14 values each. An int…