Udi Boker

Henzinger_Thomas Group

14 Publications

Mark all

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

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed

14 Publications

Mark all

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

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed