1 citations · 1 across the 2 of their papers we have counts for
3 papers
Formal Runtime Error Detection During Development in the Automotive Industry
Jesko Hecking-Harbusch, Jochen Quante, Maximilian Schlund
Modern automotive software is highly complex and consists of millions lines of code. For safety-relevant automotive software, it is recommended to use sound static program analysis…
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
Georg Bachmeier, Michael Luttenberger, Maximilian Schlund
We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (t…
An Extension of Parikh's Theorem beyond Idempotence
Michael Luttenberger, Maximilian Schlund
The commutative ambiguity of a context-free grammar G assigns to each Parikh vector v the number of distinct leftmost derivations yielding a word with Parikh vector v. Based on the…