Gera Weiss
YOU?
Author Swipe
View article: Black-Box Bug Amplification for Multithreaded Software
Black-Box Bug Amplification for Multithreaded Software Open
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 under specific inputs, often at low probability. We propose a…
View article: Black-Box Bug-Amplification for Multithreaded Software
Black-Box Bug-Amplification for Multithreaded Software Open
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 under specific inputs, even when occurring with low probabili…
View article: De Bruijn Sequences: from Games to Shift-Rules to a Proof of the Fredricksen-Kessler-Maiorana Theorem
De Bruijn Sequences: from Games to Shift-Rules to a Proof of the Fredricksen-Kessler-Maiorana Theorem Open
We present a combinatorial game and propose efficiently computable optimal strategies. We then show how these strategies can be translated to efficiently computable shift-rules for the well known prefer-max and prefer-min De Bruijn sequenc…
View article: Adding liveness to behavioral programming: theory, implementation, and user study
Adding liveness to behavioral programming: theory, implementation, and user study Open
This paper investigates how Behavioral Programming (BP), and executable specifications in general, can more effectively align models with requirements, addressing a key motivation behind BP’s development. While BP has traditionally support…
View article: A Behavior-Based Knowledge Representation Improves Prediction of Players' Moves in Chess by 25%
A Behavior-Based Knowledge Representation Improves Prediction of Players' Moves in Chess by 25% Open
Predicting player behavior in strategic games, especially complex ones like chess, presents a significant challenge. The difficulty arises from several factors. First, the sheer number of potential outcomes stemming from even a single posi…
View article: Exploring and Evaluating Interplays of BPpy with Deep Reinforcement Learning and Formal Methods
Exploring and Evaluating Interplays of BPpy with Deep Reinforcement Learning and Formal Methods Open
We explore and evaluate the interactions between Behavioral Programming (BP) and a range of Artificial Intelligence (AI) and Formal Methods (FM) techniques. Our goal is to demonstrate that BP can serve as an abstraction that integrates var…
View article: Keeping Behavioral Programs Alive: Specifying and Executing Liveness Requirements
Keeping Behavioral Programs Alive: Specifying and Executing Liveness Requirements Open
One of the benefits of using executable specifications such as Behavioral Programming (BP) is the ability to align the system implementation with its requirements. This is facilitated in BP by a protocol that allows independent implementat…
View article: Evolving Assembly Code in an Adversarial Environment
Evolving Assembly Code in an Adversarial Environment Open
In this work, we evolve Assembly code for the CodeGuru competition. The goal is to create a survivor -- an Assembly program that runs the longest in shared memory, by resisting attacks from adversary survivors and finding their weaknesses.…
View article: Model Driven Engineering, Verification and Validation (MoDeVVa 2023)
Model Driven Engineering, Verification and Validation (MoDeVVa 2023) Open
The 20th edition of the Workshop on Model Driven Engineering, Verification and Validation (MoDeVVa 2023) took place on Oct 3rd, 2023 in Västerås, Sweden. The program consisted of an invited talk by Prof. Ciprian TEODOROV (Lab-STICC, ENSTA …
View article: Provengo: A Tool Suite for Scenario Driven Model-Based Testing
Provengo: A Tool Suite for Scenario Driven Model-Based Testing Open
We present Provengo, a comprehensive suite of tools designed to facilitate the implementation of Scenario-Driven Model-Based Testing (SDMBT), an innovative approach that utilizes scenarios to construct a model encompassing the user's persp…
View article: Generalized Coverage Criteria for Combinatorial Sequence Testing
Generalized Coverage Criteria for Combinatorial Sequence Testing Open
We present a new model-based approach for testing systems that use sequences of actions and assertions as test vectors. Our solution includes a method for quantifying testing quality, a tool for generating high-quality test suites based on…
View article: What Petri Nets Oblige us to Say Comparing Approaches for Behavior Composition
What Petri Nets Oblige us to Say Comparing Approaches for Behavior Composition Open
We identify and demonstrate a weakness of Petri Nets (PN) in specifying composite behavior of reactive systems. Specifically, we show how, when specifying multiple requirements in one PN model, modelers are obliged to specify mechanisms fo…
View article: Efficient One Sided Kolmogorov Approximation
Efficient One Sided Kolmogorov Approximation Open
We present an efficient algorithm that, given a discrete random variable $X$ and a number $m$, computes a random variable whose support is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal, also for the one-sided Kolmog…
View article: What Petri Net Obliges Us to Say: Comparing Approaches for Behavior Composition
What Petri Net Obliges Us to Say: Comparing Approaches for Behavior Composition Open
We identify and demonstrate a weakness of Petri Nets (PN) in specifying composite behavior of reactive systems. Specifically, we show how, when specifying multiple requirements in one PN model, modelers are obliged to specify mechanisms fo…
View article: Generalized Coverage Criteria for Combinatorial Sequence Testing
Generalized Coverage Criteria for Combinatorial Sequence Testing Open
We present a new model-based approach for testing systems that use sequences of actions and assertions as test vectors. Our solution includes a method for quantifying testing quality, a tool for generating high-quality test suites based on…
View article: The Normalized Edit Distance with Uniform Operation Costs Is a Metric
The Normalized Edit Distance with Uniform Operation Costs Is a Metric Open
We prove that the normalized edit distance proposed in [Marzal and Vidal 1993] is a metric when the cost of all the edit operations are the same. This closes a long standing gap in the literature where several authors noted that this dista…
View article: Adapting Behaviors via Reactive Synthesis
Adapting Behaviors via Reactive Synthesis Open
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 work, we present a reactive synthesis interpretation to the ad…
View article: A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence
A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence Open
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 from the literature in a straightforward manner. First, it …
View article: Adapting Behaviors via Reactive Synthesis
Adapting Behaviors via Reactive Synthesis Open
In the Adapter Design Pattern , a programmer implements a Target interface by constructing an Adapter that accesses an existing Adaptee code. In this work, we present a reactive synthesis interpretation to the adapter design pattern, where…
View article: On-the-Fly Construction of Composite Events in Scenario-Based Modeling using Constraint Solvers
On-the-Fly Construction of Composite Events in Scenario-Based Modeling using Constraint Solvers Open
Scenario-Based Programming is a methodology for modeling and constructing complex reactive systems from simple, stand-alone building blocks, called scenarios. These scenarios are designed to model different traits of the system, and can be…
View article: Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines
Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines Open
We present an efficient algorithm that, given a discrete random variable X and a number m, computes a random variable whose support is of size at most m and whose Kolmogorov distance from X is minimal. We present some variants of the algor…
View article: Labor Division with Movable Walls: Composing Executable Specifications with Machine Learning and Search (Blue Sky Idea)
Labor Division with Movable Walls: Composing Executable Specifications with Machine Learning and Search (Blue Sky Idea) Open
Artificial intelligence (AI) techniques, including, e.g., machine learning, multi-agent collaboration, planning, and heuristic search, are emerging as ever-stronger tools for solving hard problems in real-world applications. Executable spe…
View article: To Infinity and Beyond: Continuing De Bruijn Sequences by Extending the Alphabet
To Infinity and Beyond: Continuing De Bruijn Sequences by Extending the Alphabet Open
This article presents proof that the reverse of the Prefer Max De Bruijn sequence can be expanded into an infinite De Bruijn sequence by increasing the size of the alphabet. Furthermore, we show that every De Bruijn sequence possessing thi…
View article: On-the-Fly Construction of Composite Events in Scenario-Based Modeling using Constraint Solvers
On-the-Fly Construction of Composite Events in Scenario-Based Modeling using Constraint Solvers Open
Scenario-Based Programming is a methodology for modeling and constructing complex reactive systems from simple, stand-alone building blocks, called scenarios. These scenarios are designed to model different traits of the system, and can be…
View article: BPjs --- a framework for modeling reactive systems using a scripting\n language and BP
BPjs --- a framework for modeling reactive systems using a scripting\n language and BP Open
We describe some progress towards a new common framework for model driven\nengineering, based on behavioral programming. The tool we have developed\nunifies almost all of the work done in behavioral programming so far, under a\ncommon set …
View article: BPjs --- a framework for modeling reactive systems using a scripting language and BP
BPjs --- a framework for modeling reactive systems using a scripting language and BP Open
We describe some progress towards a new common framework for model driven engineering, based on behavioral programming. The tool we have developed unifies almost all of the work done in behavioral programming so far, under a common set of …
View article: An optimal approximation of discrete random variables with respect to the Kolmogorov distance
An optimal approximation of discrete random variables with respect to the Kolmogorov distance Open
We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal. In additio…
View article: De Bruijn Sequences: From Games to Shift-Rules to a Proof of the Fredricksen-Kessler-Maiorana Theorem
De Bruijn Sequences: From Games to Shift-Rules to a Proof of the Fredricksen-Kessler-Maiorana Theorem Open
We present a combinatorial game and propose efficiently computable optimal strategies. We then show how these strategies can be translated to efficiently computable shift-rules for the well known prefer-max and prefer-min De Bruijn sequenc…
View article: A Combinatorial Game and an Efficiently Computable Shift Rule for the Prefer Max De Bruijn Sequence
A Combinatorial Game and an Efficiently Computable Shift Rule for the Prefer Max De Bruijn Sequence Open
We present a two-player combinatorial game over a $k$-ary shift-register and analyze it. The game is defined such that, for each of the player, the only way to avoid losing is to play such that the next state of the game is the next window…