Haase, Christoph
- Context-Free Commutative Grammars with Integer Counters and Resets
2015/11/16 by Chistikov, Dmitry, Haase, Christoph, Halfon, Simon · 1 citation
#F.1.1 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One
2016/02/17 by Göller, Stefan, Haase, Christoph, Lazić, Ranko +1 · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
- An efficient quantifier elimination procedure for Presburger arithmetic
2024/05/02 by Christoph Haase, Shankara Narayanan Krishna, Haase, Christoph +7 · 2 citations
Computer Science · #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Logic (math.LO) #Logic in Computer Science (cs.LO) #Numerical Methods and Algorithms
- Reachability in Fixed VASS: Expressiveness and Lower Bounds
2023/10/25 by Andrei Draghici, Draghici, Andrei, Christoph Haase +3 · 1 citation
Computer Science · #Formal Methods in Verification #Petri Nets in System Modeling #Distributed systems and fault tolerance