„program semantics“

Suchergebnisse

553 Treffer

• Varieties of Data Languages (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Urbat, Henning ; Milius, Stefan 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Parametric Complexity of Lossy Counter Machines (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Schmitz, Sylvain 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sequentiality of String-to-Context Transducers (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Reynier, Pierre-Alain ; Villevalois, Didier 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On All Things Star-Free (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Place, Thomas ; Zeitoun, Marc 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Mahler’s Theorem for Word Functions (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Pin, Jean-Éric ; Reutenauer, Christophe 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Equivalence of Finite-Valued Streaming String Transducers Is Decidable (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Muscholl, Anca ; Puppis, Gabriele 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Büchi Objectives in Countable MDPs (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Kiefer, Stefan ; Mayr, Richard ; Shirmohammadi, Mahsa ; Totzke, Patrick 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Termination of Linear Loops over the Integers (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Hosseini, Mehran ; Ouaknine, Joël ; Worrell, James 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• FO = FO^3 for Linear Orders with Monotone Binary Relations (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Fortin, Marie 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Reachability for Branching Concurrent Stochastic Games (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Etessami, Kousha ; Martinov, Emanuel ; Stewart, Alistair ; Yannakakis, Mihalis 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Dorfman, Dani ; Kaplan, Haim ; Zwick, Uri 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Counting Answers to Existential Questions (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Dell, Holger ; Roth, Marc ; Wellnitz, Philip 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Differential Logical Relations, Part I: The Simply-Typed Case (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Dal Lago, Ugo ; Gavazzo, Francesco ; Yoshimizu, Akira 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Ciobanu, Laura ; Elder, Murray 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Kleene Theorem for Nominal Automata (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Brunet, Paul ; Silva, Alexandra 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Bell, Paul C. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Boundedness of Conjunctive Regular Path Queries (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Barceló, Pablo ; Figueira, Diego ; Romero, Miguel 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Monadic Decomposability of Regular Relations (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Barceló, Pablo ; Hong, Chih-Duo ; Le, Xuan-Bach ; Lin, Anthony Widjaja ; Niskanen, Reino 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity of Value Iteration (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Balaji, Nikhil ; Kiefer, Stefan ; Novotný, Petr ; Pérez, Guillermo A. ; Shirmohammadi, Mahsa 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Minimizing GFG Transition-Based Automata (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Abu Radi, Bader ; Kupferman, Orna 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik