Seuraa
Udi Boker
Udi Boker
Computer Science, Reichman University, Herzliya, Israel
Vahvistettu sähköpostiosoite verkkotunnuksessa runi.ac.il - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Temporal specifications with accumulative values
U Boker, K Chatterjee, TA Henzinger, O Kupferman
ACM Transactions on Computational Logic (TOCL) 15 (4), 1-25, 2014
1332014
What’s decidable about weighted automata?
S Almagor, U Boker, O Kupferman
Automated Technology for Verification and Analysis: 9th International …, 2011
114*2011
Discounting in LTL
S Almagor, U Boker, O Kupferman
Tools and Algorithms for the Construction and Analysis of Systems: 20th …, 2014
792014
Formally reasoning about quality
S Almagor, U Boker, O Kupferman
Journal of the ACM (JACM) 63 (3), 1-56, 2016
672016
The Church-Turing thesis over arbitrary domains
U Boker, N Dershowitz
Pillars of computer science: essays dedicated to Boris (Boaz) Trakhtenbrot …, 2008
552008
Nondeterminism in the presence of a diverse or unknown future
U Boker, D Kuperberg, O Kupferman, M Skrzypczak
International Colloquium on Automata, Languages, and Programming, 89-100, 2013
482013
Formalizing and reasoning about quality
S Almagor, U Boker, O Kupferman
International Colloquium on Automata, Languages, and Programming, 15-27, 2013
432013
Decidable verification under a causally consistent shared memory
O Lahav, U Boker
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020
402020
Why These Automata Types?
U Boker
LPAR 18, 143-163, 2018
392018
The target discounted-sum problem
U Boker, TA Henzinger, J Otop
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 750-761, 2015
382015
Alternation removal in Büchi automata
U Boker, O Kupferman, A Rosenberg
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
382010
Exact and approximate determinization of discounted-sum automata
U Boker, TA Henzinger
Logical Methods in Computer Science 10, 2014
352014
Families of DFAs as Acceptors of -Regular Languages
D Angluin, U Boker, D Fisman
Logical Methods in Computer Science 14, 2018
332018
How deterministic are good-for-games automata?
U Boker, O Kupferman, M Skrzypczak
arXiv preprint arXiv:1710.04115, 2017
332017
Comparing computational power
U Boker, N Dershowitz
Logic Journal of the IGPL 14 (5), 633-647, 2006
332006
Good for games automata: From nondeterminism to alternation
U Boker, K Lehtinen
arXiv preprint arXiv:1906.11624, 2019
322019
Three paths to effectiveness
U Boker, N Dershowitz
Fields of logic and computation: essays dedicated to Yuri Gurevich on the …, 2010
272010
Battery transition systems
U Boker, TA Henzinger, A Radhakrishna
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014
262014
History determinism vs. good for gameness in quantitative automata
U Boker, K Lehtinen
arXiv preprint arXiv:2110.14238, 2021
252021
Formalizing and reasoning about quality
S Almagor, U Boker, O Kupferman
Journal of the ACM 63 (3), 24, 2016
242016
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20