Author image not provided
 Yaron Velner

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.90
Citation Count39
Publication count10
Publication years2011-2017
Available for download4
Average downloads per article126.50
Downloads (cumulative)506
Downloads (12 Months)114
Downloads (6 Weeks)12
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


10 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 10 of 10
Sort by:

1 published by ACM
September 2017 Journal of the ACM (JACM): Volume 64 Issue 5, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 12,   Downloads (12 Months): 63,   Downloads (Overall): 63

Full text available: PDFPDF
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 model the control flow of sequential programs with recursion. While pushdown games have ...
Keywords: mean-payoff objectives, pushdown systems, Graph games, quantitative verification and synthesis

2
April 2016 Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9636
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In modern networks, forwarding of packets often depends on the history of previously transmitted traffic. Such networks contain stateful middleboxes, 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, such as ...

3
April 2015 Information and Computation: Volume 241 Issue C, April 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 1

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, ...

4 published by ACM
January 2015 POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 6,   Downloads (12 Months): 46,   Downloads (Overall): 326

Full text available: PDFPDF
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 ...
Keywords: mean-payoff and ratio objectives, static profiling, interprocedural analysis, quantitative objectives, memory bloat
Also published in:
May 2015  ACM SIGPLAN Notices - POPL '15: Volume 50 Issue 1, January 2015

5 published by ACM
July 2014 CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 8,   Downloads (Overall): 58

Full text available: PDFPDF
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 ...
Keywords: mean-payoff games, multidimensional quantitative games on graphs, quantitative synthesis

6
August 2013 CONCUR'13: Proceedings of the 24th international conference on Concurrency Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

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 model the control flow of sequential programs with recursion. ...

7
July 2013 ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour [10]. They presented an FPTAS for computing an approximate equilibrium, and conjectured that there is a polynomial algorithm for finding an exact equilibrium [9]. We extend their study in two directions: (1) ...

8
July 2012 ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

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 ...

9
June 2012 LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Downloads (Overall): 58

Full text available: PDFPDF
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 ...
Keywords: Games on graphs, Pushdown games, Meanpayoff objectives, Pushdown automata

10
March 2011 FOSSACS'11/ETAPS'11: Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 12

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 ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us