#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2011

2017

- This year (5)
- Last 5 years (19)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp.,… (More)

- Yaron Velner
- ICALP
- 2012

Quantitative languages are extension of Boolean languages that assign to each word a real number. With quantitative languages, systems and specifications can be formalized more accurately. For example , a system may use a varying amount of some resource (e.g., memory consumption, or power consumption) depending on its behavior, and a specification may… (More)

- Krishnendu Chatterjee, Yaron Velner
- CONCUR
- 2013

Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work, we consider both finite-state game graphs, and recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. The objectives we study are… (More)

- Yaron Velner, Alexander Moshe Rabinovich
- FOSSACS
- 2011

We study two variants of infinite games with imperfect information. In the first variant, in each round player-1 may decide to hide his move from player-2. This captures situations where the input signal is subject to fluctuations (noises), and every error in the input signal can be detected by the controller. In the second variant, all of player-1 moves… (More)

- Krishnendu Chatterjee, Yaron Velner
- 2012 27th Annual IEEE Symposium on Logic in…
- 2012

Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with… (More)

- Yaron Velner
- FoSSaCS
- 2015

Mean-payoff games play a central role in quantitative synthesis and verification. In a single-dimensional game a weight is assigned to every transition and the objective of the protagonist is to assure a non-negative limit-average weight. In the multidimensional setting, a weight vector is assigned to every transition and the objective of the protagonist is… (More)

- Shaull Almagor, Orna Kupferman, Yaron Velner
- CONCUR
- 2016

In Boolean synthesis, we are given an LTL specification, and the goal is to construct a transducer that realizes it against an adversarial environment. Often, a specification contains both Boolean requirements that should be satisfied against an adversarial environment, and multi-valued components that refer to the quality of the satisfaction and whose… (More)

- Yaron Velner, Kalev Alpernas, +4 authors Sharon Shoham
- TACAS
- 2016

In modern networks, forwarding of packets often depends on the history of previously transmitted traffic. Such networks contain stateful middle-boxes, whose forwarding behavior depends on a mutable internal state. Firewalls and load balancers are typical examples of stateful middleboxes. This paper addresses the complexity of verifying safety properties,… (More)

- Yaron Velner
- CSL-LICS
- 2014

Two-player games on graphs provide the mathematical foundation for the study of reactive systems. In the quantitative framework, an objective assigns a value to every play, and the goal of player 1 is to minimize the value of the objective. In this framework, there are two relevant synthesis problems to consider: the quantitative analysis problem is to… (More)

We consider the quantitative analysis problem for interprocedural control-flow graphs (ICFGs). The input consists of an ICFG, a positive weight function that assigns every transition a positive integer-valued number, and a labelling of the transitions (events) as good, bad, and neutral events. The weight function assigns to each transition a numerical value… (More)