Udi Boker

According to our database, Udi Boker authored at least 52 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism.

Udi Boker, Karoliina Lehtinen

ACM SIGLOG News, January, 2023

Token Games and History-Deterministic Quantitative-Automata.

Udi Boker, Karoliina Lehtinen

Log. Methods Comput. Sci., 2023

Synchronized CTL over One-Counter Automata.

Shaull Almagor, Daniel Assa, Udi Boker

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

On the Comparison of Discounted-Sum Automata with Multiple Discount Factors.

Udi Boker, Guy Hefetz

Proceedings of the Foundations of Software Science and Computation Structures, 2023

Safety and Liveness of Quantitative Automata.

Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

What's Decidable About Causally Consistent Shared Memory?

Ori Lahav, Udi Boker

ACM Trans. Program. Lang. Syst., 2022

What's decidable about weighted automata?

Shaull Almagor, Udi Boker, Orna Kupferman

Inf. Comput., 2022

On the Translation of Automata to Linear Temporal Logic.

Udi Boker, Karoliina Lehtinen, Salomon Sickert

Proceedings of the Foundations of Software Science and Computation Structures, 2022

Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk).

Udi Boker

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021

Quantitative vs. Weighted Automata.

Udi Boker

Proceedings of the Reachability Problems - 15th International Conference, 2021

History Determinism vs. Good for Gameness in Quantitative Automata.

Udi Boker, Karoliina Lehtinen

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Discounted-Sum Automata with Multiple Discount Factors.

Udi Boker, Guy Hefetz

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

Register Games.

Karoliina Lehtinen, Udi Boker

Log. Methods Comput. Sci., 2020

On Succinctness and Recognisability of Alternating Good-for-Games Automata.

Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak

CoRR, 2020

Decidable verification under a causally consistent shared memory.

Ori Lahav, Udi Boker

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

On the Succinctness of Alternating Parity Good-For-Games Automata.

Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Parametrized Universality Problems for One-Counter Nets.

Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Inherent Size Blowup in ω-Automata.

Udi Boker

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

Good for Games Automata: From Nondeterminism to Alternation.

Udi Boker, Karoliina Lehtinen

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Families of DFAs as Acceptors of ω-Regular Languages.

Dana Angluin, Udi Boker, Dana Fisman

Log. Methods Comput. Sci., 2018

Why These Automata Types?

Udi Boker

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Automaton-Based Criteria for Membership in CTL.

Udi Boker, Yariv Shaulian

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

On the Way to Alternating Weak Automata.

Udi Boker, Karoliina Lehtinen

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

How Deterministic are Good-For-Games Automata?.

Udi Boker, Orna Kupferman, Michal Skrzypczak

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Rabin vs. Streett Automata.

Udi Boker

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

On the (In)Succinctness of Muller Automata.

Udi Boker

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Formally Reasoning About Quality.

Shaull Almagor, Udi Boker, Orna Kupferman

J. ACM, 2016

Families of DFAs as Acceptors of omega-Regular Languages.

Dana Angluin, Udi Boker, Dana Fisman

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Honest Computability and Complexity.

Udi Boker, Nachum Dershowitz

Proceedings of the Martin Davis on Computability, 2016

2015

The Target Discounted-Sum Problem.

Udi Boker, Thomas A. Henzinger, Jan Otop

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Temporal Specifications with Accumulative Values.

Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman

ACM Trans. Comput. Log., 2014

Exact and Approximate Determinization of Discounted-Sum Automata.

Udi Boker, Thomas A. Henzinger

Log. Methods Comput. Sci., 2014

Discounting in LTL.

Shaull Almagor, Udi Boker, Orna Kupferman

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Battery transition systems.

Udi Boker, Thomas A. Henzinger, Arjun Radhakrishna

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013

Nondeterminism in the Presence of a Diverse or Unknown Future.

Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Formalizing and Reasoning about Quality.

Shaull Almagor, Udi Boker, Orna Kupferman

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Translating to Co-Büchi Made Tight, Unified, and Useful.

Udi Boker, Orna Kupferman

ACM Trans. Comput. Log., 2012

Approximate Determinization of Quantitative Automata.

Udi Boker, Thomas A. Henzinger

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

Co-Büching Them All.

Udi Boker, Orna Kupferman

Proceedings of the Foundations of Software Science and Computational Structures, 2011

Determinizing Discounted-Sum Automata.

Udi Boker, Thomas A. Henzinger

Proceedings of the Computer Science Logic, 2011

2010

Alternation Removal in Büchi Automata.

Udi Boker, Orna Kupferman, Adin Rosenberg

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Parityizing Rabin and Streett.

Udi Boker, Orna Kupferman, Avital Steinitz

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

The Quest for a Tight Translation of Büchi to co-Büchi Automata.

Udi Boker, Orna Kupferman

Proceedings of the Fields of Logic and Computation, 2010

Three Paths to Effectiveness.

Udi Boker, Nachum Dershowitz

Proceedings of the Fields of Logic and Computation, 2010

2009

The influence of domain interpretations on computational models.

Udi Boker, Nachum Dershowitz

Appl. Math. Comput., 2009

Co-ing Büchi Made Tight and Useful.

Udi Boker, Orna Kupferman

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

The influence of domain interpretations on computational models

Udi Boker

PhD thesis, 2008

The Church-Turing Thesis over Arbitrary Domains.

Udi Boker, Nachum Dershowitz

Proceedings of the Pillars of Computer Science, 2008

2006

Comparing Computational Power.

Udi Boker, Nachum Dershowitz

Log. J. IGPL, 2006

A hypercomputational alien.

Udi Boker, Nachum Dershowitz

Appl. Math. Comput., 2006

2005

Abstract Effective Models.

Udi Boker, Nachum Dershowitz

Proceedings of the First International Workshop on Developments in Computational Models, 2005

How to Compare the Power of Computational Models.

Udi Boker, Nachum Dershowitz

Proceedings of the New Computational Paradigms, 2005