We study model checking problems for pushdown systems and linear time logics. We show that the global model checking problem (computing the set of configurations, reachable or not, that violate the formula) can be solved in O(gp^3 gb^3) time and O(gp^2 gb^2) space, where gp and gb are the size of the pushdown system and the size of a Buechi automaton for the negation of the formula. The global model checking problem for reachable configurations can be solved in O(gp^4 gb^3) time and O(gp^4 gb^2) space. In the case of pushdown systems with constant number of control states (relevant for our application), the complexity becomes O(gp^2 gb^3) time and O(gp gb^2) space and O(gp^2 gb^3) time and O(gp^2 gb^2) space, respectively. We show applications of these results in the area of program analysis and present some experimental results.     «

We study model checking problems for pushdown systems and linear time logics. We show that the global model checking problem (computing the set of configurations, reachable or not, that violate the formula) can be solved in O(gp^3 gb^3) time and O(gp^2 gb^2) space, where gp and gb are the size of the pushdown system and the size of a Buechi automaton for the negation of the formula. The global model checking problem for reachable configurations can be solved in O(gp^4 gb^3) time and O(gp^4 gb^2)...     »