Accepted Papers (Track B)
by
Michael Hoffmann
—
last modified
Apr 13, 2011 09:02 AM
The following contributions to Track B have been accepted for presentation at ICALP 2011. They are listed in no particular order.
There is also a list including abstracts.
- Emptiness and Universality Problems in Timed Automata with Positive Frequency
- On the capabilities of grammars, automata, and transducers controlled by monoids
- Approximating the Termination Value of One-counter MDPs and Stochastic Games
- On Reachability for Hybrid Automata over Bounded Time
- Programming with Infinitesimals: A While-Language for Hybrid System Modeling
- A Progress Measure for Explicit-State Probabilistic Model-Checkers
- Nondeterminism is Essential in Small 2FAs with Few Reversals
- Buechi Automata can have Smaller Quotients
- Guarded negation
- Modular Markovian Logic
- Generic Expression Hardness Results for Primitive Positive Formula Comparison
- Krivine machines and higher-order schemes
- Rice's theorem for mu-limit sets of cellular automata
- The cost of traveling between languages
- Locality of queries definable in invariant first-order logic with arbitrary built-in predicates
- Isomorphism of regular trees and words
- Deciding robustness against total store ordering
- Regular Languages of Words Over Countable Linear Orderings
- On the Semantics of Markov Automata
- Liveness-preserving atomicity abstraction
- Automata-based CSL model checking
- Multiply-Recursive Upper Bounds with Higman’s Lemma
- Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems
- Runtime Analysis of Probabilistic Programs with Unbounded Recursion
- Relating Computational Effects by TT-Lifting
- Constructing differential categories and deconstructing categories of games
- Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
- A Fragment of ML Decidable by Visibly Pushdown Automata
- On Stabilization in Herman's Algorithm
Program is available.
