JLP
2016
8 years 5 months 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...
JLP
2016
8 years 5 months 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...