33
Voted
JLP
2016
10 years 27 days ago
2016
This paper presents two criteria for the termination of tree automata completion. Tree automata completion is a technique for computing a tree automaton recognizing or over-approx...
48
Voted
JLP
2016
10 years 27 days ago
2016
Many software systems today are configurable. Analyzing configurable systems is challenging, especially as (1) the number of system variants may grow exponentially with the numb...