1 citations · 5 across the 8 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.FL2019★ 1 cited
Minimization of visibly pushdown automata is NP-complete
Olivier Gauwin, Anca Muscholl, Michael Raskin
We show that the minimization of visibly pushdown automata is NP-complete. This result is obtained by introducing immersions, that recognize multiple languages (over a usual, non-v…
cs.LO2019
Working with first-order proofs and provers
Michael Raskin, Christoph Welzel
Verifying software correctness has always been an important and complicated task. Recently, formal proofs of critical properties of algorithms and even implementations are becoming…