Kamu erişimi zorunlu olan makaleler - Udi BokerDaha fazla bilgi edinin
Bir yerde sunuluyor: 13
Temporal specifications with accumulative values
U Boker, K Chatterjee, TA Henzinger, O Kupferman
ACM Transactions on Computational Logic (TOCL) 15 (4), 1-25, 2014
Zorunlu olanlar: Austrian Science Fund, European Commission
Formally reasoning about quality
S Almagor, U Boker, O Kupferman
Journal of the ACM (JACM) 63 (3), 1-56, 2016
Zorunlu olanlar: European Commission
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
Zorunlu olanlar: Austrian Science Fund
Formalizing and reasoning about quality
S Almagor, U Boker, O Kupferman
International Colloquium on Automata, Languages, and Programming, 15-27, 2013
Zorunlu olanlar: Austrian Science Fund
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
Zorunlu olanlar: Austrian Science Fund, European Commission
Exact and approximate determinization of discounted-sum automata
U Boker, TA Henzinger
Logical Methods in Computer Science 10, 2014
Zorunlu olanlar: Austrian Science Fund, European Commission
Families of DFAs as Acceptors of -Regular Languages
D Angluin, U Boker, D Fisman
Logical Methods in Computer Science 14, 2018
Zorunlu olanlar: US National Science Foundation
Battery transition systems
U Boker, TA Henzinger, A Radhakrishna
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014
Zorunlu olanlar: Austrian Science Fund, European Commission
What’s Decidable About Causally Consistent Shared Memory?
O Lahav, U Boker
ACM Transactions on Programming Languages and Systems (TOPLAS) 44 (2), 1-55, 2022
Zorunlu olanlar: European Commission
Approximate determinization of quantitative automata
U Boker, TA Henzinger
Leibniz International Proceedings in Informatics 18, 2012
Zorunlu olanlar: Austrian Science Fund
Determinizing discounted-sum automata
U Boker, TA Henzinger
Zorunlu olanlar: Austrian Science Fund
Register games
K Lehtinen, U Boker
Logical Methods in Computer Science 16, 2020
Zorunlu olanlar: UK Engineering and Physical Sciences Research Council
On the way to alternating weak automata
U Boker, K Lehtinen
38th IARCS Annual Conference on Foundations of Software Technology and …, 2018
Zorunlu olanlar: Federal Ministry of Education and Research, Germany
Yayıncılık ve maddi kaynak bilgileri otomatik olarak bir bilgisayar programı tarafından belirlenmektedir