37 citations · 102 across the 14 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.LO2011★ 3 cited
Lower Bounds on the Complexity of MSO1 Model-Checking
Robert Ganian, Petr Hliněný, Alexander Langer +3
One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quant…
cs.PL2011★ 2 cited
Efficient Loop Navigation for Symbolic Execution
Jan Obdrzalek, Marek Trtik
Symbolic execution is a successful and very popular technique used in software verification and testing. A key limitation of symbolic execution is in dealing with code containing l…