Udi Boker

Henzinger_Thomas Group

14 Publications

Mark all

[14]
2023 | Published | Conference Paper | IST-REx-ID: 13221 | OA
Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Safety and liveness of quantitative automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 17.
[Published Version] View | Files available | DOI | arXiv
 
[13]
2015 | Published | Technical Report | IST-REx-ID: 5439 | OA
Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.
[Published Version] View | Files available | DOI
 
[12]
2015 | Published | Conference Paper | IST-REx-ID: 1659 | OA
Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem. LICS. LICS: Logic in Computer ScienceLogic in Computer Science, 750–761.
[Submitted Version] View | Files available | DOI
 
[11]
2014 | Published | Journal Article | IST-REx-ID: 2038 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
[Submitted Version] View | Files available | DOI
 
[10]
2014 | Published | Conference Paper | IST-REx-ID: 2239
Boker U, Henzinger TA, Radhakrishna A. 2014. Battery transition systems. POPL: Principles of Programming Languages vol. 49, 595–606.
View | DOI
 
[9]
2013 | Published | Conference Paper | IST-REx-ID: 2517 | OA
Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.
[Submitted Version] View | Files available | DOI
 
[8]
2013 | Published | Conference Paper | IST-REx-ID: 1387 | OA
Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.
[Submitted Version] View | Files available | DOI
 
[7]
2012 | Published | Conference Paper | IST-REx-ID: 2891 | OA
Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.
[Published Version] View | Files available | DOI
 
[6]
2012 | Published | Journal Article | IST-REx-ID: 494
Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29.
View | DOI
 
[5]
2011 | Published | Conference Paper | IST-REx-ID: 3326 | OA
Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata . ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.
[Submitted Version] View | Files available | DOI
 
[4]
2011 | Published | Conference Paper | IST-REx-ID: 3327
Boker U, Kupferman O. 2011. Co-Büching them all. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6604, 184–198.
View | DOI
 
[3]
2011 | Published | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version] View | Files available | DOI
 
[2]
2011 | Published | Conference Paper | IST-REx-ID: 3360 | OA
Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.
[Published Version] View | Files available | DOI
 
[1]
2011 | Published | Technical Report | IST-REx-ID: 5385 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

Grants


14 Publications

Mark all

[14]
2023 | Published | Conference Paper | IST-REx-ID: 13221 | OA
Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Safety and liveness of quantitative automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 17.
[Published Version] View | Files available | DOI | arXiv
 
[13]
2015 | Published | Technical Report | IST-REx-ID: 5439 | OA
Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.
[Published Version] View | Files available | DOI
 
[12]
2015 | Published | Conference Paper | IST-REx-ID: 1659 | OA
Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem. LICS. LICS: Logic in Computer ScienceLogic in Computer Science, 750–761.
[Submitted Version] View | Files available | DOI
 
[11]
2014 | Published | Journal Article | IST-REx-ID: 2038 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
[Submitted Version] View | Files available | DOI
 
[10]
2014 | Published | Conference Paper | IST-REx-ID: 2239
Boker U, Henzinger TA, Radhakrishna A. 2014. Battery transition systems. POPL: Principles of Programming Languages vol. 49, 595–606.
View | DOI
 
[9]
2013 | Published | Conference Paper | IST-REx-ID: 2517 | OA
Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.
[Submitted Version] View | Files available | DOI
 
[8]
2013 | Published | Conference Paper | IST-REx-ID: 1387 | OA
Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.
[Submitted Version] View | Files available | DOI
 
[7]
2012 | Published | Conference Paper | IST-REx-ID: 2891 | OA
Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.
[Published Version] View | Files available | DOI
 
[6]
2012 | Published | Journal Article | IST-REx-ID: 494
Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29.
View | DOI
 
[5]
2011 | Published | Conference Paper | IST-REx-ID: 3326 | OA
Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata . ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.
[Submitted Version] View | Files available | DOI
 
[4]
2011 | Published | Conference Paper | IST-REx-ID: 3327
Boker U, Kupferman O. 2011. Co-Büching them all. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6604, 184–198.
View | DOI
 
[3]
2011 | Published | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version] View | Files available | DOI
 
[2]
2011 | Published | Conference Paper | IST-REx-ID: 3360 | OA
Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.
[Published Version] View | Files available | DOI
 
[1]
2011 | Published | Technical Report | IST-REx-ID: 5385 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed